Question 9803 – Compiler-Design
February 13, 2024GATE 2003
February 13, 2024GATE 2003
|
Question 17
|
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:
|
n1 is necessarily less than n2
|
|
|
n1 is necessarily equal to n2
|
|
|
n1 is necessarily greater than n2
|
|
|
None of the above
|
Question 17 Explanation:
No. of states in SLR and LALR are equal and no. of states in SLR and LALR are less than or equal to LR(1).
Correct Answer: B
Question 17 Explanation:
No. of states in SLR and LALR are equal and no. of states in SLR and LALR are less than or equal to LR(1).