Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti

Formal Languages and Compilation

• Broschiertes Buch

Produktbeschreibung

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 analysisbased on flow equations.

Produktdetails

• Texts in Computer Science
• Verlag: Springer / Springer London / Springer, Berlin
• Artikelnr. des Verlages: 978-1-4471-6868-3
• 2. Aufl.
• Seitenzahl: 412
• Erscheinungstermin: 23. August 2016
• Englisch
• Abmessung: 235mm x 155mm x 23mm
• Gewicht: 653g
• ISBN-13: 9781447168683
• ISBN-10: 1447168682
• Artikelnr.: 45574544

Autorenporträt

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.

Inhaltsangabe

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

Rezensionen

From the book reviews:

"The book provides an in-depth introduction to the foundations of compiler construction with a strong emphasis on the theory of formal languages. It is well suited for a basic course on formal languages (covering the regular and the context-free languages) and an advanced course on compiler construction. The presentation is mathematically exact and thus necessarily formal, but the authors make every effort to illustrate the concepts and algorithms on well-selected examples." (Andreas Maletti, zbMATH, Vol. 1298, 2014)