()
| 309 | } |
| 310 | |
| 311 | function peg$parsearray() { |
| 312 | let s0, s1, s2, s3, s4, s5; |
| 313 | |
| 314 | s0 = peg$currPos; |
| 315 | s1 = []; |
| 316 | s2 = peg$currPos; |
| 317 | s3 = peg$parsestring(); |
| 318 | if (s3 !== peg$FAILED) { |
| 319 | peg$savedPos = s2; |
| 320 | s3 = peg$f0(s3); |
| 321 | } |
| 322 | s2 = s3; |
| 323 | if (s2 === peg$FAILED) { |
| 324 | s2 = peg$currPos; |
| 325 | if (input.charCodeAt(peg$currPos) === 91) { |
| 326 | s3 = peg$c0; |
| 327 | peg$currPos++; |
| 328 | } else { |
| 329 | s3 = peg$FAILED; |
| 330 | if (peg$silentFails === 0) { peg$fail(peg$e0); } |
| 331 | } |
| 332 | if (s3 !== peg$FAILED) { |
| 333 | s4 = peg$parsearray(); |
| 334 | if (input.charCodeAt(peg$currPos) === 93) { |
| 335 | s5 = peg$c1; |
| 336 | peg$currPos++; |
| 337 | } else { |
| 338 | s5 = peg$FAILED; |
| 339 | if (peg$silentFails === 0) { peg$fail(peg$e1); } |
| 340 | } |
| 341 | if (s5 !== peg$FAILED) { |
| 342 | peg$savedPos = s2; |
| 343 | s2 = peg$f1(s4); |
| 344 | } else { |
| 345 | peg$currPos = s2; |
| 346 | s2 = peg$FAILED; |
| 347 | } |
| 348 | } else { |
| 349 | peg$currPos = s2; |
| 350 | s2 = peg$FAILED; |
| 351 | } |
| 352 | } |
| 353 | while (s2 !== peg$FAILED) { |
| 354 | s1.push(s2); |
| 355 | s2 = peg$currPos; |
| 356 | s3 = peg$parsestring(); |
| 357 | if (s3 !== peg$FAILED) { |
| 358 | peg$savedPos = s2; |
| 359 | s3 = peg$f0(s3); |
| 360 | } |
| 361 | s2 = s3; |
| 362 | if (s2 === peg$FAILED) { |
| 363 | s2 = peg$currPos; |
| 364 | if (input.charCodeAt(peg$currPos) === 91) { |
| 365 | s3 = peg$c0; |
| 366 | peg$currPos++; |
| 367 | } else { |
| 368 | s3 = peg$FAILED; |
nothing calls this directly
no test coverage detected