Chapter 2, Problem 2.33E

Explanation of Solution

Content in the stack after function call:

According to the figure 2.11 the content of the stack is performed after the function call. Let assume that the C “n” variable is initialized to 3.

$\begin{array}{l}\text{0x7ffffff0 - \$a0 address}\\ \text{0x7fffffe4 - save return address of caller (n=3)}\\ \text{0x7fffffd8 - \$s0 address}\\ \text{0x7fffffcc - \$a0 address}\\ \text{0x7fffffc0 - in 1st recursive call, save return address }\left(\text{n=2}\right)\\ \text{0x7fffffb4 - \$s0 address}\\ \text{0x7fffffa8 - \$a0 address}\\ \text{0x7fffff9c - in 2nd recursive call, save return address }\left(\text{n=1}\right)\\ \text{0x7fffff90 - \$s0 address}\\ \text{0x7fffffa8 - in 2nd recursive ca}\end{array}$