MCQOPTIONS
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» E. | |