eyeling 1.28.8 → 1.28.9

package/dist/browser/eyeling.browser.js

@@ -13298,7 +13298,76 @@ function lex(inputText, opts = {}) {
       continue;
     }
 
-    // 5) Single-character punctuation.  Use a switch rather than allocating a
+    // 5) Numeric literal (integer, decimal, or double). Turtle/N3 numeric
+    // literals may have a leading sign and decimals may start with '.', e.g.
+    // '+42' and '.5'.  Reject repeated decimal points so '1.2.3'
+    // cannot be misread as one impossible numeric-like token.
+    if (
+      isAsciiDigit(c) ||
+      ((c === '+' || c === '-') && (isAsciiDigit(peek(1)) || (peek(1) === '.' && isAsciiDigit(peek(2))))) ||
+      (c === '.' && isAsciiDigit(peek(1)) && !isAsciiDigit(peek(-1)))
+    ) {
+      const start = i;
+      const numChars = [];
+
+      if (chars[i] === '+' || chars[i] === '-') {
+        numChars.push(chars[i]);
+        i++;
+      }
+
+      if (chars[i] === '.') {
+        numChars.push('.');
+        i++;
+        while (i < n && isAsciiDigit(chars[i])) {
+          numChars.push(chars[i]);
+          i++;
+        }
+      } else {
+        while (i < n && isAsciiDigit(chars[i])) {
+          numChars.push(chars[i]);
+          i++;
+        }
+        if (i < n && chars[i] === '.' && i + 1 < n && isAsciiDigit(chars[i + 1])) {
+          numChars.push('.');
+          i++;
+          while (i < n && isAsciiDigit(chars[i])) {
+            numChars.push(chars[i]);
+            i++;
+          }
+        }
+      }
+
+      if (i < n && chars[i] === '.' && i + 1 < n && isAsciiDigit(chars[i + 1])) {
+        throw new N3SyntaxError('Malformed numeric literal: multiple decimal points', start);
+      }
+
+      // Optional exponent part: e.g., 1e0, 1.1e-3, .5E+0.
+      if (i < n && (chars[i] === 'e' || chars[i] === 'E')) {
+        let j = i + 1;
+        if (j < n && (chars[j] === '+' || chars[j] === '-')) j++;
+        if (j < n && isAsciiDigit(chars[j])) {
+          numChars.push(chars[i]); // e/E
+          i++;
+          if (i < n && (chars[i] === '+' || chars[i] === '-')) {
+            numChars.push(chars[i]);
+            i++;
+          }
+          while (i < n && isAsciiDigit(chars[i])) {
+            numChars.push(chars[i]);
+            i++;
+          }
+        }
+      }
+
+      if (i < n && chars[i] === '.' && i + 1 < n && isAsciiDigit(chars[i + 1])) {
+        throw new N3SyntaxError('Malformed numeric literal: multiple decimal points', start);
+      }
+
+      tokens.push(new Token('Literal', numChars.join(''), start));
+      continue;
+    }
+
+    // 6) Single-character punctuation.  Use a switch rather than allocating a
     // mapping object for every punctuation token in large inputs.
     switch (c) {
       case '{':
@@ -13419,13 +13488,17 @@ function lex(inputText, opts = {}) {
           }
           continue;
         }
+        if (cc === '\n' || cc === '\r') {
+          throw new N3SyntaxError('Unescaped newline in short string literal', start);
+        }
         if (cc === '"') {
           closed = true;
           break;
         }
         if (sChars !== null) sChars.push(cc);
       }
-      const rawContent = sChars === null ? sliceChars(contentStart, closed ? i - 1 : i) : sChars.join('');
+      if (!closed) throw new N3SyntaxError('Unterminated short string literal "..."', start);
+      const rawContent = sChars === null ? sliceChars(contentStart, i - 1) : sChars.join('');
       const decoded = sChars === null ? rawContent : decodeN3StringEscapes(rawContent, start);
       if (sChars !== null || inputMayContainInvalidStringChar) assertValidStringLiteralValue(decoded, start);
       const s = JSON.stringify(decoded); // canonical short quoted form
@@ -13509,13 +13582,17 @@ function lex(inputText, opts = {}) {
           }
           continue;
         }
+        if (cc === '\n' || cc === '\r') {
+          throw new N3SyntaxError('Unescaped newline in short string literal', start);
+        }
         if (cc === "'") {
           closed = true;
           break;
         }
         if (sChars !== null) sChars.push(cc);
       }
