Formal Languages and Compilation
Seiten
2013
|
2nd ed. 2013
Springer London Ltd (Verlag)
978-1-4471-5513-3 (ISBN)
Springer London Ltd (Verlag)
978-1-4471-5513-3 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
This revised and expanded new edition includes supplementary web-based teaching resources and a new conceptual approach to parsing algorithms that applies to extended Backus-Naur Form grammars. It delivers inclusive, practicable coverage of the field.
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.
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.
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.
Introduction
Syntax
Finite Automata as Regular Language Recognizers
Pushdown Automata and Parsing
Translation Semantics and Static Analysis
| Erscheint lt. Verlag | 28.10.2013 |
|---|---|
| Reihe/Serie | Texts in Computer Science |
| Zusatzinfo | 30 Tables, black and white; 1 Illustrations, color; 170 Illustrations, black and white; XII, 399 p. 171 illus., 1 illus. in color. |
| Verlagsort | England |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 7391 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| ISBN-10 | 1-4471-5513-0 / 1447155130 |
| ISBN-13 | 978-1-4471-5513-3 / 9781447155133 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 53,15
Teil 2 der gestreckten Abschlussprüfung Fachinformatiker/-in …
Buch | Softcover (2025)
Europa-Lehrmittel (Verlag)
CHF 37,90
