Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
From PDA to CFG<br />
Let P=(Q, , , , q 0 , q f ) a given PDA.<br />
We construct a <strong>CFL</strong> G=(V,,S,R) as follows*:<br />
• V = {A p,q | p,qQ}<br />
• S=A<br />
q 0 ,q f<br />
• R is a set of rules constructed as follows:<br />
* Proof of correctness <strong>and</strong> fur<strong>the</strong>r reading at <strong>the</strong> supplementary<br />
material in <strong>the</strong> course web page .<br />
25