$.$global main

$.$section $.$text

main:

@ Initialize registers

mov r$0,$ #$0$ @ Counter for Fibonacci sequence

mov r$1,$ #$1$ @ Current Fibonacci number

mov r$2,$ #$0$ @ Previous Fibonacci number

mov r$3,$ #$6$ @ Number of Fibonacci terms to compute

mov r$4,$ #$0$ @ Loop counter

@ Allocate memory for Fibonacci sequence

ldr r$5,=$fibonacci$\_$sequence

mov r$6,$ #$4$ @ Size of each element in bytes

fibonacci$\_$loop:

@ Store current Fibonacci number in memory

str r$1,[$r$5],$ r$6$

@ Calculate next Fibonacci number

add r$4,$ r$4,$ #$1$ @ Increment loop counter

cmp r$4,$ r$3$ @ Compare loop counter with total terms

beq end$\_$fibonacci @ Exit loop if all terms are computed

@ Calculate next Fibonacci number using recursion

bl fibonacci$\_$recursive

b fibonacci$\_$loop @ Repeat loop

end$\_$fibonacci:

@ Exit program

mov r$7,$ #$1$ @ Exit syscall

mov r$0,$ #$0$ @ Exit status

svc $0$ @ Call kernel

fibonacci$\_$recursive:

@ Recursive Fibonacci calculation

push $\{$lr$\}$ @ Save return address

sub r$3,$ r$3,$ #$1$ @ Decrement term counter

cmp r$3,$ #$1$ @ Check if term is $1$ or $0$

blo one$\_$or$\_$zero

@ Calculate Fibonacci number

mov r$7,$ r$1$

add r$1,$ r$1,$ r$2$ @ F$($n$)=$ F$($n$-1)+$ F$($n$-2)$

mov r$2,$ r$7$ @ Update previous Fibonacci number

@ Restore return address and return

pop $\{$pc$\}$

one$\_$or$\_$zero:

@ Handle base cases $($Fibonacci sequence starts with $0,1)$

mov r$1,$ r$3$ @ Set F$(1)=1$

b end$\_$recursive

end$\_$recursive:

pop $\{$pc$\}$ @ Return from recursive call

$.$section $.$data

fibonacci$\_$sequence:

$.$skip $24$ @ Space for $6$ Fibonacci numbers $(4$ bytes each$)$

the code is not working I tried running it on onlinegdb