| 000 | 03619nam a22004935i 4500 | ||
|---|---|---|---|
| 001 | 978-1-4471-5514-0 | ||
| 003 | DE-He213 | ||
| 005 | 20200421112230.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 131016s2013 xxk| s |||| 0|eng d | ||
| 020 |
_a9781447155140 _9978-1-4471-5514-0 |
||
| 024 | 7 |
_a10.1007/978-1-4471-5514-0 _2doi |
|
| 050 | 4 | _aQA8.9-QA10.3 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aMAT018000 _2bisacsh |
|
| 072 | 7 |
_aCOM051010 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.131 _223 |
| 100 | 1 |
_aCrespi Reghizzi, Stefano. _eauthor. |
|
| 245 | 1 | 0 |
_aFormal Languages and Compilation _h[electronic resource] / _cby Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti. |
| 250 | _a2nd ed. 2013. | ||
| 264 | 1 |
_aLondon : _bSpringer London : _bImprint: Springer, _c2013. |
|
| 300 |
_aXII, 399 p. 171 illus., 1 illus. in color. _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-0941 |
|
| 505 | 0 | _aIntroduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis. | |
| 520 | _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. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aMathematical logic. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
| 700 | 1 |
_aBreveglieri, Luca. _eauthor. |
|
| 700 | 1 |
_aMorzenti, Angelo. _eauthor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9781447155133 |
| 830 | 0 |
_aTexts in Computer Science, _x1868-0941 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-1-4471-5514-0 |
| 912 | _aZDB-2-SCS | ||
| 942 | _cEBK | ||
| 999 |
_c57959 _d57959 |
||