-      const rawContent = sChars === null ? sliceChars(contentStart, closed ? i - 1 : i) : sChars.join('');
+      if (!closed) throw new N3SyntaxError("Unterminated short string literal '...'", start);
+      const rawContent = sChars === null ? sliceChars(contentStart, i - 1) : sChars.join('');
       const decoded = sChars === null ? rawContent : decodeN3StringEscapes(rawContent, start);
       if (sChars !== null || inputMayContainInvalidStringChar) assertValidStringLiteralValue(decoded, start);
       const s = JSON.stringify(decoded); // canonical short quoted form
@@ -13598,52 +13675,6 @@ function lex(inputText, opts = {}) {
       continue;
     }
 
-    // 6) Numeric literal (integer or float)
-    if (isAsciiDigit(c) || (c === '-' && peek(1) !== null && isAsciiDigit(peek(1)))) {
-      const start = i;
-      const numChars = [c];
-      i++;
-      while (i < n) {
-        const cc = chars[i];
-        if (isAsciiDigit(cc)) {
-          numChars.push(cc);
-          i++;
-          continue;
-        }
-        if (cc === '.') {
-          if (i + 1 < n && isAsciiDigit(chars[i + 1])) {
-            numChars.push('.');
-            i++;
-            continue;
-          } else {
-            break;
-          }
-        }
-        break;
-      }
-
-      // Optional exponent part: e.g., 1e0, 1.1e-3, 1.1E+0
-      if (i < n && (chars[i] === 'e' || chars[i] === 'E')) {
-        let j = i + 1;
-        if (j < n && (chars[j] === '+' || chars[j] === '-')) j++;
-        if (j < n && isAsciiDigit(chars[j])) {
-          numChars.push(chars[i]); // e/E
-          i++;
-          if (i < n && (chars[i] === '+' || chars[i] === '-')) {
-            numChars.push(chars[i]);
-            i++;
-          }
-          while (i < n && isAsciiDigit(chars[i])) {
-            numChars.push(chars[i]);
-            i++;
-          }
-        }
-      }
-
-      tokens.push(new Token('Literal', numChars.join(''), start));
-      continue;
-    }
-
     // 7) Identifiers / keywords / QNames
     const start = i;
     const word = readIdentText(start);

package/examples/complex-matrix-stability.n3

@@ -253,38 +253,38 @@
   :Check :c4 ?C4.
   :Check :c5 ?C5.
   (
-    "Complex Matrix Stability — ARC-style
+    """Complex Matrix Stability — ARC-style
 
-"
-    "## Answer
-"
+"""
+    """## Answer
+"""
     "We compare three diagonal 2x2 complex matrices for discrete-time stability: "
     "A_unstable = " ?MuS ", A_stable = " ?MsS ", and A_damped = " ?MdS ". "
     "Their spectral radii are ρ(A_unstable) = " ?Ru ", ρ(A_stable) = " ?Rs ", and ρ(A_damped) = " ?Rd ". "
-    "So A_unstable is unstable, A_stable is marginally stable, and A_damped is damped.
+    """So A_unstable is unstable, A_stable is marginally stable, and A_damped is damped.
 
-"
-    "## Reason Why
-"
+"""
+    """## Reason Why
+"""
     "For a discrete-time linear system x_{k+1} = A x_k, the eigenvalues of A govern the behaviour of the modes. "
     "Because these matrices are diagonal, the eigenvalues are just the diagonal entries. "
     "The spectral radius is the maximum modulus of the eigenvalues: if it is greater than 1 a mode grows, "
     "if it equals 1 the modes remain bounded without decaying, and if it is less than 1 all modes decay to zero. "
-    "Here the diagonal entries give radii 2, 1, and 0 respectively, which explains the three classifications.
-
-"
-    "## Check
-"
-    "C1 " ?C1 "
-"
-    "C2 " ?C2 "
-"
-    "C3 " ?C3 "
-"
-    "C4 " ?C4 "
-"
-    "C5 " ?C5 "
-"
+    """Here the diagonal entries give radii 2, 1, and 0 respectively, which explains the three classifications.
+
+"""
+    """## Check
+"""
+    "C1 " ?C1 """
+"""
+    "C2 " ?C2 """
+"""
+    "C3 " ?C3 """
+"""
+    "C4 " ?C4 """
+"""
+    "C5 " ?C5 """
+"""
   ) string:concatenation ?Block. }
 =>
 { :report log:outputString ?Block. } .

