PRx Regular Expressions is a non-backtracking regular expressions engine that models regular expressions as finite state automata. Its design is based on that of Ken Thompson's original NFA algorithm for regular expressions, Henry Spencer's regex VM and a hybrid approach that melds the two, all of which are described in these articles by Russ Cox, the author of RE1 and RE2: http://swtch.com/~rsc/regexp/