Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Formal Languages and Compilation

Formal Languages and Compilation

Crespi Reghizzi, Stefano, Breveglieri, Luca, Morzenti, Angelo

2nd ed. 2013, XII, 399 p. 171 illus., 1 illus. in color.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-1-4471-5514-0

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase

learn more about Springer eBooks

add to marked items


Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-1-4471-5513-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • 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

This fully revised and expanded new edition elucidates the elegance and simplicity of the fundamental theory underlying Formal Languages and Compilation.

Retaining the reader-friendly, minimalist style of the first edition, this uniquely 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. A comprehensive selection of topics is presented within a rigorous, unified framework, illustrated by numerous practical examples.

Features and topics:

  • 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, including course slides and exercises with solutions, at an associated website
  • Unifies the concepts and notations used in different approaches, enabling an extended coverage of methods with a reduced number of definitions
  • Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars
  • Describes all algorithms in pseudocode, so that detailed knowledge of a specific programming language is not necessary
  • 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 clearly-written, classroom-tested textbook is an ideal guide to the fundamentals of this field for advanced undergraduate and graduate students in computer science and computer engineering. Some background in programming is required, and readers should also be familiar with basic set theory, algebra and logic.

Content Level » Graduate

Related subjects » Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Formal Languages.

Additional information