From 0bab4ec014777aa8e409de93ff7d8d4e8fcf490d Mon Sep 17 00:00:00 2001 From: Aryadev Chavali Date: Wed, 1 Nov 2023 16:39:07 +0000 Subject: Made an example translation of fib.c to the custom assembly (fib.asm) --- examples/fib.asm | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 examples/fib.asm (limited to 'examples') diff --git a/examples/fib.asm b/examples/fib.asm new file mode 100644 index 0000000..004a5c3 --- /dev/null +++ b/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 -- cgit v1.2.3-13-gbd6f