Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Dynamic expansion of tokens with Parse::RecDescent

by jaldhar (Vicar)
on Aug 19, 2004 at 20:17 UTC ( #384439=note: print w/ replies, xml ) Need Help??


in reply to Dynamic expansion of tokens with Parse::RecDescent

Thanks to all that replied. amw1's code was helpful but didn't deal with the possibility of multiple-word color names. I like how he got the completed order into a data structure though.

ikegami's advice to seperate tokenizing and parsing was good and I will probably have to go that way soon to deal with things like "burnt umber", "lt. blk" etc. It seems it will be easier and more modular. Unfortunately I have a lot of input already in a fixed format so I can't quote the color names. I'll see if it can be changed for future input.

In the end I went with a variation on solo and revdiablo's suggestions:

color: /(??{join ("|", @colors)})/

--
જલધર


Comment on Re: Dynamic expansion of tokens with Parse::RecDescent
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (19)
As of 2015-07-30 16:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (273 votes), past polls