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

Function peg$parseLogicalExpression

lib/parser.js:5259–5316  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

5257 }
5258
5259 function peg$parseLogicalExpression() {
5260 var s0, s1, s2, s3, s4, s5;
5261
5262 s0 = peg$currPos;
5263 s1 = peg$parseBinaryExpression();
5264 if (s1 !== peg$FAILED) {
5265 s2 = peg$parse_();
5266 if (s2 !== peg$FAILED) {
5267 if (input.substr(peg$currPos, 2) === peg$c192) {
5268 s3 = peg$c192;
5269 peg$currPos += 2;
5270 } else {
5271 s3 = peg$FAILED;
5272 if (peg$silentFails === 0) { peg$fail(peg$c193); }
5273 }
5274 if (s3 === peg$FAILED) {
5275 if (input.substr(peg$currPos, 2) === peg$c194) {
5276 s3 = peg$c194;
5277 peg$currPos += 2;
5278 } else {
5279 s3 = peg$FAILED;
5280 if (peg$silentFails === 0) { peg$fail(peg$c195); }
5281 }
5282 }
5283 if (s3 !== peg$FAILED) {
5284 s4 = peg$parse_();
5285 if (s4 !== peg$FAILED) {
5286 s5 = peg$parseIterateExpression();
5287 if (s5 !== peg$FAILED) {
5288 peg$reportedPos = s0;
5289 s1 = peg$c196(s1, s3, s5);
5290 s0 = s1;
5291 } else {
5292 peg$currPos = s0;
5293 s0 = peg$c3;
5294 }
5295 } else {
5296 peg$currPos = s0;
5297 s0 = peg$c3;
5298 }
5299 } else {
5300 peg$currPos = s0;
5301 s0 = peg$c3;
5302 }
5303 } else {
5304 peg$currPos = s0;
5305 s0 = peg$c3;
5306 }
5307 } else {
5308 peg$currPos = s0;
5309 s0 = peg$c3;
5310 }
5311 if (s0 === peg$FAILED) {
5312 s0 = peg$parseBinaryExpression();
5313 }
5314
5315 return s0;
5316 }

Callers 1

Calls 5

peg$parse_Function · 0.85
peg$failFunction · 0.85
peg$c196Function · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…