Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: Regexp::Grammars Calculator

by blokhead (Monsignor)
on Aug 15, 2009 at 23:42 UTC ( #788945=note: print w/ replies, xml ) Need Help??


in reply to Regexp::Grammars Calculator

I couldn't find anything (after a very superficial look) in the documentation for Regexp::Grammars about associativity. If the parser-generator doesn't support it directly, then you'll have to get associativity and precedence by rewriting the grammar. In Re: Left-associative binary operators in Parse::RecDescent, I give an overview of how to rewrite a grammar for operator precedence & associativity. It might suit your needs.

blokhead


Comment on Re: Regexp::Grammars Calculator

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://788945]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (9)
As of 2015-07-31 01:36 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 (274 votes), past polls