Match List-I with List-II :
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. A-III, B-I, C-IV, D-Il
Explanation
Following the official key: backtracking parsers relate to predictive (top-down) parsing, languages with matching counts to automata (PDAs), canonical LR parsers have a large number of states, and the Post Correspondence Problem is undecidable.
More Theory of Computation and Compilers questions
- For the given two machines which of the following is correct?
- Let L= {ab, aa, baa}. Which of the following strings are not in L*?
- Let A={a, b} and L=A*. Let X={anbn, n>0}. The languages L U X and X are respectively :
- Which of the following symbol table implementations is best suited if access time is to be minimum?
- The sum of minimum and maximum number of final states for a Deterministic Finite Automata (DFA) having ' P ' state is equal to :
- Three address codes can be represented in special structures known as : (A) Quadruples (B) Triples (C) Patterns (D) Indirect Triples