I have a parse tree that parses out a stack of a stack of char (stack<stack<char>>). This gets the characters into a parse tree. My question is how would I convert this parse tree into a AST in order to evaluate it?
I have the evaluator working for a AST I just need to convert the tree into the syntax in order to evaluate it.
Any help would be appreciated.
5+6 - (4*6) + 5the stack of stack of chars would be[[5] [+] [6] [-] [(] [4] [*] [6] [)] [+] [5]]That is turned into a parse tree