Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. Hence which one is true?
(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 have been asked this question during an interview for a job.
My question comes from Handle of Right sentinel Grammar topic in division Bottom Up Parsing of Compiler