Question

Compiling a recursive C procedure, showing nested procedure linking. Let's tackle a recursive procedure that calculates factorial: long long int fact (long long int n) { if (n < 1) return (1); else return (n * fact(n - 1)); } If n= 3, analyze and evaluate the MIPS code line by line and fill in the stack behavior throughout the code. Fact: addi $sp, $sp, -8 sw $ra, 4($sp) sw $a0, 0($sp) slti $t0, $a0,1 beq $t0, $zero, L1 addi $v0, $zero, 1 addi $sp, $sp,8 jr $ra L1: addi $a0,$a0,-1 jal fact lw $a0, 0($sp) lw $ra, 4($sp) addi $sp, $sp, 8 mul $v0, $a0, $v0 jr $ra

          Compiling a recursive C procedure, showing nested procedure linking.
Let's tackle a recursive procedure that calculates factorial:
long long int fact (long long int n)
{
if (n < 1) return (1);
else return (n * fact(n - 1));
}
If n= 3, analyze and evaluate the MIPS code line by line and fill in the stack behavior
throughout the code.
Fact:
addi $sp, $sp, -8
sw $ra, 4($sp)
sw $a0, 0($sp)
slti $t0, $a0,1
beq $t0, $zero, L1
addi $v0, $zero, 1
addi $sp, $sp,8
jr $ra
L1:
addi $a0,$a0,-1
jal fact
lw $a0, 0($sp)
lw $ra, 4($sp)
addi $sp, $sp, 8
mul $v0, $a0, $v0
jr $ra

Compiling a recursive C procedure, showing nested procedure linking.
Let's tackle a recursive procedure that calculates factorial:
long long int fact (long long int n)

if (n < 1) return (1);
else return (n * fact(n - 1));

If n= 3, analyze and evaluate the MIPS code line by line and fill in the stack behavior
throughout the code.
Fact:
addi sp,sp, -8
sw ra, 4(sp)
sw a0, 0(sp)
slti t0,a0,1
beq t0,zero, L1
addi v0,zero, 1
addi sp,sp,8
jr ra
L1:
addia0,a0,-1
jal fact
lwa0, 0(sp)
lwra, 4(sp)
addisp, sp, 8
mulv0, a0,v0
jr ra

Added by Penny S.

Question

Please give Ace some feedback