Borrow it
Coverart for item
The Resource Formal languages and compilation, Stefano Crespi Reghizzi

Formal languages and compilation, Stefano Crespi Reghizzi

Creator
Summary
Whereas many textbooks on formal languages and compilation focus on technological aspects, it is the elegance and simplicity of the underlying *theory* that allows students to acquire the fundamental paradigms of language structures, to avoid pitfalls such as ambiguity, and to adequately map structure to meaning. Formal Languages and Compilation covers the fundamental concepts of formal languages and compilation, which are central to computer science and based on well-consolidated principles. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications. In a clear, reader-friendly and simple minimalist way, this uniquely versatile textbook provides the essential principles and methods used for defining the syntax of artificial languages and implementing simple translators, as well as for designing syntax-directed translators. Readers require some background in programming, although detailed knowledge of a specific programming language is not necessary; they should also be somewhat familiar with basic set theory, algebra and logic. Features and topics: {u2022} Provides many pedagogical tools, such as slides and solutions for lecturers via the author's website {u2022} Unifies the concepts and notations used in the various approaches of parsing algorithms {u2022} Concepts are illustrated with many realistic examples, to ease the understanding of the theory and the transfer to applications {u2022} Theoretical models of automata, transducers and formal grammars are used extensively {u2022} Algorithms are described in a pseudocode to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures {u2022} Coverage of the algorithms for processing regular expressions and finite automata is concise and complete {u2022} Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars {u2022} Unifies the concepts and notations used in different approaches, thus extending methods coverage with a reduced definitional apparatus {u2022} Introduces static program analysis, moving from the baseline reached with finite automata and local languages This comprehensive and clearly written text, based on many years of course instruction, will be welcomed as the ideal guide to the fundamentals of this field by advanced undergraduate and graduate students in computer science and computer engineering. Stefano Crespi Reghizzi is a full professor of computer science at the Politecnico di Milano, Milan, Italy, where he has numerous years of experience teaching formal languages and compiler technology. In addition, he leads the department's compiler research group. [Barcode] ISBN 978-1-84882-049-4 [URL] springer.com
Language
eng
Work
Publication
Extent
1 online resource (xii, 364 pages)
Contents
  • Introduction
  • Syntax
  • Finite Automata and Recognition of Regular Languages
  • Phrases Recognition and Parsing
  • Translation, Semantic, and Static Analysis
  • Appendix: Case Studies
  • Index
Isbn
9781848820500
Instance
Label
Formal languages and compilation
Title
Formal languages and compilation
Statement of responsibility
Stefano Crespi Reghizzi
Creator
Subject
Language
eng
Summary
Whereas many textbooks on formal languages and compilation focus on technological aspects, it is the elegance and simplicity of the underlying *theory* that allows students to acquire the fundamental paradigms of language structures, to avoid pitfalls such as ambiguity, and to adequately map structure to meaning. Formal Languages and Compilation covers the fundamental concepts of formal languages and compilation, which are central to computer science and based on well-consolidated principles. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications. In a clear, reader-friendly and simple minimalist way, this uniquely versatile textbook provides the essential principles and methods used for defining the syntax of artificial languages and implementing simple translators, as well as for designing syntax-directed translators. Readers require some background in programming, although detailed knowledge of a specific programming language is not necessary; they should also be somewhat familiar with basic set theory, algebra and logic. Features and topics: {u2022} Provides many pedagogical tools, such as slides and solutions for lecturers via the author's website {u2022} Unifies the concepts and notations used in the various approaches of parsing algorithms {u2022} Concepts are illustrated with many realistic examples, to ease the understanding of the theory and the transfer to applications {u2022} Theoretical models of automata, transducers and formal grammars are used extensively {u2022} Algorithms are described in a pseudocode to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures {u2022} Coverage of the algorithms for processing regular expressions and finite automata is concise and complete {u2022} Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars {u2022} Unifies the concepts and notations used in different approaches, thus extending methods coverage with a reduced definitional apparatus {u2022} Introduces static program analysis, moving from the baseline reached with finite automata and local languages This comprehensive and clearly written text, based on many years of course instruction, will be welcomed as the ideal guide to the fundamentals of this field by advanced undergraduate and graduate students in computer science and computer engineering. Stefano Crespi Reghizzi is a full professor of computer science at the Politecnico di Milano, Milan, Italy, where he has numerous years of experience teaching formal languages and compiler technology. In addition, he leads the department's compiler research group. [Barcode] ISBN 978-1-84882-049-4 [URL] springer.com
Member of
Cataloging source
GW5XE
http://library.link/vocab/creatorName
Crespi-Reghizzi, Stefano
Dewey number
005.453015113
Illustrations
illustrations
Index
index present
Language note
English
LC call number
QA267.3
LC item number
.C74 2009
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
Series statement
Texts in computer science
http://library.link/vocab/subjectName
  • Formal languages
  • Compiling (Electronic computers)
  • COMPUTERS
  • Compiling (Electronic computers)
  • Formal languages
  • Informatique
  • Compiling (Electronic computers)
  • Formal languages
Label
Formal languages and compilation, Stefano Crespi Reghizzi
Instantiates
Publication
Bibliography note
Includes bibliographical references (pages 353-355) and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Introduction -- Syntax -- Finite Automata and Recognition of Regular Languages -- Phrases Recognition and Parsing -- Translation, Semantic, and Static Analysis -- Appendix: Case Studies -- Index
Control code
405546148
Dimensions
unknown
Extent
1 online resource (xii, 364 pages)
Form of item
online
Isbn
9781848820500
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 10.1007/978-1-84882-050-0
  • 10.1007/978-1-84882-
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-1-84882-049-4
Publisher number
12200801
Specific material designation
remote
System control number
(OCoLC)405546148
Label
Formal languages and compilation, Stefano Crespi Reghizzi
Publication
Bibliography note
Includes bibliographical references (pages 353-355) and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Introduction -- Syntax -- Finite Automata and Recognition of Regular Languages -- Phrases Recognition and Parsing -- Translation, Semantic, and Static Analysis -- Appendix: Case Studies -- Index
Control code
405546148
Dimensions
unknown
Extent
1 online resource (xii, 364 pages)
Form of item
online
Isbn
9781848820500
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 10.1007/978-1-84882-050-0
  • 10.1007/978-1-84882-
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-1-84882-049-4
Publisher number
12200801
Specific material designation
remote
System control number
(OCoLC)405546148

Subject

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...