Compiler Theory

1. Compiler

ID: 439686d0-5275-4e0d-8eab-b6fd87d7a547
CREATED: <2025-03-03 Mon 20:56>

[2025-03-03 Mon 20:56] – Compiler - Wikipedia

1.1. Optimizing Compiler

ID: 3638f1d2-ebc8-4bbb-9242-4e6070a3b121
CREATED: <2025-03-03 Mon 20:56>

[2025-03-03 Mon 20:56] – Optimizing compiler - Wikipedia

1.2. IR

ID: 9e3802e1-6e58-4a5a-9a30-509e25122d31
CREATED: <2025-03-03 Mon 20:57>

[2025-03-03 Mon 20:57] – Intermediate representation - Wikipedia

Intermediate Representationa

2. Tree Shaking

ID: 23185c5d-7470-4bf5-a700-99752c334333
CREATED: <2025-01-26 Sun 00:55>

[2025-01-26 Sun 00:56] – Tree shaking - Wikipedia [2025-03-03 Mon 17:57] << Tree Shaker

A dead-code-elimination technique applied when optimizing code.

3. Polyhedral Model

ID: bbc6fa80-3c38-4efa-93fd-b0416d4ec16d
CREATED: <2025-05-08 Thu 21:13>
AKA: Polytope Model

[2025-05-08 Thu 21:13] – wiki

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.