This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Transformation from NFA to DFA – 1”.
1. Can a DFA simulate NDFA?
a) No
b) Yes
c) Sometimes
d) Depends on NDFA
View Answer
Explanation: Yes it can be done through power set construction.
2. Find the wrong statement?
a) The language accepted by finite automata are the languages denoted by regular expression
b) Every DFA has a regular expression denoting its language
c) For a regular expression r, there does not exists NDFA with L® ant transit that accept
d) None of the mentioned
View Answer
Explanation: The vice versa is true.
3. Regular expression a/b denotes which of the following set?
a) {a}
b) {€,a,b}
c) {a,b}
d) {ab}
View Answer
Explanation: Either a is the output or b hence it’s {a, b}.
4. Which behaviour of a NFA can be stimulated by DFA?
a) Always
b) Sometimes
c) Never
d) Depends on NFA
View Answer
Explanation: It can be done through power set construction.
5. For any DFA state {qi,qj…qm} If some qj is a final state in the NFA Then {qi,qj…qm}, is a final state in the DFA.
a) True
b) False
View Answer
Explanation: It the standard procedure to convert NFA to DFA.
6. What is the relation between NFA-accepted languages and DFA accepted languages?
a) >
b) <
c) =
d) <=
View Answer
Explanation: The no of languages accepted by NFA and DFA is equal.
7. In regular expressions, the operator ‘*’ stands for?
a) Concatenation
b) Selection
c) Iteration
d) Addition
View Answer
Explanation: It indicates iterations which can vary from zero to any number.
Sanfoundry Global Education & Learning Series – Compilers.
To practice all areas of Compilers, here is complete set of 1000+ Multiple Choice Questions and Answers.
- Practice Computer Science MCQs
- Practice MCA MCQs
- Apply for Computer Science Internship
- Check Compiler Design Books
- Check Computer Science Books