Skip to content

fixes #8673; Add operator's associativity check for stacks/infix_to_p… #8674

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 6 commits into from
Aug 1, 2023
Merged

fixes #8673; Add operator's associativity check for stacks/infix_to_p… #8674

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
55a8fae
fixes #8673; Add operator's associativity check for stacks/infix_to_p…
amirsoroush Apr 19, 2023
b82f402
fix ruff N806 in stacks/infix_to_postfix_conversion.py
amirsoroush Apr 19, 2023
01aebb0
Merge branch 'master' of github.com:amirsoroush/PythonAlgorithms into…
amirsoroush Apr 25, 2023
78e9dc4
Update data_structures/stacks/infix_to_postfix_conversion.py
amirsoroush Jul 31, 2023
5b760f0
Update data_structures/stacks/infix_to_postfix_conversion.py
amirsoroush Jul 31, 2023
fa927d5
Merge branch 'master' of github.com:TheAlgorithms/Python into bug-fix…
amirsoroush Aug 1, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 7 additions & 7 deletions data_structures/stacks/infix_to_postfix_conversion.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -88,14 +88,14 @@ def infix_to_postfix(expression_str: str) -> str:
if char_precedence > tos_precedence:
stack.push(char)
break
elif char_precedence == tos_precedence:
if associativity(char) == "RL":
stack.push(char)
break
else:
postfix.append(stack.pop())
else:
if char_precedence < tos_precedence:
postfix.append(stack.pop())
break
# Precedences are equal
if associativity(char) == "RL":
stack.push(char)
break
postfix.append(stack.pop())

while not stack.is_empty():
postfix.append(stack.pop())
Expand Down