算术表达式求值实习报告.docVIP

算术表达式求值实习报告 The information that is worth having It comes from the general learning accumulation summary There must be a problem Please be critical! Arithmetic expressions evaluate the internship report Class no.052415 zhu bokai One, requirements analysis the program needs users to input expression (operator can be a plus (+), minus (-), multiply (*), in addition to (/), power ():the parentheses (())) The number can be an integer or a float Press enter to finish! program function: computation of arithmetic expressions The output And output its postfix expression! test data: 8; 1 + 2 + 3 + 4; 88-1 * 3; 1024/8 * 16; 1024 / (8 * 16); (22 + 3) * (8/2); The 3-3-3; 8 / (9-9); 2 times 5 plus 3 times 2 plus 4 times 3 plus 6. Second, profile design To implement the above program functions The Numbers and operators in the expression should be stored separately from the stack of two leading nodes The abstract data type definition of the stack ADT Stack { The data object: 〃d 二{ai | ai, 〃 the 〃I 二 1, 2, 3, 〃??? n N p 0} Data relations: r = {ai - 1, ai,) | ai -1, ai unit d, 1 = 2, 3,… N} Contract al is the bottom of the stack The an is the top Basic operation: InitStack ( S) Operation result: construct an empty stack S DestroyStack ( S) Initial conditions: stack S already exists Operation result: destroy stack S ClearStack ( S) Initial conditions: stack S already exists The result: empty the stack as an empty stack StackEmpty ( S) Initial conditions: stack S already exists Operation result: if stack S is empty stack It returns TRUE, Otherwise, FALSE StackLength ( S) Initial conditions: stack S already exists Operation result: return the length of the stack (or depth) GetTop (S e) Initial conditions: stack S is already present and not empty Operation result: the stack top element of S returned with e Push ( S, e) Initial conditions: stack S already exists Operation result: insert new element e at the top of the stack Pop ( S, e) Initial conditions: stack S is already