Abstract

AbstractIn this chapter we study the class of pushdown automata and their relation to the class of context-free grammars and languages. We also consider various transformations and simplifications of context-free grammars and we show how to derive the Chomsky normal form and the Greibach normal form of context-free grammars. We then study some fundamental properties of context-free languages and we present a few basic decidability and undecidability results. We also consider the deterministic pushdown automata and the deterministic context-free languages and we present two parsing algorithms for context-free languages.

Full Text
Published version (Free)

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 call