maximum recursion in "re" module?

[CJ Kucera]

On Tue Oct 16 09:59:14 2001, Skip Montanaro wrote:
> Then s.find(startString) will return the offset in s to the start of
> startString or -1:

Ick.  Offsets.  :)  I don't like having to keep track of that kind
of stuff.

> If you really want to do this with regular expressions, I think it would be
> easier to explicitly flag the URL like so:
> 
>     urlPat = re.compile('Lo Fi Play</phrase></a>'
>                         ' <phrase><a href="([^"]*)"')

Ah, now THERE we go.  I figured I could just do something like that,
but hadn't taken the time to figure it out.  Thanks much!

> Repeat the Zawinski mantra (this stolen from a 1999 c.l.py post by Fredrik
> Lundh, the author of Python's current regular expression engine):
> 
>     Some people, when confronted with a problem, think
>     "I know, I'll use regular expressions".  Now they have
>     two problems.
>         Jamie Zawinski, on comp.lang.emacs

lol.  That's beautiful.

Thanks again for the help!

-CJ

WOW: Rapacious           | A priest advised Voltaire on his death bed to
apocalyptech.com/wow     |  renounce the devil.  Replied Voltaire, "This
pez at apocalyptech.com     |              is no time to make new enemies."