eyeling 1.24.3 → 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 )>> .
@@ -251,7 +251,7 @@ is treated internally like:
 :observation rdf:reifies { :sensor :reports :overheating } .
 ```
 
-RDF/TriG named graph blocks are normalized in the same style as `tools/n3gen`:
+RDF/TriG named graph blocks are normalized to ordinary N3 graph terms:
 
 ```trig
 :factoryDataset {
@@ -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:
 
@@ -3883,7 +3883,7 @@ In RDF compatibility mode, Eyeling accepts this surface form by translating the
 :observation rdf:reifies { :sensor :reports :overheating } .
 ```
 
-The dataset example also uses named graph syntax, which RDF compatibility mode normalizes to `log:nameOf` graph terms, matching `tools/n3gen`:
+The dataset example also uses named graph syntax, which RDF compatibility mode normalizes to `log:nameOf` graph terms:
 
 ```trig
 :factoryDataset {

package/dist/browser/eyeling.browser.js

@@ -9588,8 +9588,9 @@ function stripQuotes(lex) {
 //   - RDF 1.2 triple terms <<( s p o )>> become singleton graph terms { s p o }.
 //   - TriG named graph blocks g { ... } become g log:nameOf { ... } .
 //   - A top-level default graph block { ... } is unwrapped into ordinary triples.
-// This mirrors tools/n3gen.js and keeps all downstream parsing/reasoning N3-only.
+// 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

@@ -9588,8 +9588,9 @@ function stripQuotes(lex) {
 //   - RDF 1.2 triple terms <<( s p o )>> become singleton graph terms { s p o }.
 //   - TriG named graph blocks g { ... } become g log:nameOf { ... } .
 //   - A top-level default graph block { ... } is unwrapped into ordinary triples.
-// This mirrors tools/n3gen.js and keeps all downstream parsing/reasoning N3-only.
+// 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;