10-PD.ppt

2009-2010第一学期 西安交通大学《编译原理》课件 Yinliang Zhao （赵银亮） Pushdown Automata Yinliang Zhao Xi’an Jiaotong University 2013 Pushdown Automata A PDA is an automaton equivalent to the CFG in language-defining power. Only the nondeterministic PDA defines all possible CFL’s. But the deterministic version models parsers. Most programming languages have deterministic PDA’s. Intuition: PDA Think of an ?-NFA with the additional power that it can manipulate a stack. Its moves are determined by: The current state (of its “NFA”), The current input symbol (or ?), and The current symbol on top of its stack. Intuition: PDA – (2) Being nondeterministic, the PDA can have a choice of next moves. In each choice, the PDA can: Change state, and also Replace the top symbol on the stack by a sequence of zero or more symbols. Zero symbols = “ pop.” Many symbols = one “ pop” and then sequence of “pushes.” PDA Formalism A PDA is described by: A finite set of states (Q, typically). An input alphabet (?, typically). A stack alphabet (?, typically). A transition function (?, typically). A start state (q0, in Q, typically). A start symbol (Z0, in ?, typically). A set of final states (F ? Q, typically). Conventions a, b, … are input symbols. But sometimes we allow ? as a possible value. …, X, Y, Z are stack symbols. …, w, x, y, z are strings of input symbols. ?, ?,… are strings of stack symbols. The Transition Function Takes three arguments: A state, in Q. An input, which is either a symbol in ? or ?. A stack symbol in ?. ?(q, a, Z) is a set of zero or more actions of the form (p, ?). p is a state; ? is a string of stack symbols. Actions of the PDA If ?(q, a, Z) contains (p, ?) among its actions, then one thing the PDA can do in state q, with a at the front of the input, and Z on top of the stack is: Change the state to p. Remove a from the front of the input (but a may be ?). Replace Z on the top of the stack by ?. Example: PDA Design a PDA to accept {0n1n | n 1}. The states: q = start state. W