Which of the following suffices to convert an arbitrary CFG to an LL(1)…
PYQ UGC NET 2014
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?
- A.
Removing left recursion alone
- B.
Removing the grammar alone
- C.
Removing left recursion and factoring the grammar
- D.
None of the above
Attempted by 321 students.
Sign up free to check your answer
Sign up freeLoading lesson…

