Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Ambiguity
Which of the following statements is/are TRUE?
(a) The grammar S → SS | a is ambiguous. (Where S is the start symbol)
(b) The grammar S → 0S1 | 01S |e is ambiguous. (The special symbol e represents the empty string) (Where S is the start symbol)
(c) The grammar (Where S is the start symbol)
S → T / U
T → x S y | xy | ϵ
U → yT
generates a language consisting of the string yxxyy.
1
Only (a) and (b) are TRUE.
2
Only (a) and (c) are TRUE.
3
Only (b) and (c) are TRUE.
4
All of (a), (b) and (c) are TRUE.