Recent submissions

Comment · 10 months ago
nope, not mine
Comment · 1 year ago
A full rewrite to the computer graphics course.
Comment · 1 year ago
Comment · 1 year ago
I removed it, no need to offend people with racial slur, especially when it is not intended.
Comment · 1 year ago
Hum. Did not anticipate that, thank you for pointing out.
Comment · 1 year ago
Thank you!
Comment · 1 year ago
Thank you for the reference, I'll check it.

Why not fully maximal SSA + DCE? I mean, other than timings consideration. Fully maximal does not even need any graph traversal, it is entirely local to each block.

Comment · 1 year ago
I'd argue that Lengauer-Tarjan is overrated. While it is neat, it's premature optimization IMHO. Fully maximal SSA (at the entry of each block insert a phi-node for each variable) + dead code elimination (we need it anyways) is much simpler.
Comment · 1 year ago
The "week-end" part refers to the fact that I wrote it in one week-end with little to no experience in compiler design. You can check the commit history, 12 to 14 Jan, 2024 :)
Comment · 1 year ago
Have you ever wondered how a compiler works, but you never found courage to find out? Then this series of articles is for you.

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton