MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
DFAs, NFAs, and -NFA s are equivalent. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
For every DFA, there is an -NFA that accepts the same language. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 3. |
An NFA is nothing more than an -NFA with no transitions. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
If the NFA N has n states, then the corresponding DFA D has 2n states. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 5. |
_________ a phase of a compiler that maps the IR program into the instruction set and the finite resources of the target machine. |
| A. | Optimizer |
| B. | Parser |
| C. | Optimizer & Parser |
| D. | None of the mentioned |
| Answer» E. | |
| 6. |
Ndfa and dfa accept same languages. |
| A. | True |
| B. | False |
| Answer» B. False | |