paul3bin/maths-interpreter

Build Parser + AST from identfied tokens

Closed this issue · 2 comments

paul3bin commented
  • Build an abstract syntax tree from the list of tokens received.
  • The AST will be used to identify syntax errors in the input
ChristopherMBGavey commented

Good note, second sprint going well so far!

paul3bin commented

@cgaveyuea, @cst19hgu , @Aswin1121998 , @Soniyap151
I added a feature to build AST and parse the input.
Further testing is required.