An exhaustive review for infix to postfix conversion with applications and benefits

In Computer Science, Reverse Polish notation has simplified calculations and has benefited a new face to technology. Since 1960, RPN is used in calculators because its implementation is very easy and simple as well as it gives good performance. In this paper, we have introduced a new approach for infix to postfix expressions conversion by following some rules and highlighted some of the applications and advantages of existing methods. The proposed algorithm differs from other existing algorithms through its human readability. We have discussed a comparative analysis of RPN, Shunting Yard algorithm and a new approach to Post fix conversion named as PKR algorithm.