Using a single stack we convert from infix to postfix. We first check for any arithmetic errors that might cause problems later in the calculation. Then we check for negatives, operators, and digits ...

This repository is an assignment submission. It contains a structure to check validity of an infix expression, convert it into postfix expression and evaluate it. The operands can be multiple digit ...