On Thu, 2007-03-15 at 20:44 +0100, Bram Moolenaar wrote: Hi Bram,
I'm going through the regxp code now. I'll first have to determine a way to incorporate the fast matching code into the current code base without breaking existing functionality. Thanks. - Asiri > Asiri Rathnayake wrote: > > > 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). > > I'll be the mentor. Russ Cox may provide background info for the regexp > theories. > > There are no more details to be mentioned. You can also look at the > current regexp code in Vim, of course. > > I'll do an announcement soon. The shell server is down again, can't > change the web page right now :-(. >
