Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^2: A demanding parser

by Aristotle (Chancellor)
on Jan 25, 2002 at 17:07 UTC ( #141488=note: print w/replies, xml ) Need Help??


in reply to Re: A demanding parser
in thread A demanding parser

Wait a second - is that really a recursive regex there? :-o

Makeshifts last the longest.

Replies are listed 'Best First'.
Re: Re: Re: A demanding parser
by Juerd (Abbot) on Jan 25, 2002 at 20:31 UTC
    Affirmative

    2;0 juerd@ouranos:~$ perl -e'undef christmas' Segmentation fault 2;139 juerd@ouranos:~$

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://141488]
help
Chatterbox?
[Discipulus]: LA you know who is paco?
[Lady_Aleena]: Disc, nope.
[Discipulus]: ahi ahi ahi!!
[Lady_Aleena]: paco is a little over 2 years before my time.
[Discipulus]: you can try tachyon's iterative approach Re: Win32 Recursive Directory Listing
[Lady_Aleena]: I'm on Linux/
[beech]: isn't 2 year about standard recovery time for that kind of surgery?
[Discipulus]: if you hate FIle::Find

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (13)
As of 2017-04-23 20:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (432 votes). Check out past polls.