-
Almost everything split up into classes.
-
Turing machine can be started and can perform actions included in given rules.
-
First version of virtual "infinite" tape.
Basic functionalities have been addedd:
-
Reading machine states in specific syntax.
- Dynamic interpretation can recognize and throw simple syntax errors.
- Verbose mode for informational use.
- States and characters dynamic creation (without knowing them all in the beginning).
- Virtual Turing Machine containing all states with defined rules.
-
Source can be read from file or in the interactive mode.
- Errors stop interpretation when interpreting a file, unlike in the interactive mode.
-
Simple useful options including line echo and state board printing.
- For now, board viewing only makes sense with one-character states or alphabet members.