News for hackers. Stuff that matters.
Re:Regular Expression Matching Can Be Simple and Fast (2007) by widdma on Tuesday April 14, 2015 @06:26PM (#9377754)
As mentioned in the article, grouping can be done with Thompson-style algorithms. Backreferencing groups can not.* See the Plan9 regex library.

*Probably. Depends if P=NP or not.

There are no comments on this comment yet.