KEMBAR78
Stack Applications | PDF | Algorithms And Data Structures | Computer Engineering
Scribd
Upload
49 views6 pages

Stack Applications

This document discusses stacks and their applications in converting infix, postfix, and prefix notations. It provides examples of converting infix expressions to postfix expressions using a stack. An algorithm is presented for evaluating postfix expressions using a stack to hold operands. Finally, an algorithm is described for converting infix expressions to postfix expressions using precedence rules and a stack.

Uploaded by

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

Stack Applications

This document discusses stacks and their applications in converting infix, postfix, and prefix notations. It provides examples of converting infix expressions to postfix expressions using a stack. An algorithm is presented for evaluating postfix expressions using a stack to hold operands. Finally, an algorithm is described for converting infix expressions to postfix expressions using precedence rules and a stack.

Uploaded by

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

Data Structures & Algorithms

Stack Applications
Data Structures & Algorithms

Example of Stacks
INFIX, POSTFIX and PREFIX
– Infix: A+B-C
– Postfix: AB+C-
– Prefix: -+ABC

Order of Precedence of Operators


– Parenthesis
– Exponentiation
– Multiplication/Division
– Addition/Subtraction
Data Structures & Algorithms

Infix: ( (A+B)*C-(D-E) ) $ (F+G)


Conversion to Postfix Expression

• ( (AB+)*C-(DE-) ) $ (FG+)
• ( (AB+C*)-(DE-) ) $ (FG+)
• (AB+C*DE--) $ (FG+)
• AB+C*DE- -FG+$

Exercise: Convert the following to Postfix


• ( A + B ) * ( C – D)
• A $ B * C – D + E / F / (G + H)
Data Structures & Algorithms

Conversion to Prefix Expression


The precedence rules for converting an expression from infix to prefix are identical. The
only change from postfix is that the operator is placed before the operands rather than after
them.

Evaluating a Postfix Expression


Each operator in a postfix string refers to the previous two operands in the string.
Data Structures & Algorithms
Algorithm to Evaluate a Postfix Expression

opndstk = the empty stack Example:


/* scan the input string reading one element */ Postfix Expression: 6 2 3 + - 3 8 2 / + * 2 $ 3 +
/* at a time into symb */ symb opnd1 opnd2 value opndstk
while (not end of input) { 6 6
symb = next input character; 2 6,2
if (symb is an operand)
3 6,2,3
push(opndstk, symb)
else { + 2 3 5 6,5

/* symb is an operator */ - 6 5 1 1

opnd1 = pop(opndstk); 3 6 5 1 1,3

opnd2 = pop(opndstk); 8 6 5 1 1,3,8


value = opnd2 OPERATOR opnd1; 2 6 5 1 1,3,8,2
push(opndstk, value); / 8 2 4 1,3,4
} /* end else */ + 3 4 7 1,7
} /* end while */ * 1 7 7 7
return (pop(opndstk));
2 1 7 7 7,2

$ 7 2 49 49

3 7 2 49 49,3

+ 49 3 52 52
Data Structures & Algorithms

Algorithm to Convert Infix to Postfix


Q is the Expression in infix
P is the output in postfix

1. PUSH “(“ on to the STACK and add “)” at end of Q


2. Scan Q from Left to Right repeat step 3-6 for each element of Q until STACK is
empty
3. If an operand is encountered add it to P
4. If a Left parenthesis is encountered push it on to STACK
5. If an operator X is encountered then:
a) Repeatedly pop from STACK and add to P each operator which has
same or higher precedence than X
b) Add X to STACK
6. If a right parenthesis is encountered then
a) Repeatedly pop from STACK and add to P each operator until a left
parenthesis is encountered
b)Remove the left parenthesis.
7. Exit

Consider an Example: Q: A + ( B * C - ( D / E ^ F ) * G ) * H

You might also like