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

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?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (13)
As of 2014-12-17 20:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (32 votes), past polls