[antlr-interest] rules for re-factoring grammars?

[Loring Craymer]

Benjamin--

Take a look at
http://www.antlr.org/pipermail/antlr-interest/2003-December/005897.html for a list of refactorings.  That might help a little bit.

--Loring


----- Original Message ----
From: Benjamin Shropshire <shro8822 at vandals.uidaho.edu>
To: Antlr Interest <antlr-interest at antlr.org>
Sent: Friday, March 21, 2008 12:51:58 PM
Subject: [antlr-interest] rules for re-factoring grammars?

Does anyone known of a good wright up on the rules that can be used to 
re-factor productions? I'm thinking in particular of rules that can 
remove left recursion including with ambiguous grammars.

A :
    F |
    A B |
    D |
    A C |
    E;

D, E and/or F might map over an A.

I've Googled for it but haven't come up with much useful (I might be 
looking for the wrong terms or something) and I don't recall seeing 
anything near what I'm looking for in the antlr docs (but this is 
re-much more a language theory question than an Antlr question).






      ____________________________________________________________________________________
Looking for last minute shopping deals?  
Find them fast with Yahoo! Search.  http://tools.search.yahoo.com/newsearch/category.php?category=shopping
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.antlr.org/pipermail/antlr-interest/attachments/20080321/04315ce1/attachment.html