Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.
Posted: Thu Jul 14, 2022 9:07 am
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
b) n1 is necessarily equal to n2
c) n1 is necessarily greater than n2
d) none of the mentioned