-
Notifications
You must be signed in to change notification settings - Fork 0
/
grammar_parser.py
379 lines (348 loc) · 10.9 KB
/
grammar_parser.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
from textx.metamodel import metamodel_from_str
from textx.model import children_of_type
import engine.operators as operators;
import yaml;
grammar = """
Model: seq = Call ('=>' (seq*=Call ))* ;
Call: name= ID '('args= ArgList ')' (op='?')? ;
ArgList: a= Arg? ( ',' a*=Arg) *;
Name: v= ID ;
Arg:
(v = Call | v = INT | v = Name | v = BOOL | v = STRING ) (m ='^')?;
"""
textGrammar="""
Seq: (seq*= OrExp )+;
Group: '(' seq=Seq ')' ( op = '+' |op = '?' |op = '*' )? ;
OrExp: options=Element ('|' options*=Element )* ;
Element: val = Assign | val= STRING | val = Group;
Assign:
name = ID ( op='='|op='+='|op='*=') (val=ID | val=BOOL | val=NUMBER | val=STRING );
"""
transformModel = metamodel_from_str(grammar)
grammarModel= metamodel_from_str(textGrammar)
class ResultSet:
def __init__(self,list):
self.list=list
def orFunc(v):
if type(v) in [list,set]:
return operators.Or(v);
return v;
def andFunc(*args):
if (len(args)==1): v=args[0]
else: v=args;
if type(v) in [list,set,tuple]:
return operators.And(v);
return v;
def filterByVals(v):
if (v):
return operators.FilterByVals(v);
return None;
class TypedList(list):
def __init__(self,sup):
for v in sup:
self.append(v);
self.tp=sup[0].domain();
def domain(self):
return self.tp;
def join(v):
if isinstance(v,list):
return TypedList(v);
return v;
def prop(c,p):
if (isinstance(c,operators.Flow)):
if isinstance(c.chain[0],operators.TakePropertyValue):
ff=c.chain[0];
if ff.pn==p: return c;
return operators.TakePropertyValue(c,p);
symbols={
"propertyHasValue": operators.FilterPropertyValue,
"partOf": operators.ParentValueFilter,
"compare": operators.Compare,
"join": join,
"flow": operators.Flow,
"or": orFunc,
"related": operators.FilterGoodVals,
"not": operators.Not,
"countCompare": operators.CountCompare,
"property": prop,
"and": andFunc,
"select": operators.SelectInstances,
"count": operators.CountInstances,
"in": filterByVals,
"childFilter": operators.ChildFilter
}
class OrParser:
def __init__(self,options):
self.options=options;
def tryParse(self, ts):
for o in self.options:
ts.record();
l = o.tryParse(ts);
if (not l):
ts.rollback();
else:
return True;
return False
class SeqParser:
def __init__(self,options):
self.options=options;
def tryParse(self, ts):
for o in self.options:
l=o.tryParse(ts);
if (not l):
return False;
return True
parentValTypes={ "parentVal":"val"}
class AssignParser:
def __init__(self,name,op,val):
self.name=name;
self.op=op;
self.val=val;
def tryParse(self, ts):
v = ts.consume();
if (v.type == self.val or (v.type in parentValTypes and parentValTypes[v.type]==self.val)):
ts.storeVar(self.name,v,self.op);
return True;
return False;
class GroupParser:
def __init__(self,seq,op):
self.op=op;
self.seq=seq;
def tryParse(self, ts):
parsed=False
while True:
ts.record();
r=self.seq.tryParse(ts);
if (r):
parsed=True
if (self.op=='?'):
return True;
if (self.op != '*' and self.op != '+' and self.op != '?'):
return True
else:
ts.rollback()
if (self.op!='*' and self.op!='+' and self.op!='?'):
return False
break;
if (self.op=='+'):
if (not parsed):return False
return True
class StrParse:
def __init__(self,str):
self.str=str;
def tryParse(self,ts):
v=ts.consume();
if (isinstance(v,list)):
print "WTF"
if (v.type=="str" and v.val==self.str):
return True;
return False;
class Token:
def __init__(self,name,val):
self.name=name;
self.val=val;
self.type=name
def __repr__(self):
return str(self.name)+":"+str(self.val)
class RuleComposer:
def parseRuleModel(self,model):
if (isinstance(model,str)):
return self.parseRuleModel(grammarModel.model_from_str(model))
seq=[]
for element in model.seq:
els=[]
for v in element.options:
els.append(self.parseOption(v));
if (len(els)==1):
seq.append(els[0]);
else: seq.append(OrParser(els));
return SeqParser(seq)
def parseOption(self,element):
m = element.val
c = type(m).__name__;
if (c == 'Assign'):
return AssignParser(m.name,m.op,m.val)
if (c == 'Group'):
return GroupParser(self.parseRuleModel(m.seq),m.op)
if (c=='Element'):
return self.parseOption(m);
if (c=='str'):
v=m.split(" ")
if (len(v)>1):
return SeqParser([StrParse(x) for x in v]);
return StrParse(m);
raise ValueError()
class QueryComposer:
def parseArg(self,el,vars):
kind=type(el).__name__;
if (kind=="Call"):
return self.parseElement(el,vars);
if (kind=="Name"):
if (el.v in vars):
return vars[el.v];
return None;
return el;
def parseArgList(self,el,vars):
res=[];
if el==None:
return res;
for a in el.a:
res.append(self.parseArg(a.v,vars))
return res;
def parseElement(self,el,vars):
const=None;
if (el.name in symbols):
const=symbols[el.name];
args=self.parseArgList(el.args,vars);
if (const==None):
if el.name in vars:
return vars[el.name]
if (el.op=='?'):
return None
raise ValueError(el.name)
return const(*args);
def composeFunction(self,str,vars):
model=transformModel.model_from_str(str);
return self.composeFromModel(model, vars)
def composeFromModel(self, model, vars):
chElements = [];
for el in model.seq:
fv=self.parseElement(el, vars);
if (fv!=None):
chElements.append(fv);
if (len(chElements)==1):
return chElements[0]
return operators.Flow(chElements);
class TransformRule:
def __init__(self,key,yml):
self.key=key;
self.pattern=RuleComposer().parseRuleModel(yml['definition'])
self.transform=transformModel.model_from_str(yml['translation'])
self.example=yml['example']
if ('produces' in yml):
self.produces=yml['produces']
else: self.produces=self.key
if ('condition' in yml):
self.condition=yml['condition']
else:
self.condition=None
class TryParse:
def __init__(self,ts,i):
self.ts=ts;
self.i=i;
self.value={}
self.len=0;
self.states=[]
def storeVar(self,name,val,op):
if (op=='+='):
if (name in self.value):
vl=self.value[name];
if (isinstance(vl,list)):
vl.append(val.val);
return;
else:
self.value[name]=[vl,val.val];
return;
self.value[name]=val.val;
return;
def record(self):
self.states.append((self.value.copy(),self.len));
def consume(self):
self.len=self.len+1;
if (self.i + self.len)>len(self.ts):
return Token("eof",None);
return self.ts[self.i+(self.len-1)];
def rollback(self):
self.value,self.len=self.states.pop();
debug=False
def isChild(t1,t2):
d1=t1.domain();
d2=t2.domain();
props=d2.allProperties();
for p in props:
if (props[p].range==d1): return True
return False
def compatibleTypes(t1,t2):
if (str(t1)==str(t2)):
return True;
return False
def compatibleFilters(f):
z=set([x.domain() for x in f])
if (object in z):
z.remove(object)
if (len(z)==1):
return True;
return False
def isTrivial(s):
return isinstance(s,operators.SelectInstances);
def evalCondition(cond,val):
try:
return eval(cond,{"compatibleTypes":compatibleTypes,"isTrivial":isTrivial,"isSingle":isSingle,"compatibleFilters":compatibleFilters,"isChild":isChild},val);
except Exception as e:
print e;
# print cond;
class RuleSet:
def parse(self,ts,ruleSet=None):
p = True
if (debug):
print str(ts)+":<initial>"
while p :
p=False
for rule in self.seq:
if (ruleSet!=None):
if (not rule.key in ruleSet):
continue
while True:
parsed = False;
for i in range(0,len(ts)):
t=TryParse(ts,i);
res=rule.pattern.tryParse(t);
if (res and rule.condition):
if (not evalCondition(rule.condition,t.value)):
res=None;
if (res):
newVal = Token(rule.produces,t.value);
rm=QueryComposer().composeFromModel(rule.transform,t.value);
newVal.val=rm;
ts=replace(ts,i,t.len,newVal);
if debug:
print str(ts)+":"+rule.key
parsed=True;
p=True
break
if (not parsed or len(ts)==1):
break
if (len(ts)==1):
break
return ts;
def parseRules(self,t,ruleSet=None):
if (isinstance(t,ResultSet)):
rs=[]
for q in t.list:
rs.append(self.parse(q,ruleSet));
minLen=100000;
for m in rs:
if (len(m)<minLen):
res=m;
minLen=len(m);
return res;
return self.parse(t,ruleSet);
def __init__(self,s):
self.rules={};
self.seq=[]
with open(s) as f:
dataMap = yaml.safe_load(f)
pt= dataMap['rules'];
for v in pt:
key=v.keys()[0]
try:
vr=TransformRule(key,v[key]);
self.rules[key]=vr;
self.seq.append(vr)
except Exception as inst:
print "Error parting rule:"+key
print inst
def isSingle(s):
return isinstance(s,operators.instance)
def replace(v,startPos,tl,token):
return v[0:startPos]+[token]+v[startPos+tl:len(v)]