This command-line tool takes a regular expression, transforms it into a
deterministic finite state machine and outputs a Go source code for it.
While not supporting some features of the regexp package, like capturing
groups, the generated FSMs are generally 5x-10x faster than the
corresponding function from the regexp package with the equivalent regular
The generated functions return the length of the match or -1 if no match is
found. All patterns are anchored at the beginning of the data, as if the
pattern starts with ^. For complex regular expressions with multiple broad
unicode ranges the generation of an FSM can be slow.
You received this message because you are subscribed to the Google Groups "golang-nuts" group.
To unsubscribe from this group and stop receiving emails from it, send an email to firstname.lastname@example.org.
For more options, visit https://groups.google.com/d/optout.