$.$section $.$data

input$\_$prompt: $.$asciz "Please enter a number between $1$ and $10$

$"$

input$\_$spec: $.$asciz $"\%$d$"$

fib: $.$asciz $"\%$d

$"$

oob$\_$mess: $.$asciz "Input is out of bounds

$"$

$.$section $.$text

$.$global main

main:

$//$ Print greeting and ask for n between $1-10$

ldr x$0,=$input$\_$prompt

bl printf

sub sp$,$ sp$,$ #$16//$ Allocate stack space for input $(8$ bytes aligned to $16$ bytes$)$

$//$ Read inputted number

ldr x$1,=$input$\_$spec

mov x$0,$ sp $//$ Use stack space to store input

bl scanf

$//$ Check for out of bound input

ldr x$2,[$sp$]//$ Load the inputted number from stack

$//$ Compare if value inputted is less than $1$

cmp x$2,$ #$1$

blt checkOutOfBounds

$//$ Compare if value inputted is greater than $10$

cmp x$2,$ #$10$

bgt checkOutOfBounds

$//$ Calculate Fibonacci and print result

mov x$0,$ x$2$

bl recurse

$//$ Print the result

ldr x$1,=$fib

bl printf

b exit

checkOutOfBounds:

ldr x$0,=$oob$\_$mess

bl printf

b exit

base$\_$case$\_1$:

mov x$0,$ #$0$

ret

base$\_$case$\_2$:

mov x$0,$ #$1$

ret

recurse:

subs x$9,$ x$0,$ #$1$

B$.$GT recurse

cmp x$0,$ #$1$

beq base$\_$case$\_1$

cmp x$0,$ #$2$

beq base$\_$case$\_2$

$//$ Allocate stack space for call with n$-1$

sub sp$,$ sp$,$ #$16$

str x$30,[$sp$,$ #$8]$

str x$0,[$sp$]$

sub x$0,$ x$0,$ #$2$

bl recurse

$//$ Load result from fibonacci$($n$-2)$ into x$2$

str x$0,[$sp$,$ #$8]$

ldr x$0,[$sp$]$

ldr x$30,[$sp$,$ #$8]$

add sp$,$ sp$,$ #$16$

sub x$0,$ x$0,$ #$1$

bl recurse

add x$0,$ x$0,$ x$2$

ret

exit:

mov x$0,$ #$0$

mov x$8,$ #$93$

svc #$0$

It is a fibonacci sequence procedure fib$($argument: n$)$

return fib$($n$-2)+$fib$($n$-1)$

$1$should return $0($base case$)$

$2$should return $1($base case$)$

$3$should return $1$

$4$should return $2$

$5$should return $3$

$6$should return $5$

$7$should return $8$

$8$should return $13$

$9$should return $21$

$10$should return $34$

For some reason the program is printing the "Please enter a number"... then automatically printing "Input is out of bounds and quitting" I think that is my error. Should I have a seperate fibonacci function and then calling the recurse? How so$?$