MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
A_SERIES_OF_STATEMENTS_EXPLAINING_HOW_THE_DATA_IS_TO_BE_PROCESSED_IS_CALLED?$ |
| A. | Assembly |
| B. | Machine |
| C. | COBOL |
| D. | Program |
| Answer» E. | |
| 2. |
SYSTEM_PROGRAM_SUCH_A_S_COMPILER_ARE_DESIGNED_SO_THAT_THEY_ARE?$ |
| A. | Re-enterable |
| B. | Non reusable |
| C. | Serially usable |
| D. | None of the mentioned |
| Answer» B. Non reusable | |
| 3. |
A system program that setup an executable program in main memory ready for execution is$ |
| A. | Assembler |
| B. | Linker |
| C. | Loader |
| D. | Load and go |
| Answer» D. Load and go | |
| 4. |
A loader is a program that$ |
| A. | Program that places functions into memory and prepares them for execution. |
| B. | Program that automates the translation of assembly language into machine language. |
| C. | Program accepting another program written in a high level language and produces as object program |
| D. | None of the mentioned |
| Answer» B. Program that automates the translation of assembly language into machine language. | |
| 5. |
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 | |
| 6. |
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. | |
| 7. |
When ß ( in the LR(1) item A -> ß.a,a ) is not empty, the look-head$ |
| 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 | |
| 8. |
When there is a reduce/reduce conflict? |
| A. | If a state does not know whether it will make a shift operation using the production rule i or j for a terminal |
| B. | If a state does not know whether it will make a shift or reduction operation using the production rule i or j for a terminal |
| C. | If a state does not know whether it will make a reduction operation using the production rule i or j for a terminal |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 9. |
If a state does not know whether it will make a shift operation or reduction for a terminal is called |
| A. | Shift/reduce conflict |
| B. | Reduce /shift conflict |
| C. | Shift conflict |
| D. | Reduce conflict |
| Answer» B. Reduce /shift conflict | |