MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 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. | |
| 2. |
In a bottom-up evaluation of a syntax directed definition its inherited attributes can do which of the following?$ |
| A. | Always evaluated |
| B. | Can be evaluated if the definition is L attributed |
| C. | Can be evaluated if the definition has synthesized attributes |
| D. | Never be evaluated |
| Answer» C. Can be evaluated if the definition has synthesized attributes | |
| 3. |
The grammar A ‚Üí AA | (A) | e is not suitable for predictive-parsing because the grammar is$ |
| A. | Ambiguous |
| B. | Left recursive |
| C. | Right recursive |
| D. | An operator grammar |
| Answer» C. Right recursive | |