Call stacks are used to store the return addresses when a subroutine is called, as well as to hold the parameters passed to the subroutine and the local variables of the subroutine. They are also used for storing temporary results in recursive functions and in expression evaluation. Call stacks are also used in exception handling to store the state of the program when an exception occurs.
Carnegie Mellon University
Spring 2014
A comprehensive course at Carnegie Mellon University that introduces fundamental principles of programming language design and implementation from a mathematical perspective. It delves deep into the structural and dynamic aspects of programming languages, studying concepts like recursion, objects, polymorphism, and parallelism.
No concepts data
+ 38 more concepts