()
| 1250 | * Math For '+' '-', then Multiplication |
| 1251 | */ |
| 1252 | final public void Math() throws ParseException { |
| 1253 | Multiplication(); |
| 1254 | label_12: |
| 1255 | while (true) { |
| 1256 | switch ((jj_ntk == -1) ? jj_ntk_f() : jj_ntk) { |
| 1257 | case PLUS: |
| 1258 | case MINUS: { |
| 1259 | ; |
| 1260 | break; |
| 1261 | } |
| 1262 | default: |
| 1263 | jj_la1[27] = jj_gen; |
| 1264 | break label_12; |
| 1265 | } |
| 1266 | switch ((jj_ntk == -1) ? jj_ntk_f() : jj_ntk) { |
| 1267 | case PLUS: { |
| 1268 | jj_consume_token(PLUS); |
| 1269 | AstPlus jjtn001 = new AstPlus(JJTPLUS); |
| 1270 | boolean jjtc001 = true; |
| 1271 | jjtree.openNodeScope(jjtn001); |
| 1272 | try { |
| 1273 | Multiplication(); |
| 1274 | } catch (Throwable jjte001) { |
| 1275 | if (jjtc001) { |
| 1276 | jjtree.clearNodeScope(jjtn001); |
| 1277 | jjtc001 = false; |
| 1278 | } else { |
| 1279 | jjtree.popNode(); |
| 1280 | } |
| 1281 | if (jjte001 instanceof RuntimeException) { |
| 1282 | { |
| 1283 | if (true) { |
| 1284 | throw (RuntimeException) jjte001; |
| 1285 | } |
| 1286 | } |
| 1287 | } |
| 1288 | if (jjte001 instanceof ParseException) { |
| 1289 | { |
| 1290 | if (true) { |
| 1291 | throw (ParseException) jjte001; |
| 1292 | } |
| 1293 | } |
| 1294 | } |
| 1295 | { |
| 1296 | if (true) { |
| 1297 | throw (Error) jjte001; |
| 1298 | } |
| 1299 | } |
| 1300 | } finally { |
| 1301 | if (jjtc001) { |
| 1302 | jjtree.closeNodeScope(jjtn001, 2); |
| 1303 | } |
| 1304 | } |
| 1305 | break; |
| 1306 | } |
| 1307 | case MINUS: { |
| 1308 | jj_consume_token(MINUS); |
| 1309 | AstMinus jjtn002 = new AstMinus(JJTMINUS); |
no test coverage detected