A pure Nim regular expression implementation that seems to be 10x slower than PCRE. It's based on optimal DFAs though and if I remember correctly that means that there are no patterns or inputs that produce exponential runtimes.
A Lexer generator that produces lexers that are close to optimal both in space and time.