Abstract

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:

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.