《数据结构与算法》Chap3 stack.pptVIP

* In order to convert decimal to binary, we can divide decimal number and successive quotients by 2 continuously and record the remainders until the quotient becomes 0, then we print the remainders in backward order. Stack is an ideal structure to implement this process. While calculating the quotients and remainders, we can push the remainders into a stack. After finishing calculating, we can pop up the remainders and remainders will be naturally in backward order. quotient * Parsing is any logic that breaks data into independent pieces for further processing. For example: to translate a source program to machine language , the compiler must parse the program into individual parts Such as keywords, names and tokens . It must check that if the sentence is correctness of syntax also , parentheses pairs is one of these. * * An arithmetic expression can be expressed in three different ways. Infix, prefix, and postfix. In source program, it is often expressed with infix format, but before an expression is calculated in computer, it is usually transformed into postfix expressions. * Infix notation: the operator comes between the two operands—need to use parentheses to control the evaluation of the operators Postfix notation: the operator comes after its two operands : Not need to use parentheses Prefix notation: the operator comes before its two operands : Not need to use parentheses * arithmetic precedence-multiply and divide before add and subtract. * When we need to push an operator into the stack, if its priority is higher than the operator at the top of the stack, we go ahead and push it into the stack. Conversely, if the operator at the top of the stack has a higher priority than or equal to the current operator, it is popped and placed in the output expression. * Read each item in an infix expression from left to right until to the end of the infix expression, according to the type of item take following different action: 1. If the item is an open pare