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. |
A language is regular if and only if it is accepted by finite automata. |
| A. | The given statement statement is true |
| B. | Given statement is false |
| C. | Statement is partially true |
| D. | None of the mentioned |
| Answer» B. Given statement is false | |
| 2. |
Grammars that can be translated to DFAs is __________ |
| A. | Left linear grammar |
| B. | Right linear grammar |
| C. | Generic grammar |
| D. | All of the mentioned |
| Answer» C. Generic grammar | |
| 3. |
A context free language is called ambiguous if? |
| A. | It has 2 or more than 2 left derivations for some terminal string L (G) |
| B. | It has 2 or more than 2 right derivations for some terminal string L (G) |
| C. | It has 2 or more than 2 left and right derivations for some terminal string L (G) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
Transition of finite automata is ___________ |
| A. | Finite Diagram |
| B. | State Diagram |
| C. | Node Diagram |
| D. | E-R Diagram |
| Answer» C. Node Diagram | |
| 5. |
What is the idea of automation with a stack as auxiliary storage? |
| A. | Finite automata |
| B. | Push Down Automata |
| C. | Deterministic Automata |
| D. | None of the mentioned |
| Answer» C. Deterministic Automata | |
| 6. |
What is CFG? |
| A. | Compiler |
| B. | A language expression |
| C. | Regular Expression |
| D. | None of the mentioned |
| Answer» C. Regular Expression | |
| 7. |
Left Linear grammar can be converted to Right Linear grammar. |
| A. | Yes |
| B. | No |
| Answer» B. No | |