MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 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_‚ÄÖ√†√∂‚ÀÖ¬∫_IS_EMPTY_(A_->_‚ÄÖ√†√∂‚ÀÖ¬∫.,A_),_THE_REDUCTION_BY_A->_A_IS_DONE?$# |
| A. | If next symbol is a terminal |
| B. | Only If the next input symbol is a |
| C. | Only If the next input symbol is A |
| D. | Only if the next input symbol is a |
| Answer» E. | |
| 2. |
The_construction_of_the_canonical_collection_of_the_sets_of_LR_(1)_items_are_similar_to_the_construction_of_the_canonical_collection_of_the_sets_of_LR_(0)_items._Which_is_an_exception?$ |
| A. | Closure and goto operations work a little bit different |
| B. | Closure and goto operations work similarly |
| C. | Closure and additive operations work a little bit different |
| D. | Closure and associatively operations work a little bit different |
| Answer» B. Closure and goto operations work similarly | |
| 3. |
When ß ( in the LR(1) item A -> ß.a,a ) is not empty, the look-hea?# |
| A. | Will be affecting. |
| B. | Does not have any affect. |
| C. | Shift will take place. |
| D. | Reduction will take place. |
| Answer» C. Shift will take place. | |
| 4. |
Which of the following is incorrect for the actions of A LR-Parser I) shift s ii) reduce A->ß iii) Accept iv) reject?$ |
| A. | Only I) |
| B. | I) and ii) |
| C. | I), ii) and iii) |
| D. | I), ii) , iii) and iv) |
| Answer» D. I), ii) , iii) and iv) | |
| 5. |
Which of these is true about LR parsing? |
| A. | Is most general non-backtracking shift-reduce parsing |
| B. | It is still efficient |
| C. | Both a and b |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 6. |
An LR-parser can detect a syntactic error as soon as |
| A. | The parsing starts |
| B. | It is possible to do so a left-to-right scan of the input. |
| C. | It is possible to do so a right-to-left scan of the input. |
| D. | Parsing ends |
| Answer» C. It is possible to do so a right-to-left scan of the input. | |
| 7. |
What is the similarity between LR, LALR and SLR? |
| A. | Use same algorithm, but different parsing table. |
| B. | Same parsing table, but different algorithm. |
| C. | Their Parsing tables and algorithm are similar but uses top down approach. |
| D. | Both Parsing tables and algorithm are different. |
| Answer» B. Same parsing table, but different algorithm. | |
| 8. |
Which of these is also known as look-head LR parser? |
| A. | SLR |
| B. | LR |
| C. | LLR |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |