15-11-2012, 03:59 PM
CONVERSION OF INFIX EXPRESSION TO POSTFIX
CONVERSION OF INFIX EXPRESSION TO POSTFIX.docx (Size: 15.34 KB / Downloads: 23)
Algorithm
STEP 1: Start
STEP 2: Initialize the stack.
STEP 3: While (INSTR!= NULL)
STEP 4: CH= get the character from INSTR.
STEP 5: If( CH= = operand) then
append CH int POSTSTR
else if(CH = = ‘(‘) then
push CH into stack
else if(CH = =’)’) then
pop the data from the stack and append the data into POSTSTR until we get
‘(‘ from the stack
else
while(precedence (TOP) >= precedence (CH))
pop the data from stack and append the data into POSTSTR.
[End of while structure]
[End of if structure]
STEP 6: Push CH into the stack.
STEP 7: [End of second while structure]
STEP 8: pop all the data from stack and append data into POSTSTR.
STEP 9: Stop