any help would be appreciated, thank you!

Write a MIPS program to remove a given element from an array.

Below is an example of the C code segment to perform the above task. You may use a different code, but you have to write the code that you use as a comment before the MIPS code.

$//$ Declaration of variables

int$*$ A; $//$ Base address of array A

int n; $//$ Length of the array A

int val; $//$ Given value to be removed from array

$//$ Remove elements equal to val

int i $=0$;

while $($i $<$ n$)\{$

if $($A$[$i$]!=$ val$)//$ If no match, proceed with next element

i$++$;

else $\{$

for $($int k $=$ i; k $<$ n $-1$; k$++)//$ Shift elements if a match is found

A$[$k$]=$ A$[$k$+1]$;

n $=$ n $-1$; $//$ if element deleted, length of array decreases

Registers Variables

$s$0$ A

$s$1$ n

$s$2$ val

Addresses Contents

$s$0$ A$[0]$

$s$0+4$ A$[1]$

$s$0+8$ A$[2]$

$......$

$s$0+4*($n$-1)$ A$[$n$-1]$

You may use any temporary registers from $t$0$ to $t$9$ or saved registers from $s$3$ to $s$7.$ Clearly specify your choice of registers and explain your code using comments.

Example Test: If the values of $s$0$ through $s$2$ and array elements are initialized in the simulator as:

$($Use the $\text{'}+\text{'}$ button under the Registers display to initialize register values for $s$0,$ $s$1,$ $s$2$ and the $\text{'}+\text{'}$ button under the Memory display to initialize the initial array elements.$)$

Registers Data

$s$04000$

$s$110$

$s$2-15$

Addresses Contents

$40004$

$40048$

$4008-15$

$40125$

$4016-10$

$4020-15$

$40240$

$4028-15$

$403240$

$4036-15$

The resultant registers are:

Registers Data

$s$04000$

$s$16$

$s$2-15$

The resultant array is:

Addresses Contents

$40004$

$40048$

$40085$

$4012-10$

$40160$

$402040$

Note: Only the registers $s$0,$ $s$1,$ $s$2$ and the first $\text{'}$$s$1\text{'}$ elements in memory will be checked by the automated tests.

This is what i have so far, but it wont compile:

# Change the C code here if you have used something different from the one given.

#int i $=0$;

#while $($i $<$ n$)\{$

# if $($A$[$i$]!=$ val$)//$ If no match, proceed with next element

# i$++$;

# else $\{$

# for $($int k $=$ i; k $<$ n $-1$; k$++)//$ Shift elements if a match is found

# A$[$k$]=$ A$[$k$+1]$;

# n $=$ n $-1$; $//$ if element deleted, length of array decreases

# $\}$

#$\}$

# Enter your MIPS code below.

# Write short comments explaining

# each line of your code

# Explain your use of labels

# MIPS code to remove a given element from an array

# Register usage:

# $s$0-$ base address of array A

# $s$1-$ length of array A $($n$)$

# $s$2-$ value to be removed from array $($val$)$

# $t$0-$ index i

# $t$1-$ inner loop index k

# $t$2-$ temporary value for comparison

# $t$3,$ $t$4,$ $t$5-$ temporary registers for calculations

# Initialize index i to $0$

addi $t$0,$ $zero, $0$ # i $=0$

loop:

# Check if i $>=$ n

bge $t$0,$ $s$1,$ end$\_$loop # if i $>=$ n$,$ exit loop

# Load A$[$i$]$ into $t$2$

sll $t$3,$ $t$0,2$ # t$3=$ i $*4($calculate offset$)$

add $t$4,$ $s$0,$ $t$3$ # t$4=$ base$\_$address $+$ offset $($address of A$[$i$])$

lw $t$2,0($$t$4)$ # t$2=$ A$[$i$]$

# Compare A$[$i$]$ with val

bne $t$2,$ $s$2,$ next # if A$[$i$]!=$ val, skip to next iteration

# If A$[$i$]==$ val, shift elements to the left

add $t$1,$ $t$0,1$ # k $=$ i $+1$

shift$\_$loop:

# Check if k $>=$ n

bge $t$1,$ $s$1,$ update$\_$length # if k $>=$ n$,$ exit shift loop

# Load A$[$k$]$ into $t$2$

sll $t$3,$ $t$1,2$ # t$3=$ k $*4($calculate offset$)$

add $t$4,$ $s$0,$ $t$3$ # t$4=$ base$\_$address $+$ offset $($address of A$[$k$])$

lw $t$2,0($$t$4)$ # t$2=$ A$[$k$]$

# Store A$[$k$]$ at A$[$k$-1]$

sub $t$5,$ $t$1,1$ # t$5=$ k $-1$

sll $t$3,$ $t$5,2$ # t$3=($k$-1)*4($calculate offset$)$

add $t$4,$ $s$0,$ $t$3$ # t$4=$ base$\_$address $+$ offset $($address of A$[$k$-1])$

sw $t$2,0($$t$4)$ # A$[$k$-1]=$ A$[$k$]$

# Increment k

addi $t$1,$ $t$1,1$ # k $=$ k $+1$

j shift$\_$loop # repeat shift loop

update$\_$length:

# Decrease the length of the array

addi $s$1,$ $s$1,-1$ # n $=$ n $-1$

# Do not increment i since elements are shifted

j loop # repeat main loop

next:

# Increment i

addi $t$0,$ $t$0,1$ # i $=$ i $+1$

j loop # repeat main loop

end$\_$loop:

# End of program, infinite loop to terminate

j end$\_$loop # stay in end loop