Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re^2: Eliminating the common prefix from a Parse::RecDescent rule

by ikegami (Pope)
on Sep 03, 2010 at 02:15 UTC ( #858659=note: print w/replies, xml ) Need Help??

in reply to Re: Eliminating the common prefix from a Parse::RecDescent rule
in thread Operator Associativity and Eliminating Left-Recursion in Parse::RecDescent

You must check that nothing follows what sum matches.
evaluate : sum /\Z/ { $item[1] } ->evaluate($expr)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://858659]
[Corion]: Oooh - I had another devious idea - "Host C" - a C language where every struct is 4K in size. This makes memory and disk access incredibly fast ;)
[Corion]: (because everything is aligned to a memory page and all pages can be read+written directly from disk without buffering)

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (6)
As of 2017-04-25 08:58 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (449 votes). Check out past polls.