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

Function peg$parseCreateChainNode

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

Source from the content-addressed store, hash-verified

3967 }
3968
3969 function peg$parseCreateChainNode() {
3970 let s0, s1, s2, s3, s4, s5, s6, s7, s8;
3971
3972 s0 = peg$currPos;
3973 if (input.charCodeAt(peg$currPos) === 40) {
3974 s1 = peg$c4;
3975 peg$currPos++;
3976 } else {
3977 s1 = peg$FAILED;
3978 if (peg$silentFails === 0) { peg$fail(peg$e4); }
3979 }
3980 if (s1 !== peg$FAILED) {
3981 s2 = peg$parse_();
3982 s3 = peg$parseIdentifier();
3983 if (s3 === peg$FAILED) {
3984 s3 = null;
3985 }
3986 s4 = peg$parseNodeLabels();
3987 if (s4 === peg$FAILED) {
3988 s4 = null;
3989 }
3990 s5 = peg$parse_();
3991 s6 = peg$parsePropertyMap();
3992 if (s6 === peg$FAILED) {
3993 s6 = null;
3994 }
3995 s7 = peg$parse_();
3996 if (input.charCodeAt(peg$currPos) === 41) {
3997 s8 = peg$c5;
3998 peg$currPos++;
3999 } else {
4000 s8 = peg$FAILED;
4001 if (peg$silentFails === 0) { peg$fail(peg$e5); }
4002 }
4003 if (s8 !== peg$FAILED) {
4004 peg$savedPos = s0;
4005 s0 = peg$f36(s3, s4, s6);
4006 } else {
4007 peg$currPos = s0;
4008 s0 = peg$FAILED;
4009 }
4010 } else {
4011 peg$currPos = s0;
4012 s0 = peg$FAILED;
4013 }
4014
4015 return s0;
4016 }
4017
4018 function peg$parseCreateEdgePattern() {
4019 let s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10;

Callers 2

Calls 6

peg$failFunction · 0.85
peg$parse_Function · 0.85
peg$parseIdentifierFunction · 0.85
peg$parseNodeLabelsFunction · 0.85
peg$parsePropertyMapFunction · 0.85
peg$f36Function · 0.85

Tested by

no test coverage detected