package/examples/deep-taxonomy-10.n3

@@ -59,7 +59,7 @@
 }
     =>
 {
-    :report log:outputString "Deep Taxonomy - deep classification benchmark
+    :report log:outputString """Deep Taxonomy - deep classification benchmark
 
 ## Answer
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10 and then as A2.
@@ -74,5 +74,5 @@ C3 OK - the chain reaches the midpoint N5 and still carries both side-label bran
 C4 OK - the final taxonomy step from N9 to N10 was completed.
 C5 OK - once N10 is reached, the terminal class A2 is derived.
 C6 OK - the success flag is raised only after the terminal class A2 is present.
-" .
+""" .
 } .

package/examples/deep-taxonomy-100.n3

@@ -149,7 +149,7 @@
 }
     =>
 {
-    :report log:outputString "Deep Taxonomy - deep classification benchmark
+    :report log:outputString """Deep Taxonomy - deep classification benchmark
 
 ## Answer
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N100 and then as A2.
@@ -164,5 +164,5 @@ C3 OK - the chain reaches the midpoint N50 and still carries both side-label bra
 C4 OK - the final taxonomy step from N99 to N100 was completed.
 C5 OK - once N100 is reached, the terminal class A2 is derived.
 C6 OK - the success flag is raised only after the terminal class A2 is present.
-" .
+""" .
 } .

package/examples/deep-taxonomy-1000.n3

@@ -1049,7 +1049,7 @@
 }
     =>
 {
-    :report log:outputString "Deep Taxonomy - deep classification benchmark
+    :report log:outputString """Deep Taxonomy - deep classification benchmark
 
 ## Answer
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N1000 and then as A2.
@@ -1064,5 +1064,5 @@ C3 OK - the chain reaches the midpoint N500 and still carries both side-label br
 C4 OK - the final taxonomy step from N999 to N1000 was completed.
 C5 OK - once N1000 is reached, the terminal class A2 is derived.
 C6 OK - the success flag is raised only after the terminal class A2 is present.
-" .
+""" .
 } .

package/examples/deep-taxonomy-10000.n3

@@ -10049,7 +10049,7 @@
 }
     =>
 {
-    :report log:outputString "Deep Taxonomy - deep classification benchmark
+    :report log:outputString """Deep Taxonomy - deep classification benchmark
 
 ## Answer
 The test succeeds: starting from one individual classified as N0, the rules eventually classify it as N10000 and then as A2.
@@ -10064,5 +10064,5 @@ C3 OK - the chain reaches the midpoint N5000 and still carries both side-label b
 C4 OK - the final taxonomy step from N9999 to N10000 was completed.
 C5 OK - once N10000 is reached, the terminal class A2 is derived.
 C6 OK - the success flag is raised only after the terminal class A2 is present.
-" .
+""" .
 } .

package/eyeling.js

@@ -13298,7 +13298,76 @@ function lex(inputText, opts = {}) {
       continue;
     }
 
