Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
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?
[Lady_Aleena]: Ratazong, you didn't know about Cookies?
[Lady_Aleena]: shmem, jedikaiti would appreciate that. 8)
[shmem]: no doubt, Lady_Aleena - maybe others, too. A whole barrel just for cookies would be too much for one person alone.

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (6)
As of 2017-04-26 10:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (471 votes). Check out past polls.