Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: Eliminating Left Recursion in Parse::RecDescent

by Matts (Deacon)
on Mar 21, 2002 at 18:53 UTC ( #153384=note: print w/replies, xml ) Need Help??

in reply to Eliminating Left Recursion in Parse::RecDescent

Also note that if you have a tokeniser as a regexp, then once you've eliminated left-recursion from a grammar it's dead easy to write a pure perl parser for that grammar without using a parser module. See XML::XPath::Parser for an example of this, and also XML::SAX::PurePerl.

Edited: Sun Mar 31 22:11:49 2002, by footpad.

  • Comment on Re: Eliminating Left Recursion in Parse::RecDescent

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (4)
As of 2016-10-22 00:33 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (291 votes). Check out past polls.