I have a grammar to define arithmetic/logical expressions. I need to get the tree-based representation of these expressions, so that I can compute the results of the expressions by known tree traversal algorithms. I was wondering whether there is any easy way to get such a tree inside my program, since Xtext creates AST from such expressions anyhow.

Thanks]]>

am not sure if i get your question

maybe a look at http://typefox.io/parsing-expressions-with-xtext helps

]]>