91.102-ComputingII.pptVIP

91.102 - Computing II /* InitializeStack: initialize the stack to NULL. Pre: A Stack data structure exists - unknown state. Post: The stack has been initialized to be empty. */ void InitializeStack(Stack *s) { s-ItemList = NULL; } /* MakeNode: make a new node and insert item. Pre: None. Post: A new node with item in it exists. */ StackNode *MakeNode(ItemType item) { StackNode *np; if ((np = malloc(sizeof(StackNode))) == NULL) printf(Exhausted memory.\n); else { np-Item = item; np-Link = NULL; } return np; } 91.102 - Computing II Stacks and Function Calls. The first programming languages provided a mechanism for function call that involved saving the “return address” at some location of the code portion of the function, as well as saving any parameters and local variables in the same way. This meant that a function could not call itself. Why? 1) The initial caller calls the function and a) saves the return address - call it A1 - in the function’s code section at address, say, raF ; b) loads the parameters - call them P1 - in the function’s code section at address, say, pF. 91.102 - Computing II 2) The called function sets up local variables in its own code section at address, say, lvF - and proceeds with execution. There are now two possibilities: A) the function terminates without calling itself either directly or indirectly (by calling some other function that calls IT). In this case, control returns to the caller, the right values are returned and put in the right memory locations and processing continues. B) The function calls itself before terminating. This is where the problems start... Function code A1 Other: Local Vars, etc P1 Function code area 91.102 - Computing II Let’s say that it calls itself at address A2 of its own code section. It then saves this address in location raF (which is part of its own code section), loads the new parameters, etc… The new copy of the function sets up local variables, e