Compiler Construction MCQs with Answers
Practice important Compiler Construction MCQs with answers and explanations.
Multiple Choice Questions
Q261: The state A in the DFA example is derived from which NFA states?
- A: {1,2,3}
- B: {0,1,2,4,7}
- C: {1,2,4}
- D: {0,2,3,4}
View Answer
B
Q262: move(A,a) in the DFA example gives transition to
- A: {1,3,6}
- B: {3,4}
- C: {3,8}
- D: {5,7}
View Answer
C
Q263: After applying ε-closure to move(A,a), we get state
- A: A
- B: B
- C: C
- D: D
View Answer
B
Q264: The DFA resulting from subset construction is always
- A: Smaller than NFA
- B: Equivalent to NFA
- C: Different from NFA
- D: Cannot be minimized
View Answer
B
Q265: A transition table for DFA maps
- A: A single state to a set
- B: A symbol to a string
- C: A state-symbol pair to a state
- D: A symbol to a symbol
View Answer
C
Q266: How many sets were finally marked in the example DFA construction?
- A: 3
- B: 4
- C: 5
- D: 6
View Answer
C
Q267: Which of the following is NOT part of the subset construction algorithm?
- A: ε-closure calculation
- B: DFA state minimization
- C: move function
- D: Marking states
View Answer
B
Q268: Subset construction is applied on which type of automata?
- A: DFA
- B: PDA
- C: NFA
- D: Turing Machine
View Answer
C
Q269: After computing move and ε-closure, if a new set U is not in S’, what happens?
- A: Skip the input
- B: Add U to final states
- C: Add U to S’
- D: Discard U
View Answer
C
Q270: In subset construction, if state S contains a final NFA state, S becomes
- A: Start state
- B: Reject state
- C: Accepting DFA state
- D: Dead state
View Answer
C