-
Notifications
You must be signed in to change notification settings - Fork 0
/
Program.cs
127 lines (104 loc) · 3.96 KB
/
Program.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading;
using System.Threading.Tasks;
namespace GrammarTools
{
class Program
{
static void Main(string[] args)
{
var input = new GrammarAnalysis(Grammar.Create("ab", 'S', File.ReadAllText("input.txt")));
var transformedGrammar = ChomskyNormalform.Transform(input);
}
static void Main1(string[] args)
{
var input = new GrammarAnalysis(Grammar.Create("ab", 'S', File.ReadAllText("input.txt")));
var reference = new GrammarAnalysis(Grammar.Create("ab", 'S', File.ReadAllText("reference.txt")));
Console.WriteLine("Input Type: " + input.GrammarType);
Console.WriteLine("Reference Type: " + reference.GrammarType);
int len1 = 0;
int len2 = 0;
var words1 = new List<string>();
var words2 = new List<string>();
ThreadStart a = () =>
{
foreach (var w in input.Derive())
{
var word = w.Item1;
len1 = w.Item2;
if (word.IsTerminalWord)
{
Console.WriteLine(word);
lock (words1)
{
words1.Add(word.ToString());
}
}
}
};
ThreadStart b = () =>
{
foreach (var w in reference.Derive())
{
var word = w.Item1;
len2 = w.Item2;
if (word.IsTerminalWord)
{
lock (words2)
{
words2.Add(word.ToString());
}
}
}
};
int minLen = 0;
new Thread(a).Start();
new Thread(b).Start();
while (true)
{
Thread.Sleep(100);
var m = Math.Min(len1, len2) - 1;
if (m != minLen)
{
minLen = m;
lock (words1)
{
lock (words2)
{
Comparison<string> c = (w1, w2) =>
(w1.Length != w2.Length)
? w1.Length.CompareTo(w2.Length)
: String.Compare(w1, w2, StringComparison.Ordinal);
words1.Sort(c);
words2.Sort(c);
foreach (var word in words2.Where(w => w.Length <= minLen).ToArray())
{
words2.RemoveAt(0);
while (true)
{
var fst = words1.FirstOrDefault();
if (fst == null || c(word, fst) < 0)
{
Console.WriteLine("Word '" + word +
"' is not in input grammar, but should be");
break;
}
words1.RemoveAt(0);
if (fst == word)
break;
Console.WriteLine("Word '" + fst +
"' is in input grammar, but it should not");
}
}
Console.WriteLine("Cur len: " + m);
}
}
}
}
}
}
}