Skip to content

Latest commit

 

History

History
9 lines (6 loc) · 866 Bytes

File metadata and controls

9 lines (6 loc) · 866 Bytes

Instruction Selection Presentation

Engineering a Compiler - Instruction Selection Presentation in Greek.

The compiler’s front end and optimizer both operate on the code in its ir form. Before the code can execute on a target processor, the ir form of the code must be rewritten into the processor’s instruction set. The process of mapping ir operations into target machine operations is called instruction selection.

This chapter (11) introduces two different approaches to instruction selection. The first uses the technology of tree-pattern matching algorithms. The second builds on the classic late-stage transformation, peephole optimization. Both have found widespread use in real compilers.

Keywords: Instruction Selection, Tree-Pattern Matching, Peephole Optimization From book: https://www.amazon.com/Engineering-Compiler-Keith-Cooper/dp/012088478X