一个将中缀表达式转换为前缀表达式的算法

A Algorithm to Convert Infix Expressions into Prefix Expressions

由于用计算机判断中缀表达式中运算符的运算次序比较困难,所以往往将它转换成前缀表达式或后缀表达式,本文研究将中缀表达式转换为前缀表达式的算法,算法采用C++语言描述。

As it is comparatively difficult to use computers to judge the operation order of operation symbols in infix expressions,the common method is to convert infix expressions into prefix ones or suffix ones. This article focuses on the algorithm to convert infix expressions into prefix ones,using C+ +language.