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 → XY
X → YaY | a and y → bbX
Which of the following statements is/are true about the above grammar?
(a) Strings produced by the grammar can have consecutive three a's
(b) Every string produced by the grammar have alternate a and b
(c) Every string produced by the grammar have at least two a's
(d) Every string produced by the grammar have b's in multiple of 2.
1
(a) only
2
(b) and (c) only
3
(d) only
4
(c) and (d) only