Why Do Peephole Optimizations Work?
Explains the principles behind peephole optimizations in compilers, focusing on correctness and refinement over simple equivalence.
Explains the principles behind peephole optimizations in compilers, focusing on correctness and refinement over simple equivalence.
Introduces llvm-reduce, a specialized tool for automatically reducing LLVM IR test cases to aid in debugging compiler failures.
Explores the nuanced behavior of 'undef' values in LLVM IR, detailing permissible and non-permissible compiler transformations.
Explains tail call optimization with examples and implementation details for interpreters and compilers.
Extending a Lisp compiler to generate LLVM IR instead of x86 assembly, covering IR basics, function definitions, and backend architecture.