Chapte 6 Pushdown Automata.ppt

6.2 The language of the PDA Example: PDAs can accept languages that are not regular. The following one accepts: L={0i1j | 0 ≤ i ≤ j} Example A PDA for the language of balanced parentheses: (s,001111,Z0) |- (s, 01111, XZ0) |- (s, 1111, XXZ0) |- (p, 111, XZ0) |- (p, 11, Z0) |- (q, 11, Z0) |- (q, 1, Z0) |- (q,ε, Z0) 6.2 The language of the PDA the automaton M will have five transitions, all from q to q: δ(q, ε,S) = (q, SS) S → SS δ(q, ε,S) = (q, (S) ) S → (S) δ(q, ε,S) = (q, ε ) S → ε δ(q, (, ( ) = (q, ε) δ(q, ), ) ) = (q, ε) Now compare the leftmost derivation S ?? SS ? (S)S ? ((S))S ? (())S ? (())(S) ? (())() with the Ms execution on the same string given as input: 2. From PDA’s to Grammars S →[q0Zq0] By ?(q0, 0, Z)={(q0, ZA)}, we have:[q0Zq0] →0[q0Zq0][q0Aq0] By ?(q0, 1, Z)={(q0, ZB)}, we have:[q0Zq0] →1[q0Zq0][q0Bq0] By ?(q0, 2, Z)={(q0, ε)}, we have:[q0Zq0] →2 By ?(q0, 0, A)={(q0, ε)}, we have:[q0Aq0] →0 By ?(q0, 1, B)={(q0, ε)}, we have:[q0Zq0] →1 . if ?= Y1Y2...Yk, we have [qXrk]→a[pY1r1][r1Y2r2]…[rk-1Ykrk] . If ? = Y1Y2, we have [qXr2] → a[pY1r1][r1Y2r2], for every r1 and r2. If (p, ??)??(q, a, X), then there is one or more corresponding productions, depending on complexity of ?. . If ? = ε, we have [qXp] → a . If ? = Y, we have [qXr] → a[pYr] for every r 豫郁判趋呀呵鄙组懂晃耳绢笨燕诊艳吮镇桃驼傣烘就付祥乾痛氟帅汛琐注Chapter 6 Pushdown AutomataChapter 6 Pushdown Automata Example: Let P = ({p; q}, {0, 1}, {X, Z0}, ?, q, Z0), where ? is given by 1. ?(q, 1, Z0) = {(q, XZ0)} 2. ?(q, 1, X) = {(q, XX)} 3. ?(q, 0, X) = {(p, X)} 4. ?(q, ε, X) = {(q, ε)} 5. ?(p, 1, X) = {(p, ε)} 6. ?(p, 0, Z0) = {(q, Z0)} to a CFG. We get G = (V, {0; 1}, R, S), where V = {[qXp]; [pXq]; [qZ0p]; [pZ0q]; S} and the productions in R are S → [qZ0q] | [qZ0p] From function (1): [qZ0q] → 1[qXq][qZ0q] [qZ0q] → 1[qXp][pZ0q] [qZ0p] → 1[qXq][qZ0p] [qZ0p] → 1[qXp][pZ0p] From function (2): [qXq] → 1[qXq][qXq] [qXq]