Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Context Free Languages and Pushdown Automata Ambiguity
Consider the grammar with nonterminals N = {S, C, S1} terminals T = {a, b, i, t, e} With S as the start symbol , and the following set of rules :
S → i Ct SS1|a
S1 → es | ∈
C → b
The grammar is not LL(1) because :
1
It is left recursive
2
It is right recursive
3
It is ambiguous
4
It is not context free