News for hackers. Stuff that matters.
Re:Oh Yes You Can Use Regexes to Parse HTML by FaceKicker on Friday July 08, 2011 @11:52AM (#2742936)
Why is the language matched by /(.)\1/ non-regular? Isn't it finite (aa, bb, cc, dd, ..., zz if your alphabet is the lowercase letters a-z)? And all finite languages are trivially regular.

Maybe he meant /(.*)\1/?

Note: I know that backreferences make Perl regexes capable of matching non-regular languages, but this doesn't seem like an example of that.

There are no comments on this comment yet.