Reverse Polish Notation
Reverse Polish notation is a form of postfix notation where brackets are not permitted (and not needed). No rules about precedence are needed for different operations, which are carried out in the order met in the expression. Reverse Polish notation has the advantage that any algebraic expression can be processed strictly from left to right. It is widely used by compilers which convert the infix notation that a programmer has used into reverse Polish notation. This reverse Polish notation is then easily converted into a machine-code program. It was devised by the Polish mathematician Jan Lukasiewicz.
- Jump:
- a -
- b -
- c -
- d -
- e -
- f -
- g -
- h -
- i -
- j -
- k -
- l -
- m -
- n -
- o -
- p -
- q -
- r -
- s -
- t -
- u -
- v -
- w -
- x -
- y -
- z -
- symbols