From 6002c9fb13f0b4caf661e94c0527b0a86cf04488 Mon Sep 17 00:00:00 2001
From: Joscha <joscha@plugh.de>
Date: Mon, 11 Nov 2019 11:19:43 +0000
Subject: [PATCH] Update comments

---
 examples/fib.mimasm | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/examples/fib.mimasm b/examples/fib.mimasm
index 0d8d6b4..b8552c0 100644
--- a/examples/fib.mimasm
+++ b/examples/fib.mimasm
@@ -25,32 +25,32 @@ main:
   STSP
   
   main-loop:
-  ; while (current-number != max-number)
+  ; while (current-number != max-number) {
   LDV current-number
   EQL max-number
-  JMN main-halt
+  JMN main-loop-end
   
-  ; *ptr = fib(current-number)
+  ; *ptr = fib(current-number);
   LDV current-number
   STRS 1
   CALL fib
   LDV tmp1
   STIV ptr
   
-  ; current-number++
+  ; current-number++;
   LDV current-number
   ADC 1
   STV current-number
 
-  ; ptr++
+  ; ptr++;
   LDV ptr
   ADC 1
   STV ptr
   
-  ; Aaand loop
+  ; }
   JMP main-loop
-  
-  main-halt:
+  main-loop-end:
+
   HALT
 
 ; This function recursively calculates the n-th fibonacci number. It