a pushdown automata is a context-free grammar parser straight from automata theory (yep the same that birthed cellular automata) this one tries to see if the parenthesis are balanced for example: () is valid (() is invalid since theres 1 ( more
