InterviewSolution
Saved Bookmarks
| 1. |
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?(a) Removing left recursion only(b) Factoring the grammar alone(c) Factoring & left recursion removal(d) None of the mentioned |
|
Answer» Right option is (d) None of the mentioned The explanation: Factoring as well as left recursion removal do not suffice to convert an arbitrary CFG to LL(1) grammar. |
|