Abstract
This chapter describes the language acceptor for context-free languages, called pushdown automata (PDA). The chapter begins with mathematical preliminaries, followed by a formal representation of pushdown automata, string processing for acceptance and rejection, and design of pushdown automata for context-free languages. The chapter further describes the equivalence between context-free grammars and pushdown automata. The deterministic and nondeterministic nature of PDA is presented through examples. The chapter concludes with the conversion of context-free grammars into pushdown automata.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
