eyeling 1.24.4 → 1.24.5

package/HANDBOOK.md

@@ -239,7 +239,7 @@ Parsing becomes dramatically simpler because tokenization already decided where
 
 By default, Eyeling parses ordinary N3. Selected RDF/TriG surface syntax is accepted only when RDF compatibility is explicitly enabled with `eyeling -r file.trig`, `eyeling --rdf file.trig`, or API option `{ rdf: true }`. In that mode, the lexer normalizes RDF/TriG input syntax to ordinary N3 graph terms before normal parsing, and the printer emits RDF/TriG-compatible output where feasible. Eyeling remains an N3 reasoner; this is syntax compatibility, not a separate RDF dataset reasoning model.
 
-In RDF compatibility mode, RDF 1.2 triple terms written as `<<( s p o )>>` are normalized to Eyeling's existing singleton quoted-formula term `{ s p o }`. A leading `VERSION "1.2"` or `@version "1.2"` directive is ignored for the same reason. On output, `--rdf` converts a singleton graph term back to `<<( ... )>>` only when its inner triple is valid as an RDF triple term; otherwise it stays in N3 graph-term form. It also prints `log:nameOf` graph-term triples back as TriG named graph blocks. For example:
+In RDF compatibility mode, RDF 1.2 triple terms written as `<<( s p o )>>`, plus the reified triple form `<<s p o ~ r>>`, are normalized to Eyeling's existing singleton quoted-formula term `{ s p o }`. A reifier `r` is preserved as `r rdf:reifies { s p o }`. A leading `VERSION "1.2"` or `@version "1.2"` directive is ignored for the same reason. On output, `--rdf` converts a singleton graph term back to `<<( ... )>>` only when its inner triple is valid as an RDF triple term; otherwise it stays in N3 graph-term form. It also prints `log:nameOf` graph-term triples back as TriG named graph blocks. For example:
 
 ```n3
 :observation rdf:reifies <<( :sensor :reports :overheating )>> .
@@ -2594,7 +2594,7 @@ Quoted graphs/formulas use `{ ... }`. Inside a quoted formula, directive scope m
 
 - `@prefix/@base` and `PREFIX/BASE` directives may appear at top level **or inside `{ ... }`**, and apply to the formula they occur in (formula-local scoping).
 
-With `-r, --rdf` / `{ rdf: true }`, Eyeling also accepts the RDF 1.2 triple-term surface form `<<( s p o )>>` as a compatibility spelling for a singleton quoted formula `{ s p o }`. In the same mode, feasible singleton graph terms are printed back as RDF 1.2 triple terms, while invalid cases such as a literal subject remain ordinary N3 graph terms. This is useful for inputs that use `rdf:reifies` or other predicates whose objects are RDF 1.2 triple terms, while keeping the default language and the rest of Eyeling on its N3 formula-term model.
+With `-r, --rdf` / `{ rdf: true }`, Eyeling also accepts RDF 1.2 triple-term surface forms such as `<<( s p o )>>` and `<<s p o ~ r>>` as compatibility spellings for a singleton quoted formula `{ s p o }`. In the same mode, feasible singleton graph terms are printed back as RDF 1.2 triple terms, while invalid cases such as a literal subject remain ordinary N3 graph terms. This is useful for inputs that use `rdf:reifies` or other predicates whose objects are RDF 1.2 triple terms, while keeping the default language and the rest of Eyeling on its N3 formula-term model.
 
 For the formal grammar, see the N3 spec grammar:
 

package/dist/browser/eyeling.browser.js

@@ -9590,6 +9590,7 @@ function stripQuotes(lex) {
 //   - A top-level default graph block { ... } is unwrapped into ordinary triples.
 // This keeps all downstream parsing/reasoning N3-only.
 const LOG_NAME_OF_IRI = '<http://www.w3.org/2000/10/swap/log#nameOf>';
+const RDF_REIFIES_IRI = '<http://www.w3.org/1999/02/22-rdf-syntax-ns#reifies>';
 
 function normalizeRdfCompatibility(inputText) {
   let text = String(inputText ?? '');
@@ -9598,11 +9599,12 @@ function normalizeRdfCompatibility(inputText) {
   // surface-syntax normalization. Avoid scanning large files character-by-character
   // unless they actually contain RDF 1.2 triple terms, VERSION directives, or a
   // plausible top-level TriG named graph block.
-  const hasTripleTerms = text.includes('<<(');
+  const hasTripleTerms = text.includes('<<');
   const hasVersionDirective = /^\s*(?:@version|VERSION)\s+(["'])1\.2\1\s*\.?\s*(?:#.*)?$/im.test(text);
   const hasNamedGraphCandidate = /(?:^|[.\r\n])\s*(?:GRAPH\s+)?(?:<[^>\r\n]*>|_:[A-Za-z][A-Za-z0-9_-]*|[A-Za-z][A-Za-z0-9_-]*:[^\s{};,.()[\]]*)\s*\{/m.test(text);
+  const hasAnnotationSyntax = /(?:^|\s)~\s*(?:<|_:[A-Za-z]|[A-Za-z][A-Za-z0-9_-]*:|\{\|)|\{\|/.test(text);
 
-  if (!hasTripleTerms && !hasVersionDirective && !hasNamedGraphCandidate) return text;
+  if (!hasTripleTerms && !hasVersionDirective && !hasNamedGraphCandidate && !hasAnnotationSyntax) return text;
 
   function isWordChar(ch) {
     return ch != null && /[A-Za-z0-9_:-]/.test(ch);
@@ -9664,11 +9666,67 @@ function normalizeRdfCompatibility(inputText) {
 
   function convertTripleTerms(s) {
     let i = 0;
+    const reifierTriples = [];
 
     function startsAt(needle, at = i) {
       return s.startsWith(needle, at);
     }
 
+    function splitTopLevelReifier(body) {
+      let depthBrace = 0;
+      let depthBracket = 0;
+      let depthParen = 0;
+      for (let j = 0; j < body.length; j++) {
+        const ch = body[j];
+        if (ch === '"' || ch === "'") {
+          const str = readStringAt(body, j);
+          j = str.end - 1;
+          continue;
+        }
+        if (ch === '<') {
+          const iri = readIriAt(body, j);
+          j = iri.end - 1;
+          continue;
+        }
+        if (ch === '#') {
+          while (j < body.length && body[j] !== '\n' && body[j] !== '\r') j += 1;
+          continue;
+        }
+        if (ch === '{') depthBrace += 1;
+        else if (ch === '}' && depthBrace > 0) depthBrace -= 1;
+        else if (ch === '[') depthBracket += 1;
+        else if (ch === ']' && depthBracket > 0) depthBracket -= 1;
+        else if (ch === '(') depthParen += 1;
+        else if (ch === ')' && depthParen > 0) depthParen -= 1;
+        else if (ch === '~' && depthBrace === 0 && depthBracket === 0 && depthParen === 0) {
+          return { triple: body.slice(0, j).trim(), reifier: body.slice(j + 1).trim() };
+        }
+      }
+      return { triple: body.trim(), reifier: '' };
+    }
+
+    function firstTerm(text) {
+      const at = skipWsAndComments(text, 0);
+      if (at >= text.length) return '';
+      if (text[at] === '<') return readIriAt(text, at).text;
+      let j = at;
+      while (j < text.length && !/\s/.test(text[j]) && !'{}[](),;.'.includes(text[j])) j += 1;
+      return text.slice(at, j);
+    }
+
+    function graphTermFromTripleBody(rawBody, parenthesized) {
+      let body = rawBody.trim();
+      if (parenthesized && body.startsWith('(') && body.endsWith(')')) body = body.slice(1, -1).trim();
+      const split = splitTopLevelReifier(body);
+      const triple = split.triple;
+      const graph = '{ ' + triple + ' }';
+      if (split.reifier) {
+        const reifier = firstTerm(split.reifier);
+        if (reifier) reifierTriples.push(`${reifier} ${RDF_REIFIES_IRI} ${graph} .`);
+      }
+      return graph;
+    }
+
     function convertUntil(stopToken) {
       let out = '';
       while (i < s.length) {
@@ -9678,7 +9736,12 @@ function normalizeRdfCompatibility(inputText) {
         }
         if (startsAt('<<(')) {
           i += 3;
-          out += '{ ' + convertUntil(')>>').trim() + ' }';
+          out += graphTermFromTripleBody(convertUntil(')>>'), false);
+          continue;
+        }
+        if (startsAt('<<')) {
+          i += 2;
+          out += graphTermFromTripleBody(convertUntil('>>'), false);
           continue;
         }
         const ch = s[i];
@@ -9709,7 +9772,189 @@ function normalizeRdfCompatibility(inputText) {
       return out;
     }
 
-    return convertUntil(null);
+    const converted = convertUntil(null);
+    if (reifierTriples.length === 0) return converted;
+    return converted + (converted.endsWith('\n') ? '' : '\n') + reifierTriples.join('\n') + '\n';
+  }
+
+
+  function convertAnnotations(s) {
+    let out = '';
+    let i = 0;
+    let statementStart = true;
+    let generatedBlank = 0;
+
+    function readBalancedDelimited(s, at, open, close) {
+      if (!s.startsWith(open, at)) return null;
+      let j = at + open.length;
+      let depth = 1;
+      while (j < s.length) {
+        const ch = s[j];
+        if (ch === '"' || ch === "'") {
+          j = readStringAt(s, j).end;
+          continue;
+        }
+        if (ch === '<' && !s.startsWith('<<', j)) {
+          j = readIriAt(s, j).end;
+          continue;
+        }
+        if (ch === '#') {
+          while (j < s.length && s[j] !== '\n' && s[j] !== '\r') j += 1;
+          continue;
+        }
+        if (s.startsWith(open, j)) {
+          depth += 1;
+          j += open.length;
+          continue;
+        }
+        if (s.startsWith(close, j)) {
+          depth -= 1;
+          j += close.length;
+          if (depth === 0) return { text: s.slice(at, j), inner: s.slice(at + open.length, j - close.length), end: j };
+          continue;
+        }
+        j += 1;
+      }
+      throw new N3SyntaxError(`Unterminated RDF annotation block, expected ${close}`);
+    }
+
+    function readTermLikeAt(s, at) {
+      const j = skipWsAndComments(s, at);
+      if (j >= s.length) return null;
+      if (s[j] === '<') return readIriAt(s, j);
+      if (s[j] === '"' || s[j] === "'") {
+        const str = readStringAt(s, j);
+        let end = str.end;
+        let text = str.text;
+        if (s.startsWith('^^', end)) {
+          const dt = readTermAt(s, end + 2);
+          if (dt) {
+            text += '^^' + dt.text;
+            end = dt.end;
+          }
+        } else if (s[end] === '@') {
+          let k = end + 1;
+          if (/[A-Za-z]/.test(s[k] || '')) {
+            while (k < s.length && /[A-Za-z0-9-]/.test(s[k])) k += 1;
+            text += s.slice(end, k);
+            end = k;
+          }
+        }
+        return { text, end };
+      }
+      if (s[j] === '{') return readBalancedBlock(s, j);
+      if (s[j] === '[') return readBalancedDelimited(s, j, '[', ']');
+      if (s[j] === '(') return readBalancedDelimited(s, j, '(', ')');
+      return readTermAt(s, j);
+    }
+
+    function readAnnotationBlockAt(s, at) {
+      if (!s.startsWith('{|', at)) return null;
+      return readBalancedDelimited(s, at, '{|', '|}');
+    }
+
+    function tryReadAnnotatedTriple(at) {
+      const start = skipWsAndComments(s, at);
+      if (start >= s.length) return null;
+      if (s[start] === '@') return null;
+      if (startsWordAt(s, 'PREFIX', start) || startsWordAt(s, 'BASE', start) || startsWordAt(s, 'VERSION', start)) return null;
+      if (startsWordAt(s, 'GRAPH', start)) return null;
+
+      const subj = readTermLikeAt(s, start);
+      if (!subj) return null;
+      let j = skipWsAndComments(s, subj.end);
+      const pred = readTermLikeAt(s, j);
+      if (!pred) return null;
+      j = skipWsAndComments(s, pred.end);
+      const obj = readTermLikeAt(s, j);
+      if (!obj) return null;
+      j = skipWsAndComments(s, obj.end);
+      if (s[j] !== '~' && !s.startsWith('{|', j)) return null;
+
+      let reifier = '';
+      const annotationBlocks = [];
+      while (j < s.length) {
+        j = skipWsAndComments(s, j);
+        if (s[j] === '~') {
+          j += 1;
+          j = skipWsAndComments(s, j);
+          const term = readTermAt(s, j);
+          if (term) {
+            reifier = term.text;
+            j = term.end;
+          } else if (!reifier) {
+            reifier = `_:rdfAnnotation${++generatedBlank}`;
+          }
+          continue;
+        }
+        if (s.startsWith('{|', j)) {
+          const block = readAnnotationBlockAt(s, j);
+          if (!reifier) reifier = `_:rdfAnnotation${++generatedBlank}`;
+          annotationBlocks.push(block.inner.trim());
+          j = block.end;
+          continue;
+        }
+        break;
+      }
+
+      const after = skipWsAndComments(s, j);
+      if (s[after] !== '.') return null;
+      if (!reifier && annotationBlocks.length === 0) return null;
+
+      const baseTriple = `${subj.text} ${pred.text} ${obj.text}`;
+      const graph = `{ ${baseTriple} }`;
+      const extra = [];
+      if (reifier) extra.push(`${reifier} ${RDF_REIFIES_IRI} ${graph} .`);
+      for (const inner of annotationBlocks) {
+        if (inner) extra.push(`${reifier} ${inner} .`);
+      }
+      return {
+        start,
+        end: after + 1,
+        text: `${baseTriple} .${extra.length ? '\n' + extra.join('\n') : ''}`,
+      };
+    }
+
+    while (i < s.length) {
+      if (statementStart) {
+        const converted = tryReadAnnotatedTriple(i);
+        if (converted) {
+          out += s.slice(i, converted.start) + converted.text;
+          i = converted.end;
+          statementStart = true;
+          continue;
+        }
+      }
+
+      const ch = s[i];
+      if (ch === '"' || ch === "'") {
+        const str = readStringAt(s, i);
+        out += str.text;
+        i = str.end;
+        continue;
+      }
+      if (ch === '<' && !s.startsWith('<<', i)) {
+        const iri = readIriAt(s, i);
+        out += iri.text;
+        i = iri.end;
+        continue;
+      }
+      if (ch === '#') {
+        while (i < s.length) {
+          const c = s[i++];
+          out += c;
+          if (c === '\n' || c === '\r') break;
+        }
+        statementStart = true;
+        continue;
+      }
+      out += ch;
+      if (ch === '.' || ch === '{' || ch === '}' || ch === '\n' || ch === '\r') statementStart = true;
+      else if (!/\s/.test(ch)) statementStart = false;
+      i += 1;
+    }
+
+    return out;
   }
 
   function stripVersionDirectives(s) {
@@ -9868,6 +10113,7 @@ function normalizeRdfCompatibility(inputText) {
   }
 
   if (hasTripleTerms) text = convertTripleTerms(text);
+  if (hasAnnotationSyntax) text = convertAnnotations(text);
   if (hasVersionDirective) text = stripVersionDirectives(text);
   if (hasVersionDirective || hasNamedGraphCandidate) text = normalizeNamedGraphs(text);
   return text;

package/eyeling.js

@@ -9590,6 +9590,7 @@ function stripQuotes(lex) {
 //   - A top-level default graph block { ... } is unwrapped into ordinary triples.
 // This keeps all downstream parsing/reasoning N3-only.
 const LOG_NAME_OF_IRI = '<http://www.w3.org/2000/10/swap/log#nameOf>';
+const RDF_REIFIES_IRI = '<http://www.w3.org/1999/02/22-rdf-syntax-ns#reifies>';
 
 function normalizeRdfCompatibility(inputText) {
   let text = String(inputText ?? '');
@@ -9598,11 +9599,12 @@ function normalizeRdfCompatibility(inputText) {
   // surface-syntax normalization. Avoid scanning large files character-by-character
   // unless they actually contain RDF 1.2 triple terms, VERSION directives, or a
   // plausible top-level TriG named graph block.
-  const hasTripleTerms = text.includes('<<(');
+  const hasTripleTerms = text.includes('<<');
   const hasVersionDirective = /^\s*(?:@version|VERSION)\s+(["'])1\.2\1\s*\.?\s*(?:#.*)?$/im.test(text);
   const hasNamedGraphCandidate = /(?:^|[.\r\n])\s*(?:GRAPH\s+)?(?:<[^>\r\n]*>|_:[A-Za-z][A-Za-z0-9_-]*|[A-Za-z][A-Za-z0-9_-]*:[^\s{};,.()[\]]*)\s*\{/m.test(text);
+  const hasAnnotationSyntax = /(?:^|\s)~\s*(?:<|_:[A-Za-z]|[A-Za-z][A-Za-z0-9_-]*:|\{\|)|\{\|/.test(text);
 
-  if (!hasTripleTerms && !hasVersionDirective && !hasNamedGraphCandidate) return text;
+  if (!hasTripleTerms && !hasVersionDirective && !hasNamedGraphCandidate && !hasAnnotationSyntax) return text;
 
   function isWordChar(ch) {
     return ch != null && /[A-Za-z0-9_:-]/.test(ch);
@@ -9664,11 +9666,67 @@ function normalizeRdfCompatibility(inputText) {
 
   function convertTripleTerms(s) {
     let i = 0;
+    const reifierTriples = [];
 
     function startsAt(needle, at = i) {
       return s.startsWith(needle, at);
     }
 
+    function splitTopLevelReifier(body) {
+      let depthBrace = 0;
+      let depthBracket = 0;
+      let depthParen = 0;
+      for (let j = 0; j < body.length; j++) {
+        const ch = body[j];
+        if (ch === '"' || ch === "'") {
+          const str = readStringAt(body, j);
+          j = str.end - 1;
+          continue;
+        }
+        if (ch === '<') {
+          const iri = readIriAt(body, j);
+          j = iri.end - 1;
+          continue;
+        }
+        if (ch === '#') {
+          while (j < body.length && body[j] !== '\n' && body[j] !== '\r') j += 1;
+          continue;
+        }
+        if (ch === '{') depthBrace += 1;
+        else if (ch === '}' && depthBrace > 0) depthBrace -= 1;
+        else if (ch === '[') depthBracket += 1;
+        else if (ch === ']' && depthBracket > 0) depthBracket -= 1;
+        else if (ch === '(') depthParen += 1;
+        else if (ch === ')' && depthParen > 0) depthParen -= 1;
+        else if (ch === '~' && depthBrace === 0 && depthBracket === 0 && depthParen === 0) {
+          return { triple: body.slice(0, j).trim(), reifier: body.slice(j + 1).trim() };
+        }
+      }
+      return { triple: body.trim(), reifier: '' };
+    }
+
+    function firstTerm(text) {
+      const at = skipWsAndComments(text, 0);
+      if (at >= text.length) return '';
+      if (text[at] === '<') return readIriAt(text, at).text;
+      let j = at;
+      while (j < text.length && !/\s/.test(text[j]) && !'{}[](),;.'.includes(text[j])) j += 1;
+      return text.slice(at, j);
+    }
+
+    function graphTermFromTripleBody(rawBody, parenthesized) {
+      let body = rawBody.trim();
+      if (parenthesized && body.startsWith('(') && body.endsWith(')')) body = body.slice(1, -1).trim();
+      const split = splitTopLevelReifier(body);
+      const triple = split.triple;
+      const graph = '{ ' + triple + ' }';
+      if (split.reifier) {
+        const reifier = firstTerm(split.reifier);
+        if (reifier) reifierTriples.push(`${reifier} ${RDF_REIFIES_IRI} ${graph} .`);
+      }
+      return graph;
+    }
+
     function convertUntil(stopToken) {
       let out = '';
       while (i < s.length) {
@@ -9678,7 +9736,12 @@ function normalizeRdfCompatibility(inputText) {
         }
         if (startsAt('<<(')) {
           i += 3;
-          out += '{ ' + convertUntil(')>>').trim() + ' }';
+          out += graphTermFromTripleBody(convertUntil(')>>'), false);
+          continue;
+        }
+        if (startsAt('<<')) {
+          i += 2;
+          out += graphTermFromTripleBody(convertUntil('>>'), false);
           continue;
         }
         const ch = s[i];
@@ -9709,7 +9772,189 @@ function normalizeRdfCompatibility(inputText) {
       return out;
     }
 
-    return convertUntil(null);
+    const converted = convertUntil(null);
+    if (reifierTriples.length === 0) return converted;
+    return converted + (converted.endsWith('\n') ? '' : '\n') + reifierTriples.join('\n') + '\n';
+  }
+
+
+  function convertAnnotations(s) {
+    let out = '';
+    let i = 0;
+    let statementStart = true;
+    let generatedBlank = 0;
+
+    function readBalancedDelimited(s, at, open, close) {
+      if (!s.startsWith(open, at)) return null;
+      let j = at + open.length;
+      let depth = 1;
+      while (j < s.length) {
+        const ch = s[j];
+        if (ch === '"' || ch === "'") {
+          j = readStringAt(s, j).end;
+          continue;
+        }
+        if (ch === '<' && !s.startsWith('<<', j)) {
+          j = readIriAt(s, j).end;
+          continue;
+        }
+        if (ch === '#') {
+          while (j < s.length && s[j] !== '\n' && s[j] !== '\r') j += 1;
+          continue;
+        }
+        if (s.startsWith(open, j)) {
+          depth += 1;
+          j += open.length;
+          continue;
+        }
+        if (s.startsWith(close, j)) {
+          depth -= 1;
+          j += close.length;
+          if (depth === 0) return { text: s.slice(at, j), inner: s.slice(at + open.length, j - close.length), end: j };
+          continue;
+        }
+        j += 1;
+      }
+      throw new N3SyntaxError(`Unterminated RDF annotation block, expected ${close}`);
+    }
+
+    function readTermLikeAt(s, at) {
+      const j = skipWsAndComments(s, at);
+      if (j >= s.length) return null;
+      if (s[j] === '<') return readIriAt(s, j);
+      if (s[j] === '"' || s[j] === "'") {
+        const str = readStringAt(s, j);
+        let end = str.end;
+        let text = str.text;
+        if (s.startsWith('^^', end)) {
+          const dt = readTermAt(s, end + 2);
+          if (dt) {
+            text += '^^' + dt.text;
+            end = dt.end;
+          }
+        } else if (s[end] === '@') {
+          let k = end + 1;
+          if (/[A-Za-z]/.test(s[k] || '')) {
+            while (k < s.length && /[A-Za-z0-9-]/.test(s[k])) k += 1;
+            text += s.slice(end, k);
+            end = k;
+          }
+        }
+        return { text, end };
+      }
+      if (s[j] === '{') return readBalancedBlock(s, j);
+      if (s[j] === '[') return readBalancedDelimited(s, j, '[', ']');
+      if (s[j] === '(') return readBalancedDelimited(s, j, '(', ')');
+      return readTermAt(s, j);
+    }
+
+    function readAnnotationBlockAt(s, at) {
+      if (!s.startsWith('{|', at)) return null;
+      return readBalancedDelimited(s, at, '{|', '|}');
+    }
+
+    function tryReadAnnotatedTriple(at) {
+      const start = skipWsAndComments(s, at);
+      if (start >= s.length) return null;
+      if (s[start] === '@') return null;
+      if (startsWordAt(s, 'PREFIX', start) || startsWordAt(s, 'BASE', start) || startsWordAt(s, 'VERSION', start)) return null;
+      if (startsWordAt(s, 'GRAPH', start)) return null;
+
+      const subj = readTermLikeAt(s, start);
+      if (!subj) return null;
+      let j = skipWsAndComments(s, subj.end);
+      const pred = readTermLikeAt(s, j);
+      if (!pred) return null;
+      j = skipWsAndComments(s, pred.end);
+      const obj = readTermLikeAt(s, j);
+      if (!obj) return null;
+      j = skipWsAndComments(s, obj.end);
+      if (s[j] !== '~' && !s.startsWith('{|', j)) return null;
+
+      let reifier = '';
+      const annotationBlocks = [];
+      while (j < s.length) {
+        j = skipWsAndComments(s, j);
+        if (s[j] === '~') {
+          j += 1;
+          j = skipWsAndComments(s, j);
+          const term = readTermAt(s, j);
+          if (term) {
+            reifier = term.text;
+            j = term.end;
+          } else if (!reifier) {
+            reifier = `_:rdfAnnotation${++generatedBlank}`;
+          }
+          continue;
+        }
+        if (s.startsWith('{|', j)) {
+          const block = readAnnotationBlockAt(s, j);
+          if (!reifier) reifier = `_:rdfAnnotation${++generatedBlank}`;
+          annotationBlocks.push(block.inner.trim());
+          j = block.end;
+          continue;
+        }
+        break;
+      }
+
+      const after = skipWsAndComments(s, j);
+      if (s[after] !== '.') return null;
+      if (!reifier && annotationBlocks.length === 0) return null;
+
+      const baseTriple = `${subj.text} ${pred.text} ${obj.text}`;
+      const graph = `{ ${baseTriple} }`;
+      const extra = [];
+      if (reifier) extra.push(`${reifier} ${RDF_REIFIES_IRI} ${graph} .`);
+      for (const inner of annotationBlocks) {
+        if (inner) extra.push(`${reifier} ${inner} .`);
+      }
+      return {
+        start,
+        end: after + 1,
+        text: `${baseTriple} .${extra.length ? '\n' + extra.join('\n') : ''}`,
+      };
+    }
+
+    while (i < s.length) {
+      if (statementStart) {
+        const converted = tryReadAnnotatedTriple(i);
+        if (converted) {
+          out += s.slice(i, converted.start) + converted.text;
+          i = converted.end;
+          statementStart = true;
+          continue;
+        }
+      }
+
+      const ch = s[i];
+      if (ch === '"' || ch === "'") {
+        const str = readStringAt(s, i);
+        out += str.text;
+        i = str.end;
+        continue;
+      }
+      if (ch === '<' && !s.startsWith('<<', i)) {
+        const iri = readIriAt(s, i);
+        out += iri.text;
+        i = iri.end;
+        continue;
+      }
+      if (ch === '#') {
+        while (i < s.length) {
+          const c = s[i++];
+          out += c;
+          if (c === '\n' || c === '\r') break;
+        }
+        statementStart = true;
+        continue;
+      }
+      out += ch;
+      if (ch === '.' || ch === '{' || ch === '}' || ch === '\n' || ch === '\r') statementStart = true;
+      else if (!/\s/.test(ch)) statementStart = false;
+      i += 1;
+    }
+
+    return out;
   }
 
   function stripVersionDirectives(s) {
@@ -9868,6 +10113,7 @@ function normalizeRdfCompatibility(inputText) {
   }
 
   if (hasTripleTerms) text = convertTripleTerms(text);
+  if (hasAnnotationSyntax) text = convertAnnotations(text);
   if (hasVersionDirective) text = stripVersionDirectives(text);
   if (hasVersionDirective || hasNamedGraphCandidate) text = normalizeNamedGraphs(text);
   return text;

package/lib/lexer.js

@@ -355,6 +355,7 @@ function stripQuotes(lex) {
 //   - A top-level default graph block { ... } is unwrapped into ordinary triples.
 // This keeps all downstream parsing/reasoning N3-only.
 const LOG_NAME_OF_IRI = '<http://www.w3.org/2000/10/swap/log#nameOf>';
+const RDF_REIFIES_IRI = '<http://www.w3.org/1999/02/22-rdf-syntax-ns#reifies>';
 
 function normalizeRdfCompatibility(inputText) {
   let text = String(inputText ?? '');
@@ -363,11 +364,12 @@ function normalizeRdfCompatibility(inputText) {
   // surface-syntax normalization. Avoid scanning large files character-by-character
   // unless they actually contain RDF 1.2 triple terms, VERSION directives, or a
   // plausible top-level TriG named graph block.
-  const hasTripleTerms = text.includes('<<(');
+  const hasTripleTerms = text.includes('<<');
   const hasVersionDirective = /^\s*(?:@version|VERSION)\s+(["'])1\.2\1\s*\.?\s*(?:#.*)?$/im.test(text);
   const hasNamedGraphCandidate = /(?:^|[.\r\n])\s*(?:GRAPH\s+)?(?:<[^>\r\n]*>|_:[A-Za-z][A-Za-z0-9_-]*|[A-Za-z][A-Za-z0-9_-]*:[^\s{};,.()[\]]*)\s*\{/m.test(text);
+  const hasAnnotationSyntax = /(?:^|\s)~\s*(?:<|_:[A-Za-z]|[A-Za-z][A-Za-z0-9_-]*:|\{\|)|\{\|/.test(text);
 
-  if (!hasTripleTerms && !hasVersionDirective && !hasNamedGraphCandidate) return text;
+  if (!hasTripleTerms && !hasVersionDirective && !hasNamedGraphCandidate && !hasAnnotationSyntax) return text;
 
   function isWordChar(ch) {
     return ch != null && /[A-Za-z0-9_:-]/.test(ch);
@@ -429,11 +431,67 @@ function normalizeRdfCompatibility(inputText) {
 
   function convertTripleTerms(s) {
     let i = 0;
+    const reifierTriples = [];
 
     function startsAt(needle, at = i) {
       return s.startsWith(needle, at);
     }
 
+    function splitTopLevelReifier(body) {
+      let depthBrace = 0;
+      let depthBracket = 0;
+      let depthParen = 0;
+      for (let j = 0; j < body.length; j++) {
+        const ch = body[j];
+        if (ch === '"' || ch === "'") {
+          const str = readStringAt(body, j);
+          j = str.end - 1;
+          continue;
+        }
+        if (ch === '<') {
+          const iri = readIriAt(body, j);
+          j = iri.end - 1;
+          continue;
+        }
+        if (ch === '#') {
+          while (j < body.length && body[j] !== '\n' && body[j] !== '\r') j += 1;
+          continue;
+        }
+        if (ch === '{') depthBrace += 1;
+        else if (ch === '}' && depthBrace > 0) depthBrace -= 1;
+        else if (ch === '[') depthBracket += 1;
+        else if (ch === ']' && depthBracket > 0) depthBracket -= 1;
+        else if (ch === '(') depthParen += 1;
+        else if (ch === ')' && depthParen > 0) depthParen -= 1;
+        else if (ch === '~' && depthBrace === 0 && depthBracket === 0 && depthParen === 0) {
+          return { triple: body.slice(0, j).trim(), reifier: body.slice(j + 1).trim() };
+        }
+      }
+      return { triple: body.trim(), reifier: '' };
+    }
+
+    function firstTerm(text) {
+      const at = skipWsAndComments(text, 0);
+      if (at >= text.length) return '';
+      if (text[at] === '<') return readIriAt(text, at).text;
+      let j = at;
+      while (j < text.length && !/\s/.test(text[j]) && !'{}[](),;.'.includes(text[j])) j += 1;
+      return text.slice(at, j);
+    }
+
+    function graphTermFromTripleBody(rawBody, parenthesized) {
+      let body = rawBody.trim();
+      if (parenthesized && body.startsWith('(') && body.endsWith(')')) body = body.slice(1, -1).trim();
+      const split = splitTopLevelReifier(body);
+      const triple = split.triple;
+      const graph = '{ ' + triple + ' }';
+      if (split.reifier) {
+        const reifier = firstTerm(split.reifier);
+        if (reifier) reifierTriples.push(`${reifier} ${RDF_REIFIES_IRI} ${graph} .`);
+      }
+      return graph;
+    }
+
     function convertUntil(stopToken) {
       let out = '';
       while (i < s.length) {
@@ -443,7 +501,12 @@ function normalizeRdfCompatibility(inputText) {
         }
         if (startsAt('<<(')) {
           i += 3;
-          out += '{ ' + convertUntil(')>>').trim() + ' }';
+          out += graphTermFromTripleBody(convertUntil(')>>'), false);
+          continue;
+        }
+        if (startsAt('<<')) {
+          i += 2;
+          out += graphTermFromTripleBody(convertUntil('>>'), false);
           continue;
         }
         const ch = s[i];
@@ -474,7 +537,189 @@ function normalizeRdfCompatibility(inputText) {
       return out;
     }
 
-    return convertUntil(null);
+    const converted = convertUntil(null);
+    if (reifierTriples.length === 0) return converted;
+    return converted + (converted.endsWith('\n') ? '' : '\n') + reifierTriples.join('\n') + '\n';
+  }
+
+
+  function convertAnnotations(s) {
+    let out = '';
+    let i = 0;
+    let statementStart = true;
+    let generatedBlank = 0;
+
+    function readBalancedDelimited(s, at, open, close) {
+      if (!s.startsWith(open, at)) return null;
+      let j = at + open.length;
+      let depth = 1;
+      while (j < s.length) {
+        const ch = s[j];
+        if (ch === '"' || ch === "'") {
+          j = readStringAt(s, j).end;
+          continue;
+        }
+        if (ch === '<' && !s.startsWith('<<', j)) {
+          j = readIriAt(s, j).end;
+          continue;
+        }
+        if (ch === '#') {
+          while (j < s.length && s[j] !== '\n' && s[j] !== '\r') j += 1;
+          continue;
+        }
+        if (s.startsWith(open, j)) {
+          depth += 1;
+          j += open.length;
+          continue;
+        }
+        if (s.startsWith(close, j)) {
+          depth -= 1;
+          j += close.length;
+          if (depth === 0) return { text: s.slice(at, j), inner: s.slice(at + open.length, j - close.length), end: j };
+          continue;
+        }
+        j += 1;
+      }
+      throw new N3SyntaxError(`Unterminated RDF annotation block, expected ${close}`);
+    }
+
+    function readTermLikeAt(s, at) {
+      const j = skipWsAndComments(s, at);
+      if (j >= s.length) return null;
+      if (s[j] === '<') return readIriAt(s, j);
+      if (s[j] === '"' || s[j] === "'") {
+        const str = readStringAt(s, j);
+        let end = str.end;
+        let text = str.text;
+        if (s.startsWith('^^', end)) {
+          const dt = readTermAt(s, end + 2);
+          if (dt) {
+            text += '^^' + dt.text;
+            end = dt.end;
+          }
+        } else if (s[end] === '@') {
+          let k = end + 1;
+          if (/[A-Za-z]/.test(s[k] || '')) {
+            while (k < s.length && /[A-Za-z0-9-]/.test(s[k])) k += 1;
+            text += s.slice(end, k);
+            end = k;
+          }
+        }
+        return { text, end };
+      }
+      if (s[j] === '{') return readBalancedBlock(s, j);
+      if (s[j] === '[') return readBalancedDelimited(s, j, '[', ']');
+      if (s[j] === '(') return readBalancedDelimited(s, j, '(', ')');
+      return readTermAt(s, j);
+    }
+
+    function readAnnotationBlockAt(s, at) {
+      if (!s.startsWith('{|', at)) return null;
+      return readBalancedDelimited(s, at, '{|', '|}');
+    }
+
+    function tryReadAnnotatedTriple(at) {
+      const start = skipWsAndComments(s, at);
+      if (start >= s.length) return null;
+      if (s[start] === '@') return null;
+      if (startsWordAt(s, 'PREFIX', start) || startsWordAt(s, 'BASE', start) || startsWordAt(s, 'VERSION', start)) return null;
+      if (startsWordAt(s, 'GRAPH', start)) return null;
+
+      const subj = readTermLikeAt(s, start);
+      if (!subj) return null;
+      let j = skipWsAndComments(s, subj.end);
+      const pred = readTermLikeAt(s, j);
+      if (!pred) return null;
+      j = skipWsAndComments(s, pred.end);
+      const obj = readTermLikeAt(s, j);
+      if (!obj) return null;
+      j = skipWsAndComments(s, obj.end);
+      if (s[j] !== '~' && !s.startsWith('{|', j)) return null;
+
+      let reifier = '';
+      const annotationBlocks = [];
+      while (j < s.length) {
+        j = skipWsAndComments(s, j);
+        if (s[j] === '~') {
+          j += 1;
+          j = skipWsAndComments(s, j);
+          const term = readTermAt(s, j);
+          if (term) {
+            reifier = term.text;
+            j = term.end;
+          } else if (!reifier) {
+            reifier = `_:rdfAnnotation${++generatedBlank}`;
+          }
+          continue;
+        }
+        if (s.startsWith('{|', j)) {
+          const block = readAnnotationBlockAt(s, j);
+          if (!reifier) reifier = `_:rdfAnnotation${++generatedBlank}`;
+          annotationBlocks.push(block.inner.trim());
+          j = block.end;
+          continue;
+        }
+        break;
+      }
+
+      const after = skipWsAndComments(s, j);
+      if (s[after] !== '.') return null;
+      if (!reifier && annotationBlocks.length === 0) return null;
+
+      const baseTriple = `${subj.text} ${pred.text} ${obj.text}`;
+      const graph = `{ ${baseTriple} }`;
+      const extra = [];
+      if (reifier) extra.push(`${reifier} ${RDF_REIFIES_IRI} ${graph} .`);
+      for (const inner of annotationBlocks) {
+        if (inner) extra.push(`${reifier} ${inner} .`);
+      }
+      return {
+        start,
+        end: after + 1,
+        text: `${baseTriple} .${extra.length ? '\n' + extra.join('\n') : ''}`,
+      };
+    }
+
+    while (i < s.length) {
+      if (statementStart) {
+        const converted = tryReadAnnotatedTriple(i);
+        if (converted) {
+          out += s.slice(i, converted.start) + converted.text;
+          i = converted.end;
+          statementStart = true;
+          continue;
+        }
+      }
+
+      const ch = s[i];
+      if (ch === '"' || ch === "'") {
+        const str = readStringAt(s, i);
+        out += str.text;
+        i = str.end;
+        continue;
+      }
+      if (ch === '<' && !s.startsWith('<<', i)) {
+        const iri = readIriAt(s, i);
+        out += iri.text;
+        i = iri.end;
+        continue;
+      }
+      if (ch === '#') {
+        while (i < s.length) {
+          const c = s[i++];
+          out += c;
+          if (c === '\n' || c === '\r') break;
+        }
+        statementStart = true;
+        continue;
+      }
+      out += ch;
+      if (ch === '.' || ch === '{' || ch === '}' || ch === '\n' || ch === '\r') statementStart = true;
+      else if (!/\s/.test(ch)) statementStart = false;
+      i += 1;
+    }
+
+    return out;
   }
 
   function stripVersionDirectives(s) {
@@ -633,6 +878,7 @@ function normalizeRdfCompatibility(inputText) {
   }
 
   if (hasTripleTerms) text = convertTripleTerms(text);
+  if (hasAnnotationSyntax) text = convertAnnotations(text);
   if (hasVersionDirective) text = stripVersionDirectives(text);
   if (hasVersionDirective || hasNamedGraphCandidate) text = normalizeNamedGraphs(text);
   return text;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyeling",
-  "version": "1.24.4",
+  "version": "1.24.5",
   "description": "A minimal Notation3 (N3) reasoner in JavaScript.",
   "main": "./index.js",
   "keywords": [

package/see/README.md

@@ -18,7 +18,7 @@ Each example starts from a Notation3 source and is compiled by `see.js` into a s
 
 The trust gate is executable verification. If a required fact is missing, the program fails instead of emitting an unsupported entailment.
 
-The `triple_terms` and `rdf_dataset` examples use RDF 1.2 `<<( ... )>>` triple-term syntax. Eyeling accepts that syntax only with `-r, --rdf`, where it normalizes triple terms to existing N3 singleton graph terms `{ ... }` and prints feasible output graph terms back as RDF 1.2 triple terms. The `rdf_dataset` example also uses an RDF/TriG named graph block, which RDF compatibility mode normalizes to the N3 `log:nameOf { ... }` graph-term shape and prints back as a TriG named graph block where feasible; SEE keeps the committed `.trig` input and formal output in RDF 1.2/TriG form.
+The `triple_terms` and `rdf_dataset` examples use RDF 1.2 triple-term syntax, including `<<( ... )>>` and the reified `<<s p o ~ r>>` form. Eyeling accepts that syntax only with `-r, --rdf`, where it normalizes triple terms to existing N3 singleton graph terms `{ ... }` and prints feasible output graph terms back as RDF 1.2 triple terms. The `rdf_dataset` example also uses an RDF/TriG named graph block, which RDF compatibility mode normalizes to the N3 `log:nameOf { ... }` graph-term shape and prints back as a TriG named graph block where feasible; SEE keeps the committed `.trig` input and formal output in RDF 1.2/TriG form.
 
 
 ## Run

package/test/api.test.js

@@ -2572,6 +2572,46 @@ _:b a ex:Person ; ex:name "B" .
     expect: [/:observation\s+:entails\s+<<\(\s+:sensor\s+:needs\s+:inspection\s*\)>>\s*\./m],
   },
 
+  {
+    name: 'RDF mode accepts PREFIX and reified triple terms with reifiers',
+    opt: { proofComments: false, rdf: true },
+    input: `VERSION "1.2"
+
+PREFIX : <http://www.example.org/>
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+
+<<:employee38 :jobTitle "Assistant Designer" ~ _:id>> :accordingTo :employee22 .
+
+{ ?S ?P ?O } log:query { ?S ?P ?O } .
+`,
+    expect: [
+      /<<\(\s*:employee38\s+:jobTitle\s+"Assistant Designer"\s*\)>>\s+:accordingTo\s+:employee22\s*\./m,
+      /_:id\s+(?:rdf:reifies|<http:\/\/www\.w3\.org\/1999\/02\/22-rdf-syntax-ns#reifies>)\s+<<\(\s*:employee38\s+:jobTitle\s+"Assistant Designer"\s*\)>>\s*\./m,
+    ],
+  },
+
+  {
+    name: 'RDF mode accepts RDF 1.2 annotation syntax after objects',
+    opt: { proofComments: false, rdf: true },
+    input: `VERSION "1.2"
+
+PREFIX : <http://example.com/>
+PREFIX xsd: <http://www.w3.org/2001/XMLSchema#>
+
+:a :name "Alice" ~ :t {| :statedBy :bob ; :recorded "2021-07-07"^^xsd:date |} .
+
+@prefix log: <http://www.w3.org/2000/10/swap/log#>.
+
+{ ?S ?P ?O } log:query { ?S ?P ?O }.
+`,
+    expect: [
+      /:a\s+:name\s+"Alice"\s*\./m,
+      /:t\s+(?:rdf:reifies|<http:\/\/www\.w3\.org\/1999\/02\/22-rdf-syntax-ns#reifies>)\s+<<\(\s*:a\s+:name\s+"Alice"\s*\)>>\s*\./m,
+      /:t\s+:statedBy\s+:bob\s*\./m,
+      /:t\s+:recorded\s+"2021-07-07"\^\^xsd:date\s*\./m,
+    ],
+  },
+
   {
     name: 'RDF mode serializes only valid triple terms as RDF 1.2 triple terms',
     opt: { proofComments: false, rdf: true },

package/test/package.test.js

@@ -174,7 +174,7 @@ function main() {
     if (!fs.existsSync(eyelingJsPath)) throw new Error(`Missing eyeling.js in installed package: ${eyelingJsPath}`);
 
     // Keep this fast: package.test.js is a smoke test. The full matrix is covered by test/examples.test.js in-repo.
-    const SMOKE_EXAMPLES = ['age.n3', 'basic-monadic.n3', 'collection.n3', 'family-cousins.n3', 'backward.n3'];
+    const SMOKE_EXAMPLES = ['age.n3', 'basic-monadic.n3', 'family-cousins.n3', 'backward.n3'];
 
     const tmpExamplesOut = fs.mkdtempSync(path.join(os.tmpdir(), 'eyeling-pkg-examples-'));
     let smokeIdx = 1;

package/examples/annotation.n3

@@ -1,8 +0,0 @@
-@prefix : <http://example.com/> .
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .
-@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
-
-:a :name "Alice" .
-:t log:nameOf { :a :name "Alice" . } .
-:t :statedBy :bob .
-:t :recorded "2021-07-07"^^xsd:date .

package/examples/arcling/README.md

@@ -1,11 +0,0 @@
-# ARC-style examples in Eyeling
-
-This content is now integrated into the handbook:
-
-- [Appendix F — The ARC approach: Answer • Reason Why • Check](../../HANDBOOK.md#app-f)
-
-That appendix now includes:
-
-- a brief explanation of ARC,
-- a brief explanation of the Insight Economy,
-- and links to the ARC-style examples in `examples/` together with their outputs in `examples/output/`.

package/examples/collection.n3

@@ -1,4 +0,0 @@
-@prefix : <http://example.org/stuff/1.0/> .
-
-(1 _:b2 (2)) :p2 :q2 .
-_:b2 :p :q .

package/examples/context-association.n3

@@ -1,33 +0,0 @@
-@prefix : <http://example.org/#> .
-@prefix foaf: <http://xmlns.com/foaf/0.1/> .
-@prefix sec: <https://w3id.org/security#> .
-@prefix skolem: <https://eyereasoner.github.io/.well-known/genid/5649fff4-464d-5969-88ed-956a6b5f0d90#> .
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .
-@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
-
-skolem:g0 log:nameOf {
-  :Bob foaf:name "Bob" .
-} .
-
-skolem:g1 log:nameOf {
-  skolem:g0 sec:proof _:dataSignature .
-  _:signature1 a sec:DataIntegrityProof .
-  _:signature1 sec:cryptosuite "ecdsa-rdfc-2019" .
-  _:signature1 sec:created "2021-11-13T18:19:39Z" .
-  _:signature1 sec:verificationMethod "https://university.example/issuers/14#key-1" .
-  _:signature1 sec:proofPurpose "assertionMethod" .
-  _:signature1 sec:proofValue "z58DAdFfa9SkqZMVPxAQp...jQCrfFPP2oumHKtz" .
-  _:signature1 sec:issuer <https://university.example/issuers/14> .
-  _:signature1 sec:validFrom "2024-04-03T00:00:00.000Z"^^xsd:dateTime .
-  _:signature1 sec:validUntil "2025-04-03T00:00:00.000Z"^^xsd:dateTime .
-} .
-
-_:g3 log:nameOf {
-  skolem:g1 sec:proof _:signature2 .
-  _:signature2 a sec:DataIntegrityProof .
-  _:signature2 sec:cryptosuite "ecdsa-rdfc-2019" .
-  _:signature2 sec:created "2021-11-13T18:19:39Z" .
-  _:signature2 sec:verificationMethod "https://university.example/issuers/14#key-1" .
-  _:signature2 sec:proofPurpose "assertionMethod" .
-  _:signature2 sec:proofValue "adad123efv434r5200...dqed2t44v43das" .
-} .

package/examples/input/annotation.ttl

@@ -1,6 +0,0 @@
-VERSION "1.2"
-
-PREFIX : <http://example.com/>
-PREFIX xsd: <http://www.w3.org/2001/XMLSchema#>
-
-:a :name "Alice" ~ :t {| :statedBy :bob ; :recorded "2021-07-07"^^xsd:date |} .

package/examples/input/collection.ttl

@@ -1,13 +0,0 @@
-PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>
-PREFIX : <http://example.org/stuff/1.0/>
-
-_:b0  :p2  :q2 .
-_:b0  rdf:first  1 ;
-      rdf:rest   _:b1 .
-_:b1  rdf:first  _:b2 .
-_:b2  :p         :q .
-_:b1  rdf:rest   _:b3 .
-_:b3  rdf:first  _:b4 .
-_:b4  rdf:first  2 ;
-      rdf:rest   rdf:nil .
-_:b3  rdf:rest   rdf:nil .

package/examples/input/context-association.trig

@@ -1,35 +0,0 @@
-@prefix foaf: <http://xmlns.com/foaf/0.1/>.
-@prefix sec: <https://w3id.org/security#>.
-@prefix xsd: <http://www.w3.org/2001/XMLSchema#>.
-@prefix : <http://example.org/#>.
-
-_:g0 {
-    :Bob foaf:name "Bob".
-}
-
-# sign data graph
-_:g1 {
-    _:g0 sec:proof _:dataSignature.
-    _:signature1 
-        a sec:DataIntegrityProof;
-        sec:cryptosuite "ecdsa-rdfc-2019";
-        sec:created "2021-11-13T18:19:39Z";
-        sec:verificationMethod "https://university.example/issuers/14#key-1";
-        sec:proofPurpose "assertionMethod";
-        sec:proofValue "z58DAdFfa9SkqZMVPxAQp...jQCrfFPP2oumHKtz";
-        sec:issuer <https://university.example/issuers/14>;
-        sec:validFrom "2024-04-03T00:00:00.000Z"^^xsd:dateTime;
-        sec:validUntil "2025-04-03T00:00:00.000Z"^^xsd:dateTime.
-}
-
-# sign signature graph for verifiable metadata if needed
-_:g3 {
-    _:g1 sec:proof _:signature2.
-    _:signature2 
-        a sec:DataIntegrityProof;
-        sec:cryptosuite "ecdsa-rdfc-2019";
-        sec:created "2021-11-13T18:19:39Z";
-        sec:verificationMethod "https://university.example/issuers/14#key-1";
-        sec:proofPurpose "assertionMethod";
-        sec:proofValue "adad123efv434r5200...dqed2t44v43das".
-}

package/examples/input/reifies.ttl

@@ -1,10 +0,0 @@
-VERSION "1.2"
-
-PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>
-PREFIX :    <http://www.example.org/>
-
-_:b rdf:reifies <<(:Socrates a :Human)>> .
-_:b :is true .
-
-:employee38 :familyName "Smith" .
-<<:employee38 :jobTitle "Assistant Designer" ~ _:id>> :accordingTo :employee22 .

package/examples/input/triple-term.ttl

@@ -1,8 +0,0 @@
-VERSION "1.2"
-
-PREFIX :    <http://www.example.org/>
-PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>
-
-_:e38  :familyName  "Smith" .
-_:anno rdf:reifies <<( _:e38  :jobTitle    "Designer" )>> .
-_:anno :accordingTo _:e22 .

package/examples/reifies.n3

@@ -1,8 +0,0 @@
-@prefix : <http://www.example.org/> .
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .
-
-_:b log:nameOf { :Socrates a :Human . } .
-_:b :is true .
-:employee38 :familyName "Smith" .
-_:id log:nameOf { :employee38 :jobTitle "Assistant Designer" . } .
-_:id :accordingTo :employee22 .

package/examples/triple-term.n3

@@ -1,7 +0,0 @@
-@prefix : <http://www.example.org/> .
-@prefix skolem: <https://eyereasoner.github.io/.well-known/genid/3ce038d5-ea5f-5c1e-8635-dcdabec19d5f#> .
-@prefix log: <http://www.w3.org/2000/10/swap/log#> .
-
-skolem:e38 :familyName "Smith" .
-_:anno log:nameOf { skolem:e38 :jobTitle "Designer" . } .
-_:anno :accordingTo _:e22 .