Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Consider the following grammar.
S → AB
A → a
A → BaB
B → bbA
Which of the following statement is FALSE?
1
The length of every string produced by this grammar is even
2
No string produced by this grammar has three consecutive a's
3
The length of substring produced by B is always odd.
4
No string produced by this grammar has four consecutive b’s