A new algorithm for converting arithmetic expressions
Trong Wu · Proceedings of the 17th conference on ACM Annual Computer Science Conference · 1989
In the early 1950s, the Polish logician Jan Lukasiewicz found that the parentheses in an arithmetic expression are not necessary if the expression is written in a prefix form (later called Polish form). The reverse Polish notation, is known as Postfix expression, can be converted directly from the Polish form. The reverse Polish notation of a arithmetic expression can be executed by a computer which uses it run-time stack. To-day, most compilers for high-level languages provide a set of procedures that translate arithmetic expressions in a program to their postfix form for internal execution of the program the algorithm looks like: