$.$data

string: $.$asciiz "level"

result: $.$word $0$

$.$text

$.$globl main

main:

#Step $1=$ Calculate length of the string

la $t$0,$ string #load address of string into $t$0$

move $t$1,$ zero #initlialize lenngth counter $t$1$ to $0$

find$\_$length:

lb $t$2,0($$t$0)$ #load byte at address in $t$0$ into $t$2$

beq $t$2,$ $zero, check$\_$palindrome #If t$2$ is $0,$ end of string go to palindrome check

addi $t$0,$ $t$0,1$ #increment address pointer

addi $t$1,$ $t$1,1$ #increment length counter

j find$\_$length #jump back to continue finding length

check$\_$palindrome:

move $t$3,$ $t$1$ #move length into $t$3$ for calculations

la $t$4,$ string #load address of the string into $t$4$

add $t$5,$ $t$4,$ $t$3$ #set $t$5$ to point the last character of string

subi $t$5,$ $t$5,1$ #Adjust for zero based index

li $t$6,1$ #assume palindrome initially, store $1$ in $t$6$

compare$\_$loop:

blt $t$4,$ $t$5,$ continue$\_$compare #If start pointer is less than end poiner, continune

j finish #finish the check

continue$\_$compare:

lb $t$7,0($$t$4)$ #load character at start pointer

lb $t$8,0($$t$5)$ #load character at end pointer

bne $t$7,$ $t$8,$ not$\_$palindrome #if characters dont match, its not palindrome

addi $t$4,$ $t$4,1$ #move start pointer right

subi $t$5,$ $t$5,1$ #move end pointer left

j compare$\_$loop #jump back to start of the loop

not$\_$palindrome:

li $t$6,0$ #set result to $0$

finish:

sw $t$6,$ result #store result in memory

li $v$0,10$ #load exit syscall

syscall #exit program

What is false in that code got syntax error always