运算式求值与转换.pptVIP

運算式求值與轉換-stack之應用 Lai Ah Fur 前序式(prefix)求值 處理過程: 由右而左掃描運算式:二種處理方式 (1)由右而左讀取運算元/子 (2)將運算元/子由左而右push到stack,再由stack中pop (順序即為由右而左) 掃描到運算元(0..9),push到stack 掃描到運算子(+-*/),由stack中pop出二元素. 並進行計算,最後將計算結果push到stack 當掃描運算式結束,將由stack中pop出最後運算式結果.若stack中仍有元素表示運算式寫法有誤 前序式求值example *+47-82 處理過程: Scan 2, push into stack Scan 8 , push into stack Scan -, pop 2 operands from stack, then evaluate, finally push the result into stack Scan 7, push into stack Scan 4, push into stack Scan +, pop 2 operands from stack, then evaluate, finally push the result into stack Scan *, pop 2 operands from stack, then evaluate, finally push the result into stack Finally, pop the result from the stack 後序式(postfix)求值 處理過程: 由左而右掃描運算式 掃描到運算元(0..9),push到stack 掃描到運算子(+-*/),由stack中pop出二元素. 並進行計算,最後將計算結果push到stack 當掃描運算式結束,將由stack中pop出最後運算式結果.若stack中仍有元素表示運算式寫法有誤 後序式求值example 47+82-* 處理過程: Scan 4, push into stack Scan 7, push into stack Scan +, pop 2 operands from stack, then evaluate, finally push the result into stack Scan 8, push into stack Scan 2, push into stack Scan -, pop 2 operands from stack, then evaluate, finally push the result into stack Scan *, pop 2 operands from stack, then evaluate, finally push the result into stack Finally, pop the result from the stack 中序式求值example 4+7*8-2 處理過程: Scan 4, push into operand stack Scan +, push into operator stack Scan 7, push into operand stack Scan *,priority:*(目前)+(stack top), push into operator stack Scan 8, push into stack Scan -, priority:-(目前)=*(stack top), pop 2 operands from stack and pop * from operator stack, then evaluate, push the result into operand stack; priority:-(目前)=+(stack top) ,pop 2 operands from stack and pop + from operator stack, then evaluate, push the result into operand stack; finally push – into operator stack. Scan 2, push into stack Scan over, pop 2 operands from stack and pop - from operator stack 自行練習: 3+4*5*6-7-8處理過程 Problem: 未處理“()”問題 中序式(infix)求值(1) 處理過程: 由左而右掃描運算式,且須二個stack 掃描到運算元(0..9),push到operand stack 掃描到運算子(+-*/)