Created
December 16, 2015 16:37
-
-
Save gaiazov/98e94d72db171ec06310 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
OPERATORS = {'+': (1, lambda x, y: x + y), '-': (1, lambda x, y: x - y), | |
'*': (2, lambda x, y: x * y), '/': (2, lambda x, y: x / y)} | |
def eval_(formula): | |
def parse(formula_string): | |
number = '' | |
for s in formula_string: | |
if s in '1234567890.': | |
number += s | |
elif number: | |
yield float(number) | |
number = '' | |
if s in OPERATORS or s in "()": | |
yield s | |
if number: | |
yield float(number) | |
def shunting_yard(parsed_formula): | |
stack = [] | |
for token in parsed_formula: | |
if token in OPERATORS: | |
while stack and stack[-1] != "(" and OPERATORS[token][0] <= OPERATORS[stack[-1]][0]: | |
yield stack.pop() | |
stack.append(token) | |
elif token == ")": | |
while stack: | |
x = stack.pop() | |
if x == "(": | |
break | |
yield x | |
elif token == "(": | |
stack.append(token) | |
else: | |
yield token | |
while stack: | |
yield stack.pop() | |
def calc(polish): | |
stack = [] | |
for token in polish: | |
if token in OPERATORS: | |
y, x = stack.pop(), stack.pop() | |
stack.append(OPERATORS[token][1](x, y)) | |
else: | |
stack.append(token) | |
return stack[0] | |
return calc(shunting_yard(parse(formula))) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment