Made an example translation of fib.c to the custom assembly (fib.asm)

examples/fib.asm

@@ -0,0 +1,37 @@
+;;; fib.asm: A program that indefinitely generates the fibonacci
+;;; numbers.  Using the registers to store the pairs of fibonacci
+;;; numbers, we ensure only a finite memory space is necessary for
+;;; this program to function, unlike a pure stack version.
+  ;; Setup initial REG[0] = 1 and REG[1] = 1
+  push.word 1
+  mov.word 0
+  push.word 1
+  mov.word 1
+
+  ;; Print REG[0] and REG[1]
+  ;; Here is the loop back point `#`
+  push.reg.word 0
+  print.word
+  push.byte '\n'
+  print.char
+
+  push.reg.word 1
+  print.word
+  push.byte '\n'
+  print.char
+
+  ;;  REG[0] += REG[1]
+  push.reg.word 0
+  push.reg.word 1
+  plus.word
+  mov.word 0
+
+  ;;  REG[1] += REG[0]
+  push.reg.word 0
+  push.reg.word 1
+  plus.word
+  mov.word 1
+
+  ;; Jump to `#`
+  jump.abs 4
+  halt