2022 | OriginalPaper | Buchkapitel
Pushdown Automata and Context-Free Grammars
verfasst von : Alberto Pettorossi
Erschienen in: Automata Theory and Formal Languages
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In 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.