News for hackers. Stuff that matters.
Re:Regular Expression Matching Can Be Simple and Fast (2007) by smegel on Tuesday April 14, 2015 @05:44PM (#9377577)
And when was the last time anyone used grouping in a regex!
Re:Regular Expression Matching Can Be Simple and Fast (2007) by McUsr on Tuesday April 14, 2015 @07:53PM (#9378082)
I use groups, (look forward, and lookbehind) all the time, now that I have been comfortable with them, they are great in that I can write simpler regexps, or use fewer patterns. And I use perl for one liners, which is as far as I can go comfortably with perl. Thing is, I use regexps most for one-liners, and with perl, and grouping, it is simpler for me, than using sed for instance, where I then would have to think, (and test), substantially more, or filter the output through yet anoter sed expression. So grouping works for me. :) It is of course slower, but so far, the most critical time for me, has been the speed with which I can make a solution that works.
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.