In the pumping lemma for context-free languages, for a string uvwxy, what is the minimum length of vx together?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. 1
Explanation
The lemma requires |vx| ≥ 1 (v and x are not both empty) and |vwx| ≤ n.More Theory of Computation and Compilers questions
- Which of the following is an ε-free grammar?
- While processing a string, an LR parser reads the input
- What are the minimum and maximum numbers of initial, dead, unreachable and final states in a valid n-state finite automaton whose accepted…
- Which of the following finite automata recognise the language L = {a, b}*? A. M = ({q0}, {a, b}, δ, q0, {q0}) with δ(q0, a) = {q0}, δ(q0, b…
- Which of the following statements are correct? A. Syntax-directed translation can be applied in type checking. B. Syntax-directed translati…
- Match List I with List II (stack and input configurations)List I List II A. Initial configuration of stack and input in LL parsing I. $ | w…