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 set of rules:

S $\rightarrow$iCtSS₁ | a S₁ $\rightarrow$ eS |$\in$ C $\rightarrow$ b

The grammar is NOT LL(1) because:

Keep practicing — related questions

• Consider the grammar shown below. S $\rightarrow$ C C C $\rightarrow$ c C | d This grammar is
• Consider the grammar shown below. S $\rightarrow$ C C C $\rightarrow$ c C | d This grammar is
• Consider the grammar shown below. S $\rightarrow$ C C C $\rightarrow$ c C | d This grammar is
• The grammar S $\rightarrow$ aSa|bS|c is
• Consider the following grammar: S$\rightarrow$SS S$\rightarrow$0 S$\rightarrow$$\epsilon$ Which of the foll...
• The grammar E $\rightarrow$E + E |E*E|(E)| id is
• The grammar $S \rightarrow SA|A$ $A \rightarrow a$
• Which of the following statements are true? I. Every left-recursive grammar can be converted to a right-rec...