Revision as of 14:33, 13 July 2024 edit Matthew V. Milone (talk \| contribs) 211 edits →‎Informal description: fixed a false dichotomy Tag: Reverted ← Previous edit		Latest revision as of 06:43, 14 July 2024 edit undo Jochen Burghardt (talk \| contribs) Extended confirmed users 23,459 edits Undid revision 1234278984 by Matthew V. Milone (talk): several is correct Tag: Undo
Line 22: Put together: Given an input symbol, current state, and stack symbol, the automaton can follow a transition to another state, and optionally manipulate (push or pop) the stack. If, in every situation, at most one such transition action is possible, then the automaton is called a '''[[deterministic pushdown automaton]] (DPDA)'''. In general, if ~~multiple~~several actions are possible, then the automaton is called a '''general''', or '''nondeterministic''', '''PDA'''. A given input string may drive a nondeterministic pushdown automaton to one of ~~multiple~~several configuration sequences; if one of them leads to an accepting configuration after reading the complete input string, the latter is said to belong to the ''language accepted by the automaton''. <!---has been said more precisely above:---Nondeterministic PDAs are able to handle situations where more than one choice of action is available.---><!---don't know what these paragraphs are supposed to mean; automata don't create 'instances' during their operation; PDAs are a theoretical model, implemetation problems aren't an issue here, see [[Earley parser]], [[LR parser]], etc., instead---:In principle, it is enough{{clarify\|date=December 2016}} to create in every such case new automaton instances that will handle the extra choices.

Pushdown automaton: Difference between revisions