()
| 4126 | } |
| 4127 | |
| 4128 | function peg$parseFunctionToken() { |
| 4129 | var s0, s1, s2, s3; |
| 4130 | |
| 4131 | s0 = peg$currPos; |
| 4132 | if (input.substr(peg$currPos, 8) === peg$c200) { |
| 4133 | s1 = peg$c200; |
| 4134 | peg$currPos += 8; |
| 4135 | } else { |
| 4136 | s1 = peg$FAILED; |
| 4137 | if (peg$silentFails === 0) { peg$fail(peg$c201); } |
| 4138 | } |
| 4139 | if (s1 !== peg$FAILED) { |
| 4140 | s2 = peg$currPos; |
| 4141 | peg$silentFails++; |
| 4142 | s3 = peg$parseIdentifierPart(); |
| 4143 | peg$silentFails--; |
| 4144 | if (s3 === peg$FAILED) { |
| 4145 | s2 = void 0; |
| 4146 | } else { |
| 4147 | peg$currPos = s2; |
| 4148 | s2 = peg$FAILED; |
| 4149 | } |
| 4150 | if (s2 !== peg$FAILED) { |
| 4151 | s1 = [s1, s2]; |
| 4152 | s0 = s1; |
| 4153 | } else { |
| 4154 | peg$currPos = s0; |
| 4155 | s0 = peg$FAILED; |
| 4156 | } |
| 4157 | } else { |
| 4158 | peg$currPos = s0; |
| 4159 | s0 = peg$FAILED; |
| 4160 | } |
| 4161 | |
| 4162 | return s0; |
| 4163 | } |
| 4164 | |
| 4165 | function peg$parseIfToken() { |
| 4166 | var s0, s1, s2, s3; |
no test coverage detected
searching dependent graphs…