rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Formal Languages and Compilation
  name:
    name part: Crespi Reghizzi, Stefano.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: xxk
    date issued: 2009
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 368 p. 100 illus. online resource.
  abstract: 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: • Provides many pedagogical tools, such as slides and solutions for lecturers via the author’s website • Unifies the concepts and notations used in the various approaches of parsing algorithms • Concepts are illustrated with many realistic examples, to ease the understanding of the theory and the transfer to applications • Theoretical models of automata, transducers and formal grammars are used extensively • Algorithms are described in a pseudocode to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures • Coverage of the algorithms for processing regular expressions and finite automata is concise and complete • Systematically discusses ambiguous forms, allowing readers to avoid pit…
  table of contents: Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Top-down Parsing -- Bottom-Up and General Parsing -- Translation Semantics and Static Analysis.
  note: by Stefano Crespi Reghizzi.
  subject:
    topic: Computer science
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer Science
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Mathematical Logic and Formal Languages
  classification: QA76.9.L63
  classification: QA76.5913
  classification: QA76.63
  classification: 005.1015113
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Texts in Computer Science
  identifier: 9781848820500
  identifier: http://dx.doi.org/10.1007/978-1-84882-050-0
  record info:
    record creation date: 100301
    record change date: 20151204154637.0
    record identifier: 978-1-84882-050-0