Mastering Regular Expressions 2nd Ed.

[Michael Hudson]

"David LeBlanc" <whisper at oz.net> writes:

> I may be wrong about this, but I don't think regular expressions
> qualify as turing complete. No branching for one thing...

Somewhere you can find a (perl) regexp that matches prime but not
composite numbers, which suggests Turing completeness -- and rather
takes the mickey out of the word "regular".

> Personally, I think RE's are great and ought to be fully integrated
> into Python, along with a few improvements.

I don't.

Cheers,
M.

-- 
  ARTHUR:  Yes.  It was on display in the bottom of a locked filing
           cabinet stuck in a disused lavatory with a sign on the door
           saying "Beware of the Leopard".
                    -- The Hitch-Hikers Guide to the Galaxy, Episode 1