()
| 4089 | } |
| 4090 | |
| 4091 | function peg$parseForToken() { |
| 4092 | var s0, s1, s2, s3; |
| 4093 | |
| 4094 | s0 = peg$currPos; |
| 4095 | if (input.substr(peg$currPos, 3) === peg$c198) { |
| 4096 | s1 = peg$c198; |
| 4097 | peg$currPos += 3; |
| 4098 | } else { |
| 4099 | s1 = peg$FAILED; |
| 4100 | if (peg$silentFails === 0) { peg$fail(peg$c199); } |
| 4101 | } |
| 4102 | if (s1 !== peg$FAILED) { |
| 4103 | s2 = peg$currPos; |
| 4104 | peg$silentFails++; |
| 4105 | s3 = peg$parseIdentifierPart(); |
| 4106 | peg$silentFails--; |
| 4107 | if (s3 === peg$FAILED) { |
| 4108 | s2 = void 0; |
| 4109 | } else { |
| 4110 | peg$currPos = s2; |
| 4111 | s2 = peg$FAILED; |
| 4112 | } |
| 4113 | if (s2 !== peg$FAILED) { |
| 4114 | s1 = [s1, s2]; |
| 4115 | s0 = s1; |
| 4116 | } else { |
| 4117 | peg$currPos = s0; |
| 4118 | s0 = peg$FAILED; |
| 4119 | } |
| 4120 | } else { |
| 4121 | peg$currPos = s0; |
| 4122 | s0 = peg$FAILED; |
| 4123 | } |
| 4124 | |
| 4125 | return s0; |
| 4126 | } |
| 4127 | |
| 4128 | function peg$parseFunctionToken() { |
| 4129 | var s0, s1, s2, s3; |
no test coverage detected
searching dependent graphs…