Match List I with List II
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. A-III, B-II, C-I, D-IV
Explanation
LL starts with $S on the stack and w$ as input, and ends with $ and $. LR starts with $ and w$, and accepts with $S and $. (Item D's 'LL' should read LR.)
More Theory of Computation and Compilers questions
- Consider the following statements: (A) For every regular language, we can design Turing Machine (B) For every context free language, we can…
- The transition function ' ' in multi-tape Turing machine is defined as:
- In Pumping Lemma for regular languages, to say a language is satistying pumping lemma, what is the mınımum length of ' y ' if you consider…
- The item generated by the production is :
- In the ε-NFA M = ({q0, q1, q2, q3}, {a}, δ, q0, {q3}) with δ: q0 –ε→ q1, q1 –ε→ q2, q2 –a→ {q2, q3}, and no other moves, what is the minimu…
- Which of the following is (are) correct? 1. The language for the given expression is L = {aⁿbⁿcᵐdᵐ | n ≥ 1, m ≥ 1} ∪ {aⁿbᵐcᵐdⁿ | n ≥ 1, m ≥…