Spaces:
Runtime error
Runtime error
| /* | |
| * Generated by PEG.js 0.10.0. | |
| * | |
| * http://pegjs.org/ | |
| */ | |
| (function(root, factory) { | |
| if (typeof define === "function" && define.amd) { | |
| define([], factory); | |
| } else if (typeof module === "object" && module.exports) { | |
| module.exports = factory(); | |
| } | |
| })(this, function() { | |
| "use strict"; | |
| function peg$subclass(child, parent) { | |
| function ctor() { this.constructor = child; } | |
| ctor.prototype = parent.prototype; | |
| child.prototype = new ctor(); | |
| } | |
| function peg$SyntaxError(message, expected, found, location) { | |
| this.message = message; | |
| this.expected = expected; | |
| this.found = found; | |
| this.location = location; | |
| this.name = "SyntaxError"; | |
| if (typeof Error.captureStackTrace === "function") { | |
| Error.captureStackTrace(this, peg$SyntaxError); | |
| } | |
| } | |
| peg$subclass(peg$SyntaxError, Error); | |
| peg$SyntaxError.buildMessage = function(expected, found) { | |
| var DESCRIBE_EXPECTATION_FNS = { | |
| literal: function(expectation) { | |
| return "\"" + literalEscape(expectation.text) + "\""; | |
| }, | |
| "class": function(expectation) { | |
| var escapedParts = "", | |
| i; | |
| for (i = 0; i < expectation.parts.length; i++) { | |
| escapedParts += expectation.parts[i] instanceof Array | |
| ? classEscape(expectation.parts[i][0]) + "-" + classEscape(expectation.parts[i][1]) | |
| : classEscape(expectation.parts[i]); | |
| } | |
| return "[" + (expectation.inverted ? "^" : "") + escapedParts + "]"; | |
| }, | |
| any: function(expectation) { | |
| return "any character"; | |
| }, | |
| end: function(expectation) { | |
| return "end of input"; | |
| }, | |
| other: function(expectation) { | |
| return expectation.description; | |
| } | |
| }; | |
| function hex(ch) { | |
| return ch.charCodeAt(0).toString(16).toUpperCase(); | |
| } | |
| function literalEscape(s) { | |
| return 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, function(ch) { return '\\x0' + hex(ch); }) | |
| .replace(/[\x10-\x1F\x7F-\x9F]/g, function(ch) { return '\\x' + hex(ch); }); | |
| } | |
| function classEscape(s) { | |
| return 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, function(ch) { return '\\x0' + hex(ch); }) | |
| .replace(/[\x10-\x1F\x7F-\x9F]/g, function(ch) { return '\\x' + hex(ch); }); | |
| } | |
| function describeExpectation(expectation) { | |
| return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation); | |
| } | |
| function describeExpected(expected) { | |
| var descriptions = new Array(expected.length), | |
| i, j; | |
| for (i = 0; i < expected.length; i++) { | |
| descriptions[i] = describeExpectation(expected[i]); | |
| } | |
| descriptions.sort(); | |
| if (descriptions.length > 0) { | |
| for (i = 1, j = 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 !== void 0 ? options : {}; | |
| var peg$FAILED = {}, | |
| peg$startRuleFunctions = { start: peg$parsestart }, | |
| peg$startRuleFunction = peg$parsestart, | |
| peg$c0 = function(ss) { | |
| return ss.length === 1 ? ss[0] : { type: 'matches', selectors: ss }; | |
| }, | |
| peg$c1 = function() { return void 0; }, | |
| peg$c2 = " ", | |
| peg$c3 = peg$literalExpectation(" ", false), | |
| peg$c4 = /^[^ [\],():#!=><~+.]/, | |
| peg$c5 = peg$classExpectation([" ", "[", "]", ",", "(", ")", ":", "#", "!", "=", ">", "<", "~", "+", "."], true, false), | |
| peg$c6 = function(i) { return i.join(''); }, | |
| peg$c7 = ">", | |
| peg$c8 = peg$literalExpectation(">", false), | |
| peg$c9 = function() { return 'child'; }, | |
| peg$c10 = "~", | |
| peg$c11 = peg$literalExpectation("~", false), | |
| peg$c12 = function() { return 'sibling'; }, | |
| peg$c13 = "+", | |
| peg$c14 = peg$literalExpectation("+", false), | |
| peg$c15 = function() { return 'adjacent'; }, | |
| peg$c16 = function() { return 'descendant'; }, | |
| peg$c17 = ",", | |
| peg$c18 = peg$literalExpectation(",", false), | |
| peg$c19 = function(s, ss) { | |
| return [s].concat(ss.map(function (s) { return s[3]; })); | |
| }, | |
| peg$c20 = function(a, ops) { | |
| return ops.reduce(function (memo, rhs) { | |
| return { type: rhs[0], left: memo, right: rhs[1] }; | |
| }, a); | |
| }, | |
| peg$c21 = "!", | |
| peg$c22 = peg$literalExpectation("!", false), | |
| peg$c23 = function(subject, as) { | |
| const b = as.length === 1 ? as[0] : { type: 'compound', selectors: as }; | |
| if(subject) b.subject = true; | |
| return b; | |
| }, | |
| peg$c24 = "*", | |
| peg$c25 = peg$literalExpectation("*", false), | |
| peg$c26 = function(a) { return { type: 'wildcard', value: a }; }, | |
| peg$c27 = "#", | |
| peg$c28 = peg$literalExpectation("#", false), | |
| peg$c29 = function(i) { return { type: 'identifier', value: i }; }, | |
| peg$c30 = "[", | |
| peg$c31 = peg$literalExpectation("[", false), | |
| peg$c32 = "]", | |
| peg$c33 = peg$literalExpectation("]", false), | |
| peg$c34 = function(v) { return v; }, | |
| peg$c35 = /^[><!]/, | |
| peg$c36 = peg$classExpectation([">", "<", "!"], false, false), | |
| peg$c37 = "=", | |
| peg$c38 = peg$literalExpectation("=", false), | |
| peg$c39 = function(a) { return (a || '') + '='; }, | |
| peg$c40 = /^[><]/, | |
| peg$c41 = peg$classExpectation([">", "<"], false, false), | |
| peg$c42 = ".", | |
| peg$c43 = peg$literalExpectation(".", false), | |
| peg$c44 = function(name, op, value) { | |
| return { type: 'attribute', name: name, operator: op, value: value }; | |
| }, | |
| peg$c45 = function(name) { return { type: 'attribute', name: name }; }, | |
| peg$c46 = "\"", | |
| peg$c47 = peg$literalExpectation("\"", false), | |
| peg$c48 = /^[^\\"]/, | |
| peg$c49 = peg$classExpectation(["\\", "\""], true, false), | |
| peg$c50 = "\\", | |
| peg$c51 = peg$literalExpectation("\\", false), | |
| peg$c52 = peg$anyExpectation(), | |
| peg$c53 = function(a, b) { return a + b; }, | |
| peg$c54 = function(d) { | |
| return { type: 'literal', value: strUnescape(d.join('')) }; | |
| }, | |
| peg$c55 = "'", | |
| peg$c56 = peg$literalExpectation("'", false), | |
| peg$c57 = /^[^\\']/, | |
| peg$c58 = peg$classExpectation(["\\", "'"], true, false), | |
| peg$c59 = /^[0-9]/, | |
| peg$c60 = peg$classExpectation([["0", "9"]], false, false), | |
| peg$c61 = function(a, b) { | |
| // Can use `a.flat().join('')` once supported | |
| const leadingDecimals = a ? [].concat.apply([], a).join('') : ''; | |
| return { type: 'literal', value: parseFloat(leadingDecimals + b.join('')) }; | |
| }, | |
| peg$c62 = function(i) { return { type: 'literal', value: i }; }, | |
| peg$c63 = "type(", | |
| peg$c64 = peg$literalExpectation("type(", false), | |
| peg$c65 = /^[^ )]/, | |
| peg$c66 = peg$classExpectation([" ", ")"], true, false), | |
| peg$c67 = ")", | |
| peg$c68 = peg$literalExpectation(")", false), | |
| peg$c69 = function(t) { return { type: 'type', value: t.join('') }; }, | |
| peg$c70 = /^[imsu]/, | |
| peg$c71 = peg$classExpectation(["i", "m", "s", "u"], false, false), | |
| peg$c72 = "/", | |
| peg$c73 = peg$literalExpectation("/", false), | |
| peg$c74 = /^[^\/]/, | |
| peg$c75 = peg$classExpectation(["/"], true, false), | |
| peg$c76 = function(d, flgs) { return { | |
| type: 'regexp', value: new RegExp(d.join(''), flgs ? flgs.join('') : '') }; | |
| }, | |
| peg$c77 = function(i, is) { | |
| return { type: 'field', name: is.reduce(function(memo, p){ return memo + p[0] + p[1]; }, i)}; | |
| }, | |
| peg$c78 = ":not(", | |
| peg$c79 = peg$literalExpectation(":not(", false), | |
| peg$c80 = function(ss) { return { type: 'not', selectors: ss }; }, | |
| peg$c81 = ":matches(", | |
| peg$c82 = peg$literalExpectation(":matches(", false), | |
| peg$c83 = function(ss) { return { type: 'matches', selectors: ss }; }, | |
| peg$c84 = ":has(", | |
| peg$c85 = peg$literalExpectation(":has(", false), | |
| peg$c86 = function(ss) { return { type: 'has', selectors: ss }; }, | |
| peg$c87 = ":first-child", | |
| peg$c88 = peg$literalExpectation(":first-child", false), | |
| peg$c89 = function() { return nth(1); }, | |
| peg$c90 = ":last-child", | |
| peg$c91 = peg$literalExpectation(":last-child", false), | |
| peg$c92 = function() { return nthLast(1); }, | |
| peg$c93 = ":nth-child(", | |
| peg$c94 = peg$literalExpectation(":nth-child(", false), | |
| peg$c95 = function(n) { return nth(parseInt(n.join(''), 10)); }, | |
| peg$c96 = ":nth-last-child(", | |
| peg$c97 = peg$literalExpectation(":nth-last-child(", false), | |
| peg$c98 = function(n) { return nthLast(parseInt(n.join(''), 10)); }, | |
| peg$c99 = ":", | |
| peg$c100 = peg$literalExpectation(":", false), | |
| peg$c101 = "statement", | |
| peg$c102 = peg$literalExpectation("statement", true), | |
| peg$c103 = "expression", | |
| peg$c104 = peg$literalExpectation("expression", true), | |
| peg$c105 = "declaration", | |
| peg$c106 = peg$literalExpectation("declaration", true), | |
| peg$c107 = "function", | |
| peg$c108 = peg$literalExpectation("function", true), | |
| peg$c109 = "pattern", | |
| peg$c110 = peg$literalExpectation("pattern", true), | |
| peg$c111 = function(c) { | |
| return { type: 'class', name: c }; | |
| }, | |
| peg$currPos = 0, | |
| peg$savedPos = 0, | |
| peg$posDetailsCache = [{ line: 1, column: 1 }], | |
| peg$maxFailPos = 0, | |
| peg$maxFailExpected = [], | |
| peg$silentFails = 0, | |
| peg$resultsCache = {}, | |
| peg$result; | |
| if ("startRule" in options) { | |
| 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 location() { | |
| return peg$computeLocation(peg$savedPos, peg$currPos); | |
| } | |
| function expected(description, location) { | |
| location = location !== void 0 ? 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 !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos) | |
| throw peg$buildSimpleError(message, location); | |
| } | |
| function peg$literalExpectation(text, ignoreCase) { | |
| return { type: "literal", text: text, ignoreCase: ignoreCase }; | |
| } | |
| function peg$classExpectation(parts, inverted, ignoreCase) { | |
| return { type: "class", parts: parts, inverted: inverted, ignoreCase: ignoreCase }; | |
| } | |
| function peg$anyExpectation() { | |
| return { type: "any" }; | |
| } | |
| function peg$endExpectation() { | |
| return { type: "end" }; | |
| } | |
| function peg$otherExpectation(description) { | |
| return { type: "other", description: description }; | |
| } | |
| function peg$computePosDetails(pos) { | |
| var details = peg$posDetailsCache[pos], p; | |
| if (details) { | |
| return details; | |
| } else { | |
| p = pos - 1; | |
| while (!peg$posDetailsCache[p]) { | |
| 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) { | |
| var startPosDetails = peg$computePosDetails(startPos), | |
| endPosDetails = peg$computePosDetails(endPos); | |
| return { | |
| start: { | |
| offset: startPos, | |
| line: startPosDetails.line, | |
| column: startPosDetails.column | |
| }, | |
| end: { | |
| offset: endPos, | |
| line: endPosDetails.line, | |
| column: endPosDetails.column | |
| } | |
| }; | |
| } | |
| 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() { | |
| var s0, s1, s2, s3; | |
| var key = peg$currPos * 30 + 0, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| s1 = peg$parse_(); | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parseselectors(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parse_(); | |
| if (s3 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c0(s2); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$currPos; | |
| s1 = peg$parse_(); | |
| if (s1 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c1(); | |
| } | |
| s0 = s1; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parse_() { | |
| var s0, s1; | |
| var key = peg$currPos * 30 + 1, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = []; | |
| if (input.charCodeAt(peg$currPos) === 32) { | |
| s1 = peg$c2; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c3); } | |
| } | |
| while (s1 !== peg$FAILED) { | |
| s0.push(s1); | |
| if (input.charCodeAt(peg$currPos) === 32) { | |
| s1 = peg$c2; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c3); } | |
| } | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseidentifierName() { | |
| var s0, s1, s2; | |
| var key = peg$currPos * 30 + 2, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| s1 = []; | |
| if (peg$c4.test(input.charAt(peg$currPos))) { | |
| s2 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c5); } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| while (s2 !== peg$FAILED) { | |
| s1.push(s2); | |
| if (peg$c4.test(input.charAt(peg$currPos))) { | |
| s2 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c5); } | |
| } | |
| } | |
| } else { | |
| s1 = peg$FAILED; | |
| } | |
| if (s1 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c6(s1); | |
| } | |
| s0 = s1; | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsebinaryOp() { | |
| var s0, s1, s2, s3; | |
| var key = peg$currPos * 30 + 3, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| s1 = peg$parse_(); | |
| if (s1 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 62) { | |
| s2 = peg$c7; | |
| peg$currPos++; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c8); } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parse_(); | |
| if (s3 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c9(); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$currPos; | |
| s1 = peg$parse_(); | |
| if (s1 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 126) { | |
| s2 = peg$c10; | |
| peg$currPos++; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c11); } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parse_(); | |
| if (s3 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c12(); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$currPos; | |
| s1 = peg$parse_(); | |
| if (s1 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 43) { | |
| s2 = peg$c13; | |
| peg$currPos++; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c14); } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parse_(); | |
| if (s3 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c15(); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 32) { | |
| s1 = peg$c2; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c3); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c16(); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } | |
| } | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseselectors() { | |
| var s0, s1, s2, s3, s4, s5, s6, s7; | |
| var key = peg$currPos * 30 + 4, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| s1 = peg$parseselector(); | |
| if (s1 !== peg$FAILED) { | |
| s2 = []; | |
| s3 = peg$currPos; | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 44) { | |
| s5 = peg$c17; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c18); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| s6 = peg$parse_(); | |
| if (s6 !== peg$FAILED) { | |
| s7 = peg$parseselector(); | |
| if (s7 !== peg$FAILED) { | |
| s4 = [s4, s5, s6, s7]; | |
| s3 = s4; | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| while (s3 !== peg$FAILED) { | |
| s2.push(s3); | |
| s3 = peg$currPos; | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 44) { | |
| s5 = peg$c17; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c18); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| s6 = peg$parse_(); | |
| if (s6 !== peg$FAILED) { | |
| s7 = peg$parseselector(); | |
| if (s7 !== peg$FAILED) { | |
| s4 = [s4, s5, s6, s7]; | |
| s3 = s4; | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c19(s1, s2); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseselector() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 5, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| s1 = peg$parsesequence(); | |
| if (s1 !== peg$FAILED) { | |
| s2 = []; | |
| s3 = peg$currPos; | |
| s4 = peg$parsebinaryOp(); | |
| if (s4 !== peg$FAILED) { | |
| s5 = peg$parsesequence(); | |
| if (s5 !== peg$FAILED) { | |
| s4 = [s4, s5]; | |
| s3 = s4; | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| while (s3 !== peg$FAILED) { | |
| s2.push(s3); | |
| s3 = peg$currPos; | |
| s4 = peg$parsebinaryOp(); | |
| if (s4 !== peg$FAILED) { | |
| s5 = peg$parsesequence(); | |
| if (s5 !== peg$FAILED) { | |
| s4 = [s4, s5]; | |
| s3 = s4; | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c20(s1, s2); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsesequence() { | |
| var s0, s1, s2, s3; | |
| var key = peg$currPos * 30 + 6, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 33) { | |
| s1 = peg$c21; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c22); } | |
| } | |
| if (s1 === peg$FAILED) { | |
| s1 = null; | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = []; | |
| s3 = peg$parseatom(); | |
| if (s3 !== peg$FAILED) { | |
| while (s3 !== peg$FAILED) { | |
| s2.push(s3); | |
| s3 = peg$parseatom(); | |
| } | |
| } else { | |
| s2 = peg$FAILED; | |
| } | |
| if (s2 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c23(s1, s2); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseatom() { | |
| var s0; | |
| var key = peg$currPos * 30 + 7, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$parsewildcard(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parseidentifier(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parseattr(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parsefield(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parsenegation(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parsematches(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parsehas(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parsefirstChild(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parselastChild(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parsenthChild(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parsenthLastChild(); | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$parseclass(); | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsewildcard() { | |
| var s0, s1; | |
| var key = peg$currPos * 30 + 8, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 42) { | |
| s1 = peg$c24; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c25); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c26(s1); | |
| } | |
| s0 = s1; | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseidentifier() { | |
| var s0, s1, s2; | |
| var key = peg$currPos * 30 + 9, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 35) { | |
| s1 = peg$c27; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c28); } | |
| } | |
| if (s1 === peg$FAILED) { | |
| s1 = null; | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parseidentifierName(); | |
| if (s2 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c29(s2); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseattr() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 10, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 91) { | |
| s1 = peg$c30; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c31); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parseattrValue(); | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 93) { | |
| s5 = peg$c32; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c33); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c34(s3); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseattrOps() { | |
| var s0, s1, s2; | |
| var key = peg$currPos * 30 + 11, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (peg$c35.test(input.charAt(peg$currPos))) { | |
| s1 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c36); } | |
| } | |
| if (s1 === peg$FAILED) { | |
| s1 = null; | |
| } | |
| if (s1 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 61) { | |
| s2 = peg$c37; | |
| peg$currPos++; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c38); } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c39(s1); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| if (s0 === peg$FAILED) { | |
| if (peg$c40.test(input.charAt(peg$currPos))) { | |
| s0 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s0 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c41); } | |
| } | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseattrEqOps() { | |
| var s0, s1, s2; | |
| var key = peg$currPos * 30 + 12, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 33) { | |
| s1 = peg$c21; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c22); } | |
| } | |
| if (s1 === peg$FAILED) { | |
| s1 = null; | |
| } | |
| if (s1 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 61) { | |
| s2 = peg$c37; | |
| peg$currPos++; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c38); } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c39(s1); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseattrName() { | |
| var s0, s1, s2; | |
| var key = peg$currPos * 30 + 13, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| s1 = []; | |
| s2 = peg$parseidentifierName(); | |
| if (s2 === peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 46) { | |
| s2 = peg$c42; | |
| peg$currPos++; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c43); } | |
| } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| while (s2 !== peg$FAILED) { | |
| s1.push(s2); | |
| s2 = peg$parseidentifierName(); | |
| if (s2 === peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 46) { | |
| s2 = peg$c42; | |
| peg$currPos++; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c43); } | |
| } | |
| } | |
| } | |
| } else { | |
| s1 = peg$FAILED; | |
| } | |
| if (s1 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c6(s1); | |
| } | |
| s0 = s1; | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseattrValue() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 14, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| s1 = peg$parseattrName(); | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parseattrEqOps(); | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| s5 = peg$parsetype(); | |
| if (s5 === peg$FAILED) { | |
| s5 = peg$parseregex(); | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c44(s1, s3, s5); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$currPos; | |
| s1 = peg$parseattrName(); | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parseattrOps(); | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| s5 = peg$parsestring(); | |
| if (s5 === peg$FAILED) { | |
| s5 = peg$parsenumber(); | |
| if (s5 === peg$FAILED) { | |
| s5 = peg$parsepath(); | |
| } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c44(s1, s3, s5); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$currPos; | |
| s1 = peg$parseattrName(); | |
| if (s1 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c45(s1); | |
| } | |
| s0 = s1; | |
| } | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsestring() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 15, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 34) { | |
| s1 = peg$c46; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c47); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = []; | |
| if (peg$c48.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c49); } | |
| } | |
| if (s3 === peg$FAILED) { | |
| s3 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 92) { | |
| s4 = peg$c50; | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c51); } | |
| } | |
| if (s4 !== peg$FAILED) { | |
| if (input.length > peg$currPos) { | |
| s5 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c52); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s3; | |
| s4 = peg$c53(s4, s5); | |
| s3 = s4; | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } | |
| while (s3 !== peg$FAILED) { | |
| s2.push(s3); | |
| if (peg$c48.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c49); } | |
| } | |
| if (s3 === peg$FAILED) { | |
| s3 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 92) { | |
| s4 = peg$c50; | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c51); } | |
| } | |
| if (s4 !== peg$FAILED) { | |
| if (input.length > peg$currPos) { | |
| s5 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c52); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s3; | |
| s4 = peg$c53(s4, s5); | |
| s3 = s4; | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 34) { | |
| s3 = peg$c46; | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c47); } | |
| } | |
| if (s3 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c54(s2); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| if (s0 === peg$FAILED) { | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 39) { | |
| s1 = peg$c55; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c56); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = []; | |
| if (peg$c57.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c58); } | |
| } | |
| if (s3 === peg$FAILED) { | |
| s3 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 92) { | |
| s4 = peg$c50; | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c51); } | |
| } | |
| if (s4 !== peg$FAILED) { | |
| if (input.length > peg$currPos) { | |
| s5 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c52); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s3; | |
| s4 = peg$c53(s4, s5); | |
| s3 = s4; | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } | |
| while (s3 !== peg$FAILED) { | |
| s2.push(s3); | |
| if (peg$c57.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c58); } | |
| } | |
| if (s3 === peg$FAILED) { | |
| s3 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 92) { | |
| s4 = peg$c50; | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c51); } | |
| } | |
| if (s4 !== peg$FAILED) { | |
| if (input.length > peg$currPos) { | |
| s5 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c52); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s3; | |
| s4 = peg$c53(s4, s5); | |
| s3 = s4; | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s3; | |
| s3 = peg$FAILED; | |
| } | |
| } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 39) { | |
| s3 = peg$c55; | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c56); } | |
| } | |
| if (s3 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c54(s2); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsenumber() { | |
| var s0, s1, s2, s3; | |
| var key = peg$currPos * 30 + 16, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| s1 = peg$currPos; | |
| s2 = []; | |
| if (peg$c59.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c60); } | |
| } | |
| while (s3 !== peg$FAILED) { | |
| s2.push(s3); | |
| if (peg$c59.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c60); } | |
| } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 46) { | |
| s3 = peg$c42; | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c43); } | |
| } | |
| if (s3 !== peg$FAILED) { | |
| s2 = [s2, s3]; | |
| s1 = s2; | |
| } else { | |
| peg$currPos = s1; | |
| s1 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s1; | |
| s1 = peg$FAILED; | |
| } | |
| if (s1 === peg$FAILED) { | |
| s1 = null; | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = []; | |
| if (peg$c59.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c60); } | |
| } | |
| if (s3 !== peg$FAILED) { | |
| while (s3 !== peg$FAILED) { | |
| s2.push(s3); | |
| if (peg$c59.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c60); } | |
| } | |
| } | |
| } else { | |
| s2 = peg$FAILED; | |
| } | |
| if (s2 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c61(s1, s2); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsepath() { | |
| var s0, s1; | |
| var key = peg$currPos * 30 + 17, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| s1 = peg$parseidentifierName(); | |
| if (s1 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c62(s1); | |
| } | |
| s0 = s1; | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsetype() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 18, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.substr(peg$currPos, 5) === peg$c63) { | |
| s1 = peg$c63; | |
| peg$currPos += 5; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c64); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = []; | |
| if (peg$c65.test(input.charAt(peg$currPos))) { | |
| s4 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c66); } | |
| } | |
| if (s4 !== peg$FAILED) { | |
| while (s4 !== peg$FAILED) { | |
| s3.push(s4); | |
| if (peg$c65.test(input.charAt(peg$currPos))) { | |
| s4 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c66); } | |
| } | |
| } | |
| } else { | |
| s3 = peg$FAILED; | |
| } | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 41) { | |
| s5 = peg$c67; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c68); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c69(s3); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseflags() { | |
| var s0, s1; | |
| var key = peg$currPos * 30 + 19, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = []; | |
| if (peg$c70.test(input.charAt(peg$currPos))) { | |
| s1 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c71); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| while (s1 !== peg$FAILED) { | |
| s0.push(s1); | |
| if (peg$c70.test(input.charAt(peg$currPos))) { | |
| s1 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c71); } | |
| } | |
| } | |
| } else { | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseregex() { | |
| var s0, s1, s2, s3, s4; | |
| var key = peg$currPos * 30 + 20, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 47) { | |
| s1 = peg$c72; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c73); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = []; | |
| if (peg$c74.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c75); } | |
| } | |
| if (s3 !== peg$FAILED) { | |
| while (s3 !== peg$FAILED) { | |
| s2.push(s3); | |
| if (peg$c74.test(input.charAt(peg$currPos))) { | |
| s3 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c75); } | |
| } | |
| } | |
| } else { | |
| s2 = peg$FAILED; | |
| } | |
| if (s2 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 47) { | |
| s3 = peg$c72; | |
| peg$currPos++; | |
| } else { | |
| s3 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c73); } | |
| } | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parseflags(); | |
| if (s4 === peg$FAILED) { | |
| s4 = null; | |
| } | |
| if (s4 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c76(s2, s4); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsefield() { | |
| var s0, s1, s2, s3, s4, s5, s6; | |
| var key = peg$currPos * 30 + 21, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 46) { | |
| s1 = peg$c42; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c43); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parseidentifierName(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = []; | |
| s4 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 46) { | |
| s5 = peg$c42; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c43); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| s6 = peg$parseidentifierName(); | |
| if (s6 !== peg$FAILED) { | |
| s5 = [s5, s6]; | |
| 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; | |
| if (input.charCodeAt(peg$currPos) === 46) { | |
| s5 = peg$c42; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c43); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| s6 = peg$parseidentifierName(); | |
| if (s6 !== peg$FAILED) { | |
| s5 = [s5, s6]; | |
| s4 = s5; | |
| } else { | |
| peg$currPos = s4; | |
| s4 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s4; | |
| s4 = peg$FAILED; | |
| } | |
| } | |
| if (s3 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c77(s2, s3); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsenegation() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 22, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.substr(peg$currPos, 5) === peg$c78) { | |
| s1 = peg$c78; | |
| peg$currPos += 5; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c79); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parseselectors(); | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 41) { | |
| s5 = peg$c67; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c68); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c80(s3); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsematches() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 23, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.substr(peg$currPos, 9) === peg$c81) { | |
| s1 = peg$c81; | |
| peg$currPos += 9; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c82); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parseselectors(); | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 41) { | |
| s5 = peg$c67; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c68); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c83(s3); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsehas() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 24, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.substr(peg$currPos, 5) === peg$c84) { | |
| s1 = peg$c84; | |
| peg$currPos += 5; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c85); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = peg$parseselectors(); | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 41) { | |
| s5 = peg$c67; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c68); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c86(s3); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsefirstChild() { | |
| var s0, s1; | |
| var key = peg$currPos * 30 + 25, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.substr(peg$currPos, 12) === peg$c87) { | |
| s1 = peg$c87; | |
| peg$currPos += 12; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c88); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c89(); | |
| } | |
| s0 = s1; | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parselastChild() { | |
| var s0, s1; | |
| var key = peg$currPos * 30 + 26, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.substr(peg$currPos, 11) === peg$c90) { | |
| s1 = peg$c90; | |
| peg$currPos += 11; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c91); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c92(); | |
| } | |
| s0 = s1; | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsenthChild() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 27, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.substr(peg$currPos, 11) === peg$c93) { | |
| s1 = peg$c93; | |
| peg$currPos += 11; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c94); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = []; | |
| if (peg$c59.test(input.charAt(peg$currPos))) { | |
| s4 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c60); } | |
| } | |
| if (s4 !== peg$FAILED) { | |
| while (s4 !== peg$FAILED) { | |
| s3.push(s4); | |
| if (peg$c59.test(input.charAt(peg$currPos))) { | |
| s4 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c60); } | |
| } | |
| } | |
| } else { | |
| s3 = peg$FAILED; | |
| } | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 41) { | |
| s5 = peg$c67; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c68); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c95(s3); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parsenthLastChild() { | |
| var s0, s1, s2, s3, s4, s5; | |
| var key = peg$currPos * 30 + 28, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.substr(peg$currPos, 16) === peg$c96) { | |
| s1 = peg$c96; | |
| peg$currPos += 16; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c97); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| s2 = peg$parse_(); | |
| if (s2 !== peg$FAILED) { | |
| s3 = []; | |
| if (peg$c59.test(input.charAt(peg$currPos))) { | |
| s4 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c60); } | |
| } | |
| if (s4 !== peg$FAILED) { | |
| while (s4 !== peg$FAILED) { | |
| s3.push(s4); | |
| if (peg$c59.test(input.charAt(peg$currPos))) { | |
| s4 = input.charAt(peg$currPos); | |
| peg$currPos++; | |
| } else { | |
| s4 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c60); } | |
| } | |
| } | |
| } else { | |
| s3 = peg$FAILED; | |
| } | |
| if (s3 !== peg$FAILED) { | |
| s4 = peg$parse_(); | |
| if (s4 !== peg$FAILED) { | |
| if (input.charCodeAt(peg$currPos) === 41) { | |
| s5 = peg$c67; | |
| peg$currPos++; | |
| } else { | |
| s5 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c68); } | |
| } | |
| if (s5 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c98(s3); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function peg$parseclass() { | |
| var s0, s1, s2; | |
| var key = peg$currPos * 30 + 29, | |
| cached = peg$resultsCache[key]; | |
| if (cached) { | |
| peg$currPos = cached.nextPos; | |
| return cached.result; | |
| } | |
| s0 = peg$currPos; | |
| if (input.charCodeAt(peg$currPos) === 58) { | |
| s1 = peg$c99; | |
| peg$currPos++; | |
| } else { | |
| s1 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c100); } | |
| } | |
| if (s1 !== peg$FAILED) { | |
| if (input.substr(peg$currPos, 9).toLowerCase() === peg$c101) { | |
| s2 = input.substr(peg$currPos, 9); | |
| peg$currPos += 9; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c102); } | |
| } | |
| if (s2 === peg$FAILED) { | |
| if (input.substr(peg$currPos, 10).toLowerCase() === peg$c103) { | |
| s2 = input.substr(peg$currPos, 10); | |
| peg$currPos += 10; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c104); } | |
| } | |
| if (s2 === peg$FAILED) { | |
| if (input.substr(peg$currPos, 11).toLowerCase() === peg$c105) { | |
| s2 = input.substr(peg$currPos, 11); | |
| peg$currPos += 11; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c106); } | |
| } | |
| if (s2 === peg$FAILED) { | |
| if (input.substr(peg$currPos, 8).toLowerCase() === peg$c107) { | |
| s2 = input.substr(peg$currPos, 8); | |
| peg$currPos += 8; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c108); } | |
| } | |
| if (s2 === peg$FAILED) { | |
| if (input.substr(peg$currPos, 7).toLowerCase() === peg$c109) { | |
| s2 = input.substr(peg$currPos, 7); | |
| peg$currPos += 7; | |
| } else { | |
| s2 = peg$FAILED; | |
| if (peg$silentFails === 0) { peg$fail(peg$c110); } | |
| } | |
| } | |
| } | |
| } | |
| } | |
| if (s2 !== peg$FAILED) { | |
| peg$savedPos = s0; | |
| s1 = peg$c111(s2); | |
| s0 = s1; | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| } else { | |
| peg$currPos = s0; | |
| s0 = peg$FAILED; | |
| } | |
| peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 }; | |
| return s0; | |
| } | |
| function nth(n) { return { type: 'nth-child', index: { type: 'literal', value: n } }; } | |
| function nthLast(n) { return { type: 'nth-last-child', index: { type: 'literal', value: n } }; } | |
| function strUnescape(s) { | |
| return s.replace(/\\(.)/g, function(match, ch) { | |
| switch(ch) { | |
| case 'b': return '\b'; | |
| case 'f': return '\f'; | |
| case 'n': return '\n'; | |
| case 'r': return '\r'; | |
| case 't': return '\t'; | |
| case 'v': return '\v'; | |
| default: return ch; | |
| } | |
| }); | |
| } | |
| peg$result = peg$startRuleFunction(); | |
| if (peg$result !== peg$FAILED && peg$currPos === input.length) { | |
| return peg$result; | |
| } else { | |
| if (peg$result !== peg$FAILED && peg$currPos < input.length) { | |
| peg$fail(peg$endExpectation()); | |
| } | |
| throw peg$buildStructuredError( | |
| peg$maxFailExpected, | |
| peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null, | |
| peg$maxFailPos < input.length | |
| ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1) | |
| : peg$computeLocation(peg$maxFailPos, peg$maxFailPos) | |
| ); | |
| } | |
| } | |
| return { | |
| SyntaxError: peg$SyntaxError, | |
| parse: peg$parse | |
| }; | |
| }); | |