Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.
(a) n1 is necessarily less than n2
(b) n1 is necessarily equal to n2
(c) n1 is necessarily greater than n2
(d) none of the mentioned
I got this question in unit test.
The origin of the question is Top-Down Parsing topic in division Topdown Parsing of Compiler