rdf-n3 0.3.4.1 → 0.3.5

data/example.rb

@@ -1,45 +0,0 @@
-#!/usr/bin/env ruby
-
-$:.unshift(File.join(File.dirname(__FILE__), 'lib'))
-
-require 'rubygems'
-require 'rdf/n3'
-
-data = <<-EOF;
-  @prefix dc: <http://purl.org/dc/elements/1.1/>.
-  @prefix po: <http://purl.org/ontology/po/>.
-  @prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>.
-  _:broadcast
-   a po:Broadcast;
-   po:schedule_date """2008-06-24T12:00:00Z""";
-   po:broadcast_of _:version;
-   po:broadcast_on <http://www.bbc.co.uk/programmes/service/6music>;
-  .
-  _:version
-   a po:Version;
-  .
-  <http://www.bbc.co.uk/programmes/b0072l93>
-   dc:title """Nemone""";
-   a po:Brand;
-  .
-  <http://www.bbc.co.uk/programmes/b00c735d>
-   a po:Episode;
-   po:episode <http://www.bbc.co.uk/programmes/b0072l93>;
-   po:version _:version;
-   po:long_synopsis """Actor and comedian Rhys Darby chats to Nemone.""";
-   dc:title """Nemone""";
-   po:synopsis """Actor and comedian Rhys Darby chats to Nemone.""";
-  .
-  <http://www.bbc.co.uk/programmes/service/6music>
-   a po:Service;
-   dc:title """BBC 6 Music""";
-  .
-
-  #_:abcd a po:Episode.
-EOF
-
-RDF::N3::Reader.new(data, :base_uri => 'http://www.bbc.co.uk/programmes/on-now.n3') do |reader|
-  reader.each_statement do |statement|
-    statement.inspect!
-  end
-end

data/lib/rdf/n3/patches/graph_properties.rb

@@ -1,34 +0,0 @@
-module RDF
-  class Graph
-    # Resource properties
-    #
-    # Properties arranged as a hash with the predicate Term as index to an array of resources or literals
-    #
-    # Example:
-    #   graph.load(':foo a :bar; rdfs:label "An example" .', "http://example.com/")
-    #   graph.resources(URI.new("http://example.com/subject")) =>
-    #   {
-    #     "http://www.w3.org/1999/02/22-rdf-syntax-ns#type" => [<http://example.com/#bar>],
-    #     "http://example.com/#label"                       => ["An example"]
-    #   }
-    def properties(subject, recalc = false)
-      @properties ||= {}
-      @properties.delete(subject.to_s) if recalc
-      @properties[subject.to_s] ||= begin
-        hash = Hash.new
-        self.query(:subject => subject) do |statement|
-          pred = statement.predicate.to_s
-
-          hash[pred] ||= []
-          hash[pred] << statement.object
-        end
-        hash
-      end
-    end
-
-    # Get type(s) of subject, returns a list of symbols
-    def type_of(subject)
-      query(:subject => subject, :predicate => RDF.type).map {|st| st.object}
-    end
-  end
-end

data/lib/rdf/n3/reader/bnf-rules.n3