-    // 5) Single-character punctuation.  Use a switch rather than allocating a
+    // 5) Numeric literal (integer, decimal, or double). Turtle/N3 numeric
+    // literals may have a leading sign and decimals may start with '.', e.g.
+    // '+42' and '.5'.  Reject repeated decimal points so '1.2.3'
+    // cannot be misread as one impossible numeric-like token.
+    if (
+      isAsciiDigit(c) ||
+      ((c === '+' || c === '-') && (isAsciiDigit(peek(1)) || (peek(1) === '.' && isAsciiDigit(peek(2))))) ||
+      (c === '.' && isAsciiDigit(peek(1)) && !isAsciiDigit(peek(-1)))
+    ) {
+      const start = i;
+      const numChars = [];
+
+      if (chars[i] === '+' || chars[i] === '-') {
+        numChars.push(chars[i]);
+        i++;
+      }
+
+      if (chars[i] === '.') {
+        numChars.push('.');
+        i++;
+        while (i < n && isAsciiDigit(chars[i])) {
+          numChars.push(chars[i]);
+          i++;
+        }
+      } else {
+        while (i < n && isAsciiDigit(chars[i])) {
+          numChars.push(chars[i]);
+          i++;
+        }
+        if (i < n && chars[i] === '.' && i + 1 < n && isAsciiDigit(chars[i + 1])) {
+          numChars.push('.');
+          i++;
+          while (i < n && isAsciiDigit(chars[i])) {
+            numChars.push(chars[i]);
+            i++;
+          }
+        }
+      }
+
+      if (i < n && chars[i] === '.' && i + 1 < n && isAsciiDigit(chars[i + 1])) {
+        throw new N3SyntaxError('Malformed numeric literal: multiple decimal points', start);
+      }
+
+      // Optional exponent part: e.g., 1e0, 1.1e-3, .5E+0.
+      if (i < n && (chars[i] === 'e' || chars[i] === 'E')) {
+        let j = i + 1;
+        if (j < n && (chars[j] === '+' || chars[j] === '-')) j++;
+        if (j < n && isAsciiDigit(chars[j])) {
+          numChars.push(chars[i]); // e/E
+          i++;
+          if (i < n && (chars[i] === '+' || chars[i] === '-')) {
+            numChars.push(chars[i]);
+            i++;
+          }
+          while (i < n && isAsciiDigit(chars[i])) {
+            numChars.push(chars[i]);
+            i++;
+          }
+        }
+      }
+
+      if (i < n && chars[i] === '.' && i + 1 < n && isAsciiDigit(chars[i + 1])) {
+        throw new N3SyntaxError('Malformed numeric literal: multiple decimal points', start);
+      }
+
+      tokens.push(new Token('Literal', numChars.join(''), start));
+      continue;
+    }
+
+    // 6) Single-character punctuation.  Use a switch rather than allocating a
     // mapping object for every punctuation token in large inputs.
     switch (c) {
       case '{':
@@ -13419,13 +13488,17 @@ function lex(inputText, opts = {}) {
           }
           continue;
         }
+        if (cc === '\n' || cc === '\r') {
+          throw new N3SyntaxError('Unescaped newline in short string literal', start);
+        }
         if (cc === '"') {
           closed = true;
           break;
         }
         if (sChars !== null) sChars.push(cc);
       }
-      const rawContent = sChars === null ? sliceChars(contentStart, closed ? i - 1 : i) : sChars.join('');
+      if (!closed) throw new N3SyntaxError('Unterminated short string literal "..."', start);
+      const rawContent = sChars === null ? sliceChars(contentStart, i - 1) : sChars.join('');
       const decoded = sChars === null ? rawContent : decodeN3StringEscapes(rawContent, start);
       if (sChars !== null || inputMayContainInvalidStringChar) assertValidStringLiteralValue(decoded, start);
       const s = JSON.stringify(decoded); // canonical short quoted form
@@ -13509,13 +13582,17 @@ function lex(inputText, opts = {}) {
           }
           continue;
         }
+        if (cc === '\n' || cc === '\r') {
+          throw new N3SyntaxError('Unescaped newline in short string literal', start);
+        }
         if (cc === "'") {
           closed = true;
           break;
         }
         if (sChars !== null) sChars.push(cc);
       }
-      const rawContent = sChars === null ? sliceChars(contentStart, closed ? i - 1 : i) : sChars.join('');
+      if (!closed) throw new N3SyntaxError("Unterminated short string literal '...'", start);
+      const rawContent = sChars === null ? sliceChars(contentStart, i - 1) : sChars.join('');
       const decoded = sChars === null ? rawContent : decodeN3StringEscapes(rawContent, start);
       if (sChars !== null || inputMayContainInvalidStringChar) assertValidStringLiteralValue(decoded, start);
       const s = JSON.stringify(decoded); // canonical short quoted form
@@ -13598,52 +13675,6 @@ function lex(inputText, opts = {}) {
       continue;
     }
 
