Translating Between Context-Free Grammars and Pushdown Automata Automata Theory by ComputeNow - August 19, 2018August 19, 20180 Context-free Grammar to Pushdown Automata Each derivation or sequence of production rules that results in a given string is made up of intermediate strings (which are made at each step of the derivation). The pushdown automata's nondeterminism helps it to guess the sequence of steps in the derivation that will result in the desired