final changes and complex code testing

fibonacci and factorial and changes in readme and html

Author: HrishikeshGawasIIITH

README.md

@@ -9,7 +9,16 @@ cd sequential
 chmod +x test_sequential.sh
 ./test_sequential.sh <filename>.s
 ```
+Based on the provided code, I'll summarize the assembler's functions and features for assembly code processing:
 
+## Assembly Instructions Supported
+
+The assembler supports a subset of RISC-V instructions:
+- **R-type**: `add`, `sub`, `or`, `and`
+- **I-type**: `addi`, `ld` (load doubleword)
+- **S-type**: `sd` (store doubleword)
+- **B-type**: `beq` (branch if equal)
+- **Special**: `nop` (no operation)
 
 NOTES: 
 - `ld` and `sd` are used to load and store double words. But, they use the same instructions as `lw` and `sw` that are not implemented in this version.

sequential/testcases/11.s

@@ -0,0 +1,22 @@
+start:
+    addi x10, x0, 10    # Load n
+    addi x11, x0, 0     # x11 = 0 (Fib(0))
+    addi x12, x0, 1     # x12 = 1 (Fib(1))
+    beq x10, x0, done   # If n == 0, return Fib(0)
+    addi x10, x10, -1   # Decrement n by 1 to account for Fib(1)
+    beq x10, x0, done1  # If n == 1, return Fib(1)
+
+loop:
+    add x13, x11, x12   # x13 = x11 + x12 (Fib(n) = Fib(n-1) + Fib(n-2))
+    add x11, x12, x0    # x11 = x12 (shift Fib(n-1) to Fib(n-2))
+    add x12, x13, x0    # x12 = x13 (shift Fib(n) to Fib(n-1))
+    addi x10, x10, -1   # Decrement n
+    beq x10, x0, done1  # Repeat until n == 0
+    beq x0, x0, loop
+
+done1:
+    add x13, x12, x0    # Return Fib(1)
+
+done:
+    # x13 holds the Fibonacci result
+    nop

sequential/testcases/12.s

@@ -0,0 +1,24 @@
+start:
+    addi x10, x0, 10  # Load n
+    addi x11, x0, 1   # x11 = 1 (accumulator for factorial)
+    beq x10, x0, done # If n == 0, factorial is 1
+
+loop:
+    add x12, x0, x11  # x12 = x11 (initialize for multiplication)
+    add x13, x0, x10  # x13 = x10 (multiplier counter)
+    addi x11, x0, 0   # Reset x11 to 0
+
+mul_loop:
+    beq x13, x0, end_mul # If x13 == 0, end multiplication
+    add x11, x11, x12    # x11 = x11 + x12 (multiplication by addition)
+    addi x13, x13, -1    # Decrement multiplier counter
+    beq x0, x0, mul_loop # Continue multiplication loop
+
+end_mul:
+    addi x10, x10, -1 # Decrement x10 by 1
+    beq x10, x0, done # If x10 != 0, repeat loop
+    beq x0, x0, loop
+
+done:
+    # x11 holds the factorial result
+    nop               # End program (can replace with ecall to exit in real environment)

sequential/visualization/index.html

@@ -17,8 +17,9 @@ <h1>RISC-V CPU Visualizer</h1>
                 <button id="play-pause">Play</button>
                 <select id="speed">
                     <option value="1000">1x Speed</option>
-                    <option value="500">2x Speed</option>
                     <option value="200">5x Speed</option>
+                    <option value="100">10x Speed</option>
+                    <option value="20">50x Speed</option>
                 </select>
             </div>
         </div>