f00 nfa
This commit is contained in:
parent
8a33bb69fa
commit
1d1a048572
161
TaskF00/run.py
161
TaskF00/run.py
@ -1,10 +1,8 @@
|
||||
import sys
|
||||
import os
|
||||
|
||||
#./run test1.arg < test1.in > test1.out
|
||||
|
||||
filename = sys.argv[1]
|
||||
# filename = 'long.arg'
|
||||
# filename = 'test1.arg'
|
||||
path = os.path.join(os.getcwd(), filename)
|
||||
file = open(path, 'r').readlines()
|
||||
|
||||
@ -17,39 +15,154 @@ class FSA():
|
||||
self.alphabet = set()
|
||||
self.transition_function = []
|
||||
self.end_state = []
|
||||
self.all_states = set()
|
||||
self.is_nfa = 0
|
||||
|
||||
def add_letter_to_alphabet(self, letter):
|
||||
self.alphabet.add(letter)
|
||||
|
||||
def add_transition_to_transition_function(self, input_state, output_state, letter):
|
||||
self.all_states.add(input_state)
|
||||
self.all_states.add(output_state)
|
||||
if len(self.transition_function) > 0:
|
||||
for x, function in enumerate(self.transition_function):
|
||||
if function['in'] == input_state and function['out'] == output_state:
|
||||
self.transition_function[x]['letter'].append(letter)
|
||||
if function['in'] == input_state and function['letter'] == letter:
|
||||
self.transition_function[x]['out'].append(output_state)
|
||||
return
|
||||
obj = {'in': input_state, 'letter': [letter], 'out': output_state}
|
||||
obj = {'in': input_state, 'letter': letter, 'out': [output_state]}
|
||||
self.transition_function.append(obj)
|
||||
else:
|
||||
obj = {'in': input_state, 'letter':[letter], 'out': output_state}
|
||||
obj = {'in': input_state, 'letter': letter, 'out': [output_state]}
|
||||
self.transition_function.append(obj)
|
||||
# add letter to alphabet
|
||||
|
||||
def specify_end_state(self, end_state):
|
||||
self.end_state.append(end_state)
|
||||
|
||||
def check_text(self, text):
|
||||
for letter in text:
|
||||
if letter not in self.alphabet:
|
||||
return 'NO'
|
||||
found_function = None
|
||||
for func in self.transition_function:
|
||||
if func['in'] == self.current_state and letter in func['letter']:
|
||||
found_function = func
|
||||
if not found_function:
|
||||
return 'NO'
|
||||
self.current_state = found_function['out']
|
||||
|
||||
# print('Input text:{} output text:{} current state:{}'.format(text, output_text, self.current_state))
|
||||
def nfa_to_dfa(self):
|
||||
nfa = dict()
|
||||
for x in FSA.all_states:
|
||||
nfa[x] = {}
|
||||
for a in FSA.alphabet:
|
||||
a_dict = {a: None}
|
||||
nfa[x].update(a_dict)
|
||||
|
||||
for function in self.transition_function:
|
||||
nfa[function['in']][function['letter']] = function['out']
|
||||
|
||||
trap_state_in = str(int(sorted(FSA.all_states, reverse=True)[0]) + 1)
|
||||
trap_state = {trap_state_in: {}}
|
||||
for a in FSA.alphabet:
|
||||
a_dict = {a: trap_state_in}
|
||||
trap_state[trap_state_in].update(a_dict)
|
||||
|
||||
dfa = {}
|
||||
dfa_keys = []
|
||||
new_states_list = []
|
||||
|
||||
dfa.update(trap_state)
|
||||
|
||||
# first row
|
||||
state = FSA.initial_state
|
||||
nfa_function = nfa[state]
|
||||
dfa_keys.append(state)
|
||||
dfa_function = dict()
|
||||
for letter in FSA.alphabet:
|
||||
if not nfa_function[letter]:
|
||||
dfa_function[letter] = trap_state_in
|
||||
continue
|
||||
if nfa_function[letter] and len(nfa_function[letter]) > 1:
|
||||
new_state_in = ''.join(nfa_function[letter])
|
||||
for i in self.end_state:
|
||||
if i in nfa_function[letter]:
|
||||
self.specify_end_state(new_state_in)
|
||||
dfa_function[letter] = new_state_in
|
||||
new_states_list.append(new_state_in)
|
||||
continue
|
||||
if len(nfa_function[letter]) == 1:
|
||||
new_state = nfa_function[letter][0]
|
||||
dfa_function[letter] = new_state
|
||||
if new_state not in new_states_list:
|
||||
new_states_list.append(new_state)
|
||||
continue
|
||||
dfa[state] = dfa_function
|
||||
|
||||
while len(new_states_list) != 0:
|
||||
new_dfa_state = new_states_list.pop(0)
|
||||
dfa_function = dict()
|
||||
|
||||
|
||||
if len(new_dfa_state) == 1:
|
||||
nfa_function = nfa[new_dfa_state]
|
||||
|
||||
for letter in FSA.alphabet:
|
||||
if not nfa_function[letter]:
|
||||
dfa_function[letter] = trap_state_in
|
||||
continue
|
||||
if nfa_function[letter] and len(nfa_function[letter]) > 1:
|
||||
new_state_in = ''.join(nfa_function[letter])
|
||||
for i in self.end_state:
|
||||
if i in nfa_function[letter]:
|
||||
self.specify_end_state(new_state_in)
|
||||
dfa_function[letter] = new_state_in
|
||||
if new_state_in not in dfa_keys and new_state_in not in new_states_list:
|
||||
new_states_list.append(new_state_in)
|
||||
continue
|
||||
if len(nfa_function[letter]) == 1:
|
||||
new_state_in = nfa_function[letter][0]
|
||||
dfa_function[letter] = new_state_in
|
||||
if new_state_in not in dfa_keys and new_state_in not in new_states_list:
|
||||
new_states_list.append(new_state_in)
|
||||
continue
|
||||
dfa[new_dfa_state] = dfa_function
|
||||
else:
|
||||
dfa_func = {}
|
||||
for letter in FSA.alphabet:
|
||||
dfa_func[letter] = None
|
||||
|
||||
for let in FSA.alphabet:
|
||||
new_letter = None
|
||||
for state in new_dfa_state:
|
||||
nfa_letter = nfa[state][let]
|
||||
if nfa_letter:
|
||||
new_letter = ''.join(nfa_letter)
|
||||
if new_letter not in dfa_keys and new_letter not in new_states_list:
|
||||
new_states_list.append(new_letter)
|
||||
|
||||
if not new_letter:
|
||||
new_letter = trap_state_in
|
||||
dfa_func[let] = new_letter
|
||||
dfa[new_dfa_state] = dfa_func
|
||||
self.transition_function = dfa
|
||||
|
||||
|
||||
def check_text(self, text):
|
||||
|
||||
if self.is_nfa == 0:
|
||||
for letter in text:
|
||||
if letter not in self.alphabet:
|
||||
return 'NO'
|
||||
|
||||
found_function = None
|
||||
|
||||
for func in self.transition_function:
|
||||
if func['in'] == self.current_state and func['letter'] == letter:
|
||||
found_function = func
|
||||
|
||||
if not found_function:
|
||||
return 'NO'
|
||||
self.current_state = found_function['out'][0]
|
||||
else:
|
||||
|
||||
for letter in text:
|
||||
if letter not in self.alphabet:
|
||||
return 'NO'
|
||||
|
||||
found_function = self.transition_function[self.current_state][letter]
|
||||
self.current_state = found_function
|
||||
|
||||
|
||||
if self.current_state in self.end_state:
|
||||
return 'YES'
|
||||
else:
|
||||
@ -68,10 +181,16 @@ for line in file:
|
||||
else:
|
||||
FSA.specify_end_state(line[0])
|
||||
|
||||
for function in FSA.transition_function:
|
||||
if len(function['out']) > 1:
|
||||
FSA.is_nfa = 1
|
||||
FSA.nfa_to_dfa()
|
||||
break
|
||||
|
||||
lines = ['']
|
||||
|
||||
lines = ['xyz']
|
||||
|
||||
for line in sys.stdin:
|
||||
line = line.rstrip('\n')
|
||||
FSA.current_state = FSA.initial_state
|
||||
print(FSA.check_text(line))
|
||||
print(FSA.check_text(line))
|
||||
|
Loading…
Reference in New Issue
Block a user