Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re: Re: Re: A demanding parser

by Juerd (Abbot)
on Jan 25, 2002 at 20:34 UTC ( #141536=note: print w/replies, xml ) Need Help??

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

That's what he does already. He asked if it were possible without the module. (Not a very good idea, but I don't know the motivation (education, perhaps))

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

Replies are listed 'Best First'.
Re: Re: Re: Re: A demanding parser
by TheDamian (Priest) on Jan 27, 2002 at 15:14 UTC
    Ah, sorry. Missed that bit.

    How about:

    use Regexp::Common; print $RE{balanced}{-parens=>'()'}, "\n"; print $RE{balanced}{-parens=>'{}'}, "\n"; print $RE{balanced}{-parens=>'{}()'}, "\n"; # etc.
    followed by reading the Regexp::Common source?


      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://141536]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (7)
As of 2017-05-23 00:47 GMT
Find Nodes?
    Voting Booth?