Repository navigation

Rewrite determinization as a Laurikari TDFA for correct capture semantics - #204

Merged

hhugo merged 10 commits into

ocaml-community:masterfrom

hhugo:pr4-tdfa-rewrite

Sep 28, 2026

Merged

Rewrite determinization as a Laurikari TDFA for correct capture semantics#204
hhugo merged 10 commits into
ocaml-community:masterfrom
hhugo:pr4-tdfa-rewrite

Commits on Sep 20, 2026
- Determinize over ordered configurations (Laurikari TDFA)
  
  hhugo
  and
  claude
  committed
  ae5fbe1
- Make bounded repetition greedy
  
  hhugo
  and
  claude
  committed
  c161070
- Keep only nodes that matter in DFA states
  
  hhugo
  and
  claude
  committed
  667f656
- Simplify Seq lowering to two list folds
  
  hhugo
  and
  claude
  committed
  72e1794
- Lower Opt greedily so Opt p and Rep (p, 0..1) agree
  
  hhugo
  and
  claude
  committed
  8b8c055
- Make Plus greedy when the body's first alternative is nullable
  
  hhugo
  and
  claude
  committed
  f4b46cd
- Add non-eliminable counterparts for static as-binding tests
  
  hhugo
  and
  claude
  committed
  a29fb49
- Remove duplicate or-pattern as-binding test
  
  hhugo
  and
  claude
  committed
  173424b
- Add changelog entry for the TDFA rewrite (#204)
  
  hhugo
  and
  claude
  committed
  0bdde96
- Update the Current notes of the codegen tests for working registers
  
  hhugo
  and
  claude
  committed
  7c83851