Formal languages and compilation

DOI10.1007/978-1-4471-5514-0zbMath1298.68005OpenAlexW4292234239MaRDI QIDQ5891327

Angelo Morzenti, Luca Breveglieri, Stefano Crespi Reghizzi

Publication date: 5 December 2013

Published in: Texts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4471-5514-0

zbMATH Keywords

lexical analysiscontext-free languageregular languageprogramming languageformal languageattribute grammarcompiler constructionsyntactic analysis

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (5)

Beyond operator-precedence grammars and languages ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Operator precedence temporal logic and model checking ⋮ Fast deterministic parsers for transition networks ⋮ A deterministic parsing algorithm for ambiguous regular expressions

This page was built for publication: Formal languages and compilation