Formal Languages and Compilation

2. Auflage 2013
ISBN: 978-1-4471-6868-3
Verlag: Springer Nature B.V.

Buch, Englisch, 399 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 6204 g

Reihe: Texts in Computer Science

This revised and expanded new edition elucidates the elegance and simplicity of the fundamental theory underlying formal languages and compilation. Retaining the reader-friendly style of the 1st edition, this versatile textbook describes the essential principles and methods used for defining the syntax of artificial languages, and for designing efficient parsing algorithms and syntax-directed translators with semantic attributes. Features: presents a novel conceptual approach to parsing algorithms that applies to extended BNF grammars, together with a parallel parsing algorithm (NEW); supplies supplementary teaching tools at an associated website; systematically discusses ambiguous forms, allowing readers to avoid pitfalls; describes all algorithms in pseudocode; makes extensive usage of theoretical models of automata, transducers and formal grammars; includes concise coverage of algorithms for processing regular expressions and finite automata; introduces static program analysis based on flow equations.

Zielgruppe

Graduate

Autoren/Hrsg.

Crespi Reghizzi, Stefano

Breveglieri, Luca

Morzenti, Angelo

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Compiler
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

Introduction.- Syntax.- Finite Automata as Regular Language Recognizers.- Pushdown Automata and Parsing.- Translation Semantics and Static Analysis.

Über Autor(innen)

Dr. Stefano Crespi Reghizzi and Dr. Angelo Morzenti are Full Professors of Computer Engineering in the Department of Electronics and Computer Science at the Politecnico di Milano. Dr. Luca Breveglieri is an Associate Professor at the same institution.