Consider the grammar with non-terminals N = {S,C,S1 },terminals T={a,b,i,t,e},…
GATE · 2007 · CS
Consider the grammar with non-terminals N = {S,C,S1 },terminals T={a,b,i,t,e}, with S as the start symbol, and the following set of rules:
S --> iCtSS1|a
S1 --> eS|ϵ
C --> bThe grammar is NOT LL(1) because:
- A.
it is left recursive
- B.
it is right recursive
- C.
it is ambiguous
- D.
It is not context-free.
Attempted by 253 students.
Sign up free to check your answer
Sign up freeLoading lesson…