MCPcopy Create free account
hub / github.com/codemix/graph / peg$parseMergePattern

Function peg$parseMergePattern

packages/graph/src/grammar.js:3482–3565  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

3480 }
3481
3482 function peg$parseMergePattern() {
3483 let s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11, s12, s13;
3484
3485 s0 = peg$currPos;
3486 if (input.charCodeAt(peg$currPos) === 40) {
3487 s1 = peg$c4;
3488 peg$currPos++;
3489 } else {
3490 s1 = peg$FAILED;
3491 if (peg$silentFails === 0) { peg$fail(peg$e4); }
3492 }
3493 if (s1 !== peg$FAILED) {
3494 s2 = peg$parse_();
3495 s3 = peg$parseIdentifier();
3496 if (s3 !== peg$FAILED) {
3497 s4 = peg$parse_();
3498 if (input.charCodeAt(peg$currPos) === 41) {
3499 s5 = peg$c5;
3500 peg$currPos++;
3501 } else {
3502 s5 = peg$FAILED;
3503 if (peg$silentFails === 0) { peg$fail(peg$e5); }
3504 }
3505 if (s5 !== peg$FAILED) {
3506 s6 = peg$parse_();
3507 s7 = peg$parseMergeEdgePattern();
3508 if (s7 !== peg$FAILED) {
3509 s8 = peg$parse_();
3510 if (input.charCodeAt(peg$currPos) === 40) {
3511 s9 = peg$c4;
3512 peg$currPos++;
3513 } else {
3514 s9 = peg$FAILED;
3515 if (peg$silentFails === 0) { peg$fail(peg$e4); }
3516 }
3517 if (s9 !== peg$FAILED) {
3518 s10 = peg$parse_();
3519 s11 = peg$parseIdentifier();
3520 if (s11 !== peg$FAILED) {
3521 s12 = peg$parse_();
3522 if (input.charCodeAt(peg$currPos) === 41) {
3523 s13 = peg$c5;
3524 peg$currPos++;
3525 } else {
3526 s13 = peg$FAILED;
3527 if (peg$silentFails === 0) { peg$fail(peg$e5); }
3528 }
3529 if (s13 !== peg$FAILED) {
3530 peg$savedPos = s0;
3531 s0 = peg$f26(s3, s7, s11);
3532 } else {
3533 peg$currPos = s0;
3534 s0 = peg$FAILED;
3535 }
3536 } else {
3537 peg$currPos = s0;
3538 s0 = peg$FAILED;
3539 }

Callers 1

peg$parseMergeClauseFunction · 0.85

Calls 6

peg$failFunction · 0.85
peg$parse_Function · 0.85
peg$parseIdentifierFunction · 0.85
peg$f26Function · 0.85
peg$parseNodePatternFunction · 0.85

Tested by

no test coverage detected