mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-02-25 10:28:39 +00:00
Compare commits
2 Commits
01aebb0270
...
5b760f06f8
Author | SHA1 | Date | |
---|---|---|---|
|
5b760f06f8 | ||
|
78e9dc4c7a |
@ -88,13 +88,13 @@ def infix_to_postfix(expression_str: str) -> str:
|
|||||||
if char_precedence > tos_precedence:
|
if char_precedence > tos_precedence:
|
||||||
stack.push(char)
|
stack.push(char)
|
||||||
break
|
break
|
||||||
elif char_precedence == tos_precedence:
|
if char_precedence < tos_precedence:
|
||||||
|
postfix.append(stack.pop())
|
||||||
|
continue
|
||||||
|
# Precedences are equal
|
||||||
if associativity(char) == "RL":
|
if associativity(char) == "RL":
|
||||||
stack.push(char)
|
stack.push(char)
|
||||||
break
|
break
|
||||||
else:
|
|
||||||
postfix.append(stack.pop())
|
|
||||||
else:
|
|
||||||
postfix.append(stack.pop())
|
postfix.append(stack.pop())
|
||||||
|
|
||||||
while not stack.is_empty():
|
while not stack.is_empty():
|
||||||
|
Loading…
x
Reference in New Issue
Block a user