This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Minimization of DFA – 1”. 1. Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*? a) € b) a* c) All of the mentioned d) None of the mentioned 2. Choose the correct … Read more
This set of Compilers Interview Questions and Answers for Experienced people focuses on “The NFA with epsilon-moves to the DFA-2”. 1. The classes of languages P and NP are closed under certain operations, and not closed under others. Decide whether P and NP are closed under each of the following operations. 1. Union 2. Intersection … Read more
This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “The NFA with n-moves to the DFA – 1”. 1. Examine the following DFA: If input is 011100101, which edge is NOT traversed? a) A B b) C c) C D d) D A 2. If string s is accepted by this DFA, … Read more
This set of Compilers Questions and Answers for Experienced people focuses on “The NFA with Epsilon – Moves – 2”. 1. NFA-εs are defined because certain properties can be more easily proved on them as compared to NFA. a) True b) False 2. E(q) is known ε-closure of q. a) True b) False 3. ε-transitions … Read more
This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “The NFA with epsilon – Moves – 1”. 1. S –> aSa| bSb| a| b; the language generated by the above grammar is the set of ____________ a) All palindromes b) All odd length palindromes c) Strings beginning and ending with the same … Read more
This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Transformation from NFA to DFA – 2”. 1. A deterministic finite automation (DFA)D with alphabet ∑ = {a,b} is given below. Which of the following is a valid minimal DFA which accepts the same language as D? a) b) c) d) 2. The … Read more
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 2. Find the wrong statement? a) The language accepted by finite automata are the languages denoted by regular expression b) … Read more
This set of Compilers Interview Questions and Answers for freshers focuses on “Non – Deterministic Finite Automata – 2”. 1. Conversion of a DFA to an NFA __________ a) Is impossible b) Requires the subset construction c) Is Chancy d) Is nondeterministic 2. A regular language corresponds to __________ a) An alphabet b) Set of … Read more
This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Non-deterministic Finite Automata – 1”. 1. Which NDFA correctly represents the following RE? a(bab)*∪a(ba)* a) b) c) d) None of the mentioned 2. Which is the correct NDFA for the following mentioned expression? (ab)*∪(aba)* a) b) c) d) None of the mentioned 3. … Read more
This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Finite Automata – 2”. 1. Which of the following statement is true for Dead State? a) It cannot be reached anytime b) There is no necessity of the state c) If control enters no way to come out from the state d) If … Read more
