()
| 2915 | } |
| 2916 | |
| 2917 | function peg$parseHexEscapeSequence() { |
| 2918 | var s0, s1, s2, s3, s4, s5; |
| 2919 | |
| 2920 | s0 = peg$currPos; |
| 2921 | if (input.charCodeAt(peg$currPos) === 120) { |
| 2922 | s1 = peg$c124; |
| 2923 | peg$currPos++; |
| 2924 | } else { |
| 2925 | s1 = peg$FAILED; |
| 2926 | if (peg$silentFails === 0) { peg$fail(peg$c125); } |
| 2927 | } |
| 2928 | if (s1 !== peg$FAILED) { |
| 2929 | s2 = peg$currPos; |
| 2930 | s3 = peg$currPos; |
| 2931 | s4 = peg$parseHexDigit(); |
| 2932 | if (s4 !== peg$FAILED) { |
| 2933 | s5 = peg$parseHexDigit(); |
| 2934 | if (s5 !== peg$FAILED) { |
| 2935 | s4 = [s4, s5]; |
| 2936 | s3 = s4; |
| 2937 | } else { |
| 2938 | peg$currPos = s3; |
| 2939 | s3 = peg$FAILED; |
| 2940 | } |
| 2941 | } else { |
| 2942 | peg$currPos = s3; |
| 2943 | s3 = peg$FAILED; |
| 2944 | } |
| 2945 | if (s3 !== peg$FAILED) { |
| 2946 | s2 = input.substring(s2, peg$currPos); |
| 2947 | } else { |
| 2948 | s2 = s3; |
| 2949 | } |
| 2950 | if (s2 !== peg$FAILED) { |
| 2951 | peg$savedPos = s0; |
| 2952 | s1 = peg$c128(s2); |
| 2953 | s0 = s1; |
| 2954 | } else { |
| 2955 | peg$currPos = s0; |
| 2956 | s0 = peg$FAILED; |
| 2957 | } |
| 2958 | } else { |
| 2959 | peg$currPos = s0; |
| 2960 | s0 = peg$FAILED; |
| 2961 | } |
| 2962 | |
| 2963 | return s0; |
| 2964 | } |
| 2965 | |
| 2966 | function peg$parseUnicodeEscapeSequence() { |
| 2967 | var s0, s1, s2, s3, s4, s5, s6, s7; |
no test coverage detected
searching dependent graphs…