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

Re: Eliminating Left Recursion in Parse::RecDescent

by jmcnamara (Monsignor)
on Mar 21, 2002 at 00:13 UTC ( #153173=note: print w/ replies, xml ) Need Help??

in reply to Eliminating Left Recursion in Parse::RecDescent

Left-recursion and the workaround is discussed in D. Conway's article The man(1) of descent in The Perl Journal #12. It is also available in the tutorial dir of the Parse::RecDescent distro.

See the section entitled "Left-recurse ye not!" where the following example is given.

The left-recursive:     Addition: Addition '+' Term | Term

Can be handled as follows:     Addition: (Term '+')(s?) Term


Comment on Re: Eliminating Left Recursion in Parse::RecDescent
Select or Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://153173]
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: (4)
As of 2015-11-28 12:08 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (741 votes), past polls