Compiler Theory
1. Compiler
properties
ID: 439686d0-5275-4e0d-8eab-b6fd87d7a547CREATED: <2025-03-03 Mon 20:56>
1.1. Optimizing Compiler
properties
ID: 3638f1d2-ebc8-4bbb-9242-4e6070a3b121CREATED: <2025-03-03 Mon 20:56>
1.2. IR
properties
ID: 9e3802e1-6e58-4a5a-9a30-509e25122d31CREATED: <2025-03-03 Mon 20:57>
Intermediate Representationa
2. Tree Shaking
properties
ID: 23185c5d-7470-4bf5-a700-99752c334333CREATED: <2025-01-26 Sun 00:55>
A dead-code-elimination technique applied when optimizing code.
3. Polyhedral Model
properties
ID: bbc6fa80-3c38-4efa-93fd-b0416d4ec16dCREATED: <2025-05-08 Thu 21:13>
AKA: Polytope Model
The polyhedral method treats each loop iteration within nested loops as lattice points inside mathematical objects called polyhedra, performs affine transformations or more general non-affine transformations such as tiling on the polytopes, and then converts the transformed polytopes into equivalent, but optimized (depending on targeted optimization goal), loop nests through polyhedra scanning.