Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Eliminating Left Recursion in Parse::RecDescent

by cogent (Monk)
on Mar 21, 2002 at 17:01 UTC ( [id://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
Domain Nodelet?
Node Status?
node history
Node Type: note [id://153355]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others meditating upon the Monastery: (3)
As of 2024-04-25 07:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found