MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
WHEN_WILL_THE_RELATIONSHIP_BETWEEN_‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚Àւ§<‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•_AND_‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚Àւ§>‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•_BE_ |
| A. | > |
| B. | < |
| C. | = |
| D. | Undefined |
| Answer» E. | |
| 2. |
When will the relationship between ‘+’ and ‘-’ be ?# |
| A. | For unary minus |
| B. | Minus is right associative |
| C. | All of the mentioned |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 3. |
How is the parsing precedence relations defined |
| A. | None of the mentioned |
| B. | All of the mentioned |
| C. | To delimit the handle |
| D. | Only for a certain pair of terminals |
| Answer» C. To delimit the handle | |
| 4. |
Which is the most powerful parser? |
| A. | SLR |
| B. | LALR |
| C. | Canonical LR |
| D. | Operator-precedence |
| Answer» D. Operator-precedence | |
| 5. |
LR stands for |
| A. | Left to right |
| B. | Left to right reduction |
| C. | Right to left |
| D. | Right most derivation and Left to right and a in reverse |
| Answer» E. | |
| 6. |
Recursive descent parsing is an example of |
| A. | Top down parsing |
| B. | Bottom up parsing |
| C. | Predictive parsing |
| D. | None of the mentioned |
| Answer» B. Bottom up parsing | |
| 7. |
The grammar S ‚Üí aSa | bS | c is |
| A. | LL(1) but not LR(1) |
| B. | LR(1) but not LR(1) |
| C. | Both of the mentioned |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |