274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
|
if not sGraphName:
print("Error. All rules must belong to a named graph. Line: ", i)
exit()
for j, sTokenLine in lTokenLine:
dAllGraph[sGraphName].append((j, sRuleName, sTokenLine, sActions, nPriority))
lTokenLine.clear()
sActions = ""
nPriority = 4
elif re.search(" +<<- ", sLine):
# actions
sActions += " " + sLine.strip()
elif sLine.startswith((" ")):
lTokenLine.append([i, sLine.strip()])
else:
print("Unknown line:")
print(sLine)
# processing rules
print(" preparing rules...")
|
<
>
|
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
|
if not sGraphName:
print("Error. All rules must belong to a named graph. Line: ", i)
exit()
for j, sTokenLine in lTokenLine:
dAllGraph[sGraphName].append((j, sRuleName, sTokenLine, sActions, nPriority))
lTokenLine.clear()
sActions = ""
elif re.search(" +<<- ", sLine):
# actions
sActions += " " + sLine.strip()
elif sLine.startswith((" ")):
# tokens
lTokenLine.append([i, sLine.strip()])
else:
print("Unknown line:")
print(sLine)
# processing rules
print(" preparing rules...")
|