MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Disadvantage of ” Compile and GO ” loading scheme is that |
| A. | Memory is wasted because the case occupied by the assembler is unavailable to the object program |
| B. | Necessary to translate the users program |
| C. | It is very difficult to handle multiple segments, even when the source programs are in different languages and to produce orderly modular programs |
| D. | All of the mentioned |
| Answer» E. | |
| 2. |
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 | |
| 3. |
AB+(A+B)' is equivalent to |
| A. | A?B |
| B. | A+B |
| C. | (A+B)A |
| D. | (A+B)B |
| Answer» B. A+B | |
| 4. |
The best way to compare the different implementations of symbol table is to compare the time required to |
| A. | Add a new name |
| B. | Make an enquiry |
| C. | Add a new name and make an enquiry |
| D. | All of the mentioned |
| Answer» E. | |
| 5. |
The context free grammar S -> A111|S1, A -> A0 | 00 is equivalent to |
| A. | {0n1? | n=2, m=3} |
| B. | {0n1? | n=1, m=5} |
| C. | {0n1? | n should be greater than two and m should be greater than four} |
| D. | None of these |
| Answer» B. {0n1? | n=1, m=5} | |
| 6. |
Given the following statements : (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements ? |
| A. | I only |
| B. | II only |
| C. | Both I and II |
| D. | Neither I nor II |
| Answer» C. Both I and II | |
| 7. |
The language accepted by a Push down Automata |
| A. | Type0 |
| B. | Type1 |
| C. | Type2 |
| D. | Type3 |
| Answer» D. Type3 | |
| 8. |
Grammars that can be translated to DFAs: |
| A. | Left linear grammar |
| B. | Right linear grammar |
| C. | Generic grammar |
| D. | All of the mentioned |
| Answer» C. Generic grammar | |
| 9. |
Automaton accepting the regular expression of any number of a ‘ s is$ |
| A. | a* |
| B. | ab* |
| C. | (a/b)* |
| D. | a*b*c |
| Answer» B. ab* | |
| 10. |
Grammar that produce more than one Parse tree for same sentence is |
| A. | Ambiguous |
| B. | Unambiguous |
| C. | Complementary |
| D. | Concatenation Intersection |
| Answer» B. Unambiguous | |