On Thu, Mar 15, 2007 at 11:28:45PM +0530, Asiri Rathnayake wrote: > 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).
Wow, yesterday I read the announcement of vim's suggested SoC ideas, and I thought, it would be that cool, if the regexp thing would be taken, and here you are :) If you are accepted by Bram/Google I really wish you luck, and hope, that this one could really speed up things like syntax highlighting which can be quite slow for special files even on fast PCs. regrads, Martin
