Q. 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: (Solved)
1. n1 is necessarily less than n2
2. n1 is necessarily equal to n2
3. n1 is necessarily greater than n2
4. none of these
- b. n1 is necessarily equal to n2