[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Java compiler implementation in SableCC needed.
As you might have noticed in other messages, work is being done on automatic
CST->AST transformation. This work will greatly simplify the implementation of
compilers for large languages, such as Java, as the Concrete Syntax Tree
generated by SableCC is far too large and complex.
If you are interested, I do have a copy of an LGPLed implementation of a Java to
Jimple (see the Soot project on the www.sable.mcgill.ca web site) compiler.
It is far from being robust and/or complete, but it already has a simplified AST
(built by hand, instead of automatically). The work has helped design of the
Qi Sun wrote:
Thank you for efforts on sablecc. It is great.
I am now trying to extend java syntax. In addition to lex/parsing, I need
a function that can inference types for Java expressions statically. I
guess the easiest way to do it is to find a java compiler implementation
based on sablecc. Does any one has any idea? In fact, I need no more than
inferencing the expression. I am afriad of writing a tools that people may
have already done a lot.
Any suggestion or hints are welcomed. Thank you.
Etienne M. Gagnon, Ph.D. http://www.info.uqam.ca/~egagnon/