02878nam a22003975i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003500118050001600153072001600169072002300185072001500208100008800223245009100311250001800402264007500420300004600495336002600541337002600567338003600593347002400629490005700653505032400710520114401034650003502178650003202213710003402245773002602279776003602305776003602341830005702377856004602434978-3-031-46460-7DE-He21320251030110904.0cr nn 008mamaa231225s2024    sz |    s    |||| 0|eng d  a97830314646077 a10.1007/978-3-031-46460-72doi 4aQA76.76.C65 7aUMC2bicssc 7aCOM0100002bisacsh 7aUMC2thema1 aMogensen, Torben Ægidius.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut10aIntroduction to Compiler Designh[electronic resource] /cby Torben Ægidius Mogensen.  a3rd ed. 2024. 1aCham :bSpringer International Publishing :bImprint: Springer,c2024.  aXXII, 287 p. 139 illus.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aUndergraduate Topics in Computer Science,x2197-17810 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.  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. . 0aCompilers (Computer programs).14aCompilers and Interpreters.2 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303146459108iPrinted edition:z9783031464614 0aUndergraduate Topics in Computer Science,x2197-178140uhttps://doi.org/10.1007/978-3-031-46460-7