Nice visualizations. I made an online visualization demo showing parsing and compilation of regexes -> NFA -> DFA -> minimal DFA -> LLVM IR: http://compiler.o

Nice visualizations. I made an online visualization demo showing parsing and compilation of regexes -> NFA -> DFA -> minimal DFA -> LLVM IR: http://compiler.org/reason-re-nfa/src/index.html http://compiler.org/reason-re-nfa/src/index.html It doesn’t support backrefs, only simple basic regex features. Try entering (.+)[.](.+)[.](.+) to see how DFA-minimization of it looks like. You have to use [.] instead of \. as the parser doesn’t support escaping.