-
Notifications
You must be signed in to change notification settings - Fork 1
/
machine_parser.py
183 lines (150 loc) · 4.25 KB
/
machine_parser.py
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
import ply.lex as lex
import sys
import re
from tkinter import *
from tkinter import messagebox
class Graph:
alphabet = []
vertex_cnt = ""
start_vertex = ""
terminal_vertexes = []
edges = []
max_vert = 0
one_start_vertex = True
passed_checkers = True
correct_input = True
passed_checkers_for_validation = True
tokens = [
'alphabet',
'Q',
'start',
'T',
'function'
]
def t_newline(t):
r'\n+'
t.lexer.lineno += len(t.value)
def t_error(t):
global correct_input
correct_input = False
messagebox.showinfo("INCORRECT INPUT!", "Incorrect input format")
t.lexer.skip(1)
def t_alphabet(t):
r'alphabet:.+ \|\|'
s = t.value[9:-3]
for i in s:
Graph.alphabet.append(i)
return t
def t_Q(t):
r'Q:\(.+ s'
Graph.vertex_cnt = t.value[3:-3]
return t
def t_start(t):
r'tart:.+ T'
string = t.value[6:-3]
for i in string:
if i != ')':
Graph.start_vertex = Graph.start_vertex + i
else:
global one_start_vertex
one_start_vertex = False
break
return t
def t_T(t):
r':\(.+ f'
str = t.value[1:-2]
сur = ""
for i in str:
if i == ')':
Graph.terminal_vertexes.append(cur)
elif i == '(':
cur = ""
else:
cur = cur + i
return t
def t_function(t):
r'unction:.+'
str = t.value[8:]
сur = ""
cnt = 0
current_edge = ["", "", ""] # [start,finish,transition]
for i in str:
if i == ')':
if cnt != 2:
current_edge[cnt] = cur
cnt += 1
else:
current_edge[cnt] = current_edge[cnt] + Graph.alphabet[int(cur) - 1]
elif i == '(':
cur = ""
elif i == '.':
Graph.edges.append(current_edge)
Graph.max_vert = max(Graph.max_vert, int(current_edge[0]), int(current_edge[1])) # НОВОЕ
current_edge = ["", "", ""]
cnt = 0
else:
cur = cur + i
return t
def clear():
Graph.alphabet = []
Graph.vertex_cnt = ""
Graph.start_vertex = ""
Graph.terminal_vertexes = []
Graph.edges = []
Graph.max_vert = 0
global one_start_vertex, passed_checkers, correct_input, passed_checkers_for_validation
one_start_vertex = True
passed_checkers = True
correct_input = True
passed_checkers_for_validation = True
def alphabet_checking():
global passed_checkers
if len(Graph.alphabet) != len(set(Graph.alphabet)):
passed_checkers = False
messagebox.showinfo("INCORRECT AUTOMATON!", "Alphabet elements are not unique")
def start_vertex_checking():
global passed_checkers
if Graph.start_vertex == "":
passed_checkers = False
messagebox.showinfo("INCORRECT AUTOMATON!", "Initial state does not found :(")
elif not one_start_vertex:
passed_checkers = False
messagebox.showinfo("INCORRECT AUTOMATON!", "Initial state is not the only one")
def automaton_states_checking():
global passed_checkers
if len(Graph.terminal_vertexes) != len(set(Graph.terminal_vertexes)):
passed_checkers = False
messagebox.showinfo("INCORRECT AUTOMATON!", "States are not unique")
def determinism_and_completeness_checking():
global passed_checkers, passed_checkers_for_validation
l = []
for i in range(int(Graph.vertex_cnt)):
l.append("")
for i in Graph.edges:
l[int(i[0])] = l[int(i[0])] + i[2]
for i in l:
if len(i) != len(set(i)):
passed_checkers = False
passed_checkers_for_validation = False
messagebox.showinfo("INCORRECT AUTOMATON!", "automaton is not determenistic")
break
for i in l:
if len(set(i)) < len(Graph.alphabet):
passed_checkers = False
messagebox.showinfo("INCORRECT AUTOMATON!", "automaton is not complete")
break
def test_automaton():
alphabet_checking()
start_vertex_checking()
automaton_states_checking()
determinism_and_completeness_checking()
def analyse(fin):
clear()
lexer = lex.lex()
lexer.input(fin)
while True:
tok = lexer.token()
if not tok:
break
test_automaton()
return Graph