This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Regular Languages and D-PDA”. 1. Which of the following is analogous to the following? :NFA and NPDA a) Regular language and Context Free language b) Regular language and Context Sensitive language c) Context free language and Context Sensitive language d) None of … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Deterministic PDA” 1. The transition a Push down automaton makes is additionally dependent upon the: a) stack b) input tape c) terminals d) none of the mentioned 2. A PDA machine configuration (p, w, y) can be correctly represented as: a) (current … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “From PDA to Grammars”. 1. The instantaneous PDA is has the following elements a) State b) Unconsumed input c) Stack content d) All of the mentioned 2. The moves in the PDA is technically termed as: a) Turnstile b) Shifter c) Router … Read more
This set of Basic Automata Theory Questions and Answers focuses on “From Grammars to Push Down Automata”. 1. The production of the form A->B , where A and B are non terminals is called a) Null production b) Unit production c) Greibach Normal Form d) Chomsky Normal Form 2. Halting states are of two types. … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “PDA-acceptance by Empty Stack”. 1. If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called a) Complement b) Union c) Disjoint d) Connected 2. Which among the following is not a part of the … Read more
This set of Automata Theory Questions and Answers for Entrance exams focuses on “PDA-Acceptance by Final State”. 1. A push down automaton employs ________ data structure. a) Queue b) Linked List c) Hash Table d) Stack 2. State true or false: Statement: The operations of PDA never work on elements, other than the top. a) … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Ambiguous Grammar”. 1. A CFG is ambiguous if a) It has more than one rightmost derivations b) It has more than one leftmost derivations c) No parse tree can be generated for the CFG d) None of the mentioned 2. Which of … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Markup Languages”. 1. XML is a _________ markup language. a) meta b) beta c) octa d) peta 2. XML uses _________ principle to formally describe the data. a) DDL b) DTD c) DML d) None of the mentioned 3. Which among the … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “YACC Parser Generator”. 1. YACC is a computer program for ______ operation system. a) Windows b) DOS c) Unix d) openSUSE 2. YACC is an acronym for: a) Yes Another Compile Compiler b) Yet Another Compile Compiler c) Yet Another Compiler Compiler … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Applications – Parsers”. 1. To derive a string using the production rules of a given grammar, we use: a) Scanning b) Parsing c) Derivation d) All of the mentioned 2. Which of the following parser reaches the root symbol of the tree … Read more
