This repository is meant to collect some useful tools for the lecture "Berechenbarkeit und Komplexität". It is planned to include an interpreter for the following Turing-complete models:
- while
- Turingmachines
- ...
Note that this is only for educational purposes and not safe to use for anything but playing around with (and even for this I can not give any guarantees...!). Thus, proceed at your own risk.
The while interpreter can be build with make while
and produces an executable
whint
in the while
subdirectory. This executable takes as first argument
the path to a while program (see while/progs
for examples) and all following
paramters are parsed as inputs to the program and stored in the starting
registers.