static single assignment form

Imagine taking notes where you are never allowed to cross out and rewrite a value — if a quantity changes, you must give it a fresh name. So instead of 'x = 5 ... later x = 9', you write 'x1 = 5 ... x2 = 9'. It looks pedantic, but it makes one thing trivial: any name you see was set in exactly one place. Static single assignment form is an IR that follows precisely this rule.

In SSA, every variable is assigned exactly once, statically — that is, there is only one instruction in the whole function that defines a given name. When the original program reassigns a variable, the compiler renames it: x becomes x1, then x2, then x3 at each new assignment. The 'static' matters: a definition inside a loop still has one textual definition site even though it runs many times. This gives every use of a value an unambiguous, single source. The one wrinkle is control flow: when two different paths each defined a version of x and then merge, which version is in scope? SSA answers that with a special phi node that picks the right incoming version based on which path was taken.

It matters because single-assignment form makes dataflow analysis dramatically simpler. To ask 'what produced this value?' the compiler follows one link, not a search through every prior assignment; this makes constant propagation, dead-code elimination, and common-subexpression elimination cleaner and faster. SSA is the backbone IR of LLVM and most modern optimizers. A caveat: SSA is an internal form, not a feature of any source language — it is constructed by the compiler and torn back down (out of SSA) before register allocation, since real registers do get reassigned.