This package provides a pure Haskell “Tagged” DFA regex engine for regex-base. This implementation was inspired by the algorithm (and Master’s thesis) behind the regular expression library known as TRE or libtre.
I have the following questions:
What is the /Tagged/ DFA technique?
Can someone provide me a link to the Master’s Thesis?
The tagged DFA technique is quite well known - the wikipedia article on the topic is actually quite readable and explains the topics well. The corresponding paper introducing them is reference 2 on that page, due to Laurikari (2000).