Which Data-Flow Analysis problem propagates information in the forward direction along control flow edges?
Both Reaching Definitions (A) and Available Expressions (B) are Forward Data-Flow Analysis problems.
What is the Sethi-Ullman Algorithm used for during Code Generation?
The Sethi-Ullman algorithm labels expression tree nodes with minimum register counts needed for evaluation without memory spilling.
In compiler register allocation, what does 'Spilling' refer to?
Spilling moves low-priority or long-idle temporary variable values from registers out to activation frame memory addresses.
In Graph Coloring Register Allocation (Chaitin's Algorithm), what corresponds to the K available CPU registers?
Chaitin proved K-register allocation reduces to K-graph coloring: connected nodes represent interfering live ranges that must get different colors/registers.
In dynamic memory management, what is a 'Dangling Pointer'?
Dangling pointers point to freed dynamic heap addresses or popped activation stack frames.