Q9-Consider the following grammar:
S → aPbSQ | a
Q → t | ε
P → r
The number of states will reduce when a LALR(1) parse is computed out of CLR(1) parser for the above grammar _____.
made easy solution
my solution
please correct me if i wrong no of state is reduce =6?