Labeled matches: why is this not in every regex engine?

named entity recognition with regex at over 1 GB/s, the whole gregorian calendar as one regex, and determining dates with more than 55.1% certainty

what 262,715 regex questions on stack overflow haven't answered (part 2)

the html question, the regex that passes and fails on the same input, and other things you may find surprising

what 262,715 regex questions on stack overflow haven't answered

complement, intersection, and why the most common regex workarounds are hundreds of times slower than they need to be

finding all regex matches has always been O(n²). even in the engines built to prevent it

every regex engine that promises linear time breaks that promise the moment you ask for all matches. the problem has been there since the 70s, hiding in the iteration loop.

symbolic derivatives and the rust rewrite of RE#

RE#: how we built the world's fastest regex engine in F#

concretization, or how 10 lines of rust got me a dangling pointer and undefined behavior

gzip decompression in 250 lines of rust

why use F# for scripting and automation?

starting a dev/research blog