()
| 3508 | } |
| 3509 | |
| 3510 | function peg$parseIdentifierName() { |
| 3511 | var s0, s1, s2, s3, s4; |
| 3512 | |
| 3513 | peg$silentFails++; |
| 3514 | s0 = peg$currPos; |
| 3515 | s1 = peg$currPos; |
| 3516 | s2 = peg$parseIdentifierStart(); |
| 3517 | if (s2 !== peg$FAILED) { |
| 3518 | s3 = []; |
| 3519 | s4 = peg$parseIdentifierPart(); |
| 3520 | while (s4 !== peg$FAILED) { |
| 3521 | s3.push(s4); |
| 3522 | s4 = peg$parseIdentifierPart(); |
| 3523 | } |
| 3524 | if (s3 !== peg$FAILED) { |
| 3525 | s2 = [s2, s3]; |
| 3526 | s1 = s2; |
| 3527 | } else { |
| 3528 | peg$currPos = s1; |
| 3529 | s1 = peg$c3; |
| 3530 | } |
| 3531 | } else { |
| 3532 | peg$currPos = s1; |
| 3533 | s1 = peg$c3; |
| 3534 | } |
| 3535 | if (s1 !== peg$FAILED) { |
| 3536 | s1 = input.substring(s0, peg$currPos); |
| 3537 | } |
| 3538 | s0 = s1; |
| 3539 | peg$silentFails--; |
| 3540 | if (s0 === peg$FAILED) { |
| 3541 | s1 = peg$FAILED; |
| 3542 | if (peg$silentFails === 0) { peg$fail(peg$c115); } |
| 3543 | } |
| 3544 | |
| 3545 | return s0; |
| 3546 | } |
| 3547 | |
| 3548 | function peg$parseIdentifierStart() { |
| 3549 | var s0, s1, s2; |
no test coverage detected
searching dependent graphs…