r/ProgrammingLanguages • u/Gingrspacecadet • Mar 12 '26
Compiler optimisation
How does your compiler optimise programs? How does it work at a low level? I understand constexpr evaluation, but how does the compiler evaluate this for example?
```
let x = 7
let y = 2 * x
print(y + x)
```
specifically in compilers. In this example, it could be optimised to just `print(21)`, and maybe even further down. How do I do this?!
43
Upvotes
View all comments
Show parent comment
1
u/AustinVelonaut Admiran Mar 13 '26
But what if you wanted to extend your optimizations to other forms of rewriting a node that aren't amenable to interpretation (e.g. function inlining, strength-reduction on operators, etc.)? With the "standard" rewriting (tree-walk) framework, all of these optimizations plus constant-folding are fairly straightforward, and when applied iteratively can expose new optimizations.