Overview
- Fully revised and expanded new edition
- Supplies supplementary teaching tools at an associated website
- Now presents a novel conceptual approach to parsing algorithms that applies to extended BNF grammars, together with a parallel parsing algorithm
- Includes supplementary material: sn.pub/extras
Part of the book series: Texts in Computer Science (TCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (5 chapters)
About this book
Reviews
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)
Authors and Affiliations
About the authors
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.
Bibliographic Information
Book Title: Formal Languages and Compilation
Authors: Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti
Series Title: Texts in Computer Science
DOI: https://doi.org/10.1007/978-1-4471-5514-0
Publisher: Springer London
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag London 2013
Softcover ISBN: 978-1-4471-6868-3Published: 23 August 2016
eBook ISBN: 978-1-4471-5514-0Published: 16 October 2013
Series ISSN: 1868-0941
Series E-ISSN: 1868-095X
Edition Number: 2
Number of Pages: XII, 399
Number of Illustrations: 170 b/w illustrations, 1 illustrations in colour