Q. Write down an algorithm to evaluate an expression given to you in postfix notation. Show the execution of your algorithm for the following given expression.

AB^CD-EF/GH+/+*                                                                               

Ans.

Algorithm to evaluate Post fix Expression is shown as follows

 

Opndstk = the empty stack;

/*scan the input string reading one */

/*element at a time into symb */

while ( not end of input){

symb  = next input character;

if (symb is an operand)

push (opndstk, symb);

else

{

/* symb is an operator */

opnd 2 = Pop (opnd stk);

opnd 1 = Pop (opnd stk);

value = result of applying symb to opnd 1 and opnd 2;

push (opndstk,value);

}/*end else */

}/*end while */

return (pop (opnd stk));

AB^CD-EF/GH+/+*

Symb	Opnd1	Opnd2	Value	Opndstk
A				A
B				A,B
^	A	B	A^B	A^B
C	A	B	A^B	A^B,C
D	A	B	A^B	A^B,C,D
-	C	D	C-D	A^B,C-D
E	C	D	C-D	A^B,C-D,E
F	C	D	C-D	A^B,C-D,E,F
/	E	F	E/F	A^B,C-D,E/F
G	E	F	E/F	A^B,C-D,E/F,G
H	E	F	E/F	A^B,C-D,E/F,G,H
+	G	H	G+H	A^B,C-D,E/F,G+H
/	E/F	G+H	(E/F)/(G+H)	A^B,C-D, (E/F) /(G+H)
+	C-D	(E/F)/(G+H)	(C-D)+(E/F)/(G+H)	A^B,(C-D)+ (E/F)/(G+H)
*	A^B	(C- D)+(E/F)/(G+H)	A^B*((C-D)+ (E/F)/(G+H))	A^B*((C-D)+ (E/F)/(G+H))

Posted Date: 7/13/2012 1:53:38 AM | Location : United States

Ask an Expert

Related Discussions:- Algorithm to evaluate expression given in postfix notation , Assignment Help, Ask Question on Algorithm to evaluate expression given in postfix notation , Get Answer, Expert's Help, Algorithm to evaluate expression given in postfix notation Discussions

Write discussion on Algorithm to evaluate expression given in postfix notation
Your posts are moderated

Write your message here..

Related Questions

Procedures, what is far and near procedures in system programming? what is far and near procedures in system programming?

Single pointer pointing to the tail of the queue, Can a Queue be shown by c... Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p

Frequency count, i:=1 while(i { x:=x+1; i:=i+1; } i:=1 while(i { x:=x+1; i:=i+1; }

Depth first search, DEPTH FIRST SEARCH (DFS) The approach adopted into ... DEPTH FIRST SEARCH (DFS) The approach adopted into depth first search is to search deeper whenever possible. This algorithm frequently searches deeper through visiting unvisite

Representation of arrays?, A representation of an array structure is a mapp... A representation of an array structure is a mapping of the (abstract) array with elements of type T onto the store which is an array with elements of type BYTE. The array could be

Functions and modelling the data flows, Read the scenario (Pickerings Prope... Read the scenario (Pickerings Properties). (a) List the functions of the system, as perceived by an external user. (b) List the external entities. Note that because we are mo

Basic organization of computer system, what happen''s in my computer when ... what happen''s in my computer when i input any passage

Introduction, what are avl trees what are avl trees

Stacks, Q. Explain w hat are the stacks? How can we use the stacks  to chec... Q. Explain w hat are the stacks? How can we use the stacks  to check whether an expression is correctly parentheses or not. For example (()) is well formed but (() or )()( is not w

Multidimensional array, Q. The system allocates the memory for any of the m... Q. The system allocates the memory for any of the multidimensional array from a big single dimensional array. Describe two mapping schemes that help us to store the two dimensi