Question

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. n1 is necessarily less than n2
2. n1 is necessarily equal to n2
3. n1 is necessarily greater than n2
4. none of the options

Answer 1

Correct Answer - Option 2 : n1 is necessarily equal to n2

The correct answer is option 2.

The number of entries in the LALR(1) parse table ≤ no. of entries in the CLR(1) parse table.

The number of entries in the SLR(1) parse table is ≤ no of entries in CLR(1) parse table.

Relation between them:

n1 (SLR) = n2(LALR) ≤ n3 (CLR)

Hence n1 is necessarily equal to n2 is the correct answer.

LR parsers in terms of their power:

CLR > LALR > SLR > LR (0)