nx_eoe_branch.nx

nx_eoe_branch.nx -- EMITTER-OF-EMITTERS, GENERALITY RUNG 3: BRANCHES-from-spec. The ladder so far: nx_eoe (006e) synthesizes control-flow DEPTH (N unconditional nested loops); nx_eoe_oplist (006g) synthesizes a LINEAR COMPUTATION (op-list, no branching). Neither can take a DIFFERENT PATH based on data. This rung synthesizes a CONDITIONAL: an if/else whose PREDICATE comes from the spec, so the emitted program takes a DIFFERENT BRANCH for different inputs -- real data-driven control-flow divergence, which a linear op-list and an unconditional loop nest provably cannot produce. nx_eoe_branch <basename> <start> <pred> <then-op> <else-op> pred = g<t> | l<t> | e<t> (acc > t | acc < t | acc == t) then-op = a<n> | m<n> | s<n> (applied iff pred true) else-op = a<n> | m<n> | s<n> (applied iff pred false) -> writes runtime/_hdl_build/<basename>.nx whose main() sets acc=start, applies then-op OR else-op per the predicate, and prints "RESULT=<acc>\n". nx_cc compiles it (the if/else MACHINE CODE is delegated to the compiler the team owns -- the emitter only synthesizes the STRUCTURE from data). no-false-green plan (X-AUT-006d): same ops but a START that flips the predicate -> the OTHER branch runs -> a DIFFERENT correct result (proves the branch is really evaluated, not constant-folded to one side); tamper the threshold -> flips. Sovereign, no gcc/.sh. HONEST SCOPE: a single 2-way branch over one comparison; NOT yet nested/op-list branches or loops-with-conditions -- ONE rung. license_tier: ORIGINAL