The pseudocode found around Wikipedia is a very interesting programming language to study. Very much in the Niklaus Wirth style, but untyped, and comfortable both with mathematical symbols in Unicode and with English prose to express logic. Example:https://en.wikipedia.org/wiki/Static_single_assignment_form …
The unfortunate thing about SSA is it is a pre-obfuscated concept, so all explanations tend to be kind of terrible. The standard conception needs to be switched to a thing without phi functions, which are silly.
-
-
I read phi as “this value may come from any of these source computations”. I coopted flow graph dominators for reasoning about multiple unifications in a functional logic setting. Here the phis denote places where failure or contradiction can occur. Definitely sane there.
-
Some newer IRs like Swift’s and MLIR use block arguments as an alternative to phi nodes. Theoretically they’re equivalent, but block arguments are less weird.
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.