private bool rejected; // True if the input string was rejected
#endregion
///////////////////////////////////
// Constructor. Takes a string argument which is the general name of
// the definition Turing Machine Definition without any file extensions.
// Both the definition file and the input string file must have this same
// exact name with .def and .str extensions respectively.
///////////////////////////////////
public TuringMachine(string definitionfilename)
{
initial_state = "";
current_state = "";
original_input_string = "";
number_of_transitions = 0;
valid = false;
used = false;
operating = false;
accepted = false;
rejected = false;
tape = new Tape();
final_states = new FinalStates();
input_alphabet = new InputAlphabet();
states = new States();
tape_alphabet = new TapeAlphabet();
transition_function = new TransitionFunction();
if(loadDefinition(definitionfilename + ".def"))
{
// Additional Setup
}
else
{
// Exit(1);
}
}
public void ParseDefinition_TransFunct_InvalidChar()
{
List<string> definition = new List<string>()
{
"description stuff1",
"description stuff2",
"STATES: S1 S2 S3 S4",
"INPUT_ALPHABET: a b",
"TAPE_ALPHABET: a b x y -",
"TRANSITION_FUNCTION:",
"s0 a s1 X R",
"s0 Y s3 Y R",
"s1 a s1 a R",
"s1 b s2 Y L",
"s1 Y s1 Y R",
"s2 a s2 a L",
"s2 X s0 X R",
"s2 Y s2 Y L",
"s3 Y s3 Y R",
"s3 - s4 - R",
"INITIAL_STATE: s0",
"BLANK_CHARACTER: -",
"FINAL_STATES: s4"
};
Tape tape = new Tape();
FinalStates final_states = new FinalStates();
InputAlphabet input_alphabet = new InputAlphabet();
States states = new States();
TapeAlphabet tape_alphabet = new TapeAlphabet();
TransitionFunction transition_function = new TransitionFunction();
TuringMachine tm = new TuringMachine("");
Assert.IsTrue(tm.parseDescription(ref definition), "Failed to parse description");
Assert.IsTrue(states.load(ref definition), "Failed to parse states.");
Assert.IsTrue(input_alphabet.load(ref definition), "Failed to parse input alphabet");
Assert.IsTrue(tape_alphabet.load(ref definition), "Failed to parse tape alphabet");
Assert.IsFalse(transition_function.load(ref definition), "Should not accept transition with a state not in STATES:");
}
public void ParseDefinition_CheckForDuplicateInputAlphabetCharacters()
{
List<string> definition = new List<string>()
{
"a a",
"TAPE_ALPHABET:"
};
InputAlphabet test_inputalphabet = new InputAlphabet();
Assert.IsFalse(test_inputalphabet.load(ref definition), "Failed to detect duplicate input alphabet characters.");
}
public void ParseDefinition_CheckThatElementsAreLengthOne()
{
List<string> definition = new List<string>()
{
"ab",
"TAPE_ALPHABET:"
};
InputAlphabet test_inputalphabet = new InputAlphabet();
Assert.IsFalse(test_inputalphabet.load(ref definition), "Failed to detect improper length of input alphabet element.");
}
public void ParseDefinition_BlankChar_NotInAlphabet()
{
List<string> definition = new List<string>()
{
"a b x y -",
"TRANSITION_FUNCTION:",
"s0 a s1 X R",
"s0 Y s3 Y R",
"s1 a s1 a R",
"s1 b s2 Y L",
"s1 Y s1 Y R",
"s2 a s2 a L",
"s2 X s0 X R",
"s2 Y s2 Y L",
"s3 Y s3 Y R",
"s3 - s4 - R",
"INITIAL_STATE: s0",
"BLANK_CHARACTER: +",
"FINAL_STATES: s4"
};
Tape tape = new Tape();
FinalStates final_states = new FinalStates();
InputAlphabet input_alphabet = new InputAlphabet();
States states = new States();
TapeAlphabet tape_alphabet = new TapeAlphabet();
TransitionFunction transition_function = new TransitionFunction();
TuringMachine tm = new TuringMachine("");
Assert.IsTrue(tape_alphabet.load(ref definition), "Failed to parse tape alphabet");
Assert.IsTrue(transition_function.load(ref definition), "Failed to parse transition function.");
Assert.IsTrue(tm.LoadInitialState(ref definition), "Failed to parse initial state.");
Assert.IsFalse(tape.load(ref definition), "Should not load a blank char that's not in tape alphabet.");
}