码迷,mamicode.com
首页 > 编程语言 > 详细

[Python]中缀表达式转前缀表达式

时间:2015-03-20 22:09:43      阅读:261      评论:0      收藏:0      [点我收藏+]

标签:python   前缀表达式-后缀表达   

#判断运算符的优先级
def opOrder(op1,op2):
    order_dic = {‘*‘:4,‘$‘:5,‘/‘:4,‘+‘:3,‘-‘:3}
    if op1 == ‘(‘ or op2 == ‘(‘:
        return False
    elif op2 == ‘)‘:
        return True
    else:
        if order_dic[op1] < order_dic[op2]:
            return False
        else:
            return True

def infix2prefix(string):
    prefix = ‘‘
    stack = []
    string_tmp = ‘‘
    for s in string[::-1]:
        if s == ‘(‘:
            string_tmp += ‘)‘
        elif s == ‘)‘:
            string_tmp += ‘(‘
        else:
            string_tmp += s
    for s in string_tmp:
        if s.isalpha():
            prefix = s + prefix
        else:
            while len(stack)  and opOrder(stack[-1],s):
                op = stack.pop()
                prefix = op + prefix
            if len(stack) == 0 or s != ‘)‘:
                stack.append(s)
            else:
                stack.pop()
    if len(stack):
        prefix = ‘‘.join(stack) + prefix
    return prefix

if __name__ == ‘__main__‘:
    for string in [‘A+B*C‘,‘(A+B)*C‘,‘((A-(B+C))*D)$(E+F)‘]:
        print string,‘==>‘,infix2prefix(string)

输出

>>> 
A+B*C ==> +A*BC
(A+B)*C ==> *+ABC
((A-(B+C))*D)$(E+F) ==> $*-A+BCD+EF

[Python]中缀表达式转前缀表达式

标签:python   前缀表达式-后缀表达   

原文地址:http://blog.csdn.net/sinat_16968575/article/details/44495953

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!