mima-tools/examples
2019-11-21 19:16:47 +00:00
..
bench.mima Add example benchmark file 2019-11-18 09:33:16 +00:00
bench.mimasm Add example benchmark file 2019-11-18 09:33:16 +00:00
call_ret.mima Update example files 2019-11-10 18:34:52 +00:00
call_ret.mimasm Add CALL/RET example 2019-11-10 11:22:16 +00:00
call_ret_stack.mima Update example files 2019-11-10 18:34:52 +00:00
call_ret_stack.mimasm Update example files 2019-11-10 18:34:52 +00:00
fib.mima Add fibonacci number example 2019-11-10 21:56:36 +00:00
fib.mimasm Fix typo 2019-11-12 12:17:42 +00:00
jmp_to_address_in_acc.mima Update readme and add example 2019-11-10 11:03:13 +00:00
jmp_to_address_in_acc.mimasm Allow digits in label names 2019-11-10 14:32:55 +00:00
README.md Add readme for examples 2019-11-10 21:57:11 +00:00
stack.mima Make .mima match the .mimasm 2019-11-21 19:16:47 +00:00
stack.mimasm Add missing instructions 2019-11-10 21:08:36 +00:00

Example MiMa programs

This folder contains a few example programs, both as .mimasm and as assembled .mima files.

Basic programs

jmp_to_address_in_acc.mimasm

This program demonstrates two different techniques for jumping to an address that is currently stored in the ACC register.

call_ret.mimasm

This program demonstrates how the CALL and RET instructions behave. It doesn't use any sort of stack, so the call depth is limited to 1.

call_ret_stack.mimasm

This program works similar to call_ret.mimasm, but uses the SP register for a stack. This way, it can have nested CALLs by storing the content of the RA register on the stack.

Advanced programs

stack.mimasm

This program demonstrates the use of stack frames for calling a function and passing parameters. To call a function, it creates a shared stack frame containing the function's input parameters and enough space for its return values.

fib.mimasm

This program calculates the first few fibonacci numbers and stores them in consecutive memory locations. It uses a stack with stack frames and recursive calls according to the following pattern:

int fib(int n) {
    if (n == 0) return 0;
    if (n == 1) return 1;
    return fib(n - 1) + fib(n - 2);
}

This recursive solution for calculating fibonacci numbers is by far not the most efficient, but it demonstrates recursion and stack usage quite well.