Datasets:
thisisanshgupta
/
Pycode

Dataset card Data Studio Files
xet
Community
text
stringlengths
0
828
pathstates = {}
# maintain a queue of nodes to be visited. Both current and previous
# node must be included.
queue = []
# push the first path into the queue
queue.append([0, start])
pathstates[start.stateid] = 0
while queue:
# get the first node from the queue
leaf = queue.pop(0)
node = leaf[1]
pathlen = leaf[0]
# enumerate all adjacent nodes, construct a new path and push it
# into the queue
for arc in node.arcs:
next_state = self.mma[arc.nextstate]
if next_state.stateid not in pathstates:
queue.append([pathlen + 1, next_state])
pathstates[next_state.stateid] = pathlen + 1
orderedstatesdict = OrderedDict(
sorted(
pathstates.items(),
key=lambda x: x[1],
reverse=False))
for state in self.mma.states:
orderedstatesdict[state.stateid] = state
orderedstates = [x[1] for x in list(orderedstatesdict.items())]
return orderedstates"
1736,"def star(self, input_string):
""""""
Kleene star operation
Args:
input_string (str): The string that the kleene star will be made
Returns:
str: The applied Kleene star operation on the input string
""""""
if input_string != self.epsilon and input_string != self.empty:
return ""("" + input_string + "")*""
else:
return """""
1737,"def _brzozowski_algebraic_method_init(self):
""""""Initialize Brzozowski Algebraic Method""""""
# Initialize B
for state_a in self.mma.states:
if state_a.final:
self.B[state_a.stateid] = self.epsilon
else:
self.B[state_a.stateid] = self.empty
# Initialize A
for state_b in self.mma.states:
self.A[state_a.stateid, state_b.stateid] = self.empty
for arc in state_a.arcs:
if arc.nextstate == state_b.stateid:
self.A[state_a.stateid, state_b.stateid] = \
self.mma.isyms.find(arc.ilabel)"
1738,"def _brzozowski_algebraic_method_solve(self):
""""""Perform Brzozowski Algebraic Method""""""
orderedstates = self._bfs_sort(
sorted(
self.mma.states,
key=attrgetter('initial'),
reverse=True)[0])
for n in range(len(orderedstates) - 1, 0, -1):
# print ""n:"" + repr(n)
if self.A[
orderedstates[n].stateid,
orderedstates[n].stateid] != self.empty:
# B[n] := star(A[n,n]) . B[n]
if self.B[orderedstates[n].stateid] != self.empty:
self.B[orderedstates[n].stateid] = \
self.star(self.A[orderedstates[n].stateid, orderedstates[n].stateid]) \
+ self.B[orderedstates[n].stateid]
else:
self.B[orderedstates[n].stateid] = self.star(
self.A[orderedstates[n].stateid, orderedstates[n].stateid])
for j in range(0, n):
# A[n,j] := star(A[n,n]) . A[n,j]
if self.A[
orderedstates[n].stateid,
orderedstates[j].stateid] != self.empty:
self.A[
orderedstates[n].stateid,
orderedstates[j].stateid] = \
self.star(self.A[orderedstates[n].stateid, orderedstates[n].stateid]) \
+ self.A[orderedstates[n].stateid, orderedstates[j].stateid]
else:
self.A[orderedstates[n].stateid, orderedstates[j].stateid] = self.star(
self.A[orderedstates[n].stateid, orderedstates[n].stateid])
for i in range(0, n):
# B[i] += A[i,n] . B[n]
newnode = None
if self.A[orderedstates[i].stateid, orderedstates[n].stateid] != self.empty \
and self.B[orderedstates[n].stateid] != self.empty:
newnode = self.A[orderedstates[i].stateid, orderedstates[
n].stateid] + self.B[orderedstates[n].stateid]
elif self.A[orderedstates[i].stateid, orderedstates[n].stateid] != self.empty:
newnode = self.A[
orderedstates[i].stateid,
orderedstates[n].stateid]
elif self.B[orderedstates[n].stateid] != self.empty: