Gate CS-2003 Question Paper With Solutions

Q. 12 Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

(A) Removing left recursion alone

(B) Factoring the grammar alone

(C) Removing left recursion and factoring the grammar

(D) None of this

Answer: (D)

Explanation: