[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Formal Languages and Compilation

  • Textbook
  • © 2019
  • Latest edition

Overview

Authors:
  1. Stefano Crespi Reghizzi

    1. Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milan, Italy

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Luca Breveglieri

    1. Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milan, Italy

    View author publications

    You can also search for this author in PubMed   Google Scholar

  3. Angelo Morzenti

    1. Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milan, Italy

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Presents an introduction to the fundamentals of formal language theory and formal methods, compiler and language design, and natural language processing
  • Includes many illustrative examples, and supplies a large set of exercises with solutions at an associated website
  • Updated third edition featuring new material on string matching, extended BNF grammars, parallel parsing, and visibly pushdown models

Part of the book series: Texts in Computer Science (TCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook GBP 59.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book GBP 74.99
Price includes VAT (United Kingdom)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This classroom-tested and clearly-written textbook presents a focused guide to the conceptual foundations of compilation, explaining the fundamental principles and algorithms used for defining the syntax of languages, and for implementing simple translators.

This significantly updated and expanded third edition has been enhanced with additional coverage of regular expressions, visibly pushdown languages, bottom-up and top-down deterministic parsing algorithms, and new grammar models.

Topics and features: describes the principles and methods used in designing syntax-directed applications such as parsing and regular expression matching; covers translations, semantic functions (attribute grammars), and static program analysis by data flow equations; introduces an efficient method for string matching and parsing suitable for ambiguous regular expressions (NEW); presents a focus on extended BNF grammars with their general parser and with LR(1) and LL(1) parsers (NEW); introduces a parallel parsing algorithm that exploits multiple processing threads to speed up syntax analysis of large files; discusses recent formal models of input-driven automata and languages (NEW); includes extensive use of theoretical models of automata, transducers and formal grammars, and describes all algorithms in pseudocode; contains numerous illustrative examples, and supplies a large set of exercises with solutions at an associated website.

Advanced undergraduate and graduate students of computer science will find this reader-friendly textbook to be an invaluable guide to the essential concepts of syntax-directed compilation. The fundamental paradigms of language structures are elegantly explained in terms of the underlying theory, without requiring the use of software tools or knowledge of implementation, and through algorithms simple enough to be practiced by paper and pencil.

Similar content being viewed by others

Keywords

Table of contents (5 chapters)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Introduction

    • Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti
    Pages 1-4

  3. Syntax

    • Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti
    Pages 5-113

  4. Finite Automata as Regular Language Recognizers

    • Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti
    Pages 115-197

  5. Pushdown Automata and Parsing

    • Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti
    Pages 199-381

  6. Translation Semantics and Static Analysis

    • Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti
    Pages 383-486

  7. Back Matter

    Pages 487-499
    Download chapter PDF
Back to top

Authors and Affiliations

  • Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milan, Italy

    Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti

About the authors

The authors are Professors (Dr. Stefano Crespi Reghizzi is Emeritus Professor) of Computer Engineering at the Politecnico di Milano, Italy.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation