()
| 2040 | } |
| 2041 | |
| 2042 | final public void PostfixExpression() throws ParseException { |
| 2043 | Token t = null; |
| 2044 | if (jj_2_12(2147483647)) { |
| 2045 | PrimaryExpression(); |
| 2046 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 2047 | case INCR: |
| 2048 | t = jj_consume_token(INCR); |
| 2049 | break; |
| 2050 | case DECR: |
| 2051 | t = jj_consume_token(DECR); |
| 2052 | break; |
| 2053 | default: |
| 2054 | jj_la1[56] = jj_gen; |
| 2055 | jj_consume_token(-1); |
| 2056 | throw new ParseException(); |
| 2057 | } |
| 2058 | BSHUnaryExpression jjtn001 = new BSHUnaryExpression(JJTUNARYEXPRESSION); |
| 2059 | boolean jjtc001 = true; |
| 2060 | jjtree.openNodeScope(jjtn001); |
| 2061 | jjtreeOpenNodeScope(jjtn001); |
| 2062 | try { |
| 2063 | jjtree.closeNodeScope(jjtn001, 1); |
| 2064 | jjtc001 = false; |
| 2065 | jjtreeCloseNodeScope(jjtn001); |
| 2066 | jjtn001.kind = t.kind; jjtn001.postfix = true; |
| 2067 | } finally { |
| 2068 | if (jjtc001) { |
| 2069 | jjtree.closeNodeScope(jjtn001, 1); |
| 2070 | jjtreeCloseNodeScope(jjtn001); |
| 2071 | } |
| 2072 | } |
| 2073 | } else { |
| 2074 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 2075 | case BOOLEAN: |
| 2076 | case BYTE: |
| 2077 | case CHAR: |
| 2078 | case DOUBLE: |
| 2079 | case FALSE: |
| 2080 | case FLOAT: |
| 2081 | case INT: |
| 2082 | case LONG: |
| 2083 | case NEW: |
| 2084 | case NULL: |
| 2085 | case SHORT: |
| 2086 | case TRUE: |
| 2087 | case VOID: |
| 2088 | case INTEGER_LITERAL: |
| 2089 | case FLOATING_POINT_LITERAL: |
| 2090 | case CHARACTER_LITERAL: |
| 2091 | case STRING_LITERAL: |
| 2092 | case LONG_STRING_LITERAL: |
| 2093 | case IDENTIFIER: |
| 2094 | case LPAREN: |
| 2095 | PrimaryExpression(); |
| 2096 | break; |
| 2097 | default: |
| 2098 | jj_la1[57] = jj_gen; |
| 2099 | jj_consume_token(-1); |
no test coverage detected