Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: Re: Re: Re: A complex recursive regex,help

by OM_Zen (Scribe)
on Feb 06, 2003 at 04:45 UTC ( #233063=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Re: A complex recursive regex,help
in thread A complex recursive regex,help

Hi ,

The cases where the xx appears last are clearly taken care of by your regex BrowserUk,the part I am not understanding is that you are saying that it will fall over if yout date containes any occurances of xx without |'s or x's on either side, please give an instance of this BrowserUk, in terms of data to facilitate the understanding as yoru regex is doing pretty good in all data strings


Comment on Re: Re: Re: Re: A complex recursive regex,help
Re: Re: Re: Re: Re: A complex recursive regex,help
by BrowserUk (Pope) on Feb 06, 2003 at 08:05 UTC

    An example where mine falls over, but I think tachyon's wouldn't.

    $t = "xyxxy|xx|xy|xx|yy|yxxy xx x" $t =~ s[(?<!x)(x)(x)(?!x)][$1 $2]g; print $t xyx xy|x x|xy|x x|yy|yx xy x x x

    Examine what is said, not who speaks.

    The 7th Rule of perl club is -- pearl clubs are easily damaged. Use a diamond club instead.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://233063]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (11)
As of 2014-09-19 08:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (133 votes), past polls