Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Consider the grammer S → SbS | a.
Consider the following statements:
The string abababa has
(A) two parse trees
(B) two left most derivations
(C) two right most derivations
Which of the following is correct?
1
All (A), (B) and (C) are true
2
Only (B) is true
3
Only (C) is true
4
Only (A) is true