In the previous post we discussed about “context-free languages” and “context-free grammar”. But without understanding the “pushdown automaton”, you can’t get depth knowledge of them.
Let’s see definition of “pushdown automaton”
Pushdown automaton:
A pushdown automaton (PDA) is a finite automaton that can make use of a stack containing data.
Pushdown automata choose a transition by indexing a table by input signal, current state, and the top of the stack. Normal finite state machines just look by input signal and current state: they have no stack to work with. Pushdown automata add the stack as a parameter for choice. Given an input signal, current state, and a given symbol at the top of the stack, a transition path is chosen.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment