Computer Science · Theory of Computation
Consider the context-free grammar context: S → SbS | a. For the terminal string 'abababa', consider the following statements: (A) It has more than one distinct parse tree. (B) It has more than one distinct leftmost derivation. (C) It has more than one distinct rightmost derivation. Which of the following holds true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Only (A) is true
- 2Only (C) is true
- 3Only (B) is true
- 4All (A), (B) and (C) are true✓
Correct answer
All (A), (B) and (C) are true
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation