()
| 1356 | * Multiplication For a bunch of them, then Unary |
| 1357 | */ |
| 1358 | final public void Multiplication() throws ParseException { |
| 1359 | Unary(); |
| 1360 | label_13: |
| 1361 | while (true) { |
| 1362 | switch ((jj_ntk == -1) ? jj_ntk_f() : jj_ntk) { |
| 1363 | case MULT: |
| 1364 | case DIV0: |
| 1365 | case DIV1: |
| 1366 | case MOD0: |
| 1367 | case MOD1: { |
| 1368 | ; |
| 1369 | break; |
| 1370 | } |
| 1371 | default: |
| 1372 | jj_la1[29] = jj_gen; |
| 1373 | break label_13; |
| 1374 | } |
| 1375 | switch ((jj_ntk == -1) ? jj_ntk_f() : jj_ntk) { |
| 1376 | case MULT: { |
| 1377 | jj_consume_token(MULT); |
| 1378 | AstMult jjtn001 = new AstMult(JJTMULT); |
| 1379 | boolean jjtc001 = true; |
| 1380 | jjtree.openNodeScope(jjtn001); |
| 1381 | try { |
| 1382 | Unary(); |
| 1383 | } catch (Throwable jjte001) { |
| 1384 | if (jjtc001) { |
| 1385 | jjtree.clearNodeScope(jjtn001); |
| 1386 | jjtc001 = false; |
| 1387 | } else { |
| 1388 | jjtree.popNode(); |
| 1389 | } |
| 1390 | if (jjte001 instanceof RuntimeException) { |
| 1391 | { |
| 1392 | if (true) { |
| 1393 | throw (RuntimeException) jjte001; |
| 1394 | } |
| 1395 | } |
| 1396 | } |
| 1397 | if (jjte001 instanceof ParseException) { |
| 1398 | { |
| 1399 | if (true) { |
| 1400 | throw (ParseException) jjte001; |
| 1401 | } |
| 1402 | } |
| 1403 | } |
| 1404 | { |
| 1405 | if (true) { |
| 1406 | throw (Error) jjte001; |
| 1407 | } |
| 1408 | } |
| 1409 | } finally { |
| 1410 | if (jjtc001) { |
| 1411 | jjtree.closeNodeScope(jjtn001, 2); |
| 1412 | } |
| 1413 | } |
| 1414 | break; |
| 1415 | } |
no test coverage detected