forked from mit-dig/air-reasoner
-
Notifications
You must be signed in to change notification settings - Fork 0
/
notation3.py
executable file
·2007 lines (1689 loc) · 68.9 KB
/
notation3.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
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/local/bin/python
"""
$Id: notation3.py,v 1.195 2007/06/26 02:36:15 syosi Exp $
This module implements a Nptation3 parser, and the final
part of a notation3 serializer.
See also:
Notation 3
http://www.w3.org/DesignIssues/Notation3
Closed World Machine - and RDF Processor
http://www.w3.org/2000/10/swap/cwm
To DO: See also "@@" in comments
- Clean up interfaces
______________________________________________
Module originally by Dan Connolly, includeing notation3
parser and RDF generator. TimBL added RDF stream model
and N3 generation, replaced stream model with use
of common store/formula API. Yosi Scharf developped
the module, including tests and test harness.
"""
# Python standard libraries
import types, sys
import string
import codecs # python 2-ism; for writing utf-8 in RDF/xml output
import urllib
import re
from sax2rdf import XMLtoDOM # Incestuous.. would be nice to separate N3 and XML
# SWAP http://www.w3.org/2000/10/swap
from diag import verbosity, setVerbosity, progress
from uripath import refTo, join
import uripath
import RDFSink
from RDFSink import CONTEXT, PRED, SUBJ, OBJ, PARTS, ALL4
from RDFSink import LITERAL, XMLLITERAL, LITERAL_DT, LITERAL_LANG, ANONYMOUS, SYMBOL
from RDFSink import Logic_NS
import diag
from xmlC14n import Canonicalize
from why import BecauseOfData, becauseSubexpression
N3_forSome_URI = RDFSink.forSomeSym
N3_forAll_URI = RDFSink.forAllSym
# Magic resources we know about
from RDFSink import RDF_type_URI, RDF_NS_URI, DAML_sameAs_URI, parsesTo_URI
from RDFSink import RDF_spec, List_NS, uniqueURI
from local_decimal import Decimal
ADDED_HASH = "#" # Stop where we use this in case we want to remove it!
# This is the hash on namespace URIs
RDF_type = ( SYMBOL , RDF_type_URI )
DAML_sameAs = ( SYMBOL, DAML_sameAs_URI )
from RDFSink import N3_first, N3_rest, N3_nil, N3_li, N3_List, N3_Empty
LOG_implies_URI = "http://www.w3.org/2000/10/swap/log#implies"
INTEGER_DATATYPE = "http://www.w3.org/2001/XMLSchema#integer"
FLOAT_DATATYPE = "http://www.w3.org/2001/XMLSchema#double"
DECIMAL_DATATYPE = "http://www.w3.org/2001/XMLSchema#decimal"
BOOLEAN_DATATYPE = "http://www.w3.org/2001/XMLSchema#boolean"
option_noregen = 0 # If set, do not regenerate genids on output
# @@ I18n - the notname chars need extending for well known unicode non-text
# characters. The XML spec switched to assuming unknown things were name
# characaters.
# _namechars = string.lowercase + string.uppercase + string.digits + '_-'
_notQNameChars = "\t\r\n !\"#$%&'()*.,+/;<=>?@[\\]^`{|}~" # else valid qname :-/
_notNameChars = _notQNameChars + ":" # Assume anything else valid name :-/
_rdfns = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#'
N3CommentCharacter = "#" # For unix script #! compatabilty
########################################## Parse string to sink
#
# Regular expressions:
eol = re.compile(r'[ \t]*(#[^\n]*)?\r?\n') # end of line, poss. w/comment
eof = re.compile(r'[ \t]*(#[^\n]*)?$') # end of file, poss. w/comment
ws = re.compile(r'[ \t]*') # Whitespace not including NL
signed_integer = re.compile(r'[-+]?[0-9]+') # integer
number_syntax = re.compile(r'(?P<integer>[-+]?[0-9]+)(?P<decimal>\.[0-9]+)?(?P<exponent>e[-+]?[0-9]+)?')
digitstring = re.compile(r'[0-9]+') # Unsigned integer
interesting = re.compile(r'[\\\r\n\"]')
langcode = re.compile(r'[a-zA-Z0-9]+(-[a-zA-Z0-9]+)?')
#"
class SinkParser:
def __init__(self, store, openFormula=None, thisDoc="", baseURI=None,
genPrefix = "", metaURI=None, flags="",
why=None):
""" note: namespace names should *not* end in #;
the # will get added during qname processing """
self._bindings = {}
self._flags = flags
if thisDoc != "":
assert ':' in thisDoc, "Document URI not absolute: <%s>" % thisDoc
self._bindings[""] = thisDoc + "#" # default
self._store = store
if genPrefix: store.setGenPrefix(genPrefix) # pass it on
self._thisDoc = thisDoc
self.lines = 0 # for error handling
self.startOfLine = 0 # For calculating character number
self._genPrefix = genPrefix
self.keywords = ['a', 'this', 'bind', 'has', 'is', 'of', 'true', 'false' ]
self.keywordsSet = 0 # Then only can others be considerd qnames
self._anonymousNodes = {} # Dict of anon nodes already declared ln: Term
self._variables = {}
self._parentVariables = {}
self._reason = why # Why the parser was asked to parse this
self._reason2 = None # Why these triples
if diag.tracking: self._reason2 = BecauseOfData(
store.newSymbol(thisDoc), because=self._reason)
if baseURI: self._baseURI = baseURI
else:
if thisDoc:
self._baseURI = thisDoc
else:
self._baseURI = None
assert not self._baseURI or ':' in self._baseURI
if not self._genPrefix:
if self._thisDoc: self._genPrefix = self._thisDoc + "#_g"
else: self._genPrefix = uniqueURI()
if openFormula ==None:
if self._thisDoc:
self._formula = store.newFormula(thisDoc + "#_formula")
else:
self._formula = store.newFormula()
else:
self._formula = openFormula
self._context = self._formula
self._parentContext = None
if metaURI:
self.makeStatement((SYMBOL, metaURI), # relate doc to parse tree
(SYMBOL, PARSES_TO_URI ), #pred
(SYMBOL, thisDoc), #subj
self._context) # obj
self.makeStatement(((SYMBOL, metaURI), # quantifiers - use inverse?
(SYMBOL, N3_forSome_URI), #pred
self._context, #subj
subj)) # obj
def here(self, i):
"""String generated from position in file
This is for repeatability when refering people to bnodes in a document.
This has diagnostic uses less formally, as it should point one to which
bnode the arbitrary identifier actually is. It gives the
line and character number of the '[' charcacter or path character
which introduced the blank node. The first blank node is boringly _L1C1.
It used to be used only for tracking, but for tests in general
it makes the canonical ordering of bnodes repeatable."""
return "%s_L%iC%i" % (self._genPrefix , self.lines,
i - self.startOfLine + 1)
def formula(self):
return self._formula
def loadStream(self, stream):
return self.loadBuf(stream.read()) # Not ideal
def loadBuf(self, buf):
"""Parses a buffer and returns its top level formula"""
self.startDoc()
self.feed(buf)
return self.endDoc() # self._formula
def feed(self, octets):
"""Feed an octet stream tothe parser
if BadSyntax is raised, the string
passed in the exception object is the
remainder after any statements have been parsed.
So if there is more data to feed to the
parser, it should be straightforward to recover."""
str = octets.decode('utf-8')
i = 0
while i >= 0:
j = self.skipSpace(str, i)
if j<0: return
i = self.directiveOrStatement(str,j)
if i<0:
print "# next char: ", `str[j]`
raise BadSyntax(self._thisDoc, self.lines, str, j,
"expected directive or statement")
def directiveOrStatement(self, str,h):
i = self.skipSpace(str, h)
if i<0: return i # EOF
j = self.directive(str, i)
if j>=0: return self.checkDot(str,j)
j = self.statement(str, i)
if j>=0: return self.checkDot(str,j)
return j
#@@I18N
global _notNameChars
#_namechars = string.lowercase + string.uppercase + string.digits + '_-'
def tok(self, tok, str, i):
"""Check for keyword. Space must have been stripped on entry and
we must not be at end of file."""
assert tok[0] not in _notNameChars # not for punctuation
# was: string.whitespace which is '\t\n\x0b\x0c\r \xa0' -- not ascii
whitespace = '\t\n\x0b\x0c\r '
if str[i:i+1] == "@":
i = i+1
else:
if tok not in self.keywords:
return -1 # No, this has neither keywords declaration nor "@"
if (str[i:i+len(tok)] == tok
and (str[i+len(tok)] in _notQNameChars )):
i = i + len(tok)
return i
else:
return -1
def directive(self, str, i):
j = self.skipSpace(str, i)
if j<0: return j # eof
res = []
j = self.tok('bind', str, i) # implied "#". Obsolete.
if j>0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"keyword bind is obsolete: use @prefix")
j = self.tok('keywords', str, i)
if j>0:
i = self.commaSeparatedList(str, j, res, self.bareWord)
if i < 0:
raise BadSyntax(self._thisDoc, self.lines, str, i,
"'@keywords' needs comma separated list of words")
self.setKeywords(res[:])
if diag.chatty_flag > 80: progress("Keywords ", self.keywords)
return i
j = self.tok('forAll', str, i)
if j > 0:
i = self.commaSeparatedList(str, j, res, self.uri_ref2)
if i <0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"Bad variable list after @forAll")
for x in res:
self._context.declareUniversal(x)
# if x not in self._variables or x in self._parentVariables:
# self._variables[x] = self._context.newUniversal(x)
return i
j = self.tok('forSome', str, i)
if j > 0:
i = self. commaSeparatedList(str, j, res, self.uri_ref2)
if i <0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"Bad variable list after @forSome")
for x in res:
self._context.declareExistential(x)
return i
j=self.tok('prefix', str, i) # no implied "#"
if j<0: return -1
t = []
i = self.qname(str, j, t)
if i<0: raise BadSyntax(self._thisDoc, self.lines, str, j,
"expected qname after @prefix")
j = self.uri_ref2(str, i, t)
if j<0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"expected <uriref> after @prefix _qname_")
if isinstance(t[1], types.TupleType):
ns = t[1][1] # old system for --pipe
else:
ns = t[1].uriref()
if self._baseURI:
ns = join(self._baseURI, ns)
else:
assert ":" in ns, "With no base URI, cannot handle relative URI"
assert ':' in ns # must be absolute
self._bindings[t[0][0]] = ns
self.bind(t[0][0], hexify(ns))
return j
def bind(self, qn, uri):
assert isinstance(uri,
types.StringType), "Any unicode must be %x-encoded already"
if qn == "":
self._store.setDefaultNamespace(uri)
else:
self._store.bind(qn, uri)
def setKeywords(self, k):
"Takes a list of strings"
if k == None:
self.keywordsSet = 0
else:
self.keywords = k
self.keywordsSet = 1
def startDoc(self):
self._store.startDoc()
def endDoc(self):
"""Signal end of document and stop parsing. returns formula"""
self._store.endDoc(self._formula) # don't canonicalize yet
return self._formula
def makeStatement(self, quadruple):
#$$$$$$$$$$$$$$$$$$$$$
# print "# Parser output: ", `quadruple`
self._store.makeStatement(quadruple, why=self._reason2)
def statement(self, str, i):
r = []
i = self.object(str, i, r) # Allow literal for subject - extends RDF
if i<0: return i
j = self.property_list(str, i, r[0])
if j<0: raise BadSyntax(self._thisDoc, self.lines,
str, i, "expected propertylist")
return j
def subject(self, str, i, res):
return self.item(str, i, res)
def verb(self, str, i, res):
""" has _prop_
is _prop_ of
a
=
_prop_
>- prop ->
<- prop -<
_operator_"""
j = self.skipSpace(str, i)
if j<0:return j # eof
r = []
j = self.tok('has', str, i)
if j>=0:
i = self.prop(str, j, r)
if i < 0: raise BadSyntax(self._thisDoc, self.lines,
str, j, "expected property after 'has'")
res.append(('->', r[0]))
return i
j = self.tok('is', str, i)
if j>=0:
i = self.prop(str, j, r)
if i < 0: raise BadSyntax(self._thisDoc, self.lines, str, j,
"expected <property> after 'is'")
j = self.skipSpace(str, i)
if j<0:
raise BadSyntax(self._thisDoc, self.lines, str, i,
"End of file found, expected property after 'is'")
return j # eof
i=j
j = self.tok('of', str, i)
if j<0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"expected 'of' after 'is' <prop>")
res.append(('<-', r[0]))
return j
j = self.tok('a', str, i)
if j>=0:
res.append(('->', RDF_type))
return j
if str[i:i+2] == "<=":
res.append(('<-', self._store.newSymbol(Logic_NS+"implies")))
return i+2
if str[i:i+1] == "=":
if str[i+1:i+2] == ">":
res.append(('->', self._store.newSymbol(Logic_NS+"implies")))
return i+2
res.append(('->', DAML_sameAs))
return i+1
if str[i:i+2] == ":=":
# patch file relates two formulae, uses this @@ really?
res.append(('->', Logic_NS+"becomes"))
return i+2
j = self.prop(str, i, r)
if j >= 0:
res.append(('->', r[0]))
return j
if str[i:i+2] == ">-" or str[i:i+2] == "<-":
raise BadSyntax(self._thisDoc, self.lines, str, j,
">- ... -> syntax is obsolete.")
return -1
def prop(self, str, i, res):
return self.item(str, i, res)
def item(self, str, i, res):
return self.path(str, i, res)
def blankNode(self, uri=None):
if "B" not in self._flags:
return self._context.newBlankNode(uri, why=self._reason2)
x = self._context.newSymbol(uri)
self._context.declareExistential(x)
return x
def path(self, str, i, res):
"""Parse the path production.
"""
j = self.nodeOrLiteral(str, i, res)
if j<0: return j # nope
while str[j:j+1] in "!^.": # no spaces, must follow exactly (?)
ch = str[j:j+1] # @@ Allow "." followed IMMEDIATELY by a node.
if ch == ".":
ahead = str[j+1:j+2]
if not ahead or (ahead in _notNameChars
and ahead not in ":?<[{("): break
subj = res.pop()
obj = self.blankNode(uri=self.here(j))
j = self.node(str, j+1, res)
if j<0: raise BadSyntax(self._thisDoc, self.lines, str, j,
"EOF found in middle of path syntax")
pred = res.pop()
if ch == "^": # Reverse traverse
self.makeStatement((self._context, pred, obj, subj))
else:
self.makeStatement((self._context, pred, subj, obj))
res.append(obj)
return j
def anonymousNode(self, ln):
"""Remember or generate a term for one of these _: anonymous nodes"""
term = self._anonymousNodes.get(ln, None)
if term != None: return term
term = self._store.newBlankNode(self._context, why=self._reason2)
self._anonymousNodes[ln] = term
return term
def node(self, str, i, res, subjectAlready=None):
"""Parse the <node> production.
Space is now skipped once at the beginning
instead of in multipe calls to self.skipSpace().
"""
subj = subjectAlready
j = self.skipSpace(str,i)
if j<0: return j #eof
i=j
ch = str[i:i+1] # Quick 1-character checks first:
if ch == "[":
bnodeID = self.here(i)
j=self.skipSpace(str,i+1)
if j<0: raise BadSyntax(self._thisDoc,
self.lines, str, i, "EOF after '['")
if str[j:j+1] == "=": # Hack for "is" binding name to anon node
i = j+1
objs = []
j = self.objectList(str, i, objs);
if j>=0:
subj = objs[0]
if len(objs)>1:
for obj in objs:
self.makeStatement((self._context,
DAML_sameAs, subj, obj))
j = self.skipSpace(str, j)
if j<0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"EOF when objectList expected after [ = ")
if str[j:j+1] == ";":
j=j+1
else:
raise BadSyntax(self._thisDoc, self.lines, str, i,
"objectList expected after [= ")
if subj is None:
subj=self.blankNode(uri= bnodeID)
i = self.property_list(str, j, subj)
if i<0: raise BadSyntax(self._thisDoc, self.lines, str, j,
"property_list expected")
j = self.skipSpace(str, i)
if j<0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"EOF when ']' expected after [ <propertyList>")
if str[j:j+1] != "]":
raise BadSyntax(self._thisDoc,
self.lines, str, j, "']' expected")
res.append(subj)
return j+1
if ch == "{":
ch2 = str[i+1:i+2]
if ch2 == '$':
i += 1
j = i + 1
List = []
first_run = True
while 1:
i = self.skipSpace(str, j)
if i<0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"needed '$}', found end.")
if str[i:i+2] == '$}':
j = i+2
break
if not first_run:
if str[i:i+1] == ',':
i+=1
else:
raise BadSyntax(self._thisDoc, self.lines,
str, i, "expected: ','")
else: first_run = False
item = []
j = self.item(str,i, item) #@@@@@ should be path, was object
if j<0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"expected item in set or '$}'")
List.append(self._store.intern(item[0]))
res.append(self._store.newSet(List, self._context))
return j
else:
j=i+1
oldParentContext = self._parentContext
self._parentContext = self._context
parentAnonymousNodes = self._anonymousNodes
grandParentVariables = self._parentVariables
self._parentVariables = self._variables
self._anonymousNodes = {}
self._variables = self._variables.copy()
reason2 = self._reason2
self._reason2 = becauseSubexpression
if subj is None: subj = self._store.newFormula()
self._context = subj
while 1:
i = self.skipSpace(str, j)
if i<0: raise BadSyntax(self._thisDoc, self.lines,
str, i, "needed '}', found end.")
if str[i:i+1] == "}":
j = i+1
break
j = self.directiveOrStatement(str,i)
if j<0: raise BadSyntax(self._thisDoc, self.lines,
str, i, "expected statement or '}'")
self._anonymousNodes = parentAnonymousNodes
self._variables = self._parentVariables
self._parentVariables = grandParentVariables
self._context = self._parentContext
self._reason2 = reason2
self._parentContext = oldParentContext
res.append(subj.close()) # No use until closed
return j
if ch == "(":
thing_type = self._store.newList
ch2 = str[i+1:i+2]
if ch2 == '$':
thing_type = self._store.newSet
i += 1
j=i+1
List = []
while 1:
i = self.skipSpace(str, j)
if i<0: raise BadSyntax(self._thisDoc, self.lines,
str, i, "needed ')', found end.")
if str[i:i+1] == ')':
j = i+1
break
item = []
j = self.item(str,i, item) #@@@@@ should be path, was object
if j<0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"expected item in list or ')'")
List.append(self._store.intern(item[0]))
res.append(thing_type(List, self._context))
return j
j = self.tok('this', str, i) # This context
if j>=0:
res.append(self._context)
return j
#booleans
j = self.tok('true', str, i)
if j>=0:
res.append(True)
return j
j = self.tok('false', str, i)
if j>=0:
res.append(False)
return j
if subj is None: # If this can be a named node, then check for a name.
j = self.uri_ref2(str, i, res)
if j >= 0:
return j
return -1
def property_list(self, str, i, subj):
"""Parse property list
Leaves the terminating punctuation in the buffer
"""
while 1:
j = self.skipSpace(str, i)
if j<0:
raise BadSyntax(self._thisDoc, self.lines, str, i,
"EOF found when expected verb in property list")
return j #eof
if str[j:j+2] ==":-":
i = j + 2
res = []
j = self.node(str, i, res, subj)
if j<0: raise BadSyntax(self._thisDoc, self.lines, str, i,
"bad {} or () or [] node after :- ")
i=j
continue
i=j
v = []
j = self.verb(str, i, v)
if j<=0:
return i # void but valid
objs = []
i = self.objectList(str, j, objs)
if i<0: raise BadSyntax(self._thisDoc, self.lines, str, j,
"objectList expected")
for obj in objs:
dir, sym = v[0]
if dir == '->':
self.makeStatement((self._context, sym, subj, obj))
else:
self.makeStatement((self._context, sym, obj, subj))
j = self.skipSpace(str, i)
if j<0:
raise BadSyntax(self._thisDoc, self.lines, str, j,
"EOF found in list of objects")
return j #eof
if str[i:i+1] != ";":
return i
i = i+1 # skip semicolon and continue
def commaSeparatedList(self, str, j, res, what):
"""return value: -1 bad syntax; >1 new position in str
res has things found appended
"""
i = self.skipSpace(str, j)
if i<0:
raise BadSyntax(self._thisDoc, self.lines, str, i,
"EOF found expecting comma sep list")
return i
if str[i] == ".": return j # empty list is OK
i = what(str, i, res)
if i<0: return -1
while 1:
j = self.skipSpace(str, i)
if j<0: return j # eof
ch = str[j:j+1]
if ch != ",":
if ch != ".":
return -1
return j # Found but not swallowed "."
i = what(str, j+1, res)
if i<0:
raise BadSyntax(self._thisDoc, self.lines, str, i,
"bad list content")
return i
def objectList(self, str, i, res):
i = self.object(str, i, res)
if i<0: return -1
while 1:
j = self.skipSpace(str, i)
if j<0:
raise BadSyntax(self._thisDoc, self.lines, str, j,
"EOF found after object")
return j #eof
if str[j:j+1] != ",":
return j # Found something else!
i = self.object(str, j+1, res)
if i<0: return i
def checkDot(self, str, i):
j = self.skipSpace(str, i)
if j<0: return j #eof
if str[j:j+1] == ".":
return j+1 # skip
if str[j:j+1] == "}":
return j # don't skip it
if str[j:j+1] == "]":
return j
raise BadSyntax(self._thisDoc, self.lines,
str, j, "expected '.' or '}' or ']' at end of statement")
return i
def uri_ref2(self, str, i, res):
"""Generate uri from n3 representation.
Note that the RDF convention of directly concatenating
NS and local name is now used though I prefer inserting a '#'
to make the namesapces look more like what XML folks expect.
"""
qn = []
j = self.qname(str, i, qn)
if j>=0:
pfx, ln = qn[0]
if pfx is None:
assert 0, "not used?"
ns = self._baseURI + ADDED_HASH
else:
try:
ns = self._bindings[pfx]
except KeyError:
if pfx == "_": # Magic prefix 2001/05/30, can be overridden
res.append(self.anonymousNode(ln))
return j
raise BadSyntax(self._thisDoc, self.lines, str, i,
"Prefix %s not bound" % (pfx))
symb = self._store.newSymbol(ns + ln)
if symb in self._variables:
res.append(self._variables[symb])
else:
res.append(symb) # @@@ "#" CONVENTION
if not string.find(ns, "#"):progress(
"Warning: no # on namespace %s," % ns)
return j
i = self.skipSpace(str, i)
if i<0: return -1
if str[i] == "?":
v = []
j = self.variable(str,i,v)
if j>0: #Forget varibles as a class, only in context.
res.append(v[0])
return j
return -1
elif str[i]=="<":
i = i + 1
st = i
while i < len(str):
if str[i] == ">":
uref = str[st:i] # the join should dealt with "":
if self._baseURI:
uref = uripath.join(self._baseURI, uref)
else:
assert ":" in uref, \
"With no base URI, cannot deal with relative URIs"
if str[i-1:i]=="#" and not uref[-1:]=="#":
uref = uref + "#" # She meant it! Weirdness in urlparse?
symb = self._store.newSymbol(uref)
if symb in self._variables:
res.append(self._variables[symb])
else:
res.append(symb)
return i+1
i = i + 1
raise BadSyntax(self._thisDoc, self.lines, str, j,
"unterminated URI reference")
elif self.keywordsSet:
v = []
j = self.bareWord(str,i,v)
if j<0: return -1 #Forget varibles as a class, only in context.
if v[0] in self.keywords:
raise BadSyntax(self._thisDoc, self.lines, str, i,
'Keyword "%s" not allowed here.' % v[0])
res.append(self._store.newSymbol(self._bindings[""]+v[0]))
return j
else:
return -1
def skipSpace(self, str, i):
"""Skip white space, newlines and comments.
return -1 if EOF, else position of first non-ws character"""
while 1:
m = eol.match(str, i)
if m == None: break
self.lines = self.lines + 1
i = m.end() # Point to first character unmatched
self.startOfLine = i
m = ws.match(str, i)
if m != None:
i = m.end()
m = eof.match(str, i)
if m != None: return -1
return i
def variable(self, str, i, res):
""" ?abc -> variable(:abc)
"""
j = self.skipSpace(str, i)
if j<0: return -1
if str[j:j+1] != "?": return -1
j=j+1
i = j
if str[j] in "0123456789-":
raise BadSyntax(self._thisDoc, self.lines, str, j,
"Varible name can't start with '%s'" % str[j])
return -1
while i <len(str) and str[i] not in _notNameChars:
i = i+1
if self._parentContext == None:
raise BadSyntax(self._thisDoc, self.lines, str, j,
"Can't use ?xxx syntax for variable in outermost level: %s"
% str[j-1:i])
varURI = self._store.newSymbol(self._baseURI + "#" +str[j:i])
if varURI not in self._parentVariables:
self._parentVariables[varURI] = self._parentContext.newUniversal(varURI
, why=self._reason2)
res.append(self._parentVariables[varURI])
return i
def bareWord(self, str, i, res):
""" abc -> :abc
"""
j = self.skipSpace(str, i)
if j<0: return -1
if str[j] in "0123456789-" or str[j] in _notNameChars: return -1
i = j
while i <len(str) and str[i] not in _notNameChars:
i = i+1
res.append(str[j:i])
return i
def qname(self, str, i, res):
"""
xyz:def -> ('xyz', 'def')
If not in keywords and keywordsSet: def -> ('', 'def')
:def -> ('', 'def')
"""
i = self.skipSpace(str, i)
if i<0: return -1
c = str[i]
if c in "0123456789-+": return -1
if c not in _notNameChars:
ln = c
i = i + 1
while i < len(str):
c = str[i]
if c not in _notNameChars:
ln = ln + c
i = i + 1
else: break
else: # First character is non-alpha
ln = '' # Was: None - TBL (why? useful?)
if i<len(str) and str[i] == ':':
pfx = ln
i = i + 1
ln = ''
while i < len(str):
c = str[i]
if c not in _notNameChars:
ln = ln + c
i = i + 1
else: break
res.append((pfx, ln))
return i
else: # delimiter was not ":"
if ln and self.keywordsSet and ln not in self.keywords:
res.append(('', ln))
return i
return -1
def object(self, str, i, res):
j = self.subject(str, i, res)
if j>= 0:
return j
else:
j = self.skipSpace(str, i)
if j<0: return -1
else: i=j
if str[i]=='"':
if str[i:i+3] == '"""': delim = '"""'
else: delim = '"'
i = i + len(delim)
j, s = self.strconst(str, i, delim)
res.append(self._store.newLiteral(s))
progress("New string const ", s, j)
return j
else:
return -1
def nodeOrLiteral(self, str, i, res):
j = self.node(str, i, res)
if j>= 0:
return j
else:
j = self.skipSpace(str, i)
if j<0: return -1
else: i=j
ch = str[i]
if ch in "-+0987654321":
m = number_syntax.match(str, i)
if m == None:
raise BadSyntax(self._thisDoc, self.lines, str, i,
"Bad number syntax")
j = m.end()
if m.group('exponent') != None: # includes decimal exponent
res.append(float(str[i:j]))
# res.append(self._store.newLiteral(str[i:j],
# self._store.newSymbol(FLOAT_DATATYPE)))
elif m.group('decimal') != None:
res.append(Decimal(str[i:j]))
else:
res.append(long(str[i:j]))
# res.append(self._store.newLiteral(str[i:j],
# self._store.newSymbol(INTEGER_DATATYPE)))
return j
if str[i]=='"':
if str[i:i+3] == '"""': delim = '"""'
else: delim = '"'
i = i + len(delim)
dt = None
j, s = self.strconst(str, i, delim)
lang = None
if str[j:j+1] == "@": # Language?
m = langcode.match(str, j+1)
if m == None:
raise BadSyntax(self._thisDoc, startline, str, i,
"Bad language code syntax on string literal, after @")
i = m.end()
lang = str[j+1:i]
j = i
if str[j:j+2] == "^^":
res2 = []
j = self.uri_ref2(str, j+2, res2) # Read datatype URI