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
- lecture11web.stanford.edu
- lecture12web.stanford.edu
- lecture13web.stanford.edu
- lecture01web.stanford.edu
- lecture02web.stanford.edu
- lecture09web.stanford.edu
- A friendly introduction to machine learning compilers and optimizershuyenchip.com
- A Gentle Introduction to LLVM IR · mcyoungmcyoung.xyz
- Compilers - What Every Programmer Should Know About Compiler Optimizations | Microsoft Learnlearn.microsoft.com
- Compiler Optimizations Are Hard Because They Forget - Faultlorefaultlore.com
- Understanding static single assignment formsblog.yossarian.net
- Competitive Programmer's Handbookcses.fi