MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 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» C. Along with removing left recursion we also perform the factoring of the grammar | |
| 2. |
Consider the gramma? |
| A. | |
| B. | |
| Answer» C. | |
| 3. |
Consider the following two statements: |
| A. | |
| B. | grammar |
| C. | |
| Answer» D. | |
| 4. |
Which one of the following is a top-down parser? |
| A. | Recursive descent parser |
| B. | Operator precedence parser |
| C. | An LR(k) parser |
| D. | An LALR(k) parser |
| Answer» B. Operator precedence parser | |
| 5. |
Which of the following describes a handle (as applicable to LR-parsing) appropriately? |
| A. | Position where next reduce or shift operation will occur |
| B. | The next step has use of Non-terminal for reduction |
| C. | Used for reduction in a coming-up step along with a position in the sentential form where the next shift or reduce operation will occur |
| D. | Used in the next step for reduction along with a position in the sentential form where the right hand side of the production may be found |
| Answer» E. | |