Explore topic-wise MCQs in Compilers.

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.

A finite automata recognizes

A. Any Language
B. Context Sensitive Language
C. Context Free Language
D. Regular Language
Answer» E.
Discussion
2.

The string WWR is not recognized by any FSM because

A. A FSM cannot remember arbitrarily large amount of information
B. A FSM cannot fix the midpoint
C. A FSM cannot match W with WR
D. A FSM cannot remember first and last inputs
Answer» C. A FSM cannot match W with WR
Discussion
3.

Basic limitations of finite state machine is

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
Discussion
4.

Maximum number of states of a DFA converted from a NFA with nstates is

A. n
B. n2
C. 2n
D. None of these
Answer» D. None of these
Discussion
5.

The transitional function of a DFA is

A. Q X Σ→Q
B. Q X Σ→2Q
C. Q X Σ→2n
D. Q X Σ→Qn
Answer» B. Q X ‚âà√≠¬¨¬£‚Äö√Ñ√∂‚àö√∫‚àö‚â†2Q
Discussion
6.

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
Discussion