Re:Efficiency of regular expressions
by metageek on Friday January 21, 2011 @02:27PM
(#2128528)
I wish we had a term that meant "things like regular expressions, that may not actually define regular languages". A real regular expression can always be translated to a DFA, and be executed in O(len(input)) time. Perl regexpen are not regular.
[ Parent
| on HN ]
There are no comments on this comment yet.