one-more-re-nightmare

If you claim it's the fastest, how does it compare to one-more-re-nightmare? - https://github.com/telekons/one-more-re-nightmare - https://applied-langua.ge/posts/omrn-compiler.html OMRN is a regex compiler that leverages Common Lisp's compiler to produce optimized assembly to match the given regex. It's incredibly fast. It does omit some features to achieve that, though.

In fact, there's https://github.com/telekons/one-more-re-nightmare for CL.

there's a much faster regex library: https://github.com/telekons/one-more-re-nightmare

A related project that might interest some people: https://github.com/telekons/one-more-re-nightmare And the pretty hard to find blog post about it: https://applied-langua.ge/posts/omrn-compiler.html

Depends on your regex engine, and your non-regex solution. My engine (shameless self-plug https://github.com/telekons/one-more-re-nightmare) rivals hand-written automata, having to load each character more-or-less* only once, and throws in vectorisation for simple search loops too. I would not want to write or maintain the generated code.

> One of my favorite examples is the regex library cl-ppcre. Thanks to the nature of Lisp, the recognizer for each regex you create can be compiled to native code on compiler implementations of CL. That is not true - cl-ppcre generates a chain of closures. Experimental performance is in the same ballpark as typical "bytecode" interpreting regex implementations. However, the "compiler macro" feature in Common Lisp allows for generating the chain of closures to be performed at compile-time, and invalid syntax (in string literals) can be detected at compile-time. (Disclosure: I wrote another regex library at <https://github.com/telekons/one-more-re-nightmare>, which does do native code compilation.)