-
Notifications
You must be signed in to change notification settings - Fork 2
/
minisparql.py
624 lines (486 loc) · 19.3 KB
/
minisparql.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
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
from pyparsing import Word, OneOrMore, alphas, Combine, Regex, Group, Literal, \
Optional, ZeroOrMore, CaselessKeyword, Keyword, Forward, \
delimitedList, ParseException, QuotedString, \
operatorPrecedence, opAssoc, oneOf, ParserElement
ParserElement.enablePackrat()
import re
import sys
import operator
from itertools import islice
_float = Regex(r'[-+]?\d+\.\d*([eE]\d+)?').setParseAction(lambda s, loc, toks: float(toks[0]))
_integer = Regex(r'[-+]?\d+').setParseAction(lambda s, loc, toks: int(toks[0]))
_number = _float | _integer
_string = QuotedString('"""', escChar='\\', multiline=True) \
| QuotedString('\'\'\'', escChar='\\', multiline=True) \
| QuotedString('"', escChar='\\') | QuotedString('\'', escChar='\\')
_full_iri = QuotedString('<', endQuoteChar='>')
_iri = _full_iri | Combine(Word(alphas) + ':' + Word(alphas))
_boolean = (Keyword('true') | Keyword('false')).setParseAction(lambda s, loc, toks: toks[0] == 'true')
_literal = _number | _string | _iri | _boolean | Word(alphas)
def _binOpAction(s, loc, toks):
group = toks[0]
lhs, op, rhs = group
return BinaryOperatorExpression(lhs, op, rhs)
def _unaryOpAction(s, loc, toks):
group = toks[0]
op, rhs = group
return UnaryOperatorExpression(op, rhs)
def _expression_parser():
variable = Combine(Literal('?').suppress() + Word(alphas)) \
.setParseAction(lambda s, loc, toks: VariableExpression(toks[0]))
literal = _literal.copy().setParseAction(lambda s, loc, toks: LiteralExpression(toks[0]))
value = variable | literal
expr=Forward()
exprList = delimitedList(expr)
funcCall = (Word(alphas + "_") + \
Literal('(').suppress() + \
Optional(exprList) + \
Literal(')').suppress()) .setParseAction(lambda s, loc, toks: FunctionCallExpression(toks[0], toks[1:]))
baseExpr = funcCall | value
expr << operatorPrecedence(baseExpr,[
(oneOf('!'), 1, opAssoc.RIGHT, _unaryOpAction),
(oneOf('+ -'), 1, opAssoc.RIGHT, _unaryOpAction),
(oneOf('* /'), 2, opAssoc.LEFT, _binOpAction),
(oneOf('+ -'), 2, opAssoc.LEFT, _binOpAction),
(oneOf('<= >= < >'), 2, opAssoc.LEFT, _binOpAction),
(oneOf('= !='), 2, opAssoc.LEFT, _binOpAction),
('&&', 2, opAssoc.LEFT, _binOpAction),
('||', 2, opAssoc.LEFT, _binOpAction),
])
return (Literal('(').suppress() + expr + Literal(')').suppress()) | funcCall
def _query_parser(store):
prefixes = {}
def add_prefix(prefix, iri):
prefixes[prefix] = iri
def insert_prefixes(pattern):
return tuple(insert_prefix(p) for p in pattern)
def insert_prefix(p):
if isinstance(p, LiteralExpression):
value = p.value
if isinstance(value, basestring):
for prefix in prefixes:
if value.startswith(prefix):
iri = prefixes[prefix]
p.value = iri + value[len(prefix):]
break
return p
variable = Combine(Literal('?').suppress() + Word(alphas)) \
.setParseAction(lambda s, loc, toks: VariableExpression(toks[0]))
variables = OneOrMore(variable)
literal = _literal.copy().setParseAction(lambda s, loc, toks: LiteralExpression(toks[0]))
triple_value = variable | literal
def group_if_multiple(s, loc, toks):
if len(toks) > 1:
return PatternGroup(toks)
return toks
triple = (triple_value + triple_value + triple_value)\
.setParseAction(lambda s, loc, toks: Pattern(store, *(insert_prefixes(toks))))
triples_block = delimitedList(triple,
delim=Optional(Literal('.').suppress())) \
.setParseAction(group_if_multiple) \
+ Optional(Literal('.').suppress())
group_pattern = Forward().setParseAction(group_if_multiple)
def possible_union_group(s, loc, toks):
if len(toks) == 3:
return UnionGroup(toks[0], toks[-1])
return toks
group_or_union_pattern = (group_pattern + Optional(CaselessKeyword('UNION') + group_pattern)) \
.setParseAction(possible_union_group)
optional_graph_pattern = (CaselessKeyword('OPTIONAL').suppress() + group_pattern) \
.setParseAction(lambda s, loc, toks: OptionalGroup(toks[0]))
filter_expression = _expression_parser()
filter_pattern = (CaselessKeyword('FILTER').suppress() + filter_expression) \
.setParseAction(lambda s, loc, toks: Filter(toks[0]))
not_triples_pattern = optional_graph_pattern | group_or_union_pattern | filter_pattern
group_pattern << (Literal('{').suppress() + \
(Optional(triples_block) + ZeroOrMore(not_triples_pattern) + Optional(triples_block)) + \
Literal('}').suppress())
prefix = Group(CaselessKeyword('PREFIX').suppress() +
(Combine(Word(alphas) + ':').setResultsName('name') + _full_iri.setResultsName('value'))\
.setParseAction(lambda s, loc, toks: add_prefix(toks[0], toks[1]))
)
prologue = Group(ZeroOrMore(prefix).setResultsName('prefixes')).setResultsName('prologue')
order_by = CaselessKeyword('ORDER').suppress() + CaselessKeyword('BY').suppress() + \
(
(
(CaselessKeyword('ASC') | CaselessKeyword('DESC'))
+ Literal('(').suppress() + variable + Literal(')').suppress()
)
| variable
).setParseAction(
lambda s, loc, toks: OrderBy(toks[-1], len(toks) == 1 or toks[0].upper() != 'DESC')
)
limit = (CaselessKeyword('LIMIT').suppress() + Regex(r'\d+').setParseAction(lambda s, loc, toks: Limit(toks[0])))
offset = (CaselessKeyword('OFFSET').suppress() + Regex(r'\d+').setParseAction(lambda s, loc, toks: Offset(toks[0])))
select_query = Group(CaselessKeyword('SELECT').suppress() + Optional(CaselessKeyword('DISTINCT'))) + \
Group(variables | Keyword('*')) + \
CaselessKeyword('WHERE').suppress() + group_pattern + \
Optional(order_by) + \
((Optional(limit) + Optional(offset)) \
| (Optional(offset) + Optional(limit)))
query = prologue + Group(select_query).setResultsName('query')
return query
def _uniq(l):
seen = set()
u = []
for i in l:
if i not in seen:
u.append(i)
seen.add(i)
return u
class SelectQuery(object):
def __init__(self, distinct, variables, patterns, order_by, limit, offset):
self.distinct = distinct
if len(variables) == 1 and variables[0] == '*':
variables = patterns.variables
self.variables = tuple(_uniq(variables))
self.patterns = patterns
self.order_by = order_by
self.limit = limit
self.offset = offset or 0
def _distinct(self, matches):
matches = sorted(matches)
prev = None
for m in matches:
if prev != m:
yield m
prev = m
def __iter__(self):
variables = self.variables
matches = self.patterns.match({})
if self.distinct:
matches = self._distinct(matches)
if self.order_by is not None:
matches = self.order_by.order(matches)
stop = None
if self.limit is not None:
stop = self.offset + self.limit
matches = islice(matches, self.offset, stop)
for match in matches:
yield tuple(v.resolve(match) for v in variables)
class Pattern(object):
def __init__(self, store, a, b, c):
self.store = store
self.pattern = (a, b, c)
@property
def variables(self):
return [v for v in self.pattern if getattr(v, 'name', None)]
def match(self, solution=None):
for m in self.store.match_triples(self.pattern, solution):
yield m
def __repr__(self):
return 'Pattern(%s, %s, %s)' % self.pattern
class PatternGroup(object):
def __init__(self, patterns):
self.patterns = patterns
@property
def variables(self):
variables = []
for p in self.patterns:
variables.extend(p.variables)
return variables
def match(self, solution=None):
joined = None
for pattern in self.patterns:
if joined is None:
joined = pattern.match(solution)
else:
joined = self._join(joined, pattern)
for m in joined:
yield m
def _join(self, matches, pattern):
for m in matches:
for m2 in pattern.match(m):
yield m2
def __repr__(self):
return 'PatternGroup(%r)' % self.patterns
class OptionalGroup(object):
def __init__(self, pattern):
self.pattern = pattern
@property
def variables(self):
return self.pattern.variables
# just return untouched solution if nothing else matched
def match(self, solution):
matched = False
for m in self.pattern.match(solution):
yield m
matched = True
if not matched:
yield solution
def __repr__(self):
return 'OptionalGroup(%r)' % self.pattern
class UnionGroup(object):
def __init__(self, pattern1, pattern2):
self.pattern1 = pattern1
self.pattern2 = pattern2
@property
def variables(self):
variables = []
variables.extend(self.pattern1.variables)
variables.extend(self.pattern2.variables)
return variables
def match(self, solution):
for m in self.pattern1.match(solution):
yield m
for m in self.pattern2.match(solution):
yield m
def __repr__(self):
return 'UnionGroup(%r, %r)' % (self.pattern1, self.pattern2)
class Filter(object):
def __init__(self, expression):
self.expression = expression
@property
def variables(self):
return []
def match(self, solution):
try:
if self.expression.resolve(solution):
yield solution
except TypeError:
pass
def __repr__(self):
return 'Filter(%r)' % (self.expression)
def regex(s, pattern, flags=None):
f = 0
if flags is not None:
flags = flags.lower()
for ch, fl in (('i', re.I), ('s', re.S), ('m', re.M), ('x', re.X)):
if ch in flags:
f |= fl
return re.search(pattern, s, f) is not None
class Expression(object):
pass
class FunctionCallExpression(Expression):
FUNCTIONS = {
'bound': lambda a: a is not None,
'isblank': lambda a: a == '',
'str': unicode,
'regex': regex,
}
def __init__(self, fn, args):
self.fn = self.FUNCTIONS[(fn.lower())]
self.args = args
def resolve(self, solution):
args = tuple(a.resolve(solution) for a in self.args)
return self.fn(*args)
class UnaryOperatorExpression(Expression):
OPERATORS = { '!': operator.not_,
'-': operator.neg,
'+': operator.pos }
def __init__(self, op, rhs):
self.operator = self.OPERATORS[op]
self.rhs = rhs
def resolve(self, solution):
a = self.rhs.resolve(solution)
return self.operator(a)
class BinaryOperatorExpression(Expression):
OPERATORS = dict([('<=', operator.le), ('>=', operator.ge),
('<', operator.lt), ('>', operator.gt),
('=', operator.eq), ('!=', operator.ne),
('+', operator.add), ('-', operator.sub),
('*', operator.mul), ('/', operator.div),
('&&', lambda a,b: a and b),
('||', lambda a,b: a or b)])
def __init__(self, lhs, op, rhs):
self.lhs = lhs
self.operator = self.OPERATORS[op]
self.rhs = rhs
def resolve(self, solution):
a = self.lhs.resolve(solution)
b = self.rhs.resolve(solution)
return self.operator(a, b)
def __repr__(self):
return u'(%s %s %s)' % (self.lhs, self.operator.__name__, self.rhs)
class VariableExpression(Expression):
def __init__(self, name):
self.name = name
def resolve(self, solution):
return solution.get(self.name)
def __eq__(self, other):
return self.name == getattr(other, 'name', None)
def __hash__(self):
return hash(self.name)
def __repr__(self):
return u'VariableExpression(%s)' % self.name
class LiteralExpression(Expression):
def __init__(self, value):
self.value = value
def resolve(self, solution):
return self.value
def __repr__(self):
return u'LiteralExpression(%s)' % self.value
class OrderBy(object):
def __init__(self, expression, asc):
self.expression = expression
self.asc = asc
def _key(self, solution):
return self.expression.resolve(solution)
def order(self, matches):
return sorted(matches, key=self._key, reverse=(not self.asc))
class Limit(object):
def __init__(self, limit):
self.limit = int(limit)
class Offset(object):
def __init__(self, offset):
self.offset = int(offset)
class Index(object):
def __init__(self, permutation):
self.permutation = permutation
self._index = {}
def _create_key(self, triple):
return tuple(triple[i] for i in self.permutation)
def insert(self, triple):
key = self._create_key(triple)
self._insert(self._index, key, triple)
def _insert(self, index, key, triple):
if len(key) == 1:
index[key[0]] = triple
else:
try:
subindex = index[key[0]]
except KeyError:
subindex = {}
index[key[0]] = subindex
self._insert(subindex, key[1:], triple)
def match(self, triple):
key = self._create_key(triple)
return self._match(self._index, key)
def _match_remaining(self, index, key):
if len(key):
if key[0] is not None:
raise LookupError(key)
for v in index.values():
if getattr(v, 'values', None) is not None:
for m in self._match_remaining(v, key[1:]):
yield m
else:
yield v
def _match(self, index, key):
if key[0] is None:
for m in self._match_remaining(index, key):
yield m
else:
try:
if len(key) == 1:
yield index[key[0]]
else:
subindex = index[key[0]]
for m in self._match(subindex, key[1:]):
yield m
except KeyError:
pass
class TripleStore(object):
def __init__(self):
self._triples = []
def add_triples(self, *triples):
self._triples.extend(triples)
def clear_triples(self):
self._triples = []
def match_triples(self, pattern, existing=None):
if existing is None:
existing = {}
triple = tuple(a.resolve(existing) for a in pattern)
for a, b, c in self._triples:
if _matches(triple, (a, b, c)):
matches = _get_matches(pattern, (a, b, c))
matches.update(existing)
yield matches
def parse_query(self, q):
_qp = _query_parser(self)
return _qp.parseString(q)
def query(self, q):
p = self.parse_query(q)
q = p.query
distinct = len(q[0]) == 1 and q[0][0].lower() == 'distinct'
variables = q[1]
patterns = q[2]
order_by = None
limit = None
offset = None
for modifier in q[3:]:
if isinstance(modifier, OrderBy):
order_by = modifier
elif isinstance(modifier, Limit):
limit = modifier.limit
elif isinstance(modifier, Offset):
offset = modifier.offset
return SelectQuery(distinct, variables, patterns, order_by, limit, offset)
def import_file(self, file):
triple = Group(_literal + _literal + _literal + Literal('.').suppress())
for line in file:
tokens = triple.parseString(line)
self.add_triples(*[tuple(t) for t in tokens])
class IndexedTripleStore(TripleStore):
def __init__(self):
permutations = [(0, 1, 2), (0, 2, 1),
(1, 0, 2), (1, 2, 0),
(2, 1, 0), (2, 0, 1)]
self._indexes = {}
for p in permutations:
index = Index(p)
self._indexes[p] = index
self._indexes[p[:2]] = index
self._indexes[p[:1]] = index
self._indexes[()] = index
def add_triples(self, *triples):
for index in set(self._indexes.values()):
for triple in triples:
index.insert(triple)
def _find_index(self, pattern):
_key = tuple(i for (i,a) in enumerate(pattern) if a)
return self._indexes[_key]
def match_triples(self, pattern, existing=None):
if existing is None:
existing = {}
triple = tuple(a.resolve(existing) for a in pattern)
index = self._find_index(triple)
for m in index.match(triple):
matches = _get_matches(pattern, m)
matches.update(existing)
yield matches
def _matches(pattern, triple):
for p, t in zip(pattern, triple):
if not(p is None or p == t):
return False
return True
def _get_matches(pattern, triple):
return dict((getattr(a, 'name'), b) for (a,b) in zip(pattern, triple) if getattr(a, 'name', None))
def print_query_output(q):
print u', '.join(v.name for v in q.variables)
for row in q:
print u', '.join(repr(r) for r in row)
def run_prompt(store):
import cmd
class Sparql(cmd.Cmd):
prompt='sparql> '
def default(self, line):
try:
q = store.query(line)
print_query_output(q)
except ParseException, p:
print p
s = Sparql()
s.cmdloop()
if __name__ == '__main__':
from optparse import OptionParser
parser = OptionParser()
parser.add_option('-e', dest='script', default='', help='script to execute')
parser.add_option('-n', action="store_false", dest="use_index", default=True, help='disable indexes')
options, args = parser.parse_args()
script = options.script
if options.use_index:
store = IndexedTripleStore()
else:
store = TripleStore()
from fileinput import input
if not script and args:
store.import_file(input(args))
run_prompt(store)
elif script:
store.import_file(input(args))
try:
q = store.query(script)
print_query_output(q)
except ParseException, p:
print p