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
-
Notifications
You must be signed in to change notification settings - Fork 6
A linear regular expression engine that produces parse trees (ASTs).
License
nes1983/tree-regex
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A linear regular expression engine that produces parse trees (ASTs).
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published