Package org.openntf.formula.ast

Examples of org.openntf.formula.ast.ASTOperator


        break;
      default:
        jj_la1[15] = jj_gen;
        break label_7;
      }
      ASTOperator jjtn001 = new ASTOperator(this, JJTOPERATOR);
      boolean jjtc001 = true;
      jjtree.openNodeScope(jjtn001);
      try {
        switch ((jj_ntk == -1) ? jj_ntk() : jj_ntk) {
        case BoolAnd:
          jj_consume_token(BoolAnd);
          opNot();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("&");
          break;
        case BoolOr:
          jj_consume_token(BoolOr);
          opNot();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("|");
          break;
        default:
          jj_la1[16] = jj_gen;
          jj_consume_token(-1);
          throw new ParseException();
View Full Code Here


  }

  final private void opHasNot() throws ParseException {
    jj_consume_token(BoolNot);
    opNot();
    ASTOperator jjtn001 = new ASTOperator(this, JJTOPERATOR);
    boolean jjtc001 = true;
    jjtree.openNodeScope(jjtn001);
    try {
      jjtree.closeNodeScope(jjtn001, 1);
      jjtc001 = false;
      jjtn001.init(" !");
    } finally {
      if (jjtc001) {
        jjtree.closeNodeScope(jjtn001, 1);
      }
    }
View Full Code Here

        break;
      default:
        jj_la1[18] = jj_gen;
        break label_8;
      }
      ASTOperator jjtn001 = new ASTOperator(this, JJTOPERATOR);
      boolean jjtc001 = true;
      jjtree.openNodeScope(jjtn001);
      try {
        switch ((jj_ntk == -1) ? jj_ntk() : jj_ntk) {
        case CmpEqual:
          jj_consume_token(CmpEqual);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("=");
          break;
        case CmpEqualP:
          jj_consume_token(CmpEqualP);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*=");
          break;
        case CmpNE:
          jj_consume_token(CmpNE);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("<>");
          break;
        case CmpNEP:
          jj_consume_token(CmpNEP);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*<>");
          break;
        case CmpLT:
          jj_consume_token(CmpLT);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("<");
          break;
        case CmpLTP:
          jj_consume_token(CmpLTP);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*<");
          break;
        case CmpGT:
          jj_consume_token(CmpGT);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init(">");
          break;
        case CmpGTP:
          jj_consume_token(CmpGTP);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*>");
          break;
        case CmpLTE:
          jj_consume_token(CmpLTE);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("<=");
          break;
        case CmpLTEP:
          jj_consume_token(CmpLTEP);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*<=");
          break;
        case CmpGTE:
          jj_consume_token(CmpGTE);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init(">=");
          break;
        case CmpGTEP:
          jj_consume_token(CmpGTEP);
          opAdd();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*>=");
          break;
        default:
          jj_la1[19] = jj_gen;
          jj_consume_token(-1);
          throw new ParseException();
View Full Code Here

      if (jj_2_4(2)) {
        ;
      } else {
        break label_9;
      }
      ASTOperator jjtn001 = new ASTOperator(this, JJTOPERATOR);
      boolean jjtc001 = true;
      jjtree.openNodeScope(jjtn001);
      try {
        switch ((jj_ntk == -1) ? jj_ntk() : jj_ntk) {
        case OpPlus:
          jj_consume_token(OpPlus);
          opMult();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("+");
          break;
        case OpPlusP:
          jj_consume_token(OpPlusP);
          opMult();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*+");
          break;
        case OpMinus:
          jj_consume_token(OpMinus);
          opMult();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("-");
          break;
        case OpMinusP:
          jj_consume_token(OpMinusP);
          opMult();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*-");
          break;
        default:
          jj_la1[20] = jj_gen;
          jj_consume_token(-1);
          throw new ParseException();
View Full Code Here

        break;
      default:
        jj_la1[21] = jj_gen;
        break label_10;
      }
      ASTOperator jjtn001 = new ASTOperator(this, JJTOPERATOR);
      boolean jjtc001 = true;
      jjtree.openNodeScope(jjtn001);
      try {
        switch ((jj_ntk == -1) ? jj_ntk() : jj_ntk) {
        case OpMul:
          jj_consume_token(OpMul);
          opSign();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*");
          break;
        case OpMulP:
          jj_consume_token(OpMulP);
          opSign();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("**");
          break;
        case OpDiv:
          jj_consume_token(OpDiv);
          opSign();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("/");
          break;
        case OpDivP:
          jj_consume_token(OpDivP);
          opSign();
          jjtree.closeNodeScope(jjtn001, 2);
          jjtc001 = false;
          jjtn001.init("*/");
          break;
        default:
          jj_la1[22] = jj_gen;
          jj_consume_token(-1);
          throw new ParseException();
View Full Code Here

      opSign();
      break;
    case OpMinus:
      jj_consume_token(OpMinus);
      opSign();
      ASTOperator jjtn001 = new ASTOperator(this, JJTOPERATOR);
      boolean jjtc001 = true;
      jjtree.openNodeScope(jjtn001);
      try {
        jjtree.closeNodeScope(jjtn001, 1);
        jjtc001 = false;
        jjtn001.init(" -");
      } finally {
        if (jjtc001) {
          jjtree.closeNodeScope(jjtn001, 1);
        }
      }
View Full Code Here

TOP

Related Classes of org.openntf.formula.ast.ASTOperator

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.