Post #2639687
2025-05-15 14:56 UTC
@viduq@mstdn.social It's not exactly brute force, but it does involve some heavy lifting in the optimizer. Tail recursion elimination turns the recursive calls into a loop. Then, induction variables of the loop are detected, and finally strength reduction, algebraic simplification finish it off.
Replies (4)
-
@brahms@chaos.social 2025-05-15 15:00
@ela@infosec.exchange @viduq@mstdn.social compiler design is so beautiful ♥️
-
@Ehay2k@mastodon.social 2025-05-16 04:39
@ela@infosec.exchange @viduq@mstdn.social Uh, I need Alt text to help me understand this. 😢
-
@Elmar_Iachi@chaos.social 2025-05-16 05:28
@ela@infosec.exchange @viduq@mstdn.social Black magic, but as a beauty.
-
@kccqzy@techhub.social 2025-05-16 21:01
@ela@infosec.exchange @viduq@mstdn.social It's not a tail recursion. There's a boolean not after the recursive call. That makes the feat even more amazing.