-    // 6) Numeric literal (integer or float)
-    if (isAsciiDigit(c) || (c === '-' && peek(1) !== null && isAsciiDigit(peek(1)))) {
-      const start = i;
-      const numChars = [c];
-      i++;
-      while (i < n) {
-        const cc = chars[i];
-        if (isAsciiDigit(cc)) {
-          numChars.push(cc);
-          i++;
-          continue;
-        }
-        if (cc === '.') {
-          if (i + 1 < n && isAsciiDigit(chars[i + 1])) {
-            numChars.push('.');
-            i++;
-            continue;
-          } else {
-            break;
-          }
-        }
-        break;
-      }
-
-      // Optional exponent part: e.g., 1e0, 1.1e-3, 1.1E+0
-      if (i < n && (chars[i] === 'e' || chars[i] === 'E')) {
-        let j = i + 1;
-        if (j < n && (chars[j] === '+' || chars[j] === '-')) j++;
-        if (j < n && isAsciiDigit(chars[j])) {
-          numChars.push(chars[i]); // e/E
-          i++;
-          if (i < n && (chars[i] === '+' || chars[i] === '-')) {
-            numChars.push(chars[i]);
-            i++;
-          }
-          while (i < n && isAsciiDigit(chars[i])) {
-            numChars.push(chars[i]);
-            i++;
-          }
-        }
-      }
-
-      tokens.push(new Token('Literal', numChars.join(''), start));
-      continue;
-    }
-
     // 7) Identifiers / keywords / QNames
     const start = i;
     const word = readIdentText(start);

package/lib/lexer.js

@@ -1547,7 +1547,76 @@ function lex(inputText, opts = {}) {
       continue;
     }
 
-    // 5) Single-character punctuation.  Use a switch rather than allocating a
+    // 5) Numeric literal (integer, decimal, or double). Turtle/N3 numeric
+    // literals may have a leading sign and decimals may start with '.', e.g.
+    // '+42' and '.5'.  Reject repeated decimal points so '1.2.3'
+    // cannot be misread as one impossible numeric-like token.
+    if (
+      isAsciiDigit(c) ||
+      ((c === '+' || c === '-') && (isAsciiDigit(peek(1)) || (peek(1) === '.' && isAsciiDigit(peek(2))))) ||
+      (c === '.' && isAsciiDigit(peek(1)) && !isAsciiDigit(peek(-1)))
+    ) {
+      const start = i;
+      const numChars = [];
+
+      if (chars[i] === '+' || chars[i] === '-') {
+        numChars.push(chars[i]);
+        i++;
+      }
+
+      if (chars[i] === '.') {
+        numChars.push('.');
+        i++;
+        while (i < n && isAsciiDigit(chars[i])) {
+          numChars.push(chars[i]);
+          i++;
+        }
+      } else {
+        while (i < n && isAsciiDigit(chars[i])) {
+          numChars.push(chars[i]);
+          i++;
+        }
+        if (i < n && chars[i] === '.' && i + 1 < n && isAsciiDigit(chars[i + 1])) {
+          numChars.push('.');
+          i++;
+          while (i < n && isAsciiDigit(chars[i])) {
+            numChars.push(chars[i]);
+            i++;
+          }
+        }
+      }
+
+      if (i < n && chars[i] === '.' && i + 1 < n && isAsciiDigit(chars[i + 1])) {
+        throw new N3SyntaxError('Malformed numeric literal: multiple decimal points', start);
+      }
+
+      // Optional exponent part: e.g., 1e0, 1.1e-3, .5E+0.
+      if (i < n && (chars[i] === 'e' || chars[i] === 'E')) {
+        let j = i + 1;
+        if (j < n && (chars[j] === '+' || chars[j] === '-')) j++;
+        if (j < n && isAsciiDigit(chars[j])) {
+          numChars.push(chars[i]); // e/E
+          i++;
+          if (i < n && (chars[i] === '+' || chars[i] === '-')) {
+            numChars.push(chars[i]);
+            i++;
+          }
+          while (i < n && isAsciiDigit(chars[i])) {
+            numChars.push(chars[i]);
+            i++;
+          }
+        }
+      }
+
+      if (i < n && chars[i] === '.' && i + 1 < n && isAsciiDigit(chars[i + 1])) {
+        throw new N3SyntaxError('Malformed numeric literal: multiple decimal points', start);
+      }
+
+      tokens.push(new Token('Literal', numChars.join(''), start));
+      continue;
+    }
+
+    // 6) Single-character punctuation.  Use a switch rather than allocating a
     // mapping object for every punctuation token in large inputs.
     switch (c) {
       case '{':
@@ -1668,13 +1737,17 @@ function lex(inputText, opts = {}) {
           }
           continue;
         }
+        if (cc === '\n' || cc === '\r') {
+          throw new N3SyntaxError('Unescaped newline in short string literal', start);
+        }
         if (cc === '"') {
           closed = true;
           break;
         }
         if (sChars !== null) sChars.push(cc);
       }
