Assume that the SLR parser for a grammar G has n1 states and the LALR parser…

PYQ GATE 2003

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:

  1. A.

    n1 is necessarily less than n2

  2. B.

    n1 is necessarily equal to n2

  3. C.

    n1 is necessarily greater than n2

  4. D.

    none of these

Attempted by 257 students.

Sign up free to check your answer

Sign up free

Explore the full course: Compiler Design

Loading lesson…