First off, this needs to be done in Scheme.
I need helping taking a simple expressions such as:
(R + S * T) * U
and generating a full concrete syntax tree for it in scheme. (Wish i could do it in c++). The only language syntax defined are:
(, ), *, /, +, -, numbers, identifiers.
I really need a walk through in how to systamatically walk through the expression, and break it down to end up with the concrete tree. After the concrete tree is done, I'd need to generate an abstract tree from it. I don't really need or want the application created for me, I just need someone to walk through it with me step by step.