()
| 2677 | } |
| 2678 | |
| 2679 | function peg$parseATTRIBUTE_NAME() { |
| 2680 | var s0, s1, s2, s3, s4; |
| 2681 | |
| 2682 | s0 = peg$currPos; |
| 2683 | s1 = peg$currPos; |
| 2684 | if (peg$c64.test(input.charAt(peg$currPos))) { |
| 2685 | s2 = input.charAt(peg$currPos); |
| 2686 | peg$currPos++; |
| 2687 | } else { |
| 2688 | s2 = peg$FAILED; |
| 2689 | if (peg$silentFails === 0) { peg$fail(peg$c65); } |
| 2690 | } |
| 2691 | if (s2 !== peg$FAILED) { |
| 2692 | s3 = []; |
| 2693 | if (peg$c66.test(input.charAt(peg$currPos))) { |
| 2694 | s4 = input.charAt(peg$currPos); |
| 2695 | peg$currPos++; |
| 2696 | } else { |
| 2697 | s4 = peg$FAILED; |
| 2698 | if (peg$silentFails === 0) { peg$fail(peg$c67); } |
| 2699 | } |
| 2700 | while (s4 !== peg$FAILED) { |
| 2701 | s3.push(s4); |
| 2702 | if (peg$c66.test(input.charAt(peg$currPos))) { |
| 2703 | s4 = input.charAt(peg$currPos); |
| 2704 | peg$currPos++; |
| 2705 | } else { |
| 2706 | s4 = peg$FAILED; |
| 2707 | if (peg$silentFails === 0) { peg$fail(peg$c67); } |
| 2708 | } |
| 2709 | } |
| 2710 | if (s3 !== peg$FAILED) { |
| 2711 | s2 = [s2, s3]; |
| 2712 | s1 = s2; |
| 2713 | } else { |
| 2714 | peg$currPos = s1; |
| 2715 | s1 = peg$c3; |
| 2716 | } |
| 2717 | } else { |
| 2718 | peg$currPos = s1; |
| 2719 | s1 = peg$c3; |
| 2720 | } |
| 2721 | if (s1 !== peg$FAILED) { |
| 2722 | s1 = input.substring(s0, peg$currPos); |
| 2723 | } |
| 2724 | s0 = s1; |
| 2725 | |
| 2726 | return s0; |
| 2727 | } |
| 2728 | |
| 2729 | function peg$parseATTRIBUTE_VALUE() { |
| 2730 | var s0, s1, s2, s3, s4, s5; |
no test coverage detected
searching dependent graphs…