Package org.sbml.jsbml

Examples of org.sbml.jsbml.ASTNode.addChild()


      case MINUS:
        jj_consume_token(MINUS);
        rightChild = TermLvl2();
      node = new ASTNode('-');
      node.addChild(leftChild);
      node.addChild(rightChild);
      leftChild = node;
        break;
      case BOOLEAN_LOGIC:
        t = jj_consume_token(BOOLEAN_LOGIC);
        rightChild = TermLvl2();
View Full Code Here


      else if (s.equalsIgnoreCase("xor"))
      {
        type = ASTNode.Type.LOGICAL_XOR;
      }
      node = new ASTNode(type);
      node.addChild(leftChild);
      node.addChild(rightChild);
      leftChild = node;
        break;
      case COMPARISON:
        t = jj_consume_token(COMPARISON);
View Full Code Here

      {
        type = ASTNode.Type.LOGICAL_XOR;
      }
      node = new ASTNode(type);
      node.addChild(leftChild);
      node.addChild(rightChild);
      leftChild = node;
        break;
      case COMPARISON:
        t = jj_consume_token(COMPARISON);
        rightChild = TermLvl2();
View Full Code Here

      else if (s.equalsIgnoreCase("<="))
      {
        type = ASTNode.Type.RELATIONAL_LEQ;
      }
      node = new ASTNode(type);
      node.addChild(leftChild);
      node.addChild(rightChild);
      leftChild = node;
        break;
      default:
        jj_la1[7] = jj_gen;
View Full Code Here

      {
        type = ASTNode.Type.RELATIONAL_LEQ;
      }
      node = new ASTNode(type);
      node.addChild(leftChild);
      node.addChild(rightChild);
      leftChild = node;
        break;
      default:
        jj_la1[7] = jj_gen;
        jj_consume_token(-1);
View Full Code Here

    return node;
        case MINUS:
          jj_consume_token(MINUS);
          node = Primary();
    ASTNode uiMinus = new ASTNode('-');
    uiMinus.addChild(node);
    return uiMinus;
        case NOT:
          jj_consume_token(NOT);
          node = TermLvl1();
    ASTNode not = new ASTNode(Type.LOGICAL_NOT);
View Full Code Here

    return uiMinus;
        case NOT:
          jj_consume_token(NOT);
          node = TermLvl1();
    ASTNode not = new ASTNode(Type.LOGICAL_NOT);
    not.addChild(node);
    return not;
        case LOG:
          jj_consume_token(LOG);
          child = Primary();
    node = new ASTNode(Type.FUNCTION_LN);
View Full Code Here

  {
      ASTNode node = new ASTNode(ASTNode.Type.FUNCTION_PIECEWISE);

          ASTNode floorNode = new ASTNode(ASTNode.Type.FUNCTION_FLOOR);
          ASTNode aDividedByB = new ASTNode(ASTNode.Type.DIVIDE);
          aDividedByB.addChild(leftChild);
          aDividedByB.addChild(rightChild);

          floorNode.addChild(aDividedByB);
          node.addChild(floorNode);
View Full Code Here

      ASTNode node = new ASTNode(ASTNode.Type.FUNCTION_PIECEWISE);

          ASTNode floorNode = new ASTNode(ASTNode.Type.FUNCTION_FLOOR);
          ASTNode aDividedByB = new ASTNode(ASTNode.Type.DIVIDE);
          aDividedByB.addChild(leftChild);
          aDividedByB.addChild(rightChild);

          floorNode.addChild(aDividedByB);
          node.addChild(floorNode);

          ASTNode greaterThan = new ASTNode(ASTNode.Type.RELATIONAL_GT);
View Full Code Here

          floorNode.addChild(aDividedByB);
          node.addChild(floorNode);

          ASTNode greaterThan = new ASTNode(ASTNode.Type.RELATIONAL_GT);
          greaterThan.addChild(aDividedByB.clone());
          greaterThan.addChild(new ASTNode(0));

          node.addChild(greaterThan);

          ASTNode ceilNode = new ASTNode(ASTNode.Type.FUNCTION_CEILING);
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. 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.