Python/data_structures/stacks/infix_to_postfix_conversion.py

114 lines
3.0 KiB
Python
Raw Normal View History

"""
https://en.wikipedia.org/wiki/Infix_notation
https://en.wikipedia.org/wiki/Reverse_Polish_notation
https://en.wikipedia.org/wiki/Shunting-yard_algorithm
"""
2018-10-19 12:48:28 +00:00
from typing import Literal
from .balanced_parentheses import balanced_parentheses
from .stack import Stack
2018-10-19 12:48:28 +00:00
PRECEDENCES: dict[str, int] = {
"+": 1,
"-": 1,
"*": 2,
"/": 2,
"^": 3,
}
ASSOCIATIVITIES: dict[str, Literal["LR", "RL"]] = {
"+": "LR",
"-": "LR",
"*": "LR",
"/": "LR",
"^": "RL",
}
2018-10-19 12:48:28 +00:00
def precedence(char: str) -> int:
"""
Return integer value representing an operator's precedence, or
2018-10-19 12:48:28 +00:00
order of operation.
https://en.wikipedia.org/wiki/Order_of_operations
"""
return PRECEDENCES.get(char, -1)
def associativity(char: str) -> Literal["LR", "RL"]:
"""
Return the associativity of the operator `char`.
https://en.wikipedia.org/wiki/Operator_associativity
"""
return ASSOCIATIVITIES[char]
2018-10-19 12:48:28 +00:00
def infix_to_postfix(expression_str: str) -> str:
"""
>>> infix_to_postfix("(1*(2+3)+4))")
Traceback (most recent call last):
...
ValueError: Mismatched parentheses
>>> infix_to_postfix("")
''
>>> infix_to_postfix("3+2")
'3 2 +'
>>> infix_to_postfix("(3+4)*5-6")
'3 4 + 5 * 6 -'
>>> infix_to_postfix("(1+2)*3/4-5")
'1 2 + 3 * 4 / 5 -'
>>> infix_to_postfix("a+b*c+(d*e+f)*g")
'a b c * + d e * f + g * +'
>>> infix_to_postfix("x^y/(5*z)+2")
'x y ^ 5 z * / 2 +'
>>> infix_to_postfix("2^3^2")
'2 3 2 ^ ^'
2018-10-19 12:48:28 +00:00
"""
if not balanced_parentheses(expression_str):
raise ValueError("Mismatched parentheses")
stack: Stack[str] = Stack()
2018-10-19 12:48:28 +00:00
postfix = []
for char in expression_str:
if char.isalpha() or char.isdigit():
2018-10-19 12:48:28 +00:00
postfix.append(char)
2019-10-05 05:14:13 +00:00
elif char == "(":
2018-10-19 12:48:28 +00:00
stack.push(char)
2019-10-05 05:14:13 +00:00
elif char == ")":
while not stack.is_empty() and stack.peek() != "(":
2018-10-19 12:48:28 +00:00
postfix.append(stack.pop())
stack.pop()
else:
while True:
if stack.is_empty():
stack.push(char)
break
char_precedence = precedence(char)
tos_precedence = precedence(stack.peek())
if char_precedence > tos_precedence:
stack.push(char)
break
if char_precedence < tos_precedence:
postfix.append(stack.pop())
continue
# Precedences are equal
if associativity(char) == "RL":
stack.push(char)
break
postfix.append(stack.pop())
2018-10-19 12:48:28 +00:00
while not stack.is_empty():
postfix.append(stack.pop())
2019-10-05 05:14:13 +00:00
return " ".join(postfix)
2018-10-19 12:48:28 +00:00
2019-10-05 05:14:13 +00:00
if __name__ == "__main__":
from doctest import testmod
testmod()
2019-10-05 05:14:13 +00:00
expression = "a+b*(c^d-e)^(f+g*h)-i"
2018-10-19 12:48:28 +00:00
2019-10-05 05:14:13 +00:00
print("Infix to Postfix Notation demonstration:\n")
print("Infix notation: " + expression)
print("Postfix notation: " + infix_to_postfix(expression))