000 | 04131nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-3-030-04879-2 | ||
003 | DE-He213 | ||
005 | 20240423130106.0 | ||
007 | cr nn 008mamaa | ||
008 | 190418s2019 sz | s |||| 0|eng d | ||
020 |
_a9783030048792 _9978-3-030-04879-2 |
||
024 | 7 |
_a10.1007/978-3-030-04879-2 _2doi |
|
050 | 4 | _aQA267-268.5 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a005.131 _223 |
100 | 1 |
_aCrespi Reghizzi, Stefano. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aFormal Languages and Compilation _h[electronic resource] / _cby Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti. |
250 | _a3rd ed. 2019. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2019. |
|
300 |
_aXIII, 499 p. 486 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTexts in Computer Science, _x1868-095X |
|
505 | 0 | _aIntroduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis. | |
520 | _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 algorithmssimple 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. | ||
650 | 0 | _aMachine theory. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 1 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aCompilers and Interpreters. |
700 | 1 |
_aBreveglieri, Luca. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
700 | 1 |
_aMorzenti, Angelo. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030048785 |
776 | 0 | 8 |
_iPrinted edition: _z9783030048808 |
830 | 0 |
_aTexts in Computer Science, _x1868-095X |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-04879-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
942 | _cSPRINGER | ||
999 |
_c184960 _d184960 |