Struct TuringMachine

pub struct TuringMachine {
    pub instructions: HashMap<(String, bool), TuringInstruction>,
    pub final_states: Vec<String>,
    pub current_state: String,
    pub previous_state: Option<String>,
    pub tape_position: usize,
    pub tape: Vec<bool>,
    pub frequencies: HashMap<String, usize>,
    pub description: Option<String>,
    pub composed_libs: Vec<Library>,
    pub code: String,
}

A Turing machine

Fields

instructions: HashMap<(String, bool), TuringInstruction>

The dictionary of instructions for the machine.

final_states: Vec<String>

The final states of the machine. If the machine reaches one of these states, it will stop.

current_state: String

The current state of the machine.

previous_state: Option<String>

The previous state of the machine.

tape_position: usize

The position of the head on the tape.

tape: Vec<bool>

The binary tape of the machine.

frequencies: HashMap<String, usize>

The frequencies of the states. Used to detect infinite loops.

description: Option<String>

The description of the machine. Found in the /// comments at the top of the file.

composed_libs: Vec<Library>

The composed libraries that the machine uses. Used only as information, since their instructions are already compiled into the machine.

code: String

The actual code of the machine. Used for resetting the machine and debugging.

Implementations

impl TuringMachine

pub fn new(code: &str) -> Result<(Self, Vec<CompilerWarning>), CompilerError>

Create a new Turing machine from a string of code

pub fn none() -> Self

Create a new empty Turing machine

pub fn handle_error(error: CompilerError)

Parse a Turing machine code syntax error and print it to the console

pub fn get_current_instruction(&self) -> Option<TuringInstruction>

Gets the current instruction

pub fn is_undefined(&self) -> bool

Returns true if the current state is undefined (i.e. there is no instruction for the current state and value) except if the current state is a final state

pub fn step(&mut self) -> bool

Calculates the next step of the Turing machine and returns true if the current state is a final state

pub fn is_infinite_loop(&self, threshold: usize) -> bool

Returns true if the current state has been reached more times than the given threshold

pub fn reset_frequencies(&mut self)

Resets the frequencies of the states

pub fn finished(&self) -> bool

Returns true if the current state is a final state and the motion is to Halt

pub fn values(&self) -> Vec<u32>

Returns the values of the tape (i.e. the number of 1s between each 0)

pub fn tape_value(&self) -> TuringOutput

Returns the current output of the Turing machine (i.e. the number of steps and the number of 1s on the tape, or undefined if the Turing machine is in an undefined state)

pub fn final_result(&mut self) -> TuringOutput

Returns the final output of the Turing machine directly (i.e. keeps calculating the next step until the current state is a final state)

pub fn get(&self, i: usize) -> Option<bool>

Returns the value of the tape at the given index, or None if the index is out of bounds

Trait Implementations

impl Clone for TuringMachine

fn clone(&self) -> TuringMachine

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TuringMachine

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for TuringMachine

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.