GUEST-plan: claim step 5 — ast.sx

Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>

plans/lib-guest.md

@@ -156,7 +156,7 @@ Extract from `haskell/infer.sx`. Algorithm W or J, generalisation, instantiation
 | 2 — prefix.sx (common-lisp + lua) | [partial — pending lua] | 2ef773a3 | common-lisp/runtime.sx ported (47 aliases collapsed into 13 prefix-rename calls); 518/518 vs 309/309 baseline (improvement, no regression). lua/runtime.sx has no pure same-name aliases — every lua- definition wraps custom logic; second consumer pending. |
 | 3 — lex.sx (lua + tcl) | [done] | 559b0df9 | lex.sx exports nil-safe char-class predicates + token record. lua/tokenizer.sx (7 preds) and tcl/tokenizer.sx (5 preds) collapsed into prefix-rename calls. lua 185/185, tcl 342/342, tcl-conf 3/4 — all = baseline. |
 | 4 — pratt.sx (lua + prolog) | [done] | da27958d | Extracted operator-table format + lookup only — climbing loops stay per-language because lua and prolog use opposite prec conventions. lua/parser.sx: 18-clause cond → 15-entry table. prolog/parser.sx: pl-op-find deleted, pl-op-lookup wraps pratt-op-lookup. lua 185/185, prolog 590/590 — both = baseline. |
-| 5 — ast.sx (lua + prolog) | [ ] | — | — |
+| 5 — ast.sx (lua + prolog) | [in-progress] | — | — |
 | 6 — match.sx (haskell + prolog) | [ ] | — | — |
 | 7 — layout.sx (haskell + synthetic) | [ ] | — | — |
 | 8 — hm.sx (haskell + TBD) | [ ] | — | — |