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

Replies are listed 'Best First'.
Re: Re: Re: Re: Re: A complex recursive regex,help
by BrowserUk (Patriarch) 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

    [download]

    Examine what is said, not who speaks.

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

[reply]
[d/l]

In Section Seekers of Perl Wisdom