@@ -1,134 +0,0 @@
-#
-# Baccus - Naur Form (BNF) vocabulary
-#
-
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
-@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
-@prefix bnf: <http://www.w3.org/2000/10/swap/grammar/bnf#>.
-@prefix : <http://www.w3.org/2000/10/swap/grammar/bnf-rules#>.
-@prefix rul: <http://www.w3.org/2000/10/swap/grammar/bnf-rules#>.
-@prefix n3: <http://www.w3.org/2000/10/swap/grammar/n3#>.
-@prefix list: <http://www.w3.org/2000/10/swap/list#>.
-@prefix doc: <http://www.w3.org/2000/10/swap/pim/doc#>.
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-@prefix string: <http://www.w3.org/2000/10/swap/string#>.
-@keywords a, is, of.
-
-
-<> rdfs:comment
-
-"""This set of rules process a BNF graph in its basic
-cfg:mustBeOneOf BNF form and create the branching tables to drive a 
-predictive parser.
-
-See also cfg2bnf.n3 which expands the shothand ontology into the basic
-BNF terms.
-""".
-
-#_____________________________________
-
-
-# Enumerate options:
-
-{ ?x bnf:mustBeOneSequence ?y} => { ?x optionTail ?y }.
-
-{?x optionTail [rdf:first ?y; rdf:rest ?z]} => {
-	?x 	bnf:branch [ bnf:sequence ?y];
-		optionTail ?z.
-  }.
-
-{ ?x bnf:branch [bnf:sequence ?y] } =>  { ?y sequenceTail ?y }.
-
-sequenceTail a log:Chaff.
-optionTail a log:Chaff.
-
-{ ?x sequenceTail [ rdf:rest ?z ] } => { ?x sequenceTail ?z }.
-
-# What productions can follow each other?
-# This is used for working out when to 
-
-{ ?x sequenceTail [ rdf:first ?y; rdf:rest [ rdf:first ?z ]] } =>
-	{ ?y bnf:canPrecede ?z }.
-
-{	?x bnf:branch [
-	    bnf:sequence [
-		list:last ?y]].
-	?x bnf:canPrecede ?z} =>
-	{ ?y bnf:canPrecede ?z }.
-
-{ 	?x bnf:canPrecede ?y.
-	?y bnf:branch [ bnf:sequence () ].
-	?y bnf:canPrecede ?z.
-} => {
-
-	?x bnf:canPrecede ?z.
-}.
-
-
-bnf:eof bnf:canStartWith "@EOFDUMMY". #  @@ kludge
-
-# Have to separate the next three rules or cwm seems to
-# get screwed up and assume there is no solution @@@
- 
-{ ?x bnf:branch [bnf:sequence [ rdf:first ?y ]].
-  }  => { ?x bnf:TEST ?y }.
-
-{ ?x bnf:TEST ?y .
-  ?y log:rawType log:Literal. }  => { ?x bnf:canStartWithLiteral ?y }.
-
-{ ?x bnf:canStartWithLiteral ?y .
-#  (?y "(.).*")  string:scrape ?c     # Use whole string
- }  => { ?y bnf:canStartWith ?y }.
-
-#______________________________________________________________
-
-
-
-# Rules for determining branching
-
-# A branch has  a sequence, which is the given BNF production, and
-# one or more conditions, which are the strings on which to consider
-# that branch.  N3 is a langauge in whch the look-ahead often is only
-# one character, and may allways be a constsnt string rather than a 
-# regexp (check).
-
-# A branchTail is a sequnece which a branch could start with
-{ 	?x bnf:branch ?b.
-	?b bnf:sequence ?s.
-} => {
-	?b bnf:branchTail ?s.
-}.
-
-{	?b bnf:branchTail ?s.
-	?s rdf:first [ bnf:branch [ bnf:sequence () ]];
-           rdf:rest ?t
-} => {
-	?b bnf:branchTail ?t.
-}. 
-
-
-{ 	?x bnf:branch ?b.
-	?b bnf:branchTail ?s.
-	?s rdf:first [bnf:canStartWith ?y].
-} => {
-	?x bnf:canStartWith ?y.
-	?b bnf:condition ?y.
-}.
-
-
-
-{ 	?x bnf:branch ?b;
-	    bnf:canPrecede ?z.
-	?z log:rawType log:Literal.
-	?b bnf:sequence ().
-} =>  { ?b bnf:condition ?z}.
-
-{ 	?x bnf:branch ?b;
-	    bnf:canPrecede [bnf:canStartWith ?z].
-	?b bnf:sequence ().
-} =>  { ?b bnf:condition ?z}.
-
-
-
-
-#ends

data/lib/rdf/n3/reader/n3.n3

