The branch free regex engine is an interesting idea. I would have said that can't be implemented in finite code.

Compile to DFA by repeatedly differentiating then unroll the machine? You'd still have back edges for the repeating sections.