s434740/djfz-2019
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

'hm'

Browse Source
This commit is contained in:
deadsmond 2019-11-25 20:48:03 +01:00
parent 971ff7fd4f
commit 75b7052e7c
1 changed files with 3 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
TaskB01/run
View File

@ -38,14 +38,15 @@ class automata:
# for all values in text
for i in text:
# for all actual states
result = []
for q in self.state:
# move state to its transition
q = self.get_node_transition(q, i)
result = self.get_node_transition(q, i)
# if the list is empty, return false
if not self.state:
return False
# flatten list of states
self.state = [item for sublist in self.state for item in sublist]
self.state = [item for sublist in result for item in sublist]
print(self.state, i)
# check if automata is in accepting state
return self.check_if_accepted()
@ -58,16 +59,12 @@ class automata:
result = []
# if the node exists
if self.graph[q]:
print(self.graph[q])
# search through all its connections to find value
for connections in self.graph[q]:
print(connections)
for value in connections:
print(value, i)
if value == i:
# append next node
result.append(connections[value])
print(result)
# return list of next nodes
return result