()
| 11510 | } |
| 11511 | |
| 11512 | function peg$parseSimpleFunctionName() { |
| 11513 | let s0, s1, s2, s3; |
| 11514 | |
| 11515 | s0 = peg$currPos; |
| 11516 | s1 = input.charAt(peg$currPos); |
| 11517 | if (peg$r0.test(s1)) { |
| 11518 | peg$currPos++; |
| 11519 | } else { |
| 11520 | s1 = peg$FAILED; |
| 11521 | if (peg$silentFails === 0) { peg$fail(peg$e12); } |
| 11522 | } |
| 11523 | if (s1 !== peg$FAILED) { |
| 11524 | s2 = []; |
| 11525 | s3 = input.charAt(peg$currPos); |
| 11526 | if (peg$r1.test(s3)) { |
| 11527 | peg$currPos++; |
| 11528 | } else { |
| 11529 | s3 = peg$FAILED; |
| 11530 | if (peg$silentFails === 0) { peg$fail(peg$e13); } |
| 11531 | } |
| 11532 | while (s3 !== peg$FAILED) { |
| 11533 | s2.push(s3); |
| 11534 | s3 = input.charAt(peg$currPos); |
| 11535 | if (peg$r1.test(s3)) { |
| 11536 | peg$currPos++; |
| 11537 | } else { |
| 11538 | s3 = peg$FAILED; |
| 11539 | if (peg$silentFails === 0) { peg$fail(peg$e13); } |
| 11540 | } |
| 11541 | } |
| 11542 | peg$savedPos = s0; |
| 11543 | s0 = peg$f211(s1, s2); |
| 11544 | } else { |
| 11545 | peg$currPos = s0; |
| 11546 | s0 = peg$FAILED; |
| 11547 | } |
| 11548 | |
| 11549 | return s0; |
| 11550 | } |
| 11551 | |
| 11552 | function peg$parseFunctionalExistsCondition() { |
| 11553 | let s0, s1, s2, s3, s4, s5, s6, s7, s8, s9; |
no test coverage detected