4 ms·
It was also twice as fast as Perl in benchmarks at one point or another.
by nanny 11y ago
It was also twice as fast as Perl in benchmarks at one point or another.
- kbenson 11y agoThat's not exactly hard to do, depending on features. There's a definite trade-off between features and the type of regex engine that can be implemented.
- DasIch 11y agoIt seems to me that one should be able to detect which features are actually used in a regular expression and choose one of multiple different underlying implementations based on that.
- kbenson 11y agoNewer versions of Perl actually support a pluggable regex engine system, so you can use specific regex engines for specific tasks.
- Twirrim 11y agoIf you hook in libpcre direct it actually comes with its own JIT these days. http://sljit.sourceforge.net/pcre.html http://sljit.sourceforge.net/pcre.html
- draven 11y agoHaving the compiler available at runtime kinda helps too!