I\'m writing a parser to validate if an infix expression is correct, then build a tree from it (from tree I can calculate, or convert to prefix/postfix easily). So far so go
