Re:Regexes vs. Combinatorial Parsing (2019)
by a1369209993 on Thursday May 28, 2020 @04:43PM
(#23342302)
That's deterministic finite state machines (DFA); the nondeterministic (NFA) representation is linear in regex length (unless you use "a{99}", but that's nonstandard for a reason). You can also do concat/intersect/etc directly on the (actually-regular) regex representaion directly, although it is a bit ugly.
[ Parent
| on HN ]
There are no comments on this comment yet.