Arithmetic evaluation: Difference between revisions

ACreate a program which parses and evaluates arithmetic expressions. Requirements: an abstract-syntax tree (AST) for the expression must be created from parsing the input. The AST must be used in evaluation, also, so nothe callinginput evalmay ornot similarbe ifdirectly theevaluated language(e.g. hasby suchcalling eval or a thingsimilar language feature.) The expression will be a string or list of symbols like "(1+3)*7". The four symbols + - * / must be supported as binary operators, including precedence levels. Precedence-control parentheses must also be supported.