MCPcopy Create free account
hub / github.com/codemix/htmling / peg$parseSCRIPT_CONTENT

Function peg$parseSCRIPT_CONTENT

lib/parser.js:2220–2322  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

2218 }
2219
2220 function peg$parseSCRIPT_CONTENT() {
2221 var s0, s1, s2, s3, s4, s5;
2222
2223 peg$silentFails++;
2224 s0 = peg$currPos;
2225 s1 = peg$currPos;
2226 s2 = [];
2227 s3 = peg$currPos;
2228 s4 = peg$currPos;
2229 peg$silentFails++;
2230 if (input.substr(peg$currPos, 9) === peg$c12) {
2231 s5 = peg$c12;
2232 peg$currPos += 9;
2233 } else {
2234 s5 = peg$FAILED;
2235 if (peg$silentFails === 0) { peg$fail(peg$c13); }
2236 }
2237 peg$silentFails--;
2238 if (s5 === peg$FAILED) {
2239 s4 = peg$c5;
2240 } else {
2241 peg$currPos = s4;
2242 s4 = peg$c3;
2243 }
2244 if (s4 !== peg$FAILED) {
2245 if (input.length > peg$currPos) {
2246 s5 = input.charAt(peg$currPos);
2247 peg$currPos++;
2248 } else {
2249 s5 = peg$FAILED;
2250 if (peg$silentFails === 0) { peg$fail(peg$c14); }
2251 }
2252 if (s5 !== peg$FAILED) {
2253 s4 = [s4, s5];
2254 s3 = s4;
2255 } else {
2256 peg$currPos = s3;
2257 s3 = peg$c3;
2258 }
2259 } else {
2260 peg$currPos = s3;
2261 s3 = peg$c3;
2262 }
2263 if (s3 !== peg$FAILED) {
2264 while (s3 !== peg$FAILED) {
2265 s2.push(s3);
2266 s3 = peg$currPos;
2267 s4 = peg$currPos;
2268 peg$silentFails++;
2269 if (input.substr(peg$currPos, 9) === peg$c12) {
2270 s5 = peg$c12;
2271 peg$currPos += 9;
2272 } else {
2273 s5 = peg$FAILED;
2274 if (peg$silentFails === 0) { peg$fail(peg$c13); }
2275 }
2276 peg$silentFails--;
2277 if (s5 === peg$FAILED) {

Callers 1

peg$parseSCRIPT_ELEMENTFunction · 0.85

Calls 2

peg$failFunction · 0.85
peg$c24Function · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…