Skip to content(if available)orjump to list(if available)

Using obscure graph theory to solve programming languages problems

Using obscure graph theory to solve programming languages problems

3 comments

·May 13, 2025
Visit

tekknolagi

This seems, at least upon first read, analogous to global value numbering (GVN). Or, depending on how you look at it, common subexpression elimination (CSE). I am mostly wondering why they are not mentioned in the article.

j2kun

I came here to mention this as well. If this problem was so critical to the company the author was working at, it seems negligent to spend a _year_ reinventing a solved problem from scratch, especially given the author's apparent history of compiler experience.

georgewsinger

If you like reasoning about a program in terms of expression trees/graphs, I recently discovered that Wolfram Language has built-ins for this:

https://reference.wolfram.com/language/ref/ExpressionTree.ht...