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 finite automata recognizes ____________ |
| A. | Any Language |
| B. | Context Sensitive Language |
| C. | Context Free Language |
| D. | Regular Language |
| Answer» E. | |
| 2. |
The string WWR is not recognized by any FSM because _____________ |
| A. | An FSM cannot remember arbitrarily large amount of information |
| B. | An FSM cannot fix the midpoint |
| C. | An FSM cannot match W with WR |
| D. | An FSM cannot remember first and last inputs |
| Answer» C. An FSM cannot match W with WR | |
| 3. |
What are the basic limitations of finite state machine? |
| A. | It cannot remember arbitrarily large amount of information |
| B. | In cannot remember state transitions |
| C. | In cannot remember grammar for a language |
| D. | It cannot remember language generated from a grammar |
| Answer» C. In cannot remember grammar for a language | |
| 4. |
Maximum number of states of a DFA converted from an NFA with nstates is? |
| A. | n |
| B. | n<sup>2</sup> |
| C. | 2n |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
What is the transitional function of an NFA? |
| A. | Q X Q |
| B. | Q X 2Q |
| C. | Q X 2n |
| D. | Q X Qn |
| Answer» C. Q X 2n | |
| 6. |
What is the transitional function of a DFA? |
| A. | Q X Q |
| B. | Q X 2Q |
| C. | Q X 2n |
| D. | Q X Qn |
| Answer» B. Q X 2Q | |
| 7. |
A language L from a grammar G = { VN, , P, S} is? |
| A. | Set of symbols over VN |
| B. | Set of symbols over |
| C. | Set of symbols over P |
| D. | Set of symbols over S |
| Answer» C. Set of symbols over P | |