| 000 | 03177nam a22004815i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-46460-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240730170844.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 231225s2024 sz | s |||| 0|eng d | ||
| 020 |
_a9783031464607 _9978-3-031-46460-7 |
||
| 024 | 7 |
_a10.1007/978-3-031-46460-7 _2doi |
|
| 050 | 4 | _aQA76.76.C65 | |
| 072 | 7 |
_aUMC _2bicssc |
|
| 072 | 7 |
_aCOM010000 _2bisacsh |
|
| 072 | 7 |
_aUMC _2thema |
|
| 082 | 0 | 4 |
_a005.45 _223 |
| 100 | 1 |
_aMogensen, Torben Ægidius. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _995804 |
|
| 245 | 1 | 0 |
_aIntroduction to Compiler Design _h[electronic resource] / _cby Torben Ægidius Mogensen. |
| 250 | _a3rd ed. 2024. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2024. |
|
| 300 |
_aXXII, 287 p. 139 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aUndergraduate Topics in Computer Science, _x2197-1781 |
|
| 505 | 0 | _aLexical analysis -- Syntax analysis.-Scopes and symbol tables -- Interpretation -- Type checking.-Intermediate-code generation -- Machine-code generation -- Register allocation -- Functions -- Data-flow analysis and optimisation -- Optimisation for loops -- More language features -- Set notation and concepts -- Index. | |
| 520 | _aThe third edition of this textbook has been fully revised and adds material about the SSA form, polymorphism, garbage collection, and pattern matching. It presents techniques for making realistic compilers for simple to intermediate-complexity programming languages. The techniques presented in the book are close to those used in professional compilers, albeit in places slightly simplified for presentation purposes. "Further reading" sections point to material about the full versions of the techniques. All phases required for translating a high-level language to symbolic machine language are covered, and some techniques for optimising code are presented. Type checking and interpretation are also included. Aiming to be neutral with respect to implementation languages, algorithms are mostly presented in pseudo code rather than in any specific language, but suggestions are in many places given for how these can be realised in different language paradigms. Depending on how much of the material from the book is used, it is suitable for both undergraduate and graduate courses for introducing compiler design and implementation. . | ||
| 650 | 0 |
_aCompilers (Computer programs). _93350 |
|
| 650 | 1 | 4 |
_aCompilers and Interpreters. _931853 |
| 710 | 2 |
_aSpringerLink (Online service) _995807 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031464591 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031464614 |
| 830 | 0 |
_aUndergraduate Topics in Computer Science, _x2197-1781 _995808 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-46460-7 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 942 | _cEBK | ||
| 999 |
_c87224 _d87224 |
||