Hi all, I went through the above idea presented for google summer of code 2007 and found it interesting. In my opinion, incorporating Thompson NFA into regexp from the ground up is pretty cool. I also went through the alternate TRE (http://laurikari.net/tre/index.html) but couldn't verify whether its an implementation of Thompson NFA ( I will have to dig into it's source and find it out ). I would like to know further details (if any) regarding this project and the possible mentor(s).
- Asiri
