![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
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 |
A. | n1 < n2 < n3 |
B. | n1 = n3 < n2 |
C. | n1 = n2 = n3 |
D. | n1 ≥ n3 ≥ n2 |
Answer» B. n1 = n3 < n2 |
View all MCQs in
Theory of Computation and Compiler DesignNo comments yet