An Effective Conversion Algorithm of Arithmetic Expression from Infix Form to Prefix Form
Ting Wang, Hao Xun Tan, Ren Ren Liu · Applied Mechanics and Materials · 2011
Generally, when we optimize the object code of expression in source program, we get the optimizing code in the binary tree of this expression. Expressions in source program are in infix form, while the prefix form is more efficient for the binary tree. Hence this paper is to provide an effective transition algorithm of arithmetic expression from infix form to prefix form.