Q. 17 Consider the grammar with non-terminals N = {S,C,S}, terminals
T = {a,b, i, t,e}, with S as the start symbol, and the following of rules
S --> iCtSS1|a S1 --> eS|ϵ C --> b
The grammar is NOTLL(1) because:
(A) It is left recursive
(B) It is right recursive
(C) It is ambiguous
(D) It is not context-free
Answer: (C)
Explanation:
