Reverse Polish Notation (RPN) is a system where expressions are evaluated from left to right, with no precedence, with operators stated following the operands. A typical RPN expression might be ab+c*, which in infix means (a+b)*c. (Infix is our "standard" system which we use when writing programs) Note that the infix expression required parenthesis to override operator precedence, but the RPN expression did not. If you said in infix a+b*c, the RPN equivalent would be abc*+. The value of RPN is that it is easy to build a stack machine that processes the expression. Each time you encounter an operand, you push it on the stack. Each time you encounter an operator, you process it, replacing the top two elements of the stack with the result (for binary operators), or replacing the top element of the stack with the result (for unary operators). RPN is often used in compiler design.