Match List I with List II
| List I | List II |
|---|---|
| A. A → aB | a (a ∈ T; A, B ∈ V) | I. Recursive Descent Parser |
| B. A → BC | a (a ∈ T; A, B, C ∈ V) | II. Turing Machine |
| C. LL(1) grammar | III. Chomsky Normal Form |
| D. Halting problem | IV. Finite Automata |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. A-IV, B-III, C-I, D-II
Explanation
Right-linear rules A → aB | a define regular grammars, accepted by finite automata (IV). A → BC | a is Chomsky Normal Form (III). LL(1) grammars are parsed by recursive-descent (predictive) parsers (I). The halting problem concerns Turing machines (II).More Theory of Computation and Compilers questions
- Which of the following is a function of the semantic analysis phase of compilation?
- For regular languages and context-free languages, which is NOT correct? A. Both are closed under union B. Both are closed under concatenati…
- Match List I with List IIList I List II A. Back Tracking I. Automata B. Infinite languages with matching numbers II. Undecidable Problem C.…
- 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: