Tag
control-flow
- Feb 6, 2026 The Dangling Else and How Grammars Resolve Ambiguity Why an if-statement grammar is ambiguous, how shift-reduce parsers settle the conflict by default, and what brace-less and indentation-based designs cost instead. programming languages
- Sep 6, 2025 Definite Assignment as a Flow-Sensitive Dataflow Problem How a checker proves every variable is written before it is read, why the answer depends on control flow rather than scope, and how the lattice and transfer functions are chosen. compilers
- Aug 9, 2025 Extract Function and the Preconditions the Compiler Checks Extraction is presented as a mechanical edit, but it is only safe when the extracted body captures no free variables, no control flow, and no implicit receiver. software engineering
- Aug 8, 2025 Divergence and the Reconvergence Stack How a warp executes both sides of a branch when its lanes disagree, what the per-warp mask stack records, and why reconvergence is not always where the source suggests. gpu computing
- Nov 14, 2024 Short-Circuit Evaluation as a Language Guarantee How && and || guarantee operand order, why that guarantee is a control-flow construct rather than an optimisation, and what nullable and optional chaining borrow from it. programming languages
- Jul 23, 2024 Divergence Amplification in Nested Control Flow Why nesting multiplies serialized path count rather than adding to it, how the mask stack depth bounds what the hardware can track, and which rearrangements collapse the product. gpu computing
- Jun 28, 2024 Predication and Branch Selection When a compiler converts a conditional into predicated instructions or a select, and the cost comparison that decides whether branching or straight-line code is cheaper for a warp. gpu computing