Datasets:
thisisanshgupta
/
Pycode

Dataset card Data Studio Files
xet
Community
text
stringlengths
0
828
""""""
For each Rule A -> BC where B and C are known terminals (B -> c1 and C -> c2),
this function searches replaces A to the corresponding terminals A -> c1c2
""""""
# print 'BFS Dictionary Update - Self Non Terminals'
find = 0
for nt in self.grammar.grammar_nonterminals_map:
for i in self.grammar.grammar_nonterminals_map[nt]:
if (self.grammar.grammar_rules[i][0] not in self.resolved\
or self.grammar.grammar_rules[i][0] == 'S') \
and isinstance(self.grammar.grammar_rules[i][1], (set, tuple)):
# All rules are in CNF form, so first check the A -> BC rules
part_a = None
if optimized and self._check_self_to_empty(
self.grammar.grammar_rules[i][1][0]):
part_a = ''
elif self.grammar.grammar_rules[i][1][0] in self.resolved:
part_a = self.resolved[self.grammar.grammar_rules[i][1][0]]
part_b = None
if optimized and self._check_self_to_empty(
self.grammar.grammar_rules[i][1][1]):
part_b = ''
elif self.grammar.grammar_rules[i][1][1] in self.resolved:
part_b = self.resolved[self.grammar.grammar_rules[i][1][1]]
if part_a is not None and part_b is not None:
self.resolved[self.grammar.grammar_rules[i][0]] = part_a + part_b
# print 'Non Terminals Resolving
# '+self.g.Rules[i][0]+"": ""+
# self.Resolved[self.g.Rules[i][0]]
if self._checkfinal(self.grammar.grammar_rules[i][0]):
return self.resolved[self.grammar.grammar_rules[i][0]]
if self.grammar.grammar_rules[i][0] not in self.bfs_queue:
self.bfs_queue.append(self.grammar.grammar_rules[i][0])
find = 1
if find == 1:
return 1
return 0"
1839,"def _gen(self, optimized, splitstring):
""""""Generates a new random object generated from the nonterminal
Args:
optimized (bool): mode of operation - if enabled not all
CNF rules are included (mitigate O(n^3))
splitstring (bool): A boolean for enabling or disabling
Returns:
str: The generated string
""""""
# Define Dictionary that holds resolved rules
# (only in form A -> terminals sequence)
self.resolved = {}
# First update Resolved dictionary by adding rules
# that contain only terminals (resolved rules)
for nt in self.grammar.grammar_nonterminals_map:
for i in self.grammar.grammar_nonterminals_map[nt]:
if self.grammar.grammar_rules[i][0] not in self.resolved\
and not isinstance(self.grammar.grammar_rules[i][1], (set, tuple)):
if self.grammar.grammar_rules[i][1] != '@empty_set' \
and self.grammar.grammar_rules[i][1] in self.grammar.grammar_terminals:
if splitstring:
self.resolved[
self.grammar.grammar_rules[i][0]] = self.grammar.grammar_rules[i][1]
else:
if self.grammar.grammar_rules[i][1] == '&':
self.resolved[self.grammar.grammar_rules[i][0]] = ' '
else:
self.resolved[
self.grammar.grammar_rules[i][0]] = self.grammar.grammar_rules[i][1]
# print 'ResolvingA '+self.g.Rules[i][0]+"": ""+
# self.g.Rules[i][1]
if self._checkfinal(self.grammar.grammar_rules[i][0]):
return self.resolved[self.grammar.grammar_rules[i][0]]
if self.grammar.grammar_rules[i][0] not in self.bfs_queue:
self.bfs_queue.append(self.grammar.grammar_rules[i][0])
if self.grammar.grammar_rules[i][1] == '@empty_set':
self.resolved[self.grammar.grammar_rules[i][0]] = ''
# print 'ResolvingB '+self.g.Rules[i][0]+"": ""
self.bfs_queue.append(self.grammar.grammar_rules[i][0])
if optimized and self._check_self_to_empty(
self.grammar.grammar_rules[i][1]):
self.resolved[self.grammar.grammar_rules[i][0]] = ''
# print 'ResolvingC '+self.g.Rules[i][0]+"": ""
if self.grammar.grammar_rules[i][0] not in self.bfs_queue:
self.bfs_queue.append(self.grammar.grammar_rules[i][0])
# Then try to use the rules from Resolved dictionary and check
# if there is another rule that can be resolved.
# This should be done in a while loop
change = 1
while change:
change = 0
if not change:
ret = self._check_self_nonterminals(optimized)
if ret == 1:
change = 1
elif ret != 0:
return ret
if not change:
while not change and len(self.bfs_queue) > 0:
myntr = self.bfs_queue.pop()