Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot

Re: A demanding parser (THE SOLUTION)

by gmax (Abbot)
on Jan 31, 2002 at 06:59 UTC ( #142382=note: print w/replies, xml ) Need Help??

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

It works! I had some trouble figuring out how to implement it, because with 'use strict' the recursive RegEx stays undefined.
#!/usr/bin/perl -w use strict; my $input = "aa (bb cc) dd (ee (ff (gg) hh) jj) kk ((ll)) mm"; no strict 'vars'; # from $RE{balanced}{-parens=>'()'}; $REparens = qr/ (?:(?:(?:[(](?:(?>[^)(]+) |(??{$REparens}))*[)])) |(?:(?!)))/x; my $re = $REparens; use strict; print "input: $input\n"; while ($input =~ /\G(\w+|$re)\s*/gc) { print "$1\n" } __END__ output: aa (bb cc) dd (ee (ff (gg) hh) jj) kk ((ll)) mm
Making a block of no strict 'vars' solves the problem. There I can assign the recursive regex to a proper ly declared variable, or call explicitly ($main::REparens).
Thanks a million.
 _  _ _  _  
(_|| | |(_|><

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (5)
As of 2016-10-27 05:43 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (353 votes). Check out past polls.