code wiki / _hdl_build / nx_js_octane_earley.nx
nx_js_octane_earley.nx
buildroot/runtime/_hdl_build/nx_js_octane_earley.nx
about
nx_js_octane_earley.nx -- run the REAL Octane EarleyBoyer benchmark (unmodified scheme2js source, harness
stubbed) on our sovereign VM/JIT. Self-validates: RunBenchmark throws on wrong rewrite count, so a clean
"EARLEY_BOYER_OK" return means the Earley parser + Boyer theorem-prover both produced correct results.
This is THE GC-stress benchmark (deep closures + cons-list allocation) -- proves the default-on GC on real
heavy-allocation code. PARSE-first to split syntax gaps from runtime gaps. expect_exit: 0 license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_js_vm.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
| 7 | const K_MAGIC_524288: i64 = 524288 |
functions
| 8 | func ow(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } called by 1: main |
| 9 | func on(v: i64) -> i64 { if v==0 { sys_write(1,"0" as *u8,1); return 0 } var m: i64=v; if m<0 { sys_write(1,"-" as *u8,1); m=0-m } let t: *u8=sys_mmap(24); var k: i64=0; while m>0 { t[k]=(48+(m%10)) as u8; m=m/10; k=k+1 } let o: *u8=sys_mmap(24); var q: i64=k-1; var x: i64=0; while q>=0 { o[x]=t[q]; x=x+1; q=q-1 } sys_write(1,o,x); return 0 } called by 1: main |
| 10 | func main(argc: i64, argv: *i64) -> i64 |