Assume that the SLR parser for a grammar G has n1 states and the LALR parser…
GATE · 2003 · CS
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is:
- A.
n1 is necessarily less than n2
- B.
n1 is necessarily equal to n2
- C.
n1 is necessarily greater than n2
- D.
none of these
Attempted by 198 students.
Sign up free to check your answer
Sign up freeLoading lesson…