Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: Returning contents of subrules matches with Parse::RecDescent

by merlyn (Sage)
on Sep 29, 2000 at 07:43 UTC ( #34559=note: print w/replies, xml ) Need Help??

in reply to Returning contents of subrules matches with Parse::RecDescent

A tuple is, at the least, an alternating integer-dot sequence with at minimum two repetitions of the integer-dot sequence. E.g: 2343.23423. is the minimum that a tuple may be.
I don't know REBOL, although I've looked at it a couple times. But I do know a bit of Parse::RecDescent. Try this:
tuple: (numberdot){2..} number(?) { [@{$item[1]}, @{$item[2]}] } numberdot: number dot { $item[1] } number: /(\d+)/ dot: /\./
All the shenanigans are necessary because you want to peer down into the arrayrefs returned from both $item[1] and $item[2]. Untested, but I think it's pretty close. I might be off an indirection or two. {grin}

-- Randal L. Schwartz, Perl hacker

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://34559]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (3)
As of 2018-07-18 05:19 GMT
Find Nodes?
    Voting Booth?
    It has been suggested to rename Perl 6 in order to boost its marketing potential. Which name would you prefer?

    Results (383 votes). Check out past polls.