public static AFD read(string fileName)
{
AFD afd;
string[] lines = File.ReadAllLines(fileName, Encoding.UTF8);
Dictionary <int, Dictionary <char, int> > transitionMap = new Dictionary <int, Dictionary <char, int> >();
for (int i = 5; i <= lines.Length - 1; i++)
{
int state = Int32.Parse(lines[i].Split(' ')[0]);
char symbol = Char.Parse(lines[i].Split(' ')[1]);
int nextState = Int32.Parse(lines[i].Split(' ')[2]);
if (transitionMap.ContainsKey(state))
{
Dictionary <char, int> res = new Dictionary <char, int>();
transitionMap.TryGetValue(state, out res);
res.Add(symbol, nextState);
transitionMap[state] = res;
}
else
{
Dictionary <char, int> dict = new Dictionary <char, int>();
dict.Add(symbol, nextState);
transitionMap.Add(state, dict);
}
}
// Console.WriteLine(transitionMap.Count);
foreach (KeyValuePair <int, Dictionary <char, int> > keyValuePair in transitionMap)
{
foreach (var pair in keyValuePair.Value)
{
Console.WriteLine("{0} -> {1} -> {2}", keyValuePair.Key, pair.Key, pair.Value);
}
}
// instanciate DFA class
int noStates = Int32.Parse(lines[0]);
string alphabet = lines[1];
int startState = Int32.Parse(lines[2]); // parse start state from file
string[] finalStatesAsString = lines[4].Split(' ');
int[] finalStates = Array.ConvertAll(finalStatesAsString, int.Parse);
afd = new AFD(startState, noStates, alphabet, transitionMap, finalStates);
return(afd);
}
static void Main(string[] args)
{
Console.WriteLine("Entrez le nom de fichier:");
string path = Console.ReadLine(); // Absolute path should be given
AFD afd = AFD.read(path);
AFD.print(afd);
string mot;
do
{
Console.WriteLine("Entrez un mot:");
mot = Console.ReadLine();
Console.WriteLine(
AFD.accept(afd, mot)
? "Le mot {0} est accepté par la language de l'automate!"
: "Le mot {0} n'est pas accepté par la language de l'automate!", mot);
} while (true); // loop thru the accept function | CTRL+C to exit
}
public static bool accept(AFD M, string w)
{
bool res;
char[] letters = w.ToCharArray();
int state = M.startState;
for (int i = 0; i < letters.Length; i++)
{
int nextState = M.δ(state, letters[i]);
state = nextState;
}
if (M.finalStates.Contains(state))
{
res = true;
}
else
{
res = false;
}
return(res);
}
public static void print(AFD M)
{
List <int> states = new List <int>();
foreach (KeyValuePair <int, Dictionary <char, int> > keyValuePair in M.transitionMap)
{
foreach (KeyValuePair <char, int> pair in keyValuePair.Value)
{
if (states.IndexOf(pair.Value) == -1)
{
states.Add(pair.Value);
}
if (states.IndexOf(keyValuePair.Key) == -1)
{
states.Add(keyValuePair.Key);
}
}
}
// print E
int counter = 1;
Console.Write("E = {");
foreach (int state in states)
{
Console.Write(state);
if (counter < states.Count)
{
Console.Write(", ");
counter++;
}
}
Console.Write("} ");
// print alphabet A
counter = 1;
char[] alphabet = M.alphabet.ToCharArray();
Console.Write("A = {");
foreach (char c in alphabet)
{
Console.Write(c);
if (counter < alphabet.Length)
{
Console.Write(", ");
counter++;
}
}
Console.WriteLine("}");
// print transitions
Console.WriteLine("Transitions:");
foreach (KeyValuePair <int, Dictionary <char, int> > keyValuePair in M.transitionMap)
{
foreach (KeyValuePair <char, int> pair in keyValuePair.Value)
{
Console.WriteLine("δ({0}, {1}) = {2}", keyValuePair.Key, pair.Key, pair.Value);
}
}
// print start state
Console.WriteLine("q₀ = {0}", M.startState);
// print final states
counter = 1;
int[] finalStates = M.finalStates;
Console.Write("F = {");
foreach (int finalState in finalStates)
{
Console.Write(finalState);
if (counter < finalStates.Length)
{
Console.Write(", ");
counter++;
}
}
Console.WriteLine("} ");
}
