Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"

Re: Parse::RecDescent help

by gjb (Vicar)
on Mar 30, 2004 at 07:38 UTC ( #340878=note: print w/ replies, xml ) Need Help??

in reply to Parse::RecDescent help

Unless I miss something obvious, the language you're parsing is regular. Parse::RecDescent is a tool to deal with context free languages. Since every regular language is context free, you can use Parse::RecDescent to deal with it, but it's overkill.

Parsing a context free language is a relatively costly process compared to parsing a regular language (O(n^3) vs. O(n)) and since you're parsing lots of data, that is quite a difference. In this case it would almost certainly be much faster to implement your own parser as was suggested above.

Just my 2 cents, -gjb-

Comment on Re: Parse::RecDescent help

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (3)
As of 2015-11-28 20:25 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (744 votes), past polls