@@ -1,261 +0,0 @@
-# Notation3 in Notation3
-# Context Free Grammar without tokenization
-#
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
-@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
-@prefix cfg: <http://www.w3.org/2000/10/swap/grammar/bnf#>.
-@prefix rul: <http://www.w3.org/2000/10/swap/grammar/bnf-rules#>.
-@prefix : <http://www.w3.org/2000/10/swap/grammar/n3#>.
-@prefix n3: <http://www.w3.org/2000/10/swap/grammar/n3#>.
-@prefix list: <http://www.w3.org/2000/10/swap/list#>.
-@prefix string: <http://www.w3.org/2000/10/swap/string#>.
-@keywords a, is, of.
-
-
-# Issues:
-# - string token regexp not right  FIXED
-# - tokenizing rules in general: whitespace are not defined in n3.n3
-#   and it would be nice for the *entire* syntax description to be in RDF.
-# - encoding really needs specifying
-# - @keywords affects tokenizing
-# - comments (tokenizer deals with)
-# - We assume ASCII, in fact should use not notNameChars for i18n
-
-# tokenizing:
-# Absorb anything until end of regexp, then stil white space
-#  period followed IMMEDIATELY by an opener or name char is taken as "!".
-#  Except after a "." used instead of in those circumstances,
-#	ws may be inserted between tokens.
-#  WS MUST be inserted between tokens where ambiguity would arise.
-#  (possible ending characters of one and beginning characters overlap)
-#
-
-#<> cfg:syntaxFor [ cfg:internetMediaType 
-#		<http://www.w3.org/2003/mediatypes/text/n3>].
-
-
-# __________________________________________________________________
-#
-# The N3 Full Grammar
-
-
-language a cfg:Language;
-	cfg:document	document;
-	cfg:whiteSpace	"@@@@@".
-
-
-document a rul:Used;
-	cfg:mustBeOneSequence(
-	
-		(
-#			[ cfg:zeroOrMore declaration ]
-#			[ cfg:zeroOrMore universal ]
-#			[ cfg:zeroOrMore existential ]
-			statements_optional
-			cfg:eof
-		)
-	).
-
-statements_optional cfg:mustBeOneSequence (() ( statement "." statements_optional ) ).
-
-# Formula does NOT need period on last statement
-
-formulacontent cfg:mustBeOneSequence (
-		( statementlist )
-	).
-
-
-statementlist cfg:mustBeOneSequence (
-		( )
-		( statement statementtail )
-	).
-
-statementtail cfg:mustBeOneSequence (
-		( )
-		( "." statementlist )
-	).
-
-
-statement  cfg:mustBeOneSequence (
-		(declaration)
-		(universal)
-		(existential)
-		(simpleStatement)
-	).
-
-universal cfg:mustBeOneSequence (
-		(
-			"@forAll"
-			[ cfg:commaSeparatedListOf symbol ]
-		)).
-
-existential cfg:mustBeOneSequence(
-		(	 "@forSome" 
-			 [ cfg:commaSeparatedListOf symbol ]
-		)).
-
-
-declaration cfg:mustBeOneSequence(
-		( "@base" explicituri  )
-		( "@prefix" prefix explicituri  )
-		( "@keywords" [ cfg:commaSeparatedListOf barename ] )
-	).
-
-
-simpleStatement cfg:mustBeOneSequence(( subject propertylist )).
-
-propertylist cfg:mustBeOneSequence (
-		( )
-		( predicate  object objecttail propertylisttail )
-	).
-
-propertylisttail cfg:mustBeOneSequence (
-		( )
-		( ";" propertylist )
-	).
-
-
-objecttail cfg:mustBeOneSequence (
-		( )
-		( ","   object objecttail )
-	).
-
-
-predicate cfg:mustBeOneSequence (
-		( expression )
-		( "@has" expression )
-		( "@is" expression "@of" )
-		( "@a" )
-		( "=" )
-		( "=>" )
-		( "<=" ) 
-	).
-
-subject cfg:mustBeOneSequence ((expression)).
-
-object cfg:mustBeOneSequence ((expression)).
-
-expression cfg:mustBeOneSequence(
-		( pathitem pathtail )
-	).
-
-pathtail cfg:mustBeOneSequence(
-		(  )
-		( "!" expression )
-		( "^" expression )
-	).
-
-
-pathitem cfg:mustBeOneSequence (
-		( symbol )
-		( "{" formulacontent "}" )
-		( quickvariable )
-		( numericliteral )
-		( literal )
-		( "[" propertylist "]"  )
-		(  "("  pathlist ")"  )
-                ( boolean )
-#		( "@this" )	  #  Deprocated.  Was allowed for this log:forAll x
-).
-
-
-boolean cfg:mustBeOneSequence (
-                ( "@true" )
-                ( "@false" )
-) .
-
-pathlist cfg:mustBeOneSequence (() (expression pathlist)).
-
-symbol cfg:mustBeOneSequence (
-		(explicituri)
-		(qname)
-	).
-
-
-numericliteral cfg:mustBeOneSequence (
-          ( integer )
-          ( rational )
-          ( double )
-          ( decimal )
-) .
-
-rational cfg:mustBeOneSequence (( integer "/" unsignedint)).
-
-
-literal cfg:mustBeOneSequence(( string dtlang)).
-
-dtlang cfg:mustBeOneSequence(  ()  ("@" langcode)  ("^^" symbol)).
-
-
-#______________________________________________________________________
-#
-#   TERMINALS
-#
-# "canStartWith" actually gives "a" for the whole class of alpha characters
-# and "0" for any of the digits 0-9.  This is used to build the branching
-# tables.
-# 
-integer 	cfg:matches	"""[-+]?[0-9]+""";
-		cfg:canStartWith 	"0", "-", "+".
-unsignedint 	cfg:matches	"""[0-9]+""";
-		cfg:canStartWith 	"0".
-double	cfg:matches	"""[-+]?[0-9]+(\\.[0-9]+)?([eE][-+]?[0-9]+)""";
-		cfg:canStartWith 	"0", "-", "+".
-decimal	cfg:matches	"""[-+]?[0-9]+\\.[0-9]*""";
-		cfg:canStartWith 	"0", "-", "+".
-
-#numericliteral	cfg:matches	"""[-+]?[0-9]+(\\.[0-9]+)?(e[-+]?[0-9]+)?""";
-#		cfg:canStartWith 	"0", "-", "+".
-
-explicituri 	cfg:matches 	"<[^>]*>";
-		cfg:canStartWith 	"<".
-
-prefix 		cfg:matches  	"([A-Z_a-z\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c-\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff][\\-0-9A-Z_a-z\u00b7\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u037d\u037f-\u1fff\u200c-\u200d\u203f-\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff]*)?:";
-		cfg:canStartWith 	"a", "_", ":".  # @@ etc unicode
-
-qname 		cfg:matches  	"(([A-Z_a-z\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c-\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff][\\-0-9A-Z_a-z\u00b7\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u037d\u037f-\u1fff\u200c-\u200d\u203f-\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff]*)?:)?[A-Z_a-z\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c-\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff][\\-0-9A-Z_a-z\u00b7\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u037d\u037f-\u1fff\u200c-\u200d\u203f-\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff]*";
-		cfg:canStartWith 	"a", "_", ":".  # @@ etc unicode
-
-# ASCII version:
-#barename 	cfg:matches  	"[a-zA-Z_][a-zA-Z0-9_]*";  # subset of qname
-#		cfg:canStartWith 	"a", "_".  # @@ etc
-
-# This is the XML1.1
-barename 	cfg:matches  	"[A-Z_a-z\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c-\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff][\\-0-9A-Z_a-z\u00b7\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u037d\u037f-\u1fff\u200c-\u200d\u203f-\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff]*";
-                cfg:canStartWith 	"a", "_".  # @@ etc .
-
-# as far as I can tell, the regexp should be
-# barename 	cfg:matches  	"[A-Z_a-z\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c-\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff][\\-0-9A-Z_a-z\u00b7\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u037d\u037f-\u1fff\u200c-\u200d\u203f-\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff]*" .
-#
-
-quickvariable 	cfg:matches  	"\\?[A-Z_a-z\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c-\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff][\\-0-9A-Z_a-z\u00b7\u00c0-\u00d6\u00d8-\u00f6\u00f8-\u037d\u037f-\u1fff\u200c-\u200d\u203f-\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd\U00010000-\U000effff]*";  # ? barename
-		cfg:canStartWith 	"?".  #
-
-# Maybe dtlang should just be part of string regexp?
-# Whitespace is not allowed
-
-# was: "[a-zA-Z][a-zA-Z0-9]*(-[a-zA-Z0-9]+)?";
-langcode	cfg:matches  	"[a-z]+(-[a-z0-9]+)*"; # http://www.w3.org/TR/rdf-testcases/#language
-		cfg:canStartWith 	"a".
-
-
-#               raw regexp single quoted would be   "([^"]|(\\"))*"
-# See:
-# 	$ PYTHONPATH=$SWAP python
-# 	>>> import tokenize 
-# 	>>> import notation3
-# 	>>> print notation3.stringToN3(tokenize.Double3)
-# 	"[^\"\\\\]*(?:(?:\\\\.|\"(?!\"\"))[^\"\\\\]*)*\"\"\""
-# 	>>> print notation3.stringToN3(tokenize.Double)
-# 	"[^\"\\\\]*(?:\\\\.[^\"\\\\]*)*\""
-# After that we have to prefix with one or three opening \"  which
-# the python regexp doesn't have.
-#
-# string3		cfg:matches		"\"\"\"[^\"\\\\]*(?:(?:\\\\.|\"(?!\"\"))[^\"\\\\]*)*\"\"\"".
-# string1		cfg:matches		"\"[^\"\\\\]*(?:\\\\.[^\"\\\\]*)*\"".
-
-string		cfg:matches		"(\"\"\"[^\"\\\\]*(?:(?:\\\\.|\"(?!\"\"))[^\"\\\\]*)*\"\"\")|(\"[^\"\\\\]*(?:\\\\.[^\"\\\\]*)*\")";
-		cfg:canStartWith 	"\"".
-
-
-#ends