()
| 1912 | } |
| 1913 | |
| 1914 | final public void UnaryExpressionNotPlusMinus() throws ParseException { |
| 1915 | Token t = null; |
| 1916 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1917 | case BANG: |
| 1918 | case TILDE: |
| 1919 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1920 | case TILDE: |
| 1921 | t = jj_consume_token(TILDE); |
| 1922 | break; |
| 1923 | case BANG: |
| 1924 | t = jj_consume_token(BANG); |
| 1925 | break; |
| 1926 | default: |
| 1927 | jj_la1[51] = jj_gen; |
| 1928 | jj_consume_token(-1); |
| 1929 | throw new ParseException(); |
| 1930 | } |
| 1931 | UnaryExpression(); |
| 1932 | BSHUnaryExpression jjtn001 = new BSHUnaryExpression(JJTUNARYEXPRESSION); |
| 1933 | boolean jjtc001 = true; |
| 1934 | jjtree.openNodeScope(jjtn001); |
| 1935 | jjtreeOpenNodeScope(jjtn001); |
| 1936 | try { |
| 1937 | jjtree.closeNodeScope(jjtn001, 1); |
| 1938 | jjtc001 = false; |
| 1939 | jjtreeCloseNodeScope(jjtn001); |
| 1940 | jjtn001.kind = t.kind; |
| 1941 | } finally { |
| 1942 | if (jjtc001) { |
| 1943 | jjtree.closeNodeScope(jjtn001, 1); |
| 1944 | jjtreeCloseNodeScope(jjtn001); |
| 1945 | } |
| 1946 | } |
| 1947 | break; |
| 1948 | default: |
| 1949 | jj_la1[52] = jj_gen; |
| 1950 | if (jj_2_9(2147483647)) { |
| 1951 | CastExpression(); |
| 1952 | } else { |
| 1953 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1954 | case BOOLEAN: |
| 1955 | case BYTE: |
| 1956 | case CHAR: |
| 1957 | case DOUBLE: |
| 1958 | case FALSE: |
| 1959 | case FLOAT: |
| 1960 | case INT: |
| 1961 | case LONG: |
| 1962 | case NEW: |
| 1963 | case NULL: |
| 1964 | case SHORT: |
| 1965 | case TRUE: |
| 1966 | case VOID: |
| 1967 | case INTEGER_LITERAL: |
| 1968 | case FLOATING_POINT_LITERAL: |
| 1969 | case CHARACTER_LITERAL: |
| 1970 | case STRING_LITERAL: |
| 1971 | case LONG_STRING_LITERAL: |
no test coverage detected