This is a bytecode interpreter I intend to implement into Parvum, a programming language I am creating. The bytecode itself is for a abstract stack machine, which this interpreter simulates. This project contains 2 programs, one for calculating Fibonacci numbers and a bouncing ball, which is already loaded. Features: - Stack operations: push, pop, copy - Memory manipulation: store, load - Branching: goto, conditional jumps - Arithemetic: +, -, *, / - Input/Output system: standard I/O, pen All instructions: (28/09/25) instant, halt, push, pop, copy, memset, memload, goto, branch=, branch<, branch>, bufferstream, send, recieve, add, subtract, multiply, divide, join
