Infix-to-Prefix-Convertion-by-Python
def isOperator(c): return (not (c >= 'a' and c <= 'z') and not(c >= '0' and c <= '9') and not(c >= 'A' and c <= 'Z'))
def getPriority(C): if (C == '-' or C == '+'): return 1 elif (C == '*' or C == '/'): return 2 elif (C == '^'): return 3 return 0
def infixToPrefix(infix): operators = [] operands = []
for i in range(len(infix)):
if (infix[i] == '(' ):
operators.append(infix[i])
elif (infix[i] == ')'):
while (len(operators)!=0 and (operators[-1] != '(' )):
op1 = operands[-1]
operands.pop()
op2 = operands[-1]
operands.pop()
op = operators[-1]
operators.pop()
tmp = op + op2 + op1
operands.append(tmp)
operators.pop()
elif (not isOperator(infix[i])):
operands.append(infix[i] + "")
else:
while (len(operators)!=0 and getPriority(infix[i]) <= getPriority(operators[-1])):
op1 = operands[-1]
operands.pop()
op2 = operands[-1]
operands.pop()
op = operators[-1]
operators.pop()
tmp = op + op2 + op1
operands.append(tmp)
operators.append(infix[i])
while (len(operators)!=0):
op1 = operands[-1]
operands.pop()
op2 = operands[-1]
operands.pop()
op = operators[-1]
operators.pop()
tmp = op + op2 + op1
operands.append(tmp)
return operands[-1]
while(1): s = input("Infix Expression : ") print("Prefix Expression : ", infixToPrefix(s))
Step 1: Reverse the infix string. Note that while reversing the string you must interchange left and right parentheses. Step 2: Obtain the postfix expression of the infix expression Step 1. Step 3: Reverse the postfix expression to get the prefix expression
1 Apr 12, 2022
70 Dec 20, 2022
33 Dec 14, 2022
1 Jan 24, 2022
2 May 04, 2022
186 Jan 05, 2023
1 Nov 06, 2021
12.9k Jan 09, 2023
9 Jun 07, 2022
6 Dec 14, 2022
4 May 23, 2022
1 Feb 12, 2022
54 Dec 21, 2022
74 Jan 04, 2023
3 May 04, 2022
3 Sep 22, 2022
10 Dec 27, 2022
28 Oct 05, 2022
7 Aug 19, 2022
3 Feb 11, 2022