1 1 vote Assume that the $\text{SLR}$ parser for a grammar $\text{G}$ has $n_{1}$ states and the $\text{LALR}$ parser for $\text{G}$ has $n_{2}$ states. The relationship between $n_{1}$ and $n_{2}$ is : $n_{1}$ is necessarily less than $n_{2}$ $n_{1}$ is necessarily equal to $n_{2}$ $n_{1}$ is necessarily greater than $n_{2}$ none of the options Compiler Design nielit-sta-2020 compiler-design parsing + – gatecse 688 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes The correct answer is $(B).$ Ref: https://gateoverflow.in/907/gate2003-17 Lakshman Bhaiya answered Dec 11, 2020 Lakshman Bhaiya comment Share Follow 0 reply Please log in or register to add a comment.