-      const rawContent = sChars === null ? sliceChars(contentStart, closed ? i - 1 : i) : sChars.join('');
+      if (!closed) throw new N3SyntaxError('Unterminated short string literal "..."', start);
+      const rawContent = sChars === null ? sliceChars(contentStart, i - 1) : sChars.join('');
       const decoded = sChars === null ? rawContent : decodeN3StringEscapes(rawContent, start);
       if (sChars !== null || inputMayContainInvalidStringChar) assertValidStringLiteralValue(decoded, start);
       const s = JSON.stringify(decoded); // canonical short quoted form
@@ -1758,13 +1831,17 @@ function lex(inputText, opts = {}) {
           }
           continue;
         }
+        if (cc === '\n' || cc === '\r') {
+          throw new N3SyntaxError('Unescaped newline in short string literal', start);
+        }
         if (cc === "'") {
           closed = true;
           break;
         }
         if (sChars !== null) sChars.push(cc);
       }
-      const rawContent = sChars === null ? sliceChars(contentStart, closed ? i - 1 : i) : sChars.join('');
+      if (!closed) throw new N3SyntaxError("Unterminated short string literal '...'", start);
+      const rawContent = sChars === null ? sliceChars(contentStart, i - 1) : sChars.join('');
       const decoded = sChars === null ? rawContent : decodeN3StringEscapes(rawContent, start);
       if (sChars !== null || inputMayContainInvalidStringChar) assertValidStringLiteralValue(decoded, start);
       const s = JSON.stringify(decoded); // canonical short quoted form
@@ -1847,52 +1924,6 @@ function lex(inputText, opts = {}) {
       continue;
     }
 
-    // 6) Numeric literal (integer or float)
-    if (isAsciiDigit(c) || (c === '-' && peek(1) !== null && isAsciiDigit(peek(1)))) {
-      const start = i;
-      const numChars = [c];
-      i++;
-      while (i < n) {
-        const cc = chars[i];
-        if (isAsciiDigit(cc)) {
-          numChars.push(cc);
-          i++;
-          continue;
-        }
-        if (cc === '.') {
-          if (i + 1 < n && isAsciiDigit(chars[i + 1])) {
-            numChars.push('.');
-            i++;
-            continue;
-          } else {
-            break;
-          }
-        }
-        break;
-      }
-
-      // Optional exponent part: e.g., 1e0, 1.1e-3, 1.1E+0
-      if (i < n && (chars[i] === 'e' || chars[i] === 'E')) {
-        let j = i + 1;
-        if (j < n && (chars[j] === '+' || chars[j] === '-')) j++;
-        if (j < n && isAsciiDigit(chars[j])) {
-          numChars.push(chars[i]); // e/E
-          i++;
-          if (i < n && (chars[i] === '+' || chars[i] === '-')) {
-            numChars.push(chars[i]);
-            i++;
-          }
-          while (i < n && isAsciiDigit(chars[i])) {
-            numChars.push(chars[i]);
-            i++;
-          }
-        }
-      }
-
-      tokens.push(new Token('Literal', numChars.join(''), start));
-      continue;
-    }
-
     // 7) Identifiers / keywords / QNames
     const start = i;
     const word = readIdentText(start);

package/package.json

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

package/test/api.test.js

