ETeachingSSD5-Notes-2007课件演示火车进站.ppt

Prof. Q.Wang Prof. Qing Wang Chapter 5-1 Stacks Table of Contents Stack Specifications ADT Stacks and Their Implementations Application 1: Bracket Matching Application 2: A Desk Calculator Application 3: Infix Expression to Postfix Summary 5-1.1 Stacks Definition A stack is a kind of special linear list. A stack is a data structure in which all insertions and removals of entries are made at one end, called the top of the stack. LIFO structure: The last entry which was inserted is the first one that will be removed. (Last in first out) Example Concepts Top The specific end of linear list at which elements can inserted and removed. Bottom Another end of the stack. Linked Stack Implementation Question? Two stacks shared in the same array. Initialization. Push entry into stack 1 or stack 2. Pop entry from stacks. Critical conditions Empty Full Overflow Question? n stacks in the same array Quiz How to arrange the carriages? Algorithm: Read the file character by character. Each opening bracket (, [, or { that is encountered is considered as unmatched and is stored until a matching bracket can be found. Any closing bracket ), ], or } must correspond, in bracket style, to the last unmatched opening bracket, which should now be retrieved and removed from storage. Finally, at the end of the program, we must check that no unmatched opening brackets are left over. Bracket Matching Program int main() { Stack openings; char symbol; bool is_matched = true; ? while (is_matched (symbol = cin.get()) != \n) { if (symbol == { || symbol == ( || symbol == [) openings.push(symbol); if (symbol == } || symbol == ) || symbol == ]) { if (openings.empty()) { cout Unmatched closing bracket symbol detected. endl; is_matched = false; } else { char match; openings.top(match); openings.pop(); is_matched = (symbol == } match == {)