Which of the following option is false?
(A) If there are no SR conflicts in LR(1) then LALR(1) will never have SR conflicts.
(B) Recursive decent parser is a top-down parser.
(C) Removing left recursion and left factoring to suffice to convert a CFG to an LL(1) grammar.
(D) CLR can handle all deterministic context-free languages.


Answer: (C)

Explanation: LL(1) grammar must be free from left recursion, left factoring, and ambiguity. All of these three necessary for LL(1) grammar.

So, option (C) is false.

Quiz of this Question