Formal Languages and Compilation

✍ Scribed by Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti

• Publisher: Springer
• Year: 2013
• Tongue: English
• Leaves: 408
• Series: Texts in Computer Science
• Edition: 2nd
• Category: Library

✦ Synopsis

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 parallelparsing 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.

✦ Table of Contents

Front Matter....Pages I-XII
Introduction....Pages 1-3
Syntax....Pages 5-90
Finite Automata as Regular Language Recognizers....Pages 91-140
Pushdown Automata and Parsing....Pages 141-291
Translation Semantics and Static Analysis....Pages 293-387
Back Matter....Pages 389-399

✦ Subjects

Mathematical Logic and Formal Languages