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

Function peg$parsePathAssignment

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

Source from the content-addressed store, hash-verified

5935 }
5936
5937 function peg$parsePathAssignment() {
5938 let s0, s1, s2, s3, s4, s5;
5939
5940 s0 = peg$currPos;
5941 s1 = peg$parseIdentifier();
5942 if (s1 !== peg$FAILED) {
5943 s2 = peg$parse_();
5944 if (input.charCodeAt(peg$currPos) === 61) {
5945 s3 = peg$c13;
5946 peg$currPos++;
5947 } else {
5948 s3 = peg$FAILED;
5949 if (peg$silentFails === 0) { peg$fail(peg$e15); }
5950 }
5951 if (s3 !== peg$FAILED) {
5952 s4 = peg$parse_();
5953 s5 = peg$parseShortestPathFunction();
5954 if (s5 !== peg$FAILED) {
5955 peg$savedPos = s0;
5956 s0 = peg$f85(s1, s5);
5957 } else {
5958 peg$currPos = s0;
5959 s0 = peg$FAILED;
5960 }
5961 } else {
5962 peg$currPos = s0;
5963 s0 = peg$FAILED;
5964 }
5965 } else {
5966 peg$currPos = s0;
5967 s0 = peg$FAILED;
5968 }
5969 if (s0 === peg$FAILED) {
5970 s0 = peg$currPos;
5971 s1 = peg$parseShortestPathFunction();
5972 if (s1 !== peg$FAILED) {
5973 peg$savedPos = s0;
5974 s1 = peg$f86(s1);
5975 }
5976 s0 = s1;
5977 if (s0 === peg$FAILED) {
5978 s0 = peg$currPos;
5979 s1 = peg$parseIdentifier();
5980 if (s1 !== peg$FAILED) {
5981 s2 = peg$parse_();
5982 if (input.charCodeAt(peg$currPos) === 61) {
5983 s3 = peg$c13;
5984 peg$currPos++;
5985 } else {
5986 s3 = peg$FAILED;
5987 if (peg$silentFails === 0) { peg$fail(peg$e15); }
5988 }
5989 if (s3 !== peg$FAILED) {
5990 s4 = peg$parse_();
5991 s5 = peg$parsePattern();
5992 if (s5 !== peg$FAILED) {
5993 peg$savedPos = s0;
5994 s0 = peg$f87(s1, s5);

Callers 1

peg$parseMatchClauseFunction · 0.85

Calls 8

peg$parseIdentifierFunction · 0.85
peg$parse_Function · 0.85
peg$failFunction · 0.85
peg$f85Function · 0.85
peg$f86Function · 0.85
peg$parsePatternFunction · 0.85
peg$f87Function · 0.85

Tested by

no test coverage detected