On some properties of reverse Polish notation

This paper represents the authors' contribution to the treatise of the reverse Polish notation. The idea and development of the Polish notation (both prefix and postfix) is relatively old (during 1950s) with the main goal to establish the parentheses-free notational systems for writting mathematical expressions. The advantige of these systems is that parentheses are not needed to specify the order of evaluation of mathematical expressions. Practical use is later found in some aspects of computer science (in more efficient assembler programming) and particularly in design of scientific calculators (HP types).NEWLINENEWLINENEWLINEThe contribution of the authors is related to the extension of the reverse Polish notation to include processing of \(n\)-ary operators (or multi-variable functions). Some new definitions are given, e.g. the grasp of an arbitrary \(n\)-ary operator, the left grasp bound, and certain number of theorems are formulated and the corresponding proofs are given. Based on that, simplification rules are given which are used for the elimination of the unnecessary parentheses in the corresponding infix expressions. Also, the corresponding C++ like pseudocode implementation for transformation of the classical infix expression into the postfix form and then back to infix form is given. During the process, the elimination of unnecessary parentheses, according to given rules, is performed and thus a simplification of the original infix expression is achieved.

Recommendations

Cited in

(6)

This page was built for publication: On some properties of reverse Polish notation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724015)