An extension of the reverse Polish notation, as well as the extension of the corresponding algorithms for transforming infix expressions to the postfix ones and vice versa, are suggested. Further, some properties of reverse Polish notation are investigated. These properties are important in the simplification of the corresponding infix expression. A software implementing improved algorithms for the infix to postfix transformation and vice versa is developed.