On 28 Feb 2008, at 15:16, Ilyes Gouta wrote:
I'm writing a small grammar for a very simplified C language. My goal
is to produce an AST once a script file is parsed by the flex/bison
tools. I got almost everything working nicely, except for the C style
for loops.
...
How one would modify the grammar to take into
account such a scenario?
Any ideas?
There is a Yaccable grammar of C++ - you might check that out
http://www.parashift.com/c++-faq-lite/compiler-
dependencies.html#faq-38.11
Hans Aberg
_______________________________________________
help-bison@gnu.org http://lists.gnu.org/mailman/listinfo/help-bison
