Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Eliminating Left Recursion in Parse::RecDescent

by abstracts (Hermit)
on Mar 21, 2002 at 08:24 UTC ( #153271=note: print w/ replies, xml ) Need Help??


in reply to Eliminating Left Recursion in Parse::RecDescent

Hello

Just wanted to point out (for readers interested in this topic) that a eliminating left recursion is discussed thoroughly in the dragon book Compilers--Principles, Techniques and Tools. Refer to algorithm 4.1.

Aziz,,,


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://153271]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (13)
As of 2015-07-28 20:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (258 votes), past polls