(ab-(c+d/e^f)-g)h

Write an algorithm Conversion () to convert infix expression into prefix expression

Given expression is (ab-(c+d/e^f)-g)h

Following is the above infix expression enclosed in brackets:

((ab-(c+d/e^f)-g)h)

1. Conversion from infix to postfix:

Thus, the postfix expression is: abcdef^/+-g-h

2. Conversion from infix to prefix :

Reverse the given expression string to obtain h(g-(f^e/d+c)-ba). Enclosing the reversed string in brackets to obtain (h(g-(f^e/d+c)-ba))

Calculating the postfix expression of the reversed expression:

Thus, the postfix expression obtained is: hgfe^d/c+-ba-

Reversing the postfix expression obtained gives the prefix expression.

Prefix expression: -ab-+c/d^efgh

Algorithm to convert from infix to prefix:

1. START
2. INPUT the expression EXPR from the user.
3. Reverse the EXPR obtained in step 1 to obtain REVEXPR. While reversing the string interchange the right and left parentheses. REVEXPR → REVERSE(EXPR)
4. Calculate the POSTFIX expression of the reversed string. POSTFIXEXPR → POSTFIX(REVEXPR)
5. Reverse the POSTFIXEXPR to obtain the Prefix expression PREFIXEXPR. PREFIXEXPR→ REVERSE(POSTFIXEXPR)
6. STOP