Verification — bi-03-html-parsing

A module is complete when these pass against measured or observed output, not when the prose has been read.

  • Predictions written before observation, and scored
  • Spec sentences quoted per case
  • Implementation located; the working search queries recorded
  • Three kinds of test located (unit, web test, WPT)
  • foster.js passes cases A, B, D
  • Three analytical breakages reasoned through, first-failing test named
  • Eight gate questions answered
  • Complexity notebook entry #1 written
  • mini-browser M2–M3 complete: tokenizer/tree-builder coupling implemented

Gate (§44) — for every source-reading exercise in this module

  • Why does this code exist?
  • What invariant does it maintain?
  • Who calls it?
  • What does it call?
  • Which process and thread executes it?
  • What happens if it is removed?
  • How is it tested?
  • What simpler design would fail, and why?

Record