I am currently looking at the regex-tdfa package.
It says the following:
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?