Re: loops in bison

Aaron Jewell <jewell@willowglen.ab.ca> asked:
> I am curious though.. what is this parser generator that will build an
> AST for me and where can I find it?


There are actually numerous ones. I believe almost every one listed
in the compiler-compiler list posted by Langmack will generate AST's.
Certainly, the list includes ANTLR, Cocktail, JavaCC (using either JTB
or JJtree), PCCTS, RDB, and Yacc++.


> Almost immediately after posting my original question I did decide to
> use a tree in the manner described (after following someone's advice
> to look over the ksh code) and managed to throw one together over the
> weekend (its very small and simple language).


Yes, part of the point of the article was that one can even build AST
trees by hand and it is still worthwhile doing so. The only advantage
to an AST generated by a tool is that it is tied to the grammar and
thus when the grammar gets updated so does the tree. That's a big
advantage in my book. However, I will not dispute those who differ.


Hope this helps,
-Chris


*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. Web Site : http://world.std.com/~compres
3 Proctor Street voice : (508) 435-5016
Hopkinton, MA 01748 USA fax : (508) 435-4847 (24 hours)

Return to the comp.compilers page.
Search the comp.compilers archives again.