@@ -769,6 +769,132 @@ bad.:example a bad.:Person.
 `,
     expectError: true,
   },
+  {
+    name: '12k2 invalid syntax: raw newline in short string literal should throw',
+    opt: { proofComments: false },
+    input: `
+@prefix : <http://example.org/> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+
+:my :value "
+123".
+
+{
+    :my :value "\n123".
+}
+=>
+{
+    :result :has :crash-syntax-11.
+}.
+
+{} => {
+    :test :contains :crash-syntax-11.
+}.
+
+{
+    :result :has :crash-syntax-11.
+}
+=>
+{
+    :test :is false.
+}.
+`,
+    expectError: true,
+  },
+  {
+    name: '12k3 invalid syntax: repeated dots in numeric-looking literal should throw',
+    opt: { proofComments: false },
+    input: `
+@prefix : <http://example.org/> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+
+:my :value 1.2.3.4.5.
+
+{
+    :my :value 1.2.3.4.5.
+}
+=>
+{
+    :result :has :crash-syntax-12.
+}.
+
+{} => {
+    :test :contains :crash-syntax-12.
+}.
+
+{
+    :result :has :crash-syntax-12.
+}
+=>
+{
+    :test :is false.
+}.
+`,
+    expectError: true,
+  },
+  {
+    name: '12k4 success literal: signed integer shorthand parses',
+    opt: { proofComments: false },
+    input: `
+@prefix : <http://example.org/> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+
+:my :value +42.
+
+{
+    :my :value +42.
+}
+=>
+{
+    :result :has :success-literal-32.
+}.
+
+{} => {
+    :test :contains :success-literal-32.
+}.
+
+{
+    :result :has :success-literal-32.
+}
+=>
+{
+    :test :is true.
+}.
+`,
+    expect: [/:result\s+:has\s+:success-literal-32\s*\./, /:test\s+:is\s+true\s*\./],
+  },
+  {
+    name: '12k5 success literal: leading-dot decimal shorthand parses',
+    opt: { proofComments: false },
+    input: `
+@prefix : <http://example.org/> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+
+:my :value .5.
+
+{
+    :my :value .5.
+}
+=>
+{
+    :result :has :success-literal-33.
+}.
+
+{} => {
+    :test :contains :success-literal-33.
+}.
+
+{
+    :result :has :success-literal-33.
+}
+=>
+{
+    :test :is true.
+}.
+`,
+    expect: [/:result\s+:has\s+:success-literal-33\s*\./, /:test\s+:is\s+true\s*\./],
+  },
+
   {
     name: '12l regression: IRIREF \\u escape decodes before log:uri comparison (mismatch stays falsey)',
     opt: { proofComments: false },
@@ -1360,7 +1486,7 @@ _:l2 rdf:rest rdf:nil.
       odrl:action ?Ignore ;
       odrl:duty [ odrl:action ?A ]
   ].
-  ( "%% Duty_(a,t)(action:%s)\n%% => ~Possible_(a,t)(~action:%s)\n" ?A ?A ) string:format ?Str.
+  ( "%% Duty_(a,t)(action:%s)\\n%% => ~Possible_(a,t)(~action:%s)\\n" ?A ?A ) string:format ?Str.
 }
 =>
 {

package/test/playground.test.js

@@ -906,16 +906,30 @@ ${JSON.stringify(last, null, 2)}`);
     const fuseProgram = fs.readFileSync(path.join(ROOT, 'examples', 'fuse.n3'), 'utf8');
     const outputStringProgram = `@prefix : <#> .
 @prefix log: <http://www.w3.org/2000/10/swap/log#> .
-:report log:outputString "## Hello from output string\n\nLine 2 with **bold** and [Eyeling](https://example.org/eyeling)\n" .
+:report log:outputString """## Hello from output string
+
+Line 2 with **bold** and [Eyeling](https://example.org/eyeling)
+""" .
 `;
     const riskMarkdownOutputStringProgram = `@prefix : <#> .
 @prefix log: <http://www.w3.org/2000/10/swap/log#> .
-:report log:outputString "# Risk report\n\n### Clause H1 — score 100\n\nRisk: secondary use is permitted without a safeguard. Clause H1: Hospital may provide electronic health data for secondary use.\n\n- **Mitigation for clause H1:** Require a permit before secondary use.\n" .
+:report log:outputString """# Risk report
+
+### Clause H1 — score 100
+
+Risk: secondary use is permitted without a safeguard. Clause H1: Hospital may provide electronic health data for secondary use.
+
+- **Mitigation for clause H1:** Require a permit before secondary use.
+""" .
 `;
     const baseOnlyMarkdownProgram = `@base <https://raw.githubusercontent.com/eyereasoner/eyeling/refs/heads/main/examples/smoke-arithmetic.n3> .
 @prefix : <#> .
 @prefix log: <http://www.w3.org/2000/10/swap/log#> .
-:report log:outputString "# stateurl link base\n\n[N3 rules](../smoke-arithmetic.n3)\n[Input TriG](../input/smoke-arithmetic.trig)\n" .
+:report log:outputString """# stateurl link base
+
+[N3 rules](../smoke-arithmetic.n3)
+[Input TriG](../input/smoke-arithmetic.trig)
+""" .
 `;
     const logQueryTurtleProgram = `@prefix : <#> .
 @prefix log: <http://www.w3.org/2000/10/swap/log#> .