Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: Gathering experiences with Parse::RecDescent

by polypompholyx (Chaplain)
on Oct 21, 2005 at 13:29 UTC ( #501985=note: print w/ replies, xml ) Need Help??

in reply to Gathering experiences with Parse::RecDescent

I've used it to write toy calculator grammars, a parser for chemical formulae that calculates molecular masses, and to convert a user-friendly multiple-choice question format into Something Nasty required by an e-learning system (WebCT). It's simple to use, but like others, I found it slow (although precompiling the parser helps). On the other hand, I often find myself thinking, "Oh, I could do that much more elegantly in P::RD," when presented with a problem that I would previously have used nasty regexes on.

Comment on Re: Gathering experiences with Parse::RecDescent
Replies are listed 'Best First'.
Re^2: Gathering experiences with Parse::RecDescent
by leriksen (Curate) on Oct 22, 2005 at 02:17 UTC
    Ah yes - webCT - also known as "Run Away, RUN AWAY!!!!"

    ...reality must take precedence over public relations, for nature cannot be fooled. - R P Feynmann

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (4)
As of 2016-02-14 09:08 GMT
Find Nodes?
    Voting Booth?

    How many photographs, souvenirs, artworks, trophies or other decorative objects are displayed in your home?

    Results (468 votes), past polls