diff --git a/docs/parser/browser-comparator/defaults.js b/docs/parser/browser-comparator/defaults.js
deleted file mode 100644
index 745f8ce3466f65..00000000000000
--- a/docs/parser/browser-comparator/defaults.js
+++ /dev/null
@@ -1,17 +0,0 @@
-document.getElementById( 'prev-parser-content' ).value = (
-"/*\n * Generated by PEG.js 0.10.0.\n *\n * http://pegjs.org/\n */\n(function() {\n \"use strict\";\n\n function peg$subclass(child, parent) {\n function ctor() { this.constructor = child; }\n ctor.prototype = parent.prototype;\n child.prototype = new ctor();\n }\n\n function peg$SyntaxError(message, expected, found, location) {\n this.message = message;\n this.expected = expected;\n this.found = found;\n this.location = location;\n this.name = \"SyntaxError\";\n\n if (typeof Error.captureStackTrace === \"function\") {\n Error.captureStackTrace(this, peg$SyntaxError);\n }\n }\n\n peg$subclass(peg$SyntaxError, Error);\n\n peg$SyntaxError.buildMessage = function(expected, found) {\n var DESCRIBE_EXPECTATION_FNS = {\n literal: function(expectation) {\n return \"\\\"\" + literalEscape(expectation.text) + \"\\\"\";\n },\n\n \"class\": function(expectation) {\n var escapedParts = \"\",\n i;\n\n for (i = 0; i < expectation.parts.length; i++) {\n escapedParts += expectation.parts[i] instanceof Array\n ? classEscape(expectation.parts[i][0]) + \"-\" + classEscape(expectation.parts[i][1])\n : classEscape(expectation.parts[i]);\n }\n\n return \"[\" + (expectation.inverted ? \"^\" : \"\") + escapedParts + \"]\";\n },\n\n any: function(expectation) {\n return \"any character\";\n },\n\n end: function(expectation) {\n return \"end of input\";\n },\n\n other: function(expectation) {\n return expectation.description;\n }\n };\n\n function hex(ch) {\n return ch.charCodeAt(0).toString(16).toUpperCase();\n }\n\n function literalEscape(s) {\n return s\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(/\"/g, '\\\\\"')\n .replace(/\\0/g, '\\\\0')\n .replace(/\\t/g, '\\\\t')\n .replace(/\\n/g, '\\\\n')\n .replace(/\\r/g, '\\\\r')\n .replace(/[\\x00-\\x0F]/g, function(ch) { return '\\\\x0' + hex(ch); })\n .replace(/[\\x10-\\x1F\\x7F-\\x9F]/g, function(ch) { return '\\\\x' + hex(ch); });\n }\n\n function classEscape(s) {\n return s\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(/\\]/g, '\\\\]')\n .replace(/\\^/g, '\\\\^')\n .replace(/-/g, '\\\\-')\n .replace(/\\0/g, '\\\\0')\n .replace(/\\t/g, '\\\\t')\n .replace(/\\n/g, '\\\\n')\n .replace(/\\r/g, '\\\\r')\n .replace(/[\\x00-\\x0F]/g, function(ch) { return '\\\\x0' + hex(ch); })\n .replace(/[\\x10-\\x1F\\x7F-\\x9F]/g, function(ch) { return '\\\\x' + hex(ch); });\n }\n\n function describeExpectation(expectation) {\n return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation);\n }\n\n function describeExpected(expected) {\n var descriptions = new Array(expected.length),\n i, j;\n\n for (i = 0; i < expected.length; i++) {\n descriptions[i] = describeExpectation(expected[i]);\n }\n\n descriptions.sort();\n\n if (descriptions.length > 0) {\n for (i = 1, j = 1; i < descriptions.length; i++) {\n if (descriptions[i - 1] !== descriptions[i]) {\n descriptions[j] = descriptions[i];\n j++;\n }\n }\n descriptions.length = j;\n }\n\n switch (descriptions.length) {\n case 1:\n return descriptions[0];\n\n case 2:\n return descriptions[0] + \" or \" + descriptions[1];\n\n default:\n return descriptions.slice(0, -1).join(\", \")\n + \", or \"\n + descriptions[descriptions.length - 1];\n }\n }\n\n function describeFound(found) {\n return found ? \"\\\"\" + literalEscape(found) + \"\\\"\" : \"end of input\";\n }\n\n return \"Expected \" + describeExpected(expected) + \" but \" + describeFound(found) + \" found.\";\n };\n\n function peg$parse(input, options) {\n options = options !== void 0 ? options : {};\n\n var peg$FAILED = {},\n\n peg$startRuleFunctions = { Block_List: peg$parseBlock_List },\n peg$startRuleFunction = peg$parseBlock_List,\n\n peg$c0 = peg$anyExpectation(),\n peg$c1 = function(pre, b, html) { /** **/ return [ b, html ] },\n peg$c2 = function(pre, bs, post) { /** **/\n return joinBlocks( pre, bs, post );\n },\n peg$c3 = \"\",\n peg$c9 = peg$literalExpectation(\"/-->\", false),\n peg$c10 = function(blockName, attrs) {\n /** $blockName,\n 'attrs' => $attrs,\n 'innerBlocks' => array(),\n 'innerHTML' => '',\n );\n ?> **/\n\n return {\n blockName: blockName,\n attrs: attrs,\n innerBlocks: [],\n innerHTML: ''\n };\n },\n peg$c11 = function(s, children, e) {\n /** $s['blockName'],\n 'attrs' => $s['attrs'],\n 'innerBlocks' => $innerBlocks,\n 'innerHTML' => implode( '', $innerHTML ),\n );\n ?> **/\n\n var innerContent = partition( function( a ) { return 'string' === typeof a }, children );\n var innerHTML = innerContent[ 0 ];\n var innerBlocks = innerContent[ 1 ];\n\n return {\n blockName: s.blockName,\n attrs: s.attrs,\n innerBlocks: innerBlocks,\n innerHTML: innerHTML.join( '' )\n };\n },\n peg$c12 = \"-->\",\n peg$c13 = peg$literalExpectation(\"-->\", false),\n peg$c14 = function(blockName, attrs) {\n /** $blockName,\n 'attrs' => $attrs,\n );\n ?> **/\n\n return {\n blockName: blockName,\n attrs: attrs\n };\n },\n peg$c15 = \"/wp:\",\n peg$c16 = peg$literalExpectation(\"/wp:\", false),\n peg$c17 = function(blockName) {\n /** $blockName,\n );\n ?> **/\n\n return {\n blockName: blockName\n };\n },\n peg$c18 = \"/\",\n peg$c19 = peg$literalExpectation(\"/\", false),\n peg$c20 = function(type) {\n /** **/\n return 'core/' + type;\n },\n peg$c21 = /^[a-z]/,\n peg$c22 = peg$classExpectation([[\"a\", \"z\"]], false, false),\n peg$c23 = /^[a-z0-9_\\-]/,\n peg$c24 = peg$classExpectation([[\"a\", \"z\"], [\"0\", \"9\"], \"_\", \"-\"], false, false),\n peg$c25 = \"{\",\n peg$c26 = peg$literalExpectation(\"{\", false),\n peg$c27 = \"}\",\n peg$c28 = peg$literalExpectation(\"}\", false),\n peg$c29 = \"\",\n peg$c30 = function(attrs) {\n /** **/\n return maybeJSON( attrs );\n },\n peg$c31 = /^[ \\t\\r\\n]/,\n peg$c32 = peg$classExpectation([\" \", \"\\t\", \"\\r\", \"\\n\"], false, false),\n\n peg$currPos = 0,\n peg$savedPos = 0,\n peg$posDetailsCache = [{ line: 1, column: 1 }],\n peg$maxFailPos = 0,\n peg$maxFailExpected = [],\n peg$silentFails = 0,\n\n peg$resultsCache = {},\n\n peg$result;\n\n if (\"startRule\" in options) {\n if (!(options.startRule in peg$startRuleFunctions)) {\n throw new Error(\"Can't start parsing from rule \\\"\" + options.startRule + \"\\\".\");\n }\n\n peg$startRuleFunction = peg$startRuleFunctions[options.startRule];\n }\n\n function text() {\n return input.substring(peg$savedPos, peg$currPos);\n }\n\n function location() {\n return peg$computeLocation(peg$savedPos, peg$currPos);\n }\n\n function expected(description, location) {\n location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)\n\n throw peg$buildStructuredError(\n [peg$otherExpectation(description)],\n input.substring(peg$savedPos, peg$currPos),\n location\n );\n }\n\n function error(message, location) {\n location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)\n\n throw peg$buildSimpleError(message, location);\n }\n\n function peg$literalExpectation(text, ignoreCase) {\n return { type: \"literal\", text: text, ignoreCase: ignoreCase };\n }\n\n function peg$classExpectation(parts, inverted, ignoreCase) {\n return { type: \"class\", parts: parts, inverted: inverted, ignoreCase: ignoreCase };\n }\n\n function peg$anyExpectation() {\n return { type: \"any\" };\n }\n\n function peg$endExpectation() {\n return { type: \"end\" };\n }\n\n function peg$otherExpectation(description) {\n return { type: \"other\", description: description };\n }\n\n function peg$computePosDetails(pos) {\n var details = peg$posDetailsCache[pos], p;\n\n if (details) {\n return details;\n } else {\n p = pos - 1;\n while (!peg$posDetailsCache[p]) {\n p--;\n }\n\n details = peg$posDetailsCache[p];\n details = {\n line: details.line,\n column: details.column\n };\n\n while (p < pos) {\n if (input.charCodeAt(p) === 10) {\n details.line++;\n details.column = 1;\n } else {\n details.column++;\n }\n\n p++;\n }\n\n peg$posDetailsCache[pos] = details;\n return details;\n }\n }\n\n function peg$computeLocation(startPos, endPos) {\n var startPosDetails = peg$computePosDetails(startPos),\n endPosDetails = peg$computePosDetails(endPos);\n\n return {\n start: {\n offset: startPos,\n line: startPosDetails.line,\n column: startPosDetails.column\n },\n end: {\n offset: endPos,\n line: endPosDetails.line,\n column: endPosDetails.column\n }\n };\n }\n\n function peg$fail(expected) {\n if (peg$currPos < peg$maxFailPos) { return; }\n\n if (peg$currPos > peg$maxFailPos) {\n peg$maxFailPos = peg$currPos;\n peg$maxFailExpected = [];\n }\n\n peg$maxFailExpected.push(expected);\n }\n\n function peg$buildSimpleError(message, location) {\n return new peg$SyntaxError(message, null, null, location);\n }\n\n function peg$buildStructuredError(expected, found, location) {\n return new peg$SyntaxError(\n peg$SyntaxError.buildMessage(expected, found),\n expected,\n found,\n location\n );\n }\n\n function peg$parseBlock_List() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8, s9;\n\n var key = peg$currPos * 12 + 0,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n s2 = [];\n s3 = peg$currPos;\n s4 = peg$currPos;\n peg$silentFails++;\n s5 = peg$parseBlock();\n peg$silentFails--;\n if (s5 === peg$FAILED) {\n s4 = void 0;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n if (s4 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s5 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s5 !== peg$FAILED) {\n s4 = [s4, s5];\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n while (s3 !== peg$FAILED) {\n s2.push(s3);\n s3 = peg$currPos;\n s4 = peg$currPos;\n peg$silentFails++;\n s5 = peg$parseBlock();\n peg$silentFails--;\n if (s5 === peg$FAILED) {\n s4 = void 0;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n if (s4 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s5 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s5 !== peg$FAILED) {\n s4 = [s4, s5];\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n }\n if (s2 !== peg$FAILED) {\n s1 = input.substring(s1, peg$currPos);\n } else {\n s1 = s2;\n }\n if (s1 !== peg$FAILED) {\n s2 = [];\n s3 = peg$currPos;\n s4 = peg$parseBlock();\n if (s4 !== peg$FAILED) {\n s5 = peg$currPos;\n s6 = [];\n s7 = peg$currPos;\n s8 = peg$currPos;\n peg$silentFails++;\n s9 = peg$parseBlock();\n peg$silentFails--;\n if (s9 === peg$FAILED) {\n s8 = void 0;\n } else {\n peg$currPos = s8;\n s8 = peg$FAILED;\n }\n if (s8 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s9 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s9 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s9 !== peg$FAILED) {\n s8 = [s8, s9];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n while (s7 !== peg$FAILED) {\n s6.push(s7);\n s7 = peg$currPos;\n s8 = peg$currPos;\n peg$silentFails++;\n s9 = peg$parseBlock();\n peg$silentFails--;\n if (s9 === peg$FAILED) {\n s8 = void 0;\n } else {\n peg$currPos = s8;\n s8 = peg$FAILED;\n }\n if (s8 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s9 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s9 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s9 !== peg$FAILED) {\n s8 = [s8, s9];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n }\n if (s6 !== peg$FAILED) {\n s5 = input.substring(s5, peg$currPos);\n } else {\n s5 = s6;\n }\n if (s5 !== peg$FAILED) {\n peg$savedPos = s3;\n s4 = peg$c1(s1, s4, s5);\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n while (s3 !== peg$FAILED) {\n s2.push(s3);\n s3 = peg$currPos;\n s4 = peg$parseBlock();\n if (s4 !== peg$FAILED) {\n s5 = peg$currPos;\n s6 = [];\n s7 = peg$currPos;\n s8 = peg$currPos;\n peg$silentFails++;\n s9 = peg$parseBlock();\n peg$silentFails--;\n if (s9 === peg$FAILED) {\n s8 = void 0;\n } else {\n peg$currPos = s8;\n s8 = peg$FAILED;\n }\n if (s8 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s9 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s9 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s9 !== peg$FAILED) {\n s8 = [s8, s9];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n while (s7 !== peg$FAILED) {\n s6.push(s7);\n s7 = peg$currPos;\n s8 = peg$currPos;\n peg$silentFails++;\n s9 = peg$parseBlock();\n peg$silentFails--;\n if (s9 === peg$FAILED) {\n s8 = void 0;\n } else {\n peg$currPos = s8;\n s8 = peg$FAILED;\n }\n if (s8 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s9 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s9 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s9 !== peg$FAILED) {\n s8 = [s8, s9];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n }\n if (s6 !== peg$FAILED) {\n s5 = input.substring(s5, peg$currPos);\n } else {\n s5 = s6;\n }\n if (s5 !== peg$FAILED) {\n peg$savedPos = s3;\n s4 = peg$c1(s1, s4, s5);\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n }\n if (s2 !== peg$FAILED) {\n s3 = peg$currPos;\n s4 = [];\n if (input.length > peg$currPos) {\n s5 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n while (s5 !== peg$FAILED) {\n s4.push(s5);\n if (input.length > peg$currPos) {\n s5 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n }\n if (s4 !== peg$FAILED) {\n s3 = input.substring(s3, peg$currPos);\n } else {\n s3 = s4;\n }\n if (s3 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c2(s1, s2, s3);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseBlock() {\n var s0;\n\n var key = peg$currPos * 12 + 1,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$parseBlock_Void();\n if (s0 === peg$FAILED) {\n s0 = peg$parseBlock_Balanced();\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseBlock_Void() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8;\n\n var key = peg$currPos * 12 + 2,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$currPos;\n if (input.substr(peg$currPos, 4) === peg$c3) {\n s1 = peg$c3;\n peg$currPos += 4;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c4); }\n }\n if (s1 !== peg$FAILED) {\n s2 = peg$parse__();\n if (s2 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c5) {\n s3 = peg$c5;\n peg$currPos += 3;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c6); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parseBlock_Name();\n if (s4 !== peg$FAILED) {\n s5 = peg$parse__();\n if (s5 !== peg$FAILED) {\n s6 = peg$currPos;\n s7 = peg$parseBlock_Attributes();\n if (s7 !== peg$FAILED) {\n s8 = peg$parse__();\n if (s8 !== peg$FAILED) {\n peg$savedPos = s6;\n s7 = peg$c7(s4, s7);\n s6 = s7;\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n if (s6 === peg$FAILED) {\n s6 = null;\n }\n if (s6 !== peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c8) {\n s7 = peg$c8;\n peg$currPos += 4;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c9); }\n }\n if (s7 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c10(s4, s6);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseBlock_Balanced() {\n var s0, s1, s2, s3, s4, s5, s6;\n\n var key = peg$currPos * 12 + 3,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$currPos;\n s1 = peg$parseBlock_Start();\n if (s1 !== peg$FAILED) {\n s2 = [];\n s3 = peg$parseBlock();\n if (s3 === peg$FAILED) {\n s3 = peg$currPos;\n s4 = peg$currPos;\n s5 = peg$currPos;\n peg$silentFails++;\n s6 = peg$parseBlock_End();\n peg$silentFails--;\n if (s6 === peg$FAILED) {\n s5 = void 0;\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n if (s5 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s6 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s6 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s6 !== peg$FAILED) {\n s5 = [s5, s6];\n s4 = s5;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n if (s4 !== peg$FAILED) {\n s3 = input.substring(s3, peg$currPos);\n } else {\n s3 = s4;\n }\n }\n while (s3 !== peg$FAILED) {\n s2.push(s3);\n s3 = peg$parseBlock();\n if (s3 === peg$FAILED) {\n s3 = peg$currPos;\n s4 = peg$currPos;\n s5 = peg$currPos;\n peg$silentFails++;\n s6 = peg$parseBlock_End();\n peg$silentFails--;\n if (s6 === peg$FAILED) {\n s5 = void 0;\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n if (s5 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s6 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s6 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s6 !== peg$FAILED) {\n s5 = [s5, s6];\n s4 = s5;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n if (s4 !== peg$FAILED) {\n s3 = input.substring(s3, peg$currPos);\n } else {\n s3 = s4;\n }\n }\n }\n if (s2 !== peg$FAILED) {\n s3 = peg$parseBlock_End();\n if (s3 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c11(s1, s2, s3);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseBlock_Start() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8;\n\n var key = peg$currPos * 12 + 4,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$currPos;\n if (input.substr(peg$currPos, 4) === peg$c3) {\n s1 = peg$c3;\n peg$currPos += 4;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c4); }\n }\n if (s1 !== peg$FAILED) {\n s2 = peg$parse__();\n if (s2 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c5) {\n s3 = peg$c5;\n peg$currPos += 3;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c6); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parseBlock_Name();\n if (s4 !== peg$FAILED) {\n s5 = peg$parse__();\n if (s5 !== peg$FAILED) {\n s6 = peg$currPos;\n s7 = peg$parseBlock_Attributes();\n if (s7 !== peg$FAILED) {\n s8 = peg$parse__();\n if (s8 !== peg$FAILED) {\n peg$savedPos = s6;\n s7 = peg$c7(s4, s7);\n s6 = s7;\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n if (s6 === peg$FAILED) {\n s6 = null;\n }\n if (s6 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c12) {\n s7 = peg$c12;\n peg$currPos += 3;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c13); }\n }\n if (s7 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c14(s4, s6);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseBlock_End() {\n var s0, s1, s2, s3, s4, s5, s6;\n\n var key = peg$currPos * 12 + 5,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$currPos;\n if (input.substr(peg$currPos, 4) === peg$c3) {\n s1 = peg$c3;\n peg$currPos += 4;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c4); }\n }\n if (s1 !== peg$FAILED) {\n s2 = peg$parse__();\n if (s2 !== peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c15) {\n s3 = peg$c15;\n peg$currPos += 4;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c16); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parseBlock_Name();\n if (s4 !== peg$FAILED) {\n s5 = peg$parse__();\n if (s5 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c12) {\n s6 = peg$c12;\n peg$currPos += 3;\n } else {\n s6 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c13); }\n }\n if (s6 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c17(s4);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseBlock_Name() {\n var s0;\n\n var key = peg$currPos * 12 + 6,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$parseNamespaced_Block_Name();\n if (s0 === peg$FAILED) {\n s0 = peg$parseCore_Block_Name();\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseNamespaced_Block_Name() {\n var s0, s1, s2, s3, s4;\n\n var key = peg$currPos * 12 + 7,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n s2 = peg$parseBlock_Name_Part();\n if (s2 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 47) {\n s3 = peg$c18;\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c19); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parseBlock_Name_Part();\n if (s4 !== peg$FAILED) {\n s2 = [s2, s3, s4];\n s1 = s2;\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n if (s1 !== peg$FAILED) {\n s0 = input.substring(s0, peg$currPos);\n } else {\n s0 = s1;\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseCore_Block_Name() {\n var s0, s1, s2;\n\n var key = peg$currPos * 12 + 8,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n s2 = peg$parseBlock_Name_Part();\n if (s2 !== peg$FAILED) {\n s1 = input.substring(s1, peg$currPos);\n } else {\n s1 = s2;\n }\n if (s1 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c20(s1);\n }\n s0 = s1;\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseBlock_Name_Part() {\n var s0, s1, s2, s3, s4;\n\n var key = peg$currPos * 12 + 9,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n if (peg$c21.test(input.charAt(peg$currPos))) {\n s2 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s2 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c22); }\n }\n if (s2 !== peg$FAILED) {\n s3 = [];\n if (peg$c23.test(input.charAt(peg$currPos))) {\n s4 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s4 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c24); }\n }\n while (s4 !== peg$FAILED) {\n s3.push(s4);\n if (peg$c23.test(input.charAt(peg$currPos))) {\n s4 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s4 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c24); }\n }\n }\n if (s3 !== peg$FAILED) {\n s2 = [s2, s3];\n s1 = s2;\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n if (s1 !== peg$FAILED) {\n s0 = input.substring(s0, peg$currPos);\n } else {\n s0 = s1;\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parseBlock_Attributes() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11, s12;\n\n var key = peg$currPos * 12 + 10,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n s2 = peg$currPos;\n if (input.charCodeAt(peg$currPos) === 123) {\n s3 = peg$c25;\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c26); }\n }\n if (s3 !== peg$FAILED) {\n s4 = [];\n s5 = peg$currPos;\n s6 = peg$currPos;\n peg$silentFails++;\n s7 = peg$currPos;\n if (input.charCodeAt(peg$currPos) === 125) {\n s8 = peg$c27;\n peg$currPos++;\n } else {\n s8 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c28); }\n }\n if (s8 !== peg$FAILED) {\n s9 = peg$parse__();\n if (s9 !== peg$FAILED) {\n s10 = peg$c29;\n if (s10 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 47) {\n s11 = peg$c18;\n peg$currPos++;\n } else {\n s11 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c19); }\n }\n if (s11 === peg$FAILED) {\n s11 = null;\n }\n if (s11 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c12) {\n s12 = peg$c12;\n peg$currPos += 3;\n } else {\n s12 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c13); }\n }\n if (s12 !== peg$FAILED) {\n s8 = [s8, s9, s10, s11, s12];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n peg$silentFails--;\n if (s7 === peg$FAILED) {\n s6 = void 0;\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n if (s6 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s7 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s7 !== peg$FAILED) {\n s6 = [s6, s7];\n s5 = s6;\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n while (s5 !== peg$FAILED) {\n s4.push(s5);\n s5 = peg$currPos;\n s6 = peg$currPos;\n peg$silentFails++;\n s7 = peg$currPos;\n if (input.charCodeAt(peg$currPos) === 125) {\n s8 = peg$c27;\n peg$currPos++;\n } else {\n s8 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c28); }\n }\n if (s8 !== peg$FAILED) {\n s9 = peg$parse__();\n if (s9 !== peg$FAILED) {\n s10 = peg$c29;\n if (s10 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 47) {\n s11 = peg$c18;\n peg$currPos++;\n } else {\n s11 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c19); }\n }\n if (s11 === peg$FAILED) {\n s11 = null;\n }\n if (s11 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c12) {\n s12 = peg$c12;\n peg$currPos += 3;\n } else {\n s12 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c13); }\n }\n if (s12 !== peg$FAILED) {\n s8 = [s8, s9, s10, s11, s12];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n peg$silentFails--;\n if (s7 === peg$FAILED) {\n s6 = void 0;\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n if (s6 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s7 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s7 !== peg$FAILED) {\n s6 = [s6, s7];\n s5 = s6;\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n }\n if (s4 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 125) {\n s5 = peg$c27;\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c28); }\n }\n if (s5 !== peg$FAILED) {\n s3 = [s3, s4, s5];\n s2 = s3;\n } else {\n peg$currPos = s2;\n s2 = peg$FAILED;\n }\n } else {\n peg$currPos = s2;\n s2 = peg$FAILED;\n }\n } else {\n peg$currPos = s2;\n s2 = peg$FAILED;\n }\n if (s2 !== peg$FAILED) {\n s1 = input.substring(s1, peg$currPos);\n } else {\n s1 = s2;\n }\n if (s1 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c30(s1);\n }\n s0 = s1;\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n function peg$parse__() {\n var s0, s1;\n\n var key = peg$currPos * 12 + 11,\n cached = peg$resultsCache[key];\n\n if (cached) {\n peg$currPos = cached.nextPos;\n\n return cached.result;\n }\n\n s0 = [];\n if (peg$c31.test(input.charAt(peg$currPos))) {\n s1 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c32); }\n }\n if (s1 !== peg$FAILED) {\n while (s1 !== peg$FAILED) {\n s0.push(s1);\n if (peg$c31.test(input.charAt(peg$currPos))) {\n s1 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c32); }\n }\n }\n } else {\n s0 = peg$FAILED;\n }\n\n peg$resultsCache[key] = { nextPos: peg$currPos, result: s0 };\n\n return s0;\n }\n\n\n\n /*\n *\n * _____ _ _\n * / ____| | | | |\n * | | __ _ _| |_ ___ _ __ | |__ ___ _ __ __ _\n * | | |_ | | | | __/ _ \\ '_ \\| '_ \\ / _ \\ '__/ _` |\n * | |__| | |_| | || __/ | | | |_) | __/ | | (_| |\n * \\_____|\\__,_|\\__\\___|_| |_|_.__/ \\___|_| \\__, |\n * __/ |\n * GRAMMAR |___/\n *\n *\n * Welcome to the grammar file for Gutenberg posts!\n *\n * Please don't be distracted by the functions at the top\n * here - they're just helpers for the grammar below. We\n * try to keep them as minimal and simple as possible,\n * but the parser generator forces us to declare them at\n * the beginning of the file.\n *\n * What follows is the official specification grammar for\n * documents created or edited in Gutenberg. It starts at\n * the top-level rule `Block_List`\n *\n * The grammar is defined by a series of _rules_ and ways\n * to return matches on those rules. It's a _PEG_, a\n * parsing expression grammar, which simply means that for\n * each of our rules we have a set of sub-rules to match\n * on and the generated parser will try them in order\n * until it finds the first match.\n *\n * This grammar is a _specification_ (with as little actual\n * code as we can get away with) which is used by the\n * parser generator to generate the actual _parser_ which\n * is used by Gutenberg. We generate two parsers: one in\n * JavaScript for use the browser and one in PHP for\n * WordPress itself. PEG parser generators are available\n * in many languages, though different libraries may require\n * some translation of this grammar into their syntax.\n *\n * For more information:\n * @see https://pegjs.org\n * @see https://en.wikipedia.org/wiki/Parsing_expression_grammar\n *\n */\n\n /** array(), 'innerHTML' => $pre );\n }\n\n foreach ( $tokens as $token ) {\n list( $token, $html ) = $token;\n\n $blocks[] = $token;\n\n if ( ! empty( $html ) ) {\n $blocks[] = array( 'attrs' => array(), 'innerHTML' => $html );\n }\n }\n\n if ( ! empty( $post ) ) {\n $blocks[] = array( 'attrs' => array(), 'innerHTML' => $post );\n }\n\n return $blocks;\n }\n }\n\n ?> **/\n\n function freeform( s ) {\n return s.length && {\n attrs: {},\n innerHTML: s\n };\n }\n\n function joinBlocks( pre, tokens, post ) {\n var blocks = [], i, l, html, item, token;\n\n if ( pre.length ) {\n blocks.push( freeform( pre ) );\n }\n\n for ( i = 0, l = tokens.length; i < l; i++ ) {\n item = tokens[ i ];\n token = item[ 0 ];\n html = item[ 1 ];\n\n blocks.push( token );\n if ( html.length ) {\n blocks.push( freeform( html ) );\n }\n }\n\n if ( post.length ) {\n blocks.push( freeform( post ) );\n }\n\n return blocks;\n }\n\n function maybeJSON( s ) {\n try {\n return JSON.parse( s );\n } catch (e) {\n return null;\n }\n }\n\n function partition( predicate, list ) {\n var i, l, item;\n var truthy = [];\n var falsey = [];\n\n // nod to performance over a simpler reduce\n // and clone model we could have taken here\n for ( i = 0, l = list.length; i < l; i++ ) {\n item = list[ i ];\n\n predicate( item )\n ? truthy.push( item )\n : falsey.push( item )\n };\n\n return [ truthy, falsey ];\n }\n\n\n\n peg$result = peg$startRuleFunction();\n\n if (peg$result !== peg$FAILED && peg$currPos === input.length) {\n return peg$result;\n } else {\n if (peg$result !== peg$FAILED && peg$currPos < input.length) {\n peg$fail(peg$endExpectation());\n }\n\n throw peg$buildStructuredError(\n peg$maxFailExpected,\n peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,\n peg$maxFailPos < input.length\n ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)\n : peg$computeLocation(peg$maxFailPos, peg$maxFailPos)\n );\n }\n }\n\n return peg$parse;\n});\n"
-);
-
-document.getElementById( 'next-parser-content' ).value = (
- "/*\n * Generated by PEG.js 0.10.0.\n *\n * http://pegjs.org/\n */\n(function() {\n \"use strict\";\n\n function peg$subclass(child, parent) {\n function ctor() { this.constructor = child; }\n ctor.prototype = parent.prototype;\n child.prototype = new ctor();\n }\n\n function peg$SyntaxError(message, expected, found, location) {\n this.message = message;\n this.expected = expected;\n this.found = found;\n this.location = location;\n this.name = \"SyntaxError\";\n\n if (typeof Error.captureStackTrace === \"function\") {\n Error.captureStackTrace(this, peg$SyntaxError);\n }\n }\n\n peg$subclass(peg$SyntaxError, Error);\n\n peg$SyntaxError.buildMessage = function(expected, found) {\n var DESCRIBE_EXPECTATION_FNS = {\n literal: function(expectation) {\n return \"\\\"\" + literalEscape(expectation.text) + \"\\\"\";\n },\n\n \"class\": function(expectation) {\n var escapedParts = \"\",\n i;\n\n for (i = 0; i < expectation.parts.length; i++) {\n escapedParts += expectation.parts[i] instanceof Array\n ? classEscape(expectation.parts[i][0]) + \"-\" + classEscape(expectation.parts[i][1])\n : classEscape(expectation.parts[i]);\n }\n\n return \"[\" + (expectation.inverted ? \"^\" : \"\") + escapedParts + \"]\";\n },\n\n any: function(expectation) {\n return \"any character\";\n },\n\n end: function(expectation) {\n return \"end of input\";\n },\n\n other: function(expectation) {\n return expectation.description;\n }\n };\n\n function hex(ch) {\n return ch.charCodeAt(0).toString(16).toUpperCase();\n }\n\n function literalEscape(s) {\n return s\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(/\"/g, '\\\\\"')\n .replace(/\\0/g, '\\\\0')\n .replace(/\\t/g, '\\\\t')\n .replace(/\\n/g, '\\\\n')\n .replace(/\\r/g, '\\\\r')\n .replace(/[\\x00-\\x0F]/g, function(ch) { return '\\\\x0' + hex(ch); })\n .replace(/[\\x10-\\x1F\\x7F-\\x9F]/g, function(ch) { return '\\\\x' + hex(ch); });\n }\n\n function classEscape(s) {\n return s\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(/\\]/g, '\\\\]')\n .replace(/\\^/g, '\\\\^')\n .replace(/-/g, '\\\\-')\n .replace(/\\0/g, '\\\\0')\n .replace(/\\t/g, '\\\\t')\n .replace(/\\n/g, '\\\\n')\n .replace(/\\r/g, '\\\\r')\n .replace(/[\\x00-\\x0F]/g, function(ch) { return '\\\\x0' + hex(ch); })\n .replace(/[\\x10-\\x1F\\x7F-\\x9F]/g, function(ch) { return '\\\\x' + hex(ch); });\n }\n\n function describeExpectation(expectation) {\n return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation);\n }\n\n function describeExpected(expected) {\n var descriptions = new Array(expected.length),\n i, j;\n\n for (i = 0; i < expected.length; i++) {\n descriptions[i] = describeExpectation(expected[i]);\n }\n\n descriptions.sort();\n\n if (descriptions.length > 0) {\n for (i = 1, j = 1; i < descriptions.length; i++) {\n if (descriptions[i - 1] !== descriptions[i]) {\n descriptions[j] = descriptions[i];\n j++;\n }\n }\n descriptions.length = j;\n }\n\n switch (descriptions.length) {\n case 1:\n return descriptions[0];\n\n case 2:\n return descriptions[0] + \" or \" + descriptions[1];\n\n default:\n return descriptions.slice(0, -1).join(\", \")\n + \", or \"\n + descriptions[descriptions.length - 1];\n }\n }\n\n function describeFound(found) {\n return found ? \"\\\"\" + literalEscape(found) + \"\\\"\" : \"end of input\";\n }\n\n return \"Expected \" + describeExpected(expected) + \" but \" + describeFound(found) + \" found.\";\n };\n\n function peg$parse(input, options) {\n options = options !== void 0 ? options : {};\n\n var peg$FAILED = {},\n\n peg$startRuleFunctions = { Block_List: peg$parseBlock_List },\n peg$startRuleFunction = peg$parseBlock_List,\n\n peg$c0 = peg$anyExpectation(),\n peg$c1 = function(pre, b, html) { /** **/ return [ b, html ] },\n peg$c2 = function(pre, bs, post) { /** **/\n return joinBlocks( pre, bs, post );\n },\n peg$c3 = \"\",\n peg$c9 = peg$literalExpectation(\"/-->\", false),\n peg$c10 = function(blockName, attrs) {\n /** $blockName,\n 'attrs' => $attrs,\n 'innerBlocks' => array(),\n 'innerHTML' => '',\n );\n ?> **/\n\n return {\n blockName: blockName,\n attrs: attrs,\n innerBlocks: [],\n innerHTML: ''\n };\n },\n peg$c11 = function(s, children, e) {\n /** $s['blockName'],\n 'attrs' => $s['attrs'],\n 'innerBlocks' => $innerBlocks,\n 'innerHTML' => implode( '', $innerHTML ),\n );\n ?> **/\n\n var innerContent = partition( function( a ) { return 'string' === typeof a }, children );\n var innerHTML = innerContent[ 0 ];\n var innerBlocks = innerContent[ 1 ];\n\n return {\n blockName: s.blockName,\n attrs: s.attrs,\n innerBlocks: innerBlocks,\n innerHTML: innerHTML.join( '' )\n };\n },\n peg$c12 = \"-->\",\n peg$c13 = peg$literalExpectation(\"-->\", false),\n peg$c14 = function(blockName, attrs) {\n /** $blockName,\n 'attrs' => $attrs,\n );\n ?> **/\n\n return {\n blockName: blockName,\n attrs: attrs\n };\n },\n peg$c15 = \"/wp:\",\n peg$c16 = peg$literalExpectation(\"/wp:\", false),\n peg$c17 = function(blockName) {\n /** $blockName,\n );\n ?> **/\n\n return {\n blockName: blockName\n };\n },\n peg$c18 = \"/\",\n peg$c19 = peg$literalExpectation(\"/\", false),\n peg$c20 = function(type) {\n /** **/\n return 'core/' + type;\n },\n peg$c21 = /^[a-z]/,\n peg$c22 = peg$classExpectation([[\"a\", \"z\"]], false, false),\n peg$c23 = /^[a-z0-9_\\-]/,\n peg$c24 = peg$classExpectation([[\"a\", \"z\"], [\"0\", \"9\"], \"_\", \"-\"], false, false),\n peg$c25 = \"{\",\n peg$c26 = peg$literalExpectation(\"{\", false),\n peg$c27 = \"}\",\n peg$c28 = peg$literalExpectation(\"}\", false),\n peg$c29 = \"\",\n peg$c30 = function(attrs) {\n /** **/\n return maybeJSON( attrs );\n },\n peg$c31 = /^[ \\t\\r\\n]/,\n peg$c32 = peg$classExpectation([\" \", \"\\t\", \"\\r\", \"\\n\"], false, false),\n\n peg$currPos = 0,\n peg$savedPos = 0,\n peg$posDetailsCache = [{ line: 1, column: 1 }],\n peg$maxFailPos = 0,\n peg$maxFailExpected = [],\n peg$silentFails = 0,\n\n peg$result;\n\n if (\"startRule\" in options) {\n if (!(options.startRule in peg$startRuleFunctions)) {\n throw new Error(\"Can't start parsing from rule \\\"\" + options.startRule + \"\\\".\");\n }\n\n peg$startRuleFunction = peg$startRuleFunctions[options.startRule];\n }\n\n function text() {\n return input.substring(peg$savedPos, peg$currPos);\n }\n\n function location() {\n return peg$computeLocation(peg$savedPos, peg$currPos);\n }\n\n function expected(description, location) {\n location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)\n\n throw peg$buildStructuredError(\n [peg$otherExpectation(description)],\n input.substring(peg$savedPos, peg$currPos),\n location\n );\n }\n\n function error(message, location) {\n location = location !== void 0 ? location : peg$computeLocation(peg$savedPos, peg$currPos)\n\n throw peg$buildSimpleError(message, location);\n }\n\n function peg$literalExpectation(text, ignoreCase) {\n return { type: \"literal\", text: text, ignoreCase: ignoreCase };\n }\n\n function peg$classExpectation(parts, inverted, ignoreCase) {\n return { type: \"class\", parts: parts, inverted: inverted, ignoreCase: ignoreCase };\n }\n\n function peg$anyExpectation() {\n return { type: \"any\" };\n }\n\n function peg$endExpectation() {\n return { type: \"end\" };\n }\n\n function peg$otherExpectation(description) {\n return { type: \"other\", description: description };\n }\n\n function peg$computePosDetails(pos) {\n var details = peg$posDetailsCache[pos], p;\n\n if (details) {\n return details;\n } else {\n p = pos - 1;\n while (!peg$posDetailsCache[p]) {\n p--;\n }\n\n details = peg$posDetailsCache[p];\n details = {\n line: details.line,\n column: details.column\n };\n\n while (p < pos) {\n if (input.charCodeAt(p) === 10) {\n details.line++;\n details.column = 1;\n } else {\n details.column++;\n }\n\n p++;\n }\n\n peg$posDetailsCache[pos] = details;\n return details;\n }\n }\n\n function peg$computeLocation(startPos, endPos) {\n var startPosDetails = peg$computePosDetails(startPos),\n endPosDetails = peg$computePosDetails(endPos);\n\n return {\n start: {\n offset: startPos,\n line: startPosDetails.line,\n column: startPosDetails.column\n },\n end: {\n offset: endPos,\n line: endPosDetails.line,\n column: endPosDetails.column\n }\n };\n }\n\n function peg$fail(expected) {\n if (peg$currPos < peg$maxFailPos) { return; }\n\n if (peg$currPos > peg$maxFailPos) {\n peg$maxFailPos = peg$currPos;\n peg$maxFailExpected = [];\n }\n\n peg$maxFailExpected.push(expected);\n }\n\n function peg$buildSimpleError(message, location) {\n return new peg$SyntaxError(message, null, null, location);\n }\n\n function peg$buildStructuredError(expected, found, location) {\n return new peg$SyntaxError(\n peg$SyntaxError.buildMessage(expected, found),\n expected,\n found,\n location\n );\n }\n\n function peg$parseBlock_List() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8, s9;\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n s2 = [];\n s3 = peg$currPos;\n s4 = peg$currPos;\n peg$silentFails++;\n s5 = peg$parseBlock();\n peg$silentFails--;\n if (s5 === peg$FAILED) {\n s4 = void 0;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n if (s4 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s5 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s5 !== peg$FAILED) {\n s4 = [s4, s5];\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n while (s3 !== peg$FAILED) {\n s2.push(s3);\n s3 = peg$currPos;\n s4 = peg$currPos;\n peg$silentFails++;\n s5 = peg$parseBlock();\n peg$silentFails--;\n if (s5 === peg$FAILED) {\n s4 = void 0;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n if (s4 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s5 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s5 !== peg$FAILED) {\n s4 = [s4, s5];\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n }\n if (s2 !== peg$FAILED) {\n s1 = input.substring(s1, peg$currPos);\n } else {\n s1 = s2;\n }\n if (s1 !== peg$FAILED) {\n s2 = [];\n s3 = peg$currPos;\n s4 = peg$parseBlock();\n if (s4 !== peg$FAILED) {\n s5 = peg$currPos;\n s6 = [];\n s7 = peg$currPos;\n s8 = peg$currPos;\n peg$silentFails++;\n s9 = peg$parseBlock();\n peg$silentFails--;\n if (s9 === peg$FAILED) {\n s8 = void 0;\n } else {\n peg$currPos = s8;\n s8 = peg$FAILED;\n }\n if (s8 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s9 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s9 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s9 !== peg$FAILED) {\n s8 = [s8, s9];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n while (s7 !== peg$FAILED) {\n s6.push(s7);\n s7 = peg$currPos;\n s8 = peg$currPos;\n peg$silentFails++;\n s9 = peg$parseBlock();\n peg$silentFails--;\n if (s9 === peg$FAILED) {\n s8 = void 0;\n } else {\n peg$currPos = s8;\n s8 = peg$FAILED;\n }\n if (s8 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s9 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s9 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s9 !== peg$FAILED) {\n s8 = [s8, s9];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n }\n if (s6 !== peg$FAILED) {\n s5 = input.substring(s5, peg$currPos);\n } else {\n s5 = s6;\n }\n if (s5 !== peg$FAILED) {\n peg$savedPos = s3;\n s4 = peg$c1(s1, s4, s5);\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n while (s3 !== peg$FAILED) {\n s2.push(s3);\n s3 = peg$currPos;\n s4 = peg$parseBlock();\n if (s4 !== peg$FAILED) {\n s5 = peg$currPos;\n s6 = [];\n s7 = peg$currPos;\n s8 = peg$currPos;\n peg$silentFails++;\n s9 = peg$parseBlock();\n peg$silentFails--;\n if (s9 === peg$FAILED) {\n s8 = void 0;\n } else {\n peg$currPos = s8;\n s8 = peg$FAILED;\n }\n if (s8 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s9 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s9 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s9 !== peg$FAILED) {\n s8 = [s8, s9];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n while (s7 !== peg$FAILED) {\n s6.push(s7);\n s7 = peg$currPos;\n s8 = peg$currPos;\n peg$silentFails++;\n s9 = peg$parseBlock();\n peg$silentFails--;\n if (s9 === peg$FAILED) {\n s8 = void 0;\n } else {\n peg$currPos = s8;\n s8 = peg$FAILED;\n }\n if (s8 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s9 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s9 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s9 !== peg$FAILED) {\n s8 = [s8, s9];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n }\n if (s6 !== peg$FAILED) {\n s5 = input.substring(s5, peg$currPos);\n } else {\n s5 = s6;\n }\n if (s5 !== peg$FAILED) {\n peg$savedPos = s3;\n s4 = peg$c1(s1, s4, s5);\n s3 = s4;\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n } else {\n peg$currPos = s3;\n s3 = peg$FAILED;\n }\n }\n if (s2 !== peg$FAILED) {\n s3 = peg$currPos;\n s4 = [];\n if (input.length > peg$currPos) {\n s5 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n while (s5 !== peg$FAILED) {\n s4.push(s5);\n if (input.length > peg$currPos) {\n s5 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n }\n if (s4 !== peg$FAILED) {\n s3 = input.substring(s3, peg$currPos);\n } else {\n s3 = s4;\n }\n if (s3 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c2(s1, s2, s3);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parseBlock() {\n var s0;\n\n s0 = peg$parseBlock_Void();\n if (s0 === peg$FAILED) {\n s0 = peg$parseBlock_Balanced();\n }\n\n return s0;\n }\n\n function peg$parseBlock_Void() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8;\n\n s0 = peg$currPos;\n if (input.substr(peg$currPos, 4) === peg$c3) {\n s1 = peg$c3;\n peg$currPos += 4;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c4); }\n }\n if (s1 !== peg$FAILED) {\n s2 = peg$parse__();\n if (s2 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c5) {\n s3 = peg$c5;\n peg$currPos += 3;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c6); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parseBlock_Name();\n if (s4 !== peg$FAILED) {\n s5 = peg$parse__();\n if (s5 !== peg$FAILED) {\n s6 = peg$currPos;\n s7 = peg$parseBlock_Attributes();\n if (s7 !== peg$FAILED) {\n s8 = peg$parse__();\n if (s8 !== peg$FAILED) {\n peg$savedPos = s6;\n s7 = peg$c7(s4, s7);\n s6 = s7;\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n if (s6 === peg$FAILED) {\n s6 = null;\n }\n if (s6 !== peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c8) {\n s7 = peg$c8;\n peg$currPos += 4;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c9); }\n }\n if (s7 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c10(s4, s6);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parseBlock_Balanced() {\n var s0, s1, s2, s3, s4, s5, s6;\n\n s0 = peg$currPos;\n s1 = peg$parseBlock_Start();\n if (s1 !== peg$FAILED) {\n s2 = [];\n s3 = peg$parseBlock();\n if (s3 === peg$FAILED) {\n s3 = peg$currPos;\n s4 = peg$currPos;\n s5 = peg$currPos;\n peg$silentFails++;\n s6 = peg$parseBlock_End();\n peg$silentFails--;\n if (s6 === peg$FAILED) {\n s5 = void 0;\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n if (s5 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s6 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s6 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s6 !== peg$FAILED) {\n s5 = [s5, s6];\n s4 = s5;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n if (s4 !== peg$FAILED) {\n s3 = input.substring(s3, peg$currPos);\n } else {\n s3 = s4;\n }\n }\n while (s3 !== peg$FAILED) {\n s2.push(s3);\n s3 = peg$parseBlock();\n if (s3 === peg$FAILED) {\n s3 = peg$currPos;\n s4 = peg$currPos;\n s5 = peg$currPos;\n peg$silentFails++;\n s6 = peg$parseBlock_End();\n peg$silentFails--;\n if (s6 === peg$FAILED) {\n s5 = void 0;\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n if (s5 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s6 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s6 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s6 !== peg$FAILED) {\n s5 = [s5, s6];\n s4 = s5;\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n } else {\n peg$currPos = s4;\n s4 = peg$FAILED;\n }\n if (s4 !== peg$FAILED) {\n s3 = input.substring(s3, peg$currPos);\n } else {\n s3 = s4;\n }\n }\n }\n if (s2 !== peg$FAILED) {\n s3 = peg$parseBlock_End();\n if (s3 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c11(s1, s2, s3);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parseBlock_Start() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8;\n\n s0 = peg$currPos;\n if (input.substr(peg$currPos, 4) === peg$c3) {\n s1 = peg$c3;\n peg$currPos += 4;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c4); }\n }\n if (s1 !== peg$FAILED) {\n s2 = peg$parse__();\n if (s2 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c5) {\n s3 = peg$c5;\n peg$currPos += 3;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c6); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parseBlock_Name();\n if (s4 !== peg$FAILED) {\n s5 = peg$parse__();\n if (s5 !== peg$FAILED) {\n s6 = peg$currPos;\n s7 = peg$parseBlock_Attributes();\n if (s7 !== peg$FAILED) {\n s8 = peg$parse__();\n if (s8 !== peg$FAILED) {\n peg$savedPos = s6;\n s7 = peg$c7(s4, s7);\n s6 = s7;\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n if (s6 === peg$FAILED) {\n s6 = null;\n }\n if (s6 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c12) {\n s7 = peg$c12;\n peg$currPos += 3;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c13); }\n }\n if (s7 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c14(s4, s6);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parseBlock_End() {\n var s0, s1, s2, s3, s4, s5, s6;\n\n s0 = peg$currPos;\n if (input.substr(peg$currPos, 4) === peg$c3) {\n s1 = peg$c3;\n peg$currPos += 4;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c4); }\n }\n if (s1 !== peg$FAILED) {\n s2 = peg$parse__();\n if (s2 !== peg$FAILED) {\n if (input.substr(peg$currPos, 4) === peg$c15) {\n s3 = peg$c15;\n peg$currPos += 4;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c16); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parseBlock_Name();\n if (s4 !== peg$FAILED) {\n s5 = peg$parse__();\n if (s5 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c12) {\n s6 = peg$c12;\n peg$currPos += 3;\n } else {\n s6 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c13); }\n }\n if (s6 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c17(s4);\n s0 = s1;\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n } else {\n peg$currPos = s0;\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n function peg$parseBlock_Name() {\n var s0;\n\n s0 = peg$parseNamespaced_Block_Name();\n if (s0 === peg$FAILED) {\n s0 = peg$parseCore_Block_Name();\n }\n\n return s0;\n }\n\n function peg$parseNamespaced_Block_Name() {\n var s0, s1, s2, s3, s4;\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n s2 = peg$parseBlock_Name_Part();\n if (s2 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 47) {\n s3 = peg$c18;\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c19); }\n }\n if (s3 !== peg$FAILED) {\n s4 = peg$parseBlock_Name_Part();\n if (s4 !== peg$FAILED) {\n s2 = [s2, s3, s4];\n s1 = s2;\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n if (s1 !== peg$FAILED) {\n s0 = input.substring(s0, peg$currPos);\n } else {\n s0 = s1;\n }\n\n return s0;\n }\n\n function peg$parseCore_Block_Name() {\n var s0, s1, s2;\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n s2 = peg$parseBlock_Name_Part();\n if (s2 !== peg$FAILED) {\n s1 = input.substring(s1, peg$currPos);\n } else {\n s1 = s2;\n }\n if (s1 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c20(s1);\n }\n s0 = s1;\n\n return s0;\n }\n\n function peg$parseBlock_Name_Part() {\n var s0, s1, s2, s3, s4;\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n if (peg$c21.test(input.charAt(peg$currPos))) {\n s2 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s2 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c22); }\n }\n if (s2 !== peg$FAILED) {\n s3 = [];\n if (peg$c23.test(input.charAt(peg$currPos))) {\n s4 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s4 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c24); }\n }\n while (s4 !== peg$FAILED) {\n s3.push(s4);\n if (peg$c23.test(input.charAt(peg$currPos))) {\n s4 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s4 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c24); }\n }\n }\n if (s3 !== peg$FAILED) {\n s2 = [s2, s3];\n s1 = s2;\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n } else {\n peg$currPos = s1;\n s1 = peg$FAILED;\n }\n if (s1 !== peg$FAILED) {\n s0 = input.substring(s0, peg$currPos);\n } else {\n s0 = s1;\n }\n\n return s0;\n }\n\n function peg$parseBlock_Attributes() {\n var s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11, s12;\n\n s0 = peg$currPos;\n s1 = peg$currPos;\n s2 = peg$currPos;\n if (input.charCodeAt(peg$currPos) === 123) {\n s3 = peg$c25;\n peg$currPos++;\n } else {\n s3 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c26); }\n }\n if (s3 !== peg$FAILED) {\n s4 = [];\n s5 = peg$currPos;\n s6 = peg$currPos;\n peg$silentFails++;\n s7 = peg$currPos;\n if (input.charCodeAt(peg$currPos) === 125) {\n s8 = peg$c27;\n peg$currPos++;\n } else {\n s8 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c28); }\n }\n if (s8 !== peg$FAILED) {\n s9 = peg$parse__();\n if (s9 !== peg$FAILED) {\n s10 = peg$c29;\n if (s10 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 47) {\n s11 = peg$c18;\n peg$currPos++;\n } else {\n s11 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c19); }\n }\n if (s11 === peg$FAILED) {\n s11 = null;\n }\n if (s11 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c12) {\n s12 = peg$c12;\n peg$currPos += 3;\n } else {\n s12 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c13); }\n }\n if (s12 !== peg$FAILED) {\n s8 = [s8, s9, s10, s11, s12];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n peg$silentFails--;\n if (s7 === peg$FAILED) {\n s6 = void 0;\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n if (s6 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s7 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s7 !== peg$FAILED) {\n s6 = [s6, s7];\n s5 = s6;\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n while (s5 !== peg$FAILED) {\n s4.push(s5);\n s5 = peg$currPos;\n s6 = peg$currPos;\n peg$silentFails++;\n s7 = peg$currPos;\n if (input.charCodeAt(peg$currPos) === 125) {\n s8 = peg$c27;\n peg$currPos++;\n } else {\n s8 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c28); }\n }\n if (s8 !== peg$FAILED) {\n s9 = peg$parse__();\n if (s9 !== peg$FAILED) {\n s10 = peg$c29;\n if (s10 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 47) {\n s11 = peg$c18;\n peg$currPos++;\n } else {\n s11 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c19); }\n }\n if (s11 === peg$FAILED) {\n s11 = null;\n }\n if (s11 !== peg$FAILED) {\n if (input.substr(peg$currPos, 3) === peg$c12) {\n s12 = peg$c12;\n peg$currPos += 3;\n } else {\n s12 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c13); }\n }\n if (s12 !== peg$FAILED) {\n s8 = [s8, s9, s10, s11, s12];\n s7 = s8;\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n } else {\n peg$currPos = s7;\n s7 = peg$FAILED;\n }\n peg$silentFails--;\n if (s7 === peg$FAILED) {\n s6 = void 0;\n } else {\n peg$currPos = s6;\n s6 = peg$FAILED;\n }\n if (s6 !== peg$FAILED) {\n if (input.length > peg$currPos) {\n s7 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s7 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c0); }\n }\n if (s7 !== peg$FAILED) {\n s6 = [s6, s7];\n s5 = s6;\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n } else {\n peg$currPos = s5;\n s5 = peg$FAILED;\n }\n }\n if (s4 !== peg$FAILED) {\n if (input.charCodeAt(peg$currPos) === 125) {\n s5 = peg$c27;\n peg$currPos++;\n } else {\n s5 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c28); }\n }\n if (s5 !== peg$FAILED) {\n s3 = [s3, s4, s5];\n s2 = s3;\n } else {\n peg$currPos = s2;\n s2 = peg$FAILED;\n }\n } else {\n peg$currPos = s2;\n s2 = peg$FAILED;\n }\n } else {\n peg$currPos = s2;\n s2 = peg$FAILED;\n }\n if (s2 !== peg$FAILED) {\n s1 = input.substring(s1, peg$currPos);\n } else {\n s1 = s2;\n }\n if (s1 !== peg$FAILED) {\n peg$savedPos = s0;\n s1 = peg$c30(s1);\n }\n s0 = s1;\n\n return s0;\n }\n\n function peg$parse__() {\n var s0, s1;\n\n s0 = [];\n if (peg$c31.test(input.charAt(peg$currPos))) {\n s1 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c32); }\n }\n if (s1 !== peg$FAILED) {\n while (s1 !== peg$FAILED) {\n s0.push(s1);\n if (peg$c31.test(input.charAt(peg$currPos))) {\n s1 = input.charAt(peg$currPos);\n peg$currPos++;\n } else {\n s1 = peg$FAILED;\n if (peg$silentFails === 0) { peg$fail(peg$c32); }\n }\n }\n } else {\n s0 = peg$FAILED;\n }\n\n return s0;\n }\n\n\n\n /*\n *\n * _____ _ _\n * / ____| | | | |\n * | | __ _ _| |_ ___ _ __ | |__ ___ _ __ __ _\n * | | |_ | | | | __/ _ \\ '_ \\| '_ \\ / _ \\ '__/ _` |\n * | |__| | |_| | || __/ | | | |_) | __/ | | (_| |\n * \\_____|\\__,_|\\__\\___|_| |_|_.__/ \\___|_| \\__, |\n * __/ |\n * GRAMMAR |___/\n *\n *\n * Welcome to the grammar file for Gutenberg posts!\n *\n * Please don't be distracted by the functions at the top\n * here - they're just helpers for the grammar below. We\n * try to keep them as minimal and simple as possible,\n * but the parser generator forces us to declare them at\n * the beginning of the file.\n *\n * What follows is the official specification grammar for\n * documents created or edited in Gutenberg. It starts at\n * the top-level rule `Block_List`\n *\n * The grammar is defined by a series of _rules_ and ways\n * to return matches on those rules. It's a _PEG_, a\n * parsing expression grammar, which simply means that for\n * each of our rules we have a set of sub-rules to match\n * on and the generated parser will try them in order\n * until it finds the first match.\n *\n * This grammar is a _specification_ (with as little actual\n * code as we can get away with) which is used by the\n * parser generator to generate the actual _parser_ which\n * is used by Gutenberg. We generate two parsers: one in\n * JavaScript for use the browser and one in PHP for\n * WordPress itself. PEG parser generators are available\n * in many languages, though different libraries may require\n * some translation of this grammar into their syntax.\n *\n * For more information:\n * @see https://pegjs.org\n * @see https://en.wikipedia.org/wiki/Parsing_expression_grammar\n *\n */\n\n /** array(), 'innerHTML' => $pre );\n }\n\n foreach ( $tokens as $token ) {\n list( $token, $html ) = $token;\n\n $blocks[] = $token;\n\n if ( ! empty( $html ) ) {\n $blocks[] = array( 'attrs' => array(), 'innerHTML' => $html );\n }\n }\n\n if ( ! empty( $post ) ) {\n $blocks[] = array( 'attrs' => array(), 'innerHTML' => $post );\n }\n\n return $blocks;\n }\n }\n\n ?> **/\n\n function freeform( s ) {\n return s.length && {\n attrs: {},\n innerHTML: s\n };\n }\n\n function joinBlocks( pre, tokens, post ) {\n var blocks = [], i, l, html, item, token;\n\n if ( pre.length ) {\n blocks.push( freeform( pre ) );\n }\n\n for ( i = 0, l = tokens.length; i < l; i++ ) {\n item = tokens[ i ];\n token = item[ 0 ];\n html = item[ 1 ];\n\n blocks.push( token );\n if ( html.length ) {\n blocks.push( freeform( html ) );\n }\n }\n\n if ( post.length ) {\n blocks.push( freeform( post ) );\n }\n\n return blocks;\n }\n\n function maybeJSON( s ) {\n try {\n return JSON.parse( s );\n } catch (e) {\n return null;\n }\n }\n\n function partition( predicate, list ) {\n var i, l, item;\n var truthy = [];\n var falsey = [];\n\n // nod to performance over a simpler reduce\n // and clone model we could have taken here\n for ( i = 0, l = list.length; i < l; i++ ) {\n item = list[ i ];\n\n predicate( item )\n ? truthy.push( item )\n : falsey.push( item )\n };\n\n return [ truthy, falsey ];\n }\n\n\n\n peg$result = peg$startRuleFunction();\n\n if (peg$result !== peg$FAILED && peg$currPos === input.length) {\n return peg$result;\n } else {\n if (peg$result !== peg$FAILED && peg$currPos < input.length) {\n peg$fail(peg$endExpectation());\n }\n\n throw peg$buildStructuredError(\n peg$maxFailExpected,\n peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,\n peg$maxFailPos < input.length\n ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)\n : peg$computeLocation(peg$maxFailPos, peg$maxFailPos)\n );\n }\n }\n\n return peg$parse;\n});\n"
-);
-
-document.getElementById( 'post-list-content' ).value = `
-https://raw.githubusercontent.com/dmsnell/gutenberg-document-library/master/library/demo-post.html
-https://raw.githubusercontent.com/dmsnell/gutenberg-document-library/master/library/shortcode-shortcomings.html
-https://raw.githubusercontent.com/dmsnell/gutenberg-document-library/master/library/redesigning-chrome-desktop.html
-https://raw.githubusercontent.com/dmsnell/gutenberg-document-library/master/library/web-at-maximum-fps.html
-https://raw.githubusercontent.com/dmsnell/gutenberg-document-library/master/library/early-adopting-the-future.html
-https://raw.githubusercontent.com/dmsnell/gutenberg-document-library/master/library/pygmalian-raw-html.html
-https://raw.githubusercontent.com/dmsnell/gutenberg-document-library/master/library/moby-dick-parsed.html
-`;
\ No newline at end of file
diff --git a/docs/parser/browser-comparator/index.html b/docs/parser/browser-comparator/index.html
deleted file mode 100644
index 518d508f555a71..00000000000000
--- a/docs/parser/browser-comparator/index.html
+++ /dev/null
@@ -1,19 +0,0 @@
-
-
- Compare Gutenberg Parsers
-
-
-
- Compare Gutenberg Parsers
- Parser A:
- Parser B:
- Post List:
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/docs/parser/browser-comparator/index.js b/docs/parser/browser-comparator/index.js
deleted file mode 100644
index ffb41f37353ef5..00000000000000
--- a/docs/parser/browser-comparator/index.js
+++ /dev/null
@@ -1,249 +0,0 @@
-// @ts-check
-const l = m => ( console.log( m ), m );
-
-// how long to iterate when benchmarking
-const LOOP_TIME = 100;
-
-const state = {
- input: {
- prevParser: a => false,
- nextParser: a => false,
- postList: []
- },
-
- posts: {}
-};
-window.state = state;
-
-function initialize( next ) {
- const prevParser = eval( document.getElementById( 'prev-parser-content' ).value );
- const nextParser = eval( document.getElementById( 'next-parser-content' ).value );
- const postList = document.getElementById( 'post-list-content' ).value.split('\n').filter(Boolean);
-
- state.input.prevParser = prevParser();
- state.input.nextParser = nextParser();
- state.input.postList = postList;
-
- next();
-}
-
-function renderLoadingPosts() {
- const loadingPosts = document.getElementById( 'loading-posts' );
-
- let output = '';
- for ( let name in state.posts ) {
- const post = state.posts[ name ];
- switch ( post.status ) {
- case 'loading':
- output += post.transfer.total > 0
- ? '' + name + ': ' + Math.floor( 100 * post.transfer.loaded / post.transfer.total ) + '% '
- : '' + name + ': loading (unknown size) ';
- break;
-
- case 'loaded':
- output += '' + name + ': loaded ';
- break;
-
- case 'failed':
- output += '' + name + ': failed (' + post.transfer.status + ') ';
- break;
- }
- }
- output += ' ';
-
- loadingPosts.innerHTML = output;
-}
-
-function loadPosts( next ) {
- const startedAt = performance.now();
- const postCount = state.input.postList.length;
- let loadedPosts = 0;
-
- const queueNext = () => {
- renderLoadingPosts();
-
- if ( loadedPosts === postCount ) {
- const endedAt = performance.now();
- document.getElementById( 'loading-posts' ).innerHTML += 'Took ' + Math.ceil( endedAt - startedAt ) + ' ms to load posts
';
- next();
- }
- }
-
- for ( let i = 0; i < postCount; i++ ) {
- const post = state.input.postList[ i ];
- const name = post.replace( /.+\//g, '' );
- state.posts[ name ] = {
- content: '',
- runs: {
- prev: { ms: 0, count: 0 },
- next: { ms: 0, count: 0 }
- },
- status: 'loading',
- transfer: {
- loaded: 0,
- total: 0
- }
- }
-
- queueNext();
-
- const xhr = new XMLHttpRequest();
- xhr.open( 'GET', post );
-
- xhr.onprogress = event => {
- state.posts[ name ].transfer = {
- loaded: event.loaded,
- total: event.total
- }
-
- queueNext();
- };
-
- xhr.onload = () => {
- state.posts[ name ].content = xhr.responseText;
- state.posts[ name ].status = 'loaded';
- loadedPosts += 1;
-
- queueNext();
- };
-
- xhr.onerror = () => {
- state.posts[ name ].transfer.status = xhr.status;
- state.posts[ name ].status = 'failed';
- loadedPosts += 1;
-
- queueNext();
- };
-
- xhr.send();
- }
-}
-
-function compareOutputs( next ) {
- const startedAt = performance.now();
- const output = document.getElementById( 'comparing-parsers' );
- output.innerHTML = '';
- const o = m => output.innerHTML += m;
-
- o( 'Comparing parsers…
' );
-
- o( '' );
- for ( let name in state.posts ) {
- const post = state.posts[ name ];
-
- if ( post.status !== 'loaded' ) {
- continue;
- }
-
- post.prevParse = state.input.prevParser( post.content );
- post.nextParse = state.input.nextParser( post.content );
-
- post.isEqual = window.deepEqual( post.prevParse, post.nextParse );
-
- o( '' + name + ': ' + ( post.isEqual ? 'match' : 'mismatch' ) + ' ' );
- }
- o( ' ' );
-
- const endedAt = performance.now();
- o( 'Took ' + Math.ceil( endedAt - startedAt ) + ' ms to compare parsers
' );
-
- next();
-}
-
-function benchmark( next ) {
- const startedAt = performance.now();
- const output = document.getElementById( 'benchmark' );
- output.innerHTML = '';
- const o = m => output.innerHTML += m;
- let stillRunning = true;
-
- const stopper = document.createElement( 'button' );
- stopper.setAttribute( 'id', 'stop-benchmark' );
- stopper.innerHTML = 'Stop benchmark';
- stopper.addEventListener( 'click', () => {
- stillRunning = false;
- stopper.parentNode.removeChild( stopper );
- } );
- output.parentNode.appendChild( stopper );
-
- const finish = () => {
- const endedAt = performance.now();
- o( 'Took ' + Math.ceil( endedAt - startedAt ) / 1000 + ' s to run benchmark
' );
- next();
- };
-
- o( '
' );
-
- const posts = Object.keys( state.posts ).filter( name => state.posts[ name ].status === 'loaded' );
- const postCount = posts.length;
-
- const report = document.getElementById( 'benchmark-results' );
- const ul = document.createElement( 'ul' );
- for ( let i = 0; i < posts.length; i++ ) {
- const name = posts[ i ];
- const post = state.posts[ name ];
- const id = 'post-report-' + name;
- const li = document.createElement( 'ui' );
- li.setAttribute( 'id', id );
- li.innerHTML = name + ': not yet benchmarked';
- state.posts[ name ].node = li;
- ul.appendChild( li );
- }
- report.appendChild( ul );
-
- const loop = () => {
- // grab a random post and randomly pick the parser
- const choice = ( Math.random() > 0.5 ) ? 'prev' : 'next';
- const parse = choice === 'prev' ? state.input.prevParser : state.input.nextParser;
- const name = posts[ Math.floor( Math.random() * postCount ) ];
- const post = state.posts[ name ];
- const tic = performance.now();
- let toc = tic;
- let count = 0;
- let ms = 0;
- const RUNTIME = post.runLong ? 3 * LOOP_TIME : LOOP_TIME;
-
- do {
- const content = post.content + '' + count + '
';
- const _tic = performance.now();
- parse( content );
- toc = performance.now();
- count += 1;
- ms += toc - _tic;
- } while ( toc - tic < RUNTIME );
-
- post.runLong = count < 3;
-
- post.runs[ choice ].ms += ms;
- post.runs[ choice ].count += count;
-
- const prevAvg = Math.round( 1000 * post.runs.prev.ms / ( post.runs.prev.count + Number.EPSILON ) ) / 1000;
- const nextAvg = Math.round( 1000 * post.runs.next.ms / ( post.runs.next.count + Number.EPSILON ) ) / 1000;
- const diff = Math.abs( prevAvg - nextAvg );
-
- post.node.innerHTML = (
- '' +
- '
' + name + ' - ' + ( prevAvg < nextAvg ? 'prev' : 'next') + ' faster by ' + Math.floor( 1000 * diff ) / 1000 + ' ms (' + Math.floor( 1000 * diff / Math.max( prevAvg, nextAvg ) ) / 10 + '%)
' +
- '
prev: ' + prevAvg + ' ms avg (' + post.runs.prev.count + ' runs)' +
- 'next: ' + nextAvg + ' ms avg (' + post.runs.next.count + ' runs)' +
- ' =0;p--)if(a[p]!=y[p])return!1;for(p=a.length-1;p>=0;p--)if(l=a[p],!c(t[l],e[l],r))return!1;return typeof t==typeof e}(t,e,r))};function f(t){return null===t||void 0===t}function i(t){return!(!t||"object"!=typeof t||"number"!=typeof t.length)&&("function"==typeof t.copy&&"function"==typeof t.slice&&!(t.length>0&&"number"!=typeof t[0]))}},function(t,e,r){window.deepEqual=r(2)}]);
\ No newline at end of file
diff --git a/docs/parser/comparator/README.md b/docs/parser/comparator/README.md
new file mode 100644
index 00000000000000..b61d277a08e05d
--- /dev/null
+++ b/docs/parser/comparator/README.md
@@ -0,0 +1,135 @@
+# Generic parser comparator
+
+Please understand that this code is generally hacky.
+This iteration of the parser comparator focuses on
+language-independence while the first iteration was
+focused on Javascript being run in a browser.
+
+With this tool we can compare against any parser in
+any language in any environment _as long as it can
+run provide a web interface_.
+
+That is, there are two parts to this tool:
+ - The primary runner which is a simple HTML/JS
+ file run in the browser.
+ - Parser "runners" which are exposed as web
+ services which the browser will call.
+
+## How to use
+
+Load the `index.html` file in your browser and specify
+the URLs at which the different parsers can be reached
+at. In most cases this will be a local URL as we will
+probably be developing the parsers when running this.
+
+Once the two URLs are entered you may click the button
+to start. The comparator will download test documents
+and then start running its benchmark. There's no _end_
+though; it will continue to gather data as long as you
+allow it.
+
+To finish press the ESC key.
+
+## How to develop runner
+
+This was experimentally built using the Calypso project
+as a build tool. You may note that at the current time
+there are no styles: this is an issue to fix.
+
+In order to run then you will need to perform the
+following list of steps:
+
+ 1. Clone the [Gutenberg repository](https://github.com/wordpress/gutenberg) and run `npm install`
+ 2. Clone the [Calypso repository](https://github.com/automattic/wp-calypso) and run `npm install`
+ 3. Create an `npm link` to Calypso. In its directory run `npm link`
+ 4. Link to Calypso from this directory. In this directory run `npm link wp-calypso`
+ 5. Build with `./node_modules/wp-calypso/node_modules/.bin/webpack --mode production`
+ 6. Run a webserver in this directory, for example `php -S localhost:8000`
+ 7. Load the `index.html` file
+
+## How to test parsers
+
+There are two Dockerfiles provided for testing Javascript-
+and PHP-based parsers. These aren't necessary but are there
+to help. The only requirement is mounting a file at `/parser.php`
+or `/parser.js` accordingly. Since most parsers will have some
+initialization code and need to expose a standard file you
+may need to mount additional files.
+
+For example, let's use the provided parsers for the spec parsers.
+
+```
+# At first we have to build the docker image
+docker build -t php-parser -f runner-php-sync.Dockerfile .
+
+# Run the PHP parser
+docker run --rm -it -p 8001:80 -v (pwd)/parser-php-php-pegjs.php:/parser.php -v (pwd)/post.peg.php:/post.peg.php php-parser
+```
+
+The defined interface for the PHP runner is that we provide a class
+called `MyParser` which has a method called `parse()`. Since we're
+using the spec parser from Gutenberg it doesn't provide that interface,
+thus we write a small wrapper file that handles that translation. This
+wrapper is mounted as `/parser.php` but since it requires the PEG-generated
+parser we also mount that at a known location: `/post.peg.php`
+
+The provided Dockerfile creates a web-server that listens to port 80. We
+will have multiple parsers running at once so we'll map that port to another
+open port - in this case port 8001.
+
+Now the Javascript.
+
+```
+# Build the provided docker image
+docker build -t js-parser -f runner-js-sync.Dockerfile .
+
+# Run it
+docker run --rm -it -p 8002:80 -v (pwd)/parser-js-pegjs.js:/parser.js -v (pwd)/post.peg.js:/post.peg.js js-parser
+```
+
+The options here should make sense as well. We created a small wrapper then
+setup another port on which to run this.
+
+When running the comparator we will use `localhost:8001` and `localhost:8002`
+as the URLs for the parsers.
+
+We should not that Docker was unnecessary. As long as we provide a web service
+conforming to the requirements we can run anything and we can skip docker.
+
+## Web interface
+
+In order to normalize runs across all languages, across synchronous vs. asynchronous
+code, across all environments, we are connecting via `POST` calls to a web server.
+We are also trusting the parser under test to report its own metrics. We're not
+looking for people to cheat - we're trying to honestly compare one parser against
+another.
+
+The request may contain a `count` parameter indicating how many times to run the
+document through the parse function. This can be helpful in order to mitigate
+the effects of caches and data locality and other non-obvious factors.
+
+The body of the request should be a raw string which is the content of the document
+to be parsed.
+
+The parser should then parse the document and track the time it took to parse it
+and do its best to measure the memory used by the parser. Memory can be tricky to
+measure; ideally we want the total amount of rss memory as reported
+in `/proc/{pid}` on a Linux system.
+
+The response should mirror this format in a JSON-encoded value:
+
+```
+{
+ parse: [array of blocks] // parsed output of the document
+ us: [number] // number of milliseconds taken to parse the document across all runs
+ usAvg: [number] // number of milliseconds on average it took to parse the document once
+ rss: {
+ start: [number] // bytes of used memory before any initialization
+ beforeParserInit: [number] // bytes right before initializing parser
+ afterParserInit: [number] // bytes right after initializing parser
+ end: [number] // bytes after parsing document the requested number of times
+ }
+}
+```
+
+The comparator will parse this response and report the results accordingly.
diff --git a/docs/parser/comparator/index.html b/docs/parser/comparator/index.html
new file mode 100644
index 00000000000000..952fa748782545
--- /dev/null
+++ b/docs/parser/comparator/index.html
@@ -0,0 +1,2 @@
+Loading
+
diff --git a/docs/parser/comparator/index.jsx b/docs/parser/comparator/index.jsx
new file mode 100644
index 00000000000000..b6eb39a2abf3c4
--- /dev/null
+++ b/docs/parser/comparator/index.jsx
@@ -0,0 +1,389 @@
+import React, { Component, Fragment } from "react";
+import ReactDOM from "react-dom";
+import { isEqual, random, range, sample } from 'lodash';
+
+import Button from "components/button";
+import Card from "components/card";
+import TextInput from "components/forms/form-text-input";
+
+const l = m => (console.log(m), m);
+
+class ParserPicker extends Component {
+ state = {
+ parsers: {
+ Left: "http://localhost:8001",
+ Right: "http://localhost:8002"
+ }
+ };
+
+ updateUrl = ({ target: { dataset: { name }, value } }) =>
+ this.setState(({ parsers }) => ({
+ parsers: { ...parsers, [name]: value }
+ }));
+
+ next = () => this.props.next(this.state);
+
+ render() {
+ const { parsers } = this.state;
+ return (
+
+ {Object.keys(parsers)
+ .map(name => [name, parsers[name]])
+ .map(([name, url]) => (
+
+ {name}:
+
+ ))}
+ {this.props.next && Compare outputs }
+
+ );
+ }
+}
+
+class LibraryLoader extends Component {
+ state = {
+ documents: {}
+ }
+
+ componentDidMount() {
+ const xhr = new XMLHttpRequest();
+ xhr.open('GET', 'https://raw.githubusercontent.com/dmsnell/gutenberg-document-library/master/post-list.txt');
+ xhr.onload = () => this.setState({
+ documents: xhr.responseText.trim().split('\n').reduce((o, url) => ({ ...o, [url]: null }), {})
+ }, this.loadDocs)
+ xhr.onerror = () => l('Failed to load documents');
+ xhr.send();
+ }
+
+ loadDocs = () => {
+ const { documents } = this.state;
+ const urls = Object.keys(documents);
+
+ urls.forEach(url => {
+ const xhr = new XMLHttpRequest();
+ xhr.open('GET', url);
+ xhr.onload = () => this.setState(({ documents }) => ({
+ documents: {
+ ...documents,
+ [url]: xhr.responseText
+ }
+ }), this.proceed);
+ xhr.onerror = () => l('Failed to load ' + url);
+ xhr.send();
+ });
+ };
+
+ proceed = () => {
+ const { documents } = this.state;
+
+ if (Object.keys(documents).every(url => documents[url] !== null)) {
+ this.props.next(this.state);
+ }
+ }
+
+ render() {
+ const { documents } = this.state;
+ const urls = Object.keys(documents);
+ const docs = urls.map(url => documents[url]);
+ const hasUrls = urls.length !== 0;
+ const hasAllDocs = docs.every(a => a !== null);
+
+ return (
+
+ {hasUrls ?
+ ⏳ Loading list of documents from repository…
:
+ ✅ Loaded list of documents from repository…
+ }
+ {hasUrls && (
+
+ ⏳Loading individual test documents…
+
+ {urls.map(url => (
+ {documents[url] === null ?
+ ⏳ Loading {url}
:
+ ✅ Loaded {url}
}
+ ))}
+
+
+ )}
+
+ );
+ }
+}
+
+class OutputComparator extends Component {
+ state = {
+ allEqual: null,
+ done: false,
+ failed: false,
+ }
+
+ componentDidMount() {
+ const { documents, parsers } = this.props;
+
+ Promise.all(Object.keys(parsers).map(name => new Promise((resolve, reject) => {
+ const url = parsers[name];
+
+ const xhr = new XMLHttpRequest();
+ xhr.open('POST', url);
+ xhr.onload = () => resolve(JSON.parse(xhr.responseText));
+ xhr.onerror = () => reject();
+ xhr.send(documents[Object.keys(documents)[0]]);
+ })))
+ .then(outputs => this.setState({
+ done: true,
+ allEqual: outputs.reduce(([stillEqual, prev], { parse: next }) => prev === null || stillEqual === false
+ ? [stillEqual, next]
+ : [isEqual(prev, next), next], [true, null])[0]
+ }, this.props.next), () => this.setState({ done: true, failed: true }))
+
+ window.isEqual = isEqual;
+ }
+
+ render() {
+ const { allEqual, done, failed } = this.state;
+
+ return (
+
+ {!done ? (
+ Comparing outputs…
+ ) : (
+ failed ? Failed to test all parsers!
: Output equal? {allEqual ? 'true' : 'false'}
+ )}
+
+ );
+ }
+}
+
+class Histogram extends Component {
+ render() {
+ const { data } = this.props;
+ const maxHeight = data.reduce((max, next) => Math.max(max, next.value), 0);
+
+ return (
+
+ {data.map(bin => (
+
+
+ { bin.value }
+
+
+ { bin.label }
+
+
+ ))}
+
+ {keepGoing && (
+
+ Running! (Press ESC to stop)
+ {current}
+
+ )}
+ Bins are measuring `ms` runtime for each parse
+
+ {Object.keys(documents).map(doc => (
+
+ {doc}
+ {Object.keys(parsers).map(parser => (
+
+ ))}
+
+ ))}
+
+
+ )
+ }
+}
+
+class Comparator extends Component {
+ state = {
+ step: [
+ [],
+ ["pick-parsers", "load-library", "compare-outputs", "run-benchmark"]
+ ]
+ };
+
+ nextStep = updates =>
+ this.setState(({ step: [prev, [current, ...next]] }) => ({
+ step: [[...prev, current], next],
+ ...updates,
+ }));
+
+ render() {
+ const [prevSteps, [currentStep, ...nextSteps]] = this.state.step;
+
+ return (
+
+ {(() => {
+ switch (currentStep) {
+ case "pick-parsers":
+ return
;
+ case "load-library":
+ return (
+
+
+ );
+ case 'compare-outputs':
+ return (
+
+
+ );
+ case 'run-benchmark':
+ return (
+
+
+ );
+ default:
+ return
Done!
;
+ }
+ })()}
+
/status in bytes.
+ *
+ * @cite: http://drib.tech/programming/get-real-amount-memory-allocated-php
+ *
+ * @return int|bool sum of VmRSS and VmSwap in bytes. On error returns false.
+ */
+function memory_get_process_usage()
+{
+ $status = file_get_contents('/proc/' . getmypid() . '/status');
+
+ $matches = [];
+ preg_match_all('~^(?:VmRSS|VmSwap):\s*([0-9]+).*$~im', $status, $matches, PREG_SET_ORDER);
+
+ return array_sum( array_column( $matches, 1 ) ) * 1024;
+}
diff --git a/docs/parser/comparator/webpack.config.js b/docs/parser/comparator/webpack.config.js
new file mode 100644
index 00000000000000..43fe3ab5f04b43
--- /dev/null
+++ b/docs/parser/comparator/webpack.config.js
@@ -0,0 +1,115 @@
+const path = require("path");
+
+module.exports = {
+ entry: path.join(__dirname, "index.jsx"),
+ output: {
+ path: path.join(__dirname, "build"),
+ filename: "[name].js"
+ },
+ module: {
+ rules: [
+ {
+ test: /\.scss$/,
+ use: [
+ {
+ loader: "css-loader",
+ options: {
+ root: "https://wordpress.com"
+ }
+ },
+ {
+ loader: "postcss-loader",
+ options: {
+ plugins: () => [autoprefixer({ browsers: "last 2 versions" })]
+ }
+ },
+ {
+ loader: "sass-loader",
+ options: {
+ fallback: "style-loader",
+ use: [
+ {
+ loader: "css-loader",
+ options: {
+ root: "https://wordpress.com"
+ }
+ },
+ {
+ loader: "postcss-loader",
+ options: {
+ plugins: () => [autoprefixer({ browsers })]
+ }
+ },
+ {
+ loader: "sass-loader",
+ options: {
+ includePaths: [
+ path.resolve(__dirname, "client"),
+ path.resolve(
+ __dirname,
+ "node_modules",
+ "wp-calypso",
+ "client"
+ ),
+ path.resolve(
+ __dirname,
+ "node_modules",
+ "wp-calypso",
+ "client",
+ "extensions"
+ ),
+ path.resolve(
+ __dirname,
+ "node_modules",
+ "wp-calypso",
+ "assets",
+ "stylesheets"
+ )
+ ]
+ }
+ }
+ ]
+ }
+ }
+ ]
+ },
+ {
+ test: /\.jsx?$/,
+ use: {
+ loader: "babel-loader",
+ options: {
+ presets: [
+ [
+ "env",
+ {
+ useBuiltIns: true,
+ targets: {
+ browsers: "last 2 versions, not ie_mob 10, not ie 10"
+ },
+ loose: true
+ }
+ ],
+ "react",
+ "stage-2"
+ ],
+ babelrc: false
+ }
+ },
+ include: [
+ __dirname,
+ path.join(__dirname, "node_modules", "wp-calypso", "client")
+ ]
+ }
+ ]
+ },
+ resolve: {
+ extensions: [".json", ".jsx", ".js"],
+ modules: [
+ path.join(__dirname, "node_modules"),
+ path.join(__dirname, "node_modules", "wp-calypso"),
+ path.join(__dirname, "node_modules", "wp-calypso", "client"),
+ path.join(__dirname, "node_modules", "wp-calypso", "node_modules")
+ ],
+ symlinks: false
+ }
+};