Cantitate/Preț
Produs

Formal Languages and Compilation: Texts in Computer Science

Autor Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti
en Limba Engleză Hardback – 6 mai 2019
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 46674 lei  43-57 zile
  SPRINGER LONDON – 23 aug 2016 46674 lei  43-57 zile
Hardback (1) 58853 lei  43-57 zile
  Springer International Publishing – 6 mai 2019 58853 lei  43-57 zile

Din seria Texts in Computer Science

Preț: 58853 lei

Preț vechi: 73566 lei
-20% Nou

Puncte Express: 883

Preț estimativ în valută:
11264 11740$ 9377£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030048785
ISBN-10: 3030048780
Pagini: 510
Ilustrații: XIII, 499 p. 486 illus.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.89 kg
Ediția:3rd ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seria Texts in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Introduction.- Syntax.- Finite Automata as Regular Language Recognizers.- Pushdown Automata and Parsing.- Translation Semantics and Static Analysis.

Notă biografică

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


Textul de pe ultima copertă

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 algorithmssimple enough to be practiced by paper and pencil.
The authors are Professors (Dr. Stefano Crespi Reghizzi is Emeritus Professor) of Computer Engineering at the Politecnico di Milano, Italy.


Caracteristici

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

Recenzii

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)