A Turing Machine compiler.
This compiler compiles a pseudo-assembly like description of a machine into a list of transitions runnable on a TM simulator. In other words, it makes it easier to write Turing Machines.
- Programmatic generation of Turing Machines
- Persistent bits of "memory" through conditional flags
- State labels and fall-through transitions
- Write a description of a machine using the
compile
function (see palindrome.py for an example) - Run the script you've written (
python3 palindrome.py
) - Paste the output into a TM simulator
Written during UNSW's COMP4141 course.