This document describes the algorithm used to convert a mathematical expression from infix notation (e.g., A + B * C) to postfix notation (Reverse Polish Notation, e.g., A B C * +). The implementation ...

In infix notation, we need parentheses to show which part of the expression to solve first. In postfix notation, the order of operations is already clear, so we don’t need parentheses.