UNPKG

parsergen-starter

Version:

A complete parser generator starter with PEG.js, optional Moo lexer, and VS Code integration

748 lines (665 loc) 18.9 kB
// @generated by Peggy 5.0.5. // // https://peggyjs.org/ class peg$SyntaxError extends SyntaxError { constructor(message, expected, found, location) { super(message); this.expected = expected; this.found = found; this.location = location; this.name = "SyntaxError"; } format(sources) { let str = "Error: " + this.message; if (this.location) { let src = null; const st = sources.find(s => s.source === this.location.source); if (st) { src = st.text.split(/\r\n|\n|\r/g); } const s = this.location.start; const offset_s = (this.location.source && (typeof this.location.source.offset === "function")) ? this.location.source.offset(s) : s; const loc = this.location.source + ":" + offset_s.line + ":" + offset_s.column; if (src) { const e = this.location.end; const filler = "".padEnd(offset_s.line.toString().length, " "); const line = src[s.line - 1]; const last = s.line === e.line ? e.column : line.length + 1; const hatLen = (last - s.column) || 1; str += "\n --> " + loc + "\n" + filler + " |\n" + offset_s.line + " | " + line + "\n" + filler + " | " + "".padEnd(s.column - 1, " ") + "".padEnd(hatLen, "^"); } else { str += "\n at " + loc; } } return str; } static buildMessage(expected, found) { function hex(ch) { return ch.codePointAt(0).toString(16).toUpperCase(); } const nonPrintable = Object.prototype.hasOwnProperty.call(RegExp.prototype, "unicode") ? new RegExp("[\\p{C}\\p{Mn}\\p{Mc}]", "gu") : null; function unicodeEscape(s) { if (nonPrintable) { return s.replace(nonPrintable, ch => "\\u{" + hex(ch) + "}"); } return s; } function literalEscape(s) { return unicodeEscape(s .replace(/\\/g, "\\\\") .replace(/"/g, "\\\"") .replace(/\0/g, "\\0") .replace(/\t/g, "\\t") .replace(/\n/g, "\\n") .replace(/\r/g, "\\r") .replace(/[\x00-\x0F]/g, ch => "\\x0" + hex(ch)) .replace(/[\x10-\x1F\x7F-\x9F]/g, ch => "\\x" + hex(ch))); } function classEscape(s) { return unicodeEscape(s .replace(/\\/g, "\\\\") .replace(/\]/g, "\\]") .replace(/\^/g, "\\^") .replace(/-/g, "\\-") .replace(/\0/g, "\\0") .replace(/\t/g, "\\t") .replace(/\n/g, "\\n") .replace(/\r/g, "\\r") .replace(/[\x00-\x0F]/g, ch => "\\x0" + hex(ch)) .replace(/[\x10-\x1F\x7F-\x9F]/g, ch => "\\x" + hex(ch))); } const DESCRIBE_EXPECTATION_FNS = { literal(expectation) { return "\"" + literalEscape(expectation.text) + "\""; }, class(expectation) { const escapedParts = expectation.parts.map( part => (Array.isArray(part) ? classEscape(part[0]) + "-" + classEscape(part[1]) : classEscape(part)) ); return "[" + (expectation.inverted ? "^" : "") + escapedParts.join("") + "]" + (expectation.unicode ? "u" : ""); }, any() { return "any character"; }, end() { return "end of input"; }, other(expectation) { return expectation.description; }, }; function describeExpectation(expectation) { return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation); } function describeExpected(expected) { const descriptions = expected.map(describeExpectation); descriptions.sort(); if (descriptions.length > 0) { let j = 1; for (let i = 1; i < descriptions.length; i++) { if (descriptions[i - 1] !== descriptions[i]) { descriptions[j] = descriptions[i]; j++; } } descriptions.length = j; } switch (descriptions.length) { case 1: return descriptions[0]; case 2: return descriptions[0] + " or " + descriptions[1]; default: return descriptions.slice(0, -1).join(", ") + ", or " + descriptions[descriptions.length - 1]; } } function describeFound(found) { return found ? "\"" + literalEscape(found) + "\"" : "end of input"; } return "Expected " + describeExpected(expected) + " but " + describeFound(found) + " found."; } } function peg$parse(input, options) { options = options !== undefined ? options : {}; const peg$FAILED = {}; const peg$source = options.grammarSource; const peg$startRuleFunctions = { start: peg$parsestart, }; let peg$startRuleFunction = peg$parsestart; const peg$c0 = "("; const peg$c1 = ")"; const peg$c2 = "."; const peg$r0 = /^[+\-]/; const peg$r1 = /^[*\/]/; const peg$r2 = /^[0-9]/; const peg$r3 = /^[ \t\n\r]/; const peg$e0 = peg$classExpectation(["+", "-"], false, false, false); const peg$e1 = peg$classExpectation(["*", "/"], false, false, false); const peg$e2 = peg$literalExpectation("(", false); const peg$e3 = peg$literalExpectation(")", false); const peg$e4 = peg$otherExpectation("number"); const peg$e5 = peg$classExpectation([["0", "9"]], false, false, false); const peg$e6 = peg$literalExpectation(".", false); const peg$e7 = peg$classExpectation([" ", "\t", "\n", "\r"], false, false, false); function peg$f0(expr) { return expr; } function peg$f1(left, operators) { let result = left; for (let i = 0; i < operators.length; i++) { const op = operators[i][0]; const right = operators[i][2]; result = { type: "BinaryExpression", operator: op, left: result, right: right }; } return result; } function peg$f2(left, operators) { let result = left; for (let i = 0; i < operators.length; i++) { const op = operators[i][0]; const right = operators[i][2]; result = { type: "BinaryExpression", operator: op, left: result, right: right }; } return result; } function peg$f3(expr) { return expr; } function peg$f4(digits) { return { type: "NumberLiteral", value: parseFloat(text()) }; } let peg$currPos = options.peg$currPos | 0; let peg$savedPos = peg$currPos; const peg$posDetailsCache = [{ line: 1, column: 1 }]; let peg$maxFailPos = peg$currPos; let peg$maxFailExpected = options.peg$maxFailExpected || []; let peg$silentFails = options.peg$silentFails | 0; let peg$result; if (options.startRule) { if (!(options.startRule in peg$startRuleFunctions)) { throw new Error("Can't start parsing from rule \"" + options.startRule + "\"."); } peg$startRuleFunction = peg$startRuleFunctions[options.startRule]; } function text() { return input.substring(peg$savedPos, peg$currPos); } function offset() { return peg$savedPos; } function range() { return { source: peg$source, start: peg$savedPos, end: peg$currPos, }; } function location() { return peg$computeLocation(peg$savedPos, peg$currPos); } function expected(description, location) { location = location !== undefined ? location : peg$computeLocation(peg$savedPos, peg$currPos); throw peg$buildStructuredError( [peg$otherExpectation(description)], input.substring(peg$savedPos, peg$currPos), location ); } function error(message, location) { location = location !== undefined ? location : peg$computeLocation(peg$savedPos, peg$currPos); throw peg$buildSimpleError(message, location); } function peg$getUnicode(pos = peg$currPos) { const cp = input.codePointAt(pos); if (cp === undefined) { return ""; } return String.fromCodePoint(cp); } function peg$literalExpectation(text, ignoreCase) { return { type: "literal", text, ignoreCase }; } function peg$classExpectation(parts, inverted, ignoreCase, unicode) { return { type: "class", parts, inverted, ignoreCase, unicode }; } function peg$anyExpectation() { return { type: "any" }; } function peg$endExpectation() { return { type: "end" }; } function peg$otherExpectation(description) { return { type: "other", description }; } function peg$computePosDetails(pos) { let details = peg$posDetailsCache[pos]; let p; if (details) { return details; } else { if (pos >= peg$posDetailsCache.length) { p = peg$posDetailsCache.length - 1; } else { p = pos; while (!peg$posDetailsCache[--p]) {} } details = peg$posDetailsCache[p]; details = { line: details.line, column: details.column, }; while (p < pos) { if (input.charCodeAt(p) === 10) { details.line++; details.column = 1; } else { details.column++; } p++; } peg$posDetailsCache[pos] = details; return details; } } function peg$computeLocation(startPos, endPos, offset) { const startPosDetails = peg$computePosDetails(startPos); const endPosDetails = peg$computePosDetails(endPos); const res = { source: peg$source, start: { offset: startPos, line: startPosDetails.line, column: startPosDetails.column, }, end: { offset: endPos, line: endPosDetails.line, column: endPosDetails.column, }, }; if (offset && peg$source && (typeof peg$source.offset === "function")) { res.start = peg$source.offset(res.start); res.end = peg$source.offset(res.end); } return res; } function peg$fail(expected) { if (peg$currPos < peg$maxFailPos) { return; } if (peg$currPos > peg$maxFailPos) { peg$maxFailPos = peg$currPos; peg$maxFailExpected = []; } peg$maxFailExpected.push(expected); } function peg$buildSimpleError(message, location) { return new peg$SyntaxError(message, null, null, location); } function peg$buildStructuredError(expected, found, location) { return new peg$SyntaxError( peg$SyntaxError.buildMessage(expected, found), expected, found, location ); } function peg$parsestart() { let s0, s1, s2, s3; s0 = peg$currPos; s1 = peg$parse_(); s2 = peg$parseexpression(); if (s2 !== peg$FAILED) { s3 = peg$parse_(); peg$savedPos = s0; s0 = peg$f0(s2); } else { peg$currPos = s0; s0 = peg$FAILED; } return s0; } function peg$parseexpression() { let s0, s1, s2, s3, s4, s5, s6, s7; s0 = peg$currPos; s1 = peg$parseterm(); if (s1 !== peg$FAILED) { s2 = peg$parse_(); s3 = []; s4 = peg$currPos; s5 = input.charAt(peg$currPos); if (peg$r0.test(s5)) { peg$currPos++; } else { s5 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e0); } } if (s5 !== peg$FAILED) { s6 = peg$parse_(); s7 = peg$parseterm(); if (s7 !== peg$FAILED) { s5 = [s5, s6, s7]; s4 = s5; } else { peg$currPos = s4; s4 = peg$FAILED; } } else { peg$currPos = s4; s4 = peg$FAILED; } while (s4 !== peg$FAILED) { s3.push(s4); s4 = peg$currPos; s5 = input.charAt(peg$currPos); if (peg$r0.test(s5)) { peg$currPos++; } else { s5 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e0); } } if (s5 !== peg$FAILED) { s6 = peg$parse_(); s7 = peg$parseterm(); if (s7 !== peg$FAILED) { s5 = [s5, s6, s7]; s4 = s5; } else { peg$currPos = s4; s4 = peg$FAILED; } } else { peg$currPos = s4; s4 = peg$FAILED; } } peg$savedPos = s0; s0 = peg$f1(s1, s3); } else { peg$currPos = s0; s0 = peg$FAILED; } return s0; } function peg$parseterm() { let s0, s1, s2, s3, s4, s5, s6, s7; s0 = peg$currPos; s1 = peg$parsefactor(); if (s1 !== peg$FAILED) { s2 = peg$parse_(); s3 = []; s4 = peg$currPos; s5 = input.charAt(peg$currPos); if (peg$r1.test(s5)) { peg$currPos++; } else { s5 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e1); } } if (s5 !== peg$FAILED) { s6 = peg$parse_(); s7 = peg$parsefactor(); if (s7 !== peg$FAILED) { s5 = [s5, s6, s7]; s4 = s5; } else { peg$currPos = s4; s4 = peg$FAILED; } } else { peg$currPos = s4; s4 = peg$FAILED; } while (s4 !== peg$FAILED) { s3.push(s4); s4 = peg$currPos; s5 = input.charAt(peg$currPos); if (peg$r1.test(s5)) { peg$currPos++; } else { s5 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e1); } } if (s5 !== peg$FAILED) { s6 = peg$parse_(); s7 = peg$parsefactor(); if (s7 !== peg$FAILED) { s5 = [s5, s6, s7]; s4 = s5; } else { peg$currPos = s4; s4 = peg$FAILED; } } else { peg$currPos = s4; s4 = peg$FAILED; } } peg$savedPos = s0; s0 = peg$f2(s1, s3); } else { peg$currPos = s0; s0 = peg$FAILED; } return s0; } function peg$parsefactor() { let s0, s1, s2, s3, s4, s5; s0 = peg$parsenumber(); if (s0 === peg$FAILED) { s0 = peg$currPos; if (input.charCodeAt(peg$currPos) === 40) { s1 = peg$c0; peg$currPos++; } else { s1 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e2); } } if (s1 !== peg$FAILED) { s2 = peg$parse_(); s3 = peg$parseexpression(); if (s3 !== peg$FAILED) { s4 = peg$parse_(); if (input.charCodeAt(peg$currPos) === 41) { s5 = peg$c1; peg$currPos++; } else { s5 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e3); } } if (s5 !== peg$FAILED) { peg$savedPos = s0; s0 = peg$f3(s3); } else { peg$currPos = s0; s0 = peg$FAILED; } } else { peg$currPos = s0; s0 = peg$FAILED; } } else { peg$currPos = s0; s0 = peg$FAILED; } } return s0; } function peg$parsenumber() { let s0, s1, s2, s3, s4, s5, s6; peg$silentFails++; s0 = peg$currPos; s1 = peg$currPos; s2 = []; s3 = input.charAt(peg$currPos); if (peg$r2.test(s3)) { peg$currPos++; } else { s3 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e5); } } if (s3 !== peg$FAILED) { while (s3 !== peg$FAILED) { s2.push(s3); s3 = input.charAt(peg$currPos); if (peg$r2.test(s3)) { peg$currPos++; } else { s3 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e5); } } } } else { s2 = peg$FAILED; } if (s2 !== peg$FAILED) { s3 = peg$currPos; if (input.charCodeAt(peg$currPos) === 46) { s4 = peg$c2; peg$currPos++; } else { s4 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e6); } } if (s4 !== peg$FAILED) { s5 = []; s6 = input.charAt(peg$currPos); if (peg$r2.test(s6)) { peg$currPos++; } else { s6 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e5); } } if (s6 !== peg$FAILED) { while (s6 !== peg$FAILED) { s5.push(s6); s6 = input.charAt(peg$currPos); if (peg$r2.test(s6)) { peg$currPos++; } else { s6 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e5); } } } } else { s5 = peg$FAILED; } if (s5 !== peg$FAILED) { s4 = [s4, s5]; s3 = s4; } else { peg$currPos = s3; s3 = peg$FAILED; } } else { peg$currPos = s3; s3 = peg$FAILED; } if (s3 === peg$FAILED) { s3 = null; } s2 = [s2, s3]; s1 = s2; } else { peg$currPos = s1; s1 = peg$FAILED; } if (s1 !== peg$FAILED) { peg$savedPos = s0; s1 = peg$f4(s1); } s0 = s1; peg$silentFails--; if (s0 === peg$FAILED) { s1 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e4); } } return s0; } function peg$parse_() { let s0, s1; peg$silentFails++; s0 = []; s1 = input.charAt(peg$currPos); if (peg$r3.test(s1)) { peg$currPos++; } else { s1 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e7); } } while (s1 !== peg$FAILED) { s0.push(s1); s1 = input.charAt(peg$currPos); if (peg$r3.test(s1)) { peg$currPos++; } else { s1 = peg$FAILED; if (peg$silentFails === 0) { peg$fail(peg$e7); } } } peg$silentFails--; return s0; } peg$result = peg$startRuleFunction(); const peg$success = (peg$result !== peg$FAILED && peg$currPos === input.length); function peg$throw() { if (peg$result !== peg$FAILED && peg$currPos < input.length) { peg$fail(peg$endExpectation()); } throw peg$buildStructuredError( peg$maxFailExpected, peg$maxFailPos < input.length ? peg$getUnicode(peg$maxFailPos) : null, peg$maxFailPos < input.length ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1) : peg$computeLocation(peg$maxFailPos, peg$maxFailPos) ); } if (options.peg$library) { return /** @type {any} */ ({ peg$result, peg$currPos, peg$FAILED, peg$maxFailExpected, peg$maxFailPos, peg$success, peg$throw: peg$success ? undefined : peg$throw, }); } if (peg$success) { return peg$result; } else { peg$throw(); } } const peg$allowedStartRules = [ "start" ]; export { peg$allowedStartRules as StartRules, peg$SyntaxError as SyntaxError, peg$parse as parse };