Scribd
Upload
67 views2 pages

Infix To Postfix Programmed in Python

This document defines a Stack class and Converter class to convert infix notation to postfix notation. The Stack class implements push and pop methods to add and remove items from a stack. The Converter class uses a Stack instance as an operator stack. It iterates through the infix expression, adding operands to the postfix string and operators to the stack. When it encounters a closing parenthesis, it pops operators off the stack and adds them to the postfix string until the stack is empty. It returns the completed postfix notation string.

Uploaded by

Henry Dennis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
67 views2 pages

Infix To Postfix Programmed in Python

This document defines a Stack class and Converter class to convert infix notation to postfix notation. The Stack class implements push and pop methods to add and remove items from a stack. The Converter class uses a Stack instance as an operator stack. It iterates through the infix expression, adding operands to the postfix string and operators to the stack. When it encounters a closing parenthesis, it pops operators off the stack and adds them to the postfix string until the stack is empty. It returns the completed postfix notation string.

Uploaded by

Henry Dennis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

# the stack class works like a stack

class stack:
def __init__(self):
self.stack = []

def add(self, item):


self.stack.append(item)

def remove(self):
end = self.stack[-1]
self.stack.pop(-1)
return end

# allows iteration backwards through the stack | Magic method


def __iter__(self):
for op in self.stack:
yield self.stack[-1]

def __len__(self):
return len(self.stack)

def print(self):
pro = ", ".join(self.stack)
print(f"Stack: {pro}")

# the actual code


class converter:
def __init__(self, infix):
self.operator_stack = stack()
#self.b_depth = 0
self.infix = infix
self.operators = ["+", "-", "*", "/", "^","×", "÷", "−"]
self.postfix = ""

# the func
def convert(self):
for char in self.infix:
if char == "(":
pass
#self.b_depth += 1

# how it works is when theres a ) it empties the stack onto the


# postfix expression if theres items in the stack
elif char == ")":
#self.b_depth -= 1
if len(self.operator_stack) > 0:

for i in range(len(self.operator_stack)):
self.postfix = self.postfix + " " +
self.operator_stack.remove()

# adds operator to the stack


elif char in self.operators:
self.operator_stack.add(char)
self.postfix = self.postfix + " "
elif char == " ":
pass
# if its an operand add to the postfix
else:
self.postfix = self.postfix + char

return self.postfix

# place where its executed


if __name__ == "__main__":

# example input
# print(converter("((15 ÷ (7 − (1 + 1))) × 3) − (2 + (1 + 1))").convert())

print(converter(input("Enter Infix expression: ")).convert())

# Working one hundred billion percent correctly !!

You might also like