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