refa
refa copied to clipboard
A library for finite automata and regular expressions in the context of JS RegExp
https://en.wikipedia.org/wiki/Quotient_of_a_formal_language Here is a simple construction for the left quotient for NFAs: https://cs.stackexchange.com/a/155475/125991
https://en.wikipedia.org/wiki/Brzozowski_derivative Should be relatively easy to implement for NFAs.
The JS parser is able to resolve backreferences where (among other conditions) the associated capturing group accepts a small finite language. E.g. `/(a|b)\1/` will be parsed as `/aa|bb/` This is...
I'm using your package as part of research and want to collaborate on adding anchor assertion support. From a group of ~835k regexes, approximately 53% were supported for conversion without...
Bumps [braces](https://github.com/micromatch/braces) from 3.0.2 to 3.0.3. Commits 74b2db2 3.0.3 88f1429 update eslint. lint, fix unit tests. 415d660 Snyk js braces 6838727 (#40) 190510f fix tests, skip 1 test in test/braces.expand...