About this document
Converting CFG to PDA Explained by John Sabers is a document available to read on EtoBox.
The document discusses converting between context-free grammars (CFGs) and pushdown automata (PDAs). It shows that a language L has a CFG if and only if it is accepted by some PDA. It then describes how to convert a CFG to a PDA by having the PDA simulate derivations in the CFG. It also describes how to simplify a PDA into an equivalent CFG.
- Author
- John Sabers
- Language
- EN