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

Function peg$parseMAX

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

Source from the content-addressed store, hash-verified

14174 }
14175
14176 function peg$parseMAX() {
14177 let s0, s1, s2, s3;
14178
14179 s0 = peg$currPos;
14180 s1 = input.substr(peg$currPos, 3);
14181 if (s1.toLowerCase() === peg$c44) {
14182 peg$currPos += (3);
14183 } else {
14184 s1 = peg$FAILED;
14185 if (peg$silentFails === 0) { peg$fail(peg$e49); }
14186 }
14187 if (s1 !== peg$FAILED) {
14188 s2 = peg$currPos;
14189 peg$silentFails++;
14190 s3 = peg$parseIdentifierPart();
14191 peg$silentFails--;
14192 if (s3 === peg$FAILED) {
14193 s2 = undefined;
14194 } else {
14195 peg$currPos = s2;
14196 s2 = peg$FAILED;
14197 }
14198 if (s2 !== peg$FAILED) {
14199 s1 = [s1, s2];
14200 s0 = s1;
14201 } else {
14202 peg$currPos = s0;
14203 s0 = peg$FAILED;
14204 }
14205 } else {
14206 peg$currPos = s0;
14207 s0 = peg$FAILED;
14208 }
14209
14210 return s0;
14211 }
14212
14213 function peg$parseCOLLECT() {
14214 let s0, s1, s2, s3;

Callers 3

peg$parseWithExpressionFunction · 0.85
peg$parseReturnItemFunction · 0.85
peg$parseKeywordFunction · 0.85

Calls 2

peg$failFunction · 0.85
peg$parseIdentifierPartFunction · 0.85

Tested by

no test coverage detected