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

Function peg$parseUnaryExpression

lib/parser.js:5476–5530  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

5474 }
5475
5476 function peg$parseUnaryExpression() {
5477 var s0, s1, s2, s3;
5478
5479 s0 = peg$currPos;
5480 if (input.charCodeAt(peg$currPos) === 43) {
5481 s1 = peg$c197;
5482 peg$currPos++;
5483 } else {
5484 s1 = peg$FAILED;
5485 if (peg$silentFails === 0) { peg$fail(peg$c198); }
5486 }
5487 if (s1 === peg$FAILED) {
5488 if (input.charCodeAt(peg$currPos) === 45) {
5489 s1 = peg$c40;
5490 peg$currPos++;
5491 } else {
5492 s1 = peg$FAILED;
5493 if (peg$silentFails === 0) { peg$fail(peg$c41); }
5494 }
5495 if (s1 === peg$FAILED) {
5496 if (input.charCodeAt(peg$currPos) === 33) {
5497 s1 = peg$c218;
5498 peg$currPos++;
5499 } else {
5500 s1 = peg$FAILED;
5501 if (peg$silentFails === 0) { peg$fail(peg$c219); }
5502 }
5503 }
5504 }
5505 if (s1 !== peg$FAILED) {
5506 s2 = peg$parse_();
5507 if (s2 !== peg$FAILED) {
5508 s3 = peg$parseIterateExpression();
5509 if (s3 !== peg$FAILED) {
5510 peg$reportedPos = s0;
5511 s1 = peg$c220(s1, s3);
5512 s0 = s1;
5513 } else {
5514 peg$currPos = s0;
5515 s0 = peg$c3;
5516 }
5517 } else {
5518 peg$currPos = s0;
5519 s0 = peg$c3;
5520 }
5521 } else {
5522 peg$currPos = s0;
5523 s0 = peg$c3;
5524 }
5525 if (s0 === peg$FAILED) {
5526 s0 = peg$parseMemberExpression();
5527 }
5528
5529 return s0;
5530 }
5531
5532 function peg$parseMemberExpression() {
5533 var s0, s1, s2, s3;

Callers 1

Calls 5

peg$failFunction · 0.85
peg$parse_Function · 0.85
peg$c220Function · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…