lecture14
web.stanford.edu · 2,250 words · saved by 1 readers
N/A
Intermediate Code & Local Optimizations CS143 Lecture 14 Instructor: Fredrik Kjolstad Slide design by Prof. Alex Aiken, with modifications 1 Lecture Outline • Intermediate code • Local optimizations • Next time: global optimizations 2 Code Generation Summary • We have discussed – Runtime organization – Simple stack machine code generation – Improvements to stack machine code generation • Our compiler maps AST to…
related reading
- Code generation (compiler) - Wikipediaen.wikipedia.org
- A Gentle Introduction to LLVM IR · mcyoungmcyoung.xyz
- Compilers - What Every Programmer Should Know About Compiler Optimizations | Microsoft Learnlearn.microsoft.com
- [1912.05036] RVSDG: An Intermediate Representation for Optimizing Compilersarxiv.org
- Understanding static single assignment formsblog.yossarian.net
- Building a Performant Compiler from Scratch — Bowen Chengbowencheng.dev
- Compiler Optimizations Are Hard Because They Forget - Faultlorefaultlore.com
- Many can write faster asm than the compiler, yet don't. Why? — LessWronglesswrong.com
- A Gentle Introduction to LLVM IR · mcyoungmcyoung.xyz
- A Map of the Territory · Crafting Interpreterscraftinginterpreters.com
- how I think when I think about programming - alice mazalicemaz.com
- A Map of the Territory · Crafting Interpreterscraftinginterpreters.com