nx_comparewatch_census_gate.nx
buildroot/runtime/nx_comparewatch_census_gate.nx
about
nx_comparewatch_census_gate.nx -- proves the /compare watch-plane census parsers (2026-08-29).
Composes nx_comparewatch_lib IN-PROCESS on fixtures CONSTRUCTED AT RUNTIME (tab bytes written as 9,
never embedded in source literals -- the lexer hazard, and also so no source scanner ever finds a
fixture row pretending to be data). No filesystem, no seg-store, no fork: every rule is decidable.
THE LOAD-BEARING TOOTH is the production trap this whole organ exists for: a LANDED row whose LABEL
carries the literal token "OPEN:" (measured live: legalpractice_of_import). A substring ruler counts
that row OPEN; the positional ruler must not. The fixture ASSERTS it contains the trap token before
asserting the verdict, so a fixture that drifted could never pass vacuously.
license_tier: ORIGINAL No hw writes (Rule 26). expect_exit: 0
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_gate_verdict.nxnx_comparewatch_lib.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| 15 | const CWG_BUF: i64 = 1024 |
| 16 | const CWG_TAB: i64 = 9 |
functions
| 18 | func cwg_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } called by 1: cwg_contains |
| 19 | func cwg_cat(b: *u8, o: i64, s: *u8) -> i64 { var i: i64 = 0; var p: i64 = o; while s[i] != (0 as u8) { b[p] = s[i]; p = p + 1; i = i + 1 } return p } |
| 20 | func cwg_tab(b: *u8, o: i64) -> i64 { b[o] = CWG_TAB as u8; return o + 1 } called by 1: cwg_row |
| 22 | func cwg_row(b: *u8, id: *u8, dom: *u8, label: *u8, org: *u8, sym: *u8, status: *u8) -> i64 |
| 31 | func cwg_contains(b: *u8, n: i64, needle: *u8) -> i64 |
| 46 | func main(argc: i64, argv: *i64) -> i64 |