Match List I with List II
| List I | List II |
|---|---|
| A. Back Tracking | I. Automata |
| B. Infinite languages with matching numbers | II. Undecidable Problem |
| C. Canonical LR Parser | III. Predictive Parser |
| D. Post Correspondence Problem | IV. Large number of states |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. A-III, B-I, C-IV, D-II
Explanation
Backtracking is what a predictive parser avoids, so it is paired with predictive parsing (III). Infinite languages with matching counts are handled by (pushdown) automata (I). Canonical LR parsers have a large number of states (IV). Post's Correspondence Problem is undecidable (II).More Theory of Computation and Compilers questions
- An ambiguous grammar is one which has: A. More than one derivation B. More than one leftmost derivation C. More than one rightmost derivati…
- Arrange in appropriate order the construction of a finite automaton: A. Minimum-state DFA B. Regular expression C. NFA-ε D. Problem stateme…
- The grammar stmt → if expr then stmt else stmt | if expr then stmt suffers from:
- The language of the following PDA would be: δ(q0, a, z0) = (q0, aaaz0) δ(q0, a, a) = (q0, aaaa) δ(q0, b, a) = (q1, λ) δ(q1, b, a) = (q1, λ)…
- For the given two machines over {a, b}, which of the following is correct? Machine 1: states A (start), B (final); A –a→ A, A –a→ B, B –b→…
- The number of tokens in the line ' for i in range (begin; end ; step) : ' is: