[antlr-interest] middle-end example

Johannes Luber jaluber at gmx.de
Mon Oct 29 06:23:11 PDT 2007


Michael LeBlanc wrote:
> I looked through the v3 examples but didn't spot what I'm looking for,
> which is:
> 
> Pass 1: Normal grammar that writes a tree.
> Pass 2 thru N-1: Tree grammars that rewrite the tree.  Optimizers, if
> you like.
> Pass N: Tree grammar that writes string-templates to produce final output.
> 
> Can anyone point me to such a thing?

I'm not sure that such an example actually exists as it is dependent on
tree rewriting which will be supported by 3.1. But if there is an
example then maybe Ter's programming language Mantra may provide
insight. If yes, then please tell me, because I'd would like to see an
example myself.

Johannes


More information about the antlr-interest mailing list