Question

The task will be to write a program in assembler to enter a number and calculate its associated Fibonacci number using a procedure (subroutine) that is called recursively.

Factorial and Fibonacci(outline Programs)

# MIPS assembly assembly assemblyassemblycode

.data

n: .word 4

.text

main: la $s0,n

lw $a0, 0($s0)

jal factorial

# move what ever is returned into $a0

move $a0, $v0

li $v0,1

syscall

b finished

factorial: add $sp , $sp , -8 # make room

sw $a0, 4($sp ) # store $

sw $ra 0($sp ) # store $ra

add $t0, $0, 2

slt $t0, $a0, $t0 # a <= 1 ?

beq $t0, 0, else # no : go to else

addi $v0, $0, 1 # yes : return 1

addi $sp , $sp , 8 # restore $sp

jr $ra # return

else: add $a0, $a0, -1 # n = -1

jal factorial # recursive call

lw $ra , 0($sp ) # restore restore restore $ra

lw $a0, 4($sp ) # restore restore restore $a0

addi $sp , $sp , 8 # restore restore restore $sp

mul $v0, $a0, $v0 # n * factorialfactorial

#add $v0, $a0, $v0 # n * factorialfactorial

jr $ra # return

finished:

# Fibanocci numbers

# Note any value above 46 will generate an overflow.

please help me finish it, there are three places need to add some code

Answer 1

# MIPS assembly assembly assemblyassemblycode

.data

n: .word 4

.text

main: la $s0,n

lw $a0, 0($s0)

jal factorial

# move what ever is returned into $a0

move $a0, $v0

li $v0,1

syscall

b finished

factorial: add $sp , $sp , -8 # make room

sw $a0, 4($sp ) # store $

sw $ra 0($sp ) # store $ra

add $t0, $0, 2

slt $t0, $a0, $t0 # a <= 1 ?

beq $t0, 0, else # no : go to else

addi $v0, $0, 1 # yes : return 1

addi $sp , $sp , 8 # restore $sp

jr $ra # return

else: add $a0, $a0, -1 # n = -1

jal factorial # recursive call

lw $ra , 0($sp ) # restore restore restore $ra

lw $a0, 4($sp ) # restore restore restore $a0

addi $sp , $sp , 8 # restore restore restore $sp

mul $v0, $a0, $v0 # n * factorialfactorial

#add $v0, $a0, $v0 # n * factorialfactorial

jr $ra # return

finished:

# Fibanocci numbers

# Note any value above 46 will generate an overflow.