LEADER 04263nam 22005535 450 001 9910337561203321 005 20200702114552.0 010 $a3-030-04879-9 024 7 $a10.1007/978-3-030-04879-2 035 $a(CKB)4100000007992486 035 $a(DE-He213)978-3-030-04879-2 035 $a(MiAaPQ)EBC5921869 035 $a(PPN)235669024 035 $a(EXLCZ)994100000007992486 100 $a20190418d2019 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFormal Languages and Compilation /$fby Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti 205 $a3rd ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (XIII, 499 p. 486 illus.) 225 1 $aTexts in Computer Science,$x1868-0941 311 $a3-030-04878-0 327 $aIntroduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis. 330 $aThis 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. The authors are Professors (Dr. Stefano Crespi Reghizzi is Emeritus Professor) of Computer Engineering at the Politecnico di Milano, Italy. 410 0$aTexts in Computer Science,$x1868-0941 606 $aMathematical logic 606 $aProgramming languages (Electronic computers) 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 615 0$aMathematical logic. 615 0$aProgramming languages (Electronic computers). 615 14$aMathematical Logic and Formal Languages. 615 24$aProgramming Languages, Compilers, Interpreters. 676 $a511.3 676 $a005.131 700 $aCrespi Reghizzi$b Stefano$4aut$4http://id.loc.gov/vocabulary/relators/aut$051848 702 $aBreveglieri$b Luca$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aMorzenti$b Angelo$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910337561203321 996 $aFormal Languages and Compilation$92504029 997 $aUNINA