Consider the grammar S → (S) | a Let the number of states in SLR(1), LR(1) and…

PYQ GATE 2005

Consider the grammar

S → (S) | a

Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2 and n3 respectively. The following relationship holds good

  1. A.

    n1 < n2 < n3

  2. B.

    n1 = n3 < n2

  3. C.

    n1 = n2 = n3

  4. D.

    n1 ≥ n3 ≥ n2

Attempted by 224 students.

Sign up free to check your answer

Sign up free

Explore the full course: Compiler Design

Loading lesson…