Yesterday, Russ Cox released a new regex matching library from Google, as an open source project. I think it’s very interesting and worth a look.
It shares many of the technical characteristics with TRE, mainly:
- Guarantee searching time linear to the size of input (no backreferences).
- Guarantee small fixed stack usage when searching
RE2 is compatible with the PCRE API, whereas TRE uses the POSIX API. RE2 does not have approximate matching support, so that continues to be the main differentiator of TRE compared to any other library out there.