code wiki / _hdl_build / nx_regex_unified_gate.nx
nx_regex_unified_gate.nx
buildroot/runtime/_hdl_build/nx_regex_unified_gate.nx
about
nx_regex_unified_gate.nx -- GATE: the UNIFIED linear-time regex engine (nx_regex_vm_lib) is a STRICT SUPERSET of
BOTH old engines and drives grep. Proves: (T1) every atom-NFA feature works (literal/./*+?/[]ranges/^/$ anchors);
(T2) PLUS alternation | and groups () that the atom-NFA could NOT do; (T3) the UNIFICATION payoff -- anchors COMBINED
with alternation/groups (^(cat|dog)$), which NEITHER old engine could express; (T4) ReDoS-immune (linear on the
classic blowup); (T5) grep runs on it -- ReDoS-immune, full-regex line grep (beats backtracking grep/PCRE); (T6)
malformed pattern fails-loud. This consolidates two engines into one SOTA engine. expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_regex_vm_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
| none |
functions
| 10 | func g_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 11 | func g_pn(v: i64) -> i64 { let b: *u8=sys_mmap(28); var x: i64=v; if x<0{b[0]=45;sys_write(1,b,1);x=0-x} if x==0{b[0]=48;sys_write(1,b,1);return 0} var d: i64=0; var y: i64=x; while y>0{d=d+1;y=y/10} var i: i64=d-1; y=x; while i>=0{b[i]=(48+(y%10)) as u8;y=y/10;i=i-1} sys_write(1,b,d); return 0 } |
| 12 | func ck(name: *u8, c: i64) -> i64 { if c==1 { g_puts(" PASS " as *u8) } else { g_puts(" FAIL " as *u8) } g_puts(name); g_puts("\n" as *u8); return c } |
| 13 | func m(pat: *u8, text: *u8, n: i64) -> i64 { return re_vm_run(pat, text, n) } |
| 15 | func main() -> i64 |