Explore topic-wise MCQs in Compilers.

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.

Is an ordinary NFA and a NFA- are equivalent.

A. True
B. False
Answer» B. False
Discussion
2.

A nondeterministic finite automation with -moves is an extension of nondeterministic finite automation.

A. True
B. False
Answer» B. False
Discussion
3.

The transitions which does not take an input symbol are called ___________

A. -transitions
B. -transitions
C. -transitions & -transitions
D. none of the mentioned
Answer» D. none of the mentioned
Discussion
4.

Which of the following CFG s can t be simulated by an FSM?

A. S->Sa/b
B. S->aSb/ab
C. S->abX, X->cY, Y->d/aX
D. None of the mentioned
Answer» C. S->abX, X->cY, Y->d/aX
Discussion
5.

-transitions does not add any extra capacity of recognizing formal.

A. True
B. False
Answer» B. False
Discussion
6.

E(q) is known -closure of q.

A. True
B. False
Answer» B. False
Discussion
7.

NFA- s are defined because certain properties can be more easily proved on them as compared to NFA.

A. True
B. False
Answer» B. False
Discussion