Infix notation is how we usually read and write arithmetic expressions. In this notation, the operator goes between the operands in the expression:

   (operand1)   (operator)   (operand2)

E.g., , or , etc.

Infix notation suffers from some ambiguity; e.g.

could mean or . Parentheses are needed to specify the order of operations unambiguously.

Postfix notation (or reverse-Polish notation) does not suffer this ambiguity; but it is considered harder for humans to read (hence its primary use in computer applications).

The “usual” fix for the ambiguity problem described above is to provide a convention regarding precedence of operations. This is typically done for computer parsing of mathematical expressions rather than in math done by hand, because in the former case, the computer must have some standard rules to proceed. For example, it is typical to make multiplication “higher precedence” than addition, so in the above case, would be performed before adding the result to 3.

The ambiguity problem only occurs when multiple operators are present in one expression, and thus, the associative law does not hold. E.g., there is no ambiguity in , because is the same as , by the associative property of addition.