A -> B a | c B b | d C b | d C a

B -> q | & | A a C

C -> f A C B | q

A: Show that the given grammar is not suitable for CLR (1) but suitable for SLR (1): B: Now modify the grammar, so that it becomes suitable for CLR (1). Make sure that the modified grammar should results the same set of strings as the given grammar. C: Create the stack table to parse the given input string: c q a a f q q f D: Fill the CLR(1) parsing table with suitable error codes / messages and identify the error in the given input string: c b a f q q a c q