The GATE Grind

GATE 2007 CS – Question 52

Compiler Design · Parsing and Syntax Analysis · 2 marks · Multiple choice

Grammar has N={S, C, S1}, T={a, b, i, t, e}, start S, rules $S\to iCtSS_1\mid a$, $S_1\to eS\mid\epsilon$, $C\to b$. Why is it NOT LL(1)?

  1. Left-recursive
  2. Right-recursive
  3. Ambiguous
  4. Not context-free

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) Ambiguous

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Parsing and Syntax Analysis questions

All Parsing and Syntax Analysis questions →