A fast regular expression engine that produces parse trees (ASTs). It does so in linear time in the size of the text matched and scales in O(m*log(m)) in the size of the pattern.
The algorithm is described in
A linear regular expression engine that produces parse trees (ASTs).
A fast regular expression engine that produces parse trees (ASTs). It does so in linear time in the size of the text matched and scales in O(m*log(m)) in the size of the pattern.
The algorithm is described in
A linear regular expression engine that produces parse trees (ASTs).
Apache License 2.0