forked from mikeash/mikeash.com-svn
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathOperator.py
67 lines (56 loc) · 1.7 KB
/
Operator.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
from CalcException import CalcException
precedencesList = [
('in', 'to'),
('(', ')'),
('+', '-'),
'-unary',
('*', '/'),
('*unit', '/unit'),
'^'
]
i = 0
precedences = {}
for x in precedencesList:
if type(x) != tuple:
x = (x, )
for op in x:
precedences[op] = i
i += 1
class Operator:
def __init__(self, str, precedence = None):
self.operator = str
if not precedences.has_key(str):
raise CalcException("unknown operator %s" % str)
if not precedence:
precedence = precedences[self.operator]
self.precedence = precedence
def __str__(self):
return self.operator
def isNumber(self):
return False
def process(self, infixStack, postfixStack):
if self.operator == '(':
infixStack.append(self)
elif self.operator == ')':
while infixStack[-1].operator != '(':
postfixStack.append(infixStack.pop())
infixStack.pop()
elif len(infixStack) == 0:
infixStack.append(self)
else:
top = infixStack[-1]
if self.precedence > top.precedence:
infixStack.append(self)
else:
postfixStack.append(infixStack.pop())
self.process(infixStack, postfixStack)
def calc(self, stack):
val2 = stack.pop()
val1 = stack.pop()
stack.append(val1.eval(self.operator, val2))
def unitMultiplyOperator():
return Operator('*', precedences['*unit'])
def unitDivideOperator():
return Operator('/', precedences['/unit'])
def unaryMinusOperator():
return Operator('-', precedences['-unary'])