InterviewSolution
Saved Bookmarks
| 1. |
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?(a) Removing left Recursive alone(b) Factoring the grammar alone(c) Along with removing left recursion we also perform the factoring of the grammar(d) None of the mentioned |
|
Answer» Right option is (d) None of the mentioned To explain: Removing left recursion and factoring the grammar do not suffice to convert an arbitrary CFG to LL(1) grammar. |
|