LEADER 04088nam 22006255 450 001 9910437583203321 005 20200704030419.0 010 $a1-4471-5514-9 024 7 $a10.1007/978-1-4471-5514-0 035 $a(CKB)3710000000024268 035 $a(EBL)1538476 035 $a(SSID)ssj0001120911 035 $a(PQKBManifestationID)11711819 035 $a(PQKBTitleCode)TC0001120911 035 $a(PQKBWorkID)11170806 035 $a(PQKB)11297013 035 $a(DE-He213)978-1-4471-5514-0 035 $a(MiAaPQ)EBC6311299 035 $a(MiAaPQ)EBC1538476 035 $a(Au-PeEL)EBL1538476 035 $a(CaPaEBR)ebr10976346 035 $a(OCoLC)861969130 035 $a(PPN)17609704X 035 $a(EXLCZ)993710000000024268 100 $a20131016d2013 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aFormal Languages and Compilation$b[electronic resource] /$fby Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti 205 $a2nd ed. 2013. 210 1$aLondon :$cSpringer London :$cImprint: Springer,$d2013. 215 $a1 online resource (408 p.) 225 1 $aTexts in Computer Science,$x1868-0941 300 $aDescription based upon print version of record. 311 $a1-4471-5513-0 327 $aIntroduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis. 330 $aThis fully revised and expanded new edition elucidates the elegance and simplicity of the fundamental theory underlying Formal Languages and Compilation. Retaining the reader-friendly, minimalist style of the first edition, this uniquely versatile textbook describes the essential principles and methods used for defining the syntax of artificial languages, and for designing efficient parsing algorithms and syntax-directed translators with semantic attributes. A comprehensive selection of topics is presented within a rigorous, unified framework, illustrated by numerous practical examples. Features and topics: Presents a novel conceptual approach to parsing algorithms that applies to extended BNF grammars, together with a parallel parsing algorithm (NEW) Supplies supplementary teaching tools, including course slides and exercises with solutions, at an associated website Unifies the concepts and notations used in different approaches, enabling an extended coverage of methods with a reduced number of definitions Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars Describes all algorithms in pseudocode, so that detailed knowledge of a specific programming language is not necessary Makes extensive usage of theoretical models of automata, transducers and formal grammars Includes concise coverage of algorithms for processing regular expressions and finite automata Introduces static program analysis based on flow equations This clearly-written, classroom-tested textbook is an ideal guide to the fundamentals of this field for advanced undergraduate and graduate students in computer science and computer engineering. Some background in programming is required, and readers should also be familiar with basic set theory, algebra and logic. 410 0$aTexts in Computer Science,$x1868-0941 606 $aMathematical logic 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aMathematical logic. 615 14$aMathematical Logic and Formal Languages. 676 $a511.3 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 $a9910437583203321 996 $aFormal Languages and Compilation$92504029 997 $aUNINA