Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Eliminating Left Recursion in Parse::RecDescent

by cogent (Monk)
on Mar 21, 2002 at 17:01 UTC ( #153355=note: print w/replies, xml ) Need Help??

in reply to Eliminating Left Recursion in Parse::RecDescent

I'm currently going through the Dragon Book in order to write a parser for JavaScript in pure Perl.

Since I'd planned on using Parse::RecDescent, and the grammar (summarized at the end of the standard) is quite large, I'm planning on writing a module to systematically eliminate left recursion. (I also plan to do some other grammar munging, like eliminating epsilon-expressions.)

  • 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://153355]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (4)
As of 2016-10-01 06:23 GMT
Find Nodes?
    Voting Booth?
    Extraterrestrials haven't visited the Earth yet because:

    Results (575 votes). Check out past polls.