LC

Implement Static Single Assignment (SSA) Form

hard3/8

Translate an AST into Your IR Build a Control Flow Graph (CFG) from Your IR

Language

Compiler

2.0s Limit 256MB

Implementation

Implement SSA form construction and PHI node placement.

Requirements:

Convert three-address code to SSA form
Insert PHI nodes at control flow merge points
Rename variables to ensure single assignment
Handle loops with dominance frontiers
Implement SSA construction algorithm
Test with if/else and loop constructs
Print SSA form with PHI nodes

Why This Matters

SSA form is the single most important IR idea of the last 30 years: LLVM, GCC, V8's TurboFan, HotSpot's C2, and Go's compiler all optimize in SSA. Making each variable assigned exactly once turns hard dataflow questions into simple def-use lookups, which is why constant propagation and dead code elimination become almost trivial after this task.

Hints

0 / 3 revealed

Validation Suite

main.c

Workspace 1.0