()
| 2565 | } |
| 2566 | |
| 2567 | function peg$parseClassCharacter() { |
| 2568 | var s0, s1, s2; |
| 2569 | |
| 2570 | s0 = peg$currPos; |
| 2571 | s1 = peg$currPos; |
| 2572 | peg$silentFails++; |
| 2573 | if (input.charCodeAt(peg$currPos) === 93) { |
| 2574 | s2 = peg$c96; |
| 2575 | peg$currPos++; |
| 2576 | } else { |
| 2577 | s2 = peg$FAILED; |
| 2578 | if (peg$silentFails === 0) { peg$fail(peg$c97); } |
| 2579 | } |
| 2580 | if (s2 === peg$FAILED) { |
| 2581 | if (input.charCodeAt(peg$currPos) === 92) { |
| 2582 | s2 = peg$c73; |
| 2583 | peg$currPos++; |
| 2584 | } else { |
| 2585 | s2 = peg$FAILED; |
| 2586 | if (peg$silentFails === 0) { peg$fail(peg$c74); } |
| 2587 | } |
| 2588 | if (s2 === peg$FAILED) { |
| 2589 | s2 = peg$parseLineTerminator(); |
| 2590 | } |
| 2591 | } |
| 2592 | peg$silentFails--; |
| 2593 | if (s2 === peg$FAILED) { |
| 2594 | s1 = void 0; |
| 2595 | } else { |
| 2596 | peg$currPos = s1; |
| 2597 | s1 = peg$FAILED; |
| 2598 | } |
| 2599 | if (s1 !== peg$FAILED) { |
| 2600 | s2 = peg$parseSourceCharacter(); |
| 2601 | if (s2 !== peg$FAILED) { |
| 2602 | peg$savedPos = s0; |
| 2603 | s1 = peg$c90(); |
| 2604 | s0 = s1; |
| 2605 | } else { |
| 2606 | peg$currPos = s0; |
| 2607 | s0 = peg$FAILED; |
| 2608 | } |
| 2609 | } else { |
| 2610 | peg$currPos = s0; |
| 2611 | s0 = peg$FAILED; |
| 2612 | } |
| 2613 | if (s0 === peg$FAILED) { |
| 2614 | s0 = peg$currPos; |
| 2615 | if (input.charCodeAt(peg$currPos) === 92) { |
| 2616 | s1 = peg$c73; |
| 2617 | peg$currPos++; |
| 2618 | } else { |
| 2619 | s1 = peg$FAILED; |
| 2620 | if (peg$silentFails === 0) { peg$fail(peg$c74); } |
| 2621 | } |
| 2622 | if (s1 !== peg$FAILED) { |
| 2623 | s2 = peg$parseEscapeSequence(); |
| 2624 | if (s2 !== peg$FAILED) { |
no test coverage detected
searching dependent graphs…