Package antlr.collections.impl

Examples of antlr.collections.impl.ASTArray


      _cnt310++;
    } while (true);
    }
    if ( inputState.guessing==0 ) {
      closureList_AST = (AST)currentAST.root;
      closureList_AST = (AST)astFactory.make( (new ASTArray(2)).add(create(CLOSURE_LIST,"CLOSURE_LIST",first,LT(1))).add(closureList_AST));
      currentAST.root = closureList_AST;
      currentAST.child = closureList_AST!=null &&closureList_AST.getFirstChild()!=null ?
        closureList_AST.getFirstChild() : closureList_AST;
      currentAST.advanceChildToEnd();
    }
View Full Code Here


    do {
      if ((_tokenSet_87.member(LA(1))) && (_tokenSet_88.member(LA(2)))) {
        primaryExpression();
        pre_AST = (AST)returnAST;
        if ( inputState.guessing==0 ) {
          prev = (AST)astFactory.make( (new ASTArray(3)).add(create(DOT,".",prev)).add(prev).add(pre_AST));
        }
        {
        boolean synPredMatched375 = false;
        if (((_tokenSet_89.member(LA(1))) && (_tokenSet_90.member(LA(2))))) {
          int _m375 = mark();
View Full Code Here

    astFactory.addASTChild(currentAST, var_s_AST);
    match(STRING);
    if ( inputState.guessing==0 ) {
      quotedRegularExpression_AST = currentAST.root;
     
              quotedRegularExpression_AST = astFactory.make((new ASTArray(2)).add(new RegExNode(RegularExpression,var_s.getText(),caseSensitive,regex)).add(quotedRegularExpression_AST));
           
      currentAST.root = quotedRegularExpression_AST;
      currentAST.child = quotedRegularExpression_AST!=null &&quotedRegularExpression_AST.getFirstChild()!=null ?
        quotedRegularExpression_AST.getFirstChild() : quotedRegularExpression_AST;
      currentAST.advanceChildToEnd();
View Full Code Here

    astFactory.addASTChild(currentAST, var_s_AST);
    match(FIELDTYPE);
    if ( inputState.guessing==0 ) {
      simpleRegularExpression_AST = currentAST.root;
     
              simpleRegularExpression_AST = astFactory.make((new ASTArray(2)).add(new RegExNode(RegularExpression,var_s.getText(),caseSensitive,regex)).add(simpleRegularExpression_AST));
           
      currentAST.root = simpleRegularExpression_AST;
      currentAST.child = simpleRegularExpression_AST!=null &&simpleRegularExpression_AST.getFirstChild()!=null ?
        simpleRegularExpression_AST.getFirstChild() : simpleRegularExpression_AST;
      currentAST.advanceChildToEnd();
View Full Code Here

      match(LITERAL_and);
      condition();
      astFactory.addASTChild(currentAST, returnAST);
      if ( inputState.guessing==0 ) {
        condition_AST = currentAST.root;
        condition_AST = astFactory.make( (new ASTArray(2)).add(astFactory.create(And)).add(condition_AST));
        currentAST.root = condition_AST;
        currentAST.child = condition_AST!=null &&condition_AST.getFirstChild()!=null ?
          condition_AST.getFirstChild() : condition_AST;
        currentAST.advanceChildToEnd();
      }
      condition_AST = currentAST.root;
    }
    else {
      boolean synPredMatched82 = false;
      if (((_tokenSet_0.member(LA(1))) && (_tokenSet_1.member(LA(2))) && (_tokenSet_1.member(LA(3))))) {
        int _m82 = mark();
        synPredMatched82 = true;
        inputState.guessing++;
        try {
          {
          expression();
          match(LITERAL_or);
          condition();
          }
        }
        catch (RecognitionException pe) {
          synPredMatched82 = false;
        }
        rewind(_m82);
inputState.guessing--;
      }
      if ( synPredMatched82 ) {
        expression();
        astFactory.addASTChild(currentAST, returnAST);
        match(LITERAL_or);
        condition();
        astFactory.addASTChild(currentAST, returnAST);
        if ( inputState.guessing==0 ) {
          condition_AST = currentAST.root;
          condition_AST = astFactory.make( (new ASTArray(2)).add(astFactory.create(Or)).add(condition_AST));
          currentAST.root = condition_AST;
          currentAST.child = condition_AST!=null &&condition_AST.getFirstChild()!=null ?
            condition_AST.getFirstChild() : condition_AST;
          currentAST.advanceChildToEnd();
        }
View Full Code Here

        match(LITERAL_not);
        expressionSearch();
        astFactory.addASTChild(currentAST, returnAST);
        if ( inputState.guessing==0 ) {
          expression_AST = currentAST.root;
          expression_AST = astFactory.make( (new ASTArray(2)).add(astFactory.create(Not)).add(expression_AST));
          currentAST.root = expression_AST;
          currentAST.child = expression_AST!=null &&expression_AST.getFirstChild()!=null ?
            expression_AST.getFirstChild() : expression_AST;
          currentAST.advanceChildToEnd();
        }
        expression_AST = currentAST.root;
      }
      else if ((LA(1)==LITERAL_not) && (LA(2)==LPAREN)) {
        match(LITERAL_not);
        match(LPAREN);
        condition();
        astFactory.addASTChild(currentAST, returnAST);
        match(RPAREN);
        if ( inputState.guessing==0 ) {
          expression_AST = currentAST.root;
          expression_AST = astFactory.make( (new ASTArray(2)).add(astFactory.create(Not)).add(expression_AST));
          currentAST.root = expression_AST;
          currentAST.child = expression_AST!=null &&expression_AST.getFirstChild()!=null ?
            expression_AST.getFirstChild() : expression_AST;
          currentAST.advanceChildToEnd();
        }
View Full Code Here

      astFactory.addASTChild(currentAST, returnAST);
      quotedRegularExpression(caseSensitive,regex);
      astFactory.addASTChild(currentAST, returnAST);
      if ( inputState.guessing==0 ) {
        expressionSearch_AST = currentAST.root;
        expressionSearch_AST = astFactory.make( (new ASTArray(2)).add(astFactory.create(ExpressionSearch)).add(expressionSearch_AST));
        currentAST.root = expressionSearch_AST;
        currentAST.child = expressionSearch_AST!=null &&expressionSearch_AST.getFirstChild()!=null ?
          expressionSearch_AST.getFirstChild() : expressionSearch_AST;
        currentAST.advanceChildToEnd();
      }
      expressionSearch_AST = currentAST.root;
    }
    else if ((LA(1)==FIELDTYPE) && (_tokenSet_2.member(LA(2))) && (LA(3)==STRING)) {
      simpleRegularExpression(false,true);
      astFactory.addASTChild(currentAST, returnAST);
      compareType();
      astFactory.addASTChild(currentAST, returnAST);
      quotedRegularExpression(caseSensitive,regex);
      astFactory.addASTChild(currentAST, returnAST);
      if ( inputState.guessing==0 ) {
        expressionSearch_AST = currentAST.root;
        expressionSearch_AST = astFactory.make( (new ASTArray(2)).add(astFactory.create(ExpressionSearch)).add(expressionSearch_AST));
        currentAST.root = expressionSearch_AST;
        currentAST.child = expressionSearch_AST!=null &&expressionSearch_AST.getFirstChild()!=null ?
          expressionSearch_AST.getFirstChild() : expressionSearch_AST;
        currentAST.advanceChildToEnd();
      }
      expressionSearch_AST = currentAST.root;
    }
    else if ((LA(1)==FIELDTYPE) && (_tokenSet_2.member(LA(2))) && (LA(3)==FIELDTYPE)) {
      simpleRegularExpression(false,true);
      astFactory.addASTChild(currentAST, returnAST);
      compareType();
      astFactory.addASTChild(currentAST, returnAST);
      simpleRegularExpression(caseSensitive,regex);
      astFactory.addASTChild(currentAST, returnAST);
      if ( inputState.guessing==0 ) {
        expressionSearch_AST = currentAST.root;
        expressionSearch_AST = astFactory.make( (new ASTArray(2)).add(astFactory.create(ExpressionSearch)).add(expressionSearch_AST));
        currentAST.root = expressionSearch_AST;
        currentAST.child = expressionSearch_AST!=null &&expressionSearch_AST.getFirstChild()!=null ?
          expressionSearch_AST.getFirstChild() : expressionSearch_AST;
        currentAST.advanceChildToEnd();
      }
      expressionSearch_AST = currentAST.root;
    }
    else if ((LA(1)==STRING) && (_tokenSet_2.member(LA(2))) && (LA(3)==FIELDTYPE)) {
      quotedRegularExpression(false,true);
      astFactory.addASTChild(currentAST, returnAST);
      compareType();
      astFactory.addASTChild(currentAST, returnAST);
      simpleRegularExpression(caseSensitive,regex);
      astFactory.addASTChild(currentAST, returnAST);
      if ( inputState.guessing==0 ) {
        expressionSearch_AST = currentAST.root;
        expressionSearch_AST = astFactory.make( (new ASTArray(2)).add(astFactory.create(ExpressionSearch)).add(expressionSearch_AST));
        currentAST.root = expressionSearch_AST;
        currentAST.child = expressionSearch_AST!=null &&expressionSearch_AST.getFirstChild()!=null ?
          expressionSearch_AST.getFirstChild() : expressionSearch_AST;
        currentAST.advanceChildToEnd();
      }
View Full Code Here

            }
        }
        if ( inputState.guessing == 0 )
        {
            parameterDeclarationList_AST = (AST) currentAST.root;
            parameterDeclarationList_AST = (AST) astFactory.make( (new ASTArray( 2 )).add( astFactory.create( PARAMETERS,
                                                                                                              "PARAMETERS" ) ).add( parameterDeclarationList_AST ) );
            currentAST.root = parameterDeclarationList_AST;
            currentAST.child = parameterDeclarationList_AST != null && parameterDeclarationList_AST.getFirstChild() != null ? parameterDeclarationList_AST.getFirstChild() : parameterDeclarationList_AST;
            currentAST.advanceChildToEnd();
        }
View Full Code Here

        declaratorBrackets( t_AST );
        pd_AST = (AST) returnAST;
        if ( inputState.guessing == 0 )
        {
            parameterDeclaration_AST = (AST) currentAST.root;
            parameterDeclaration_AST = (AST) astFactory.make( (new ASTArray( 4 )).add( astFactory.create( PARAMETER_DEF,
                                                                                                          "PARAMETER_DEF" ) ).add( pm_AST ).add( (AST) astFactory.make( (new ASTArray( 2 )).add( astFactory.create( TYPE,
                                                                                                                                                                                                                    "TYPE" ) ).add( pd_AST ) ) ).add( id_AST ) );
            currentAST.root = parameterDeclaration_AST;
            currentAST.child = parameterDeclaration_AST != null && parameterDeclaration_AST.getFirstChild() != null ? parameterDeclaration_AST.getFirstChild() : parameterDeclaration_AST;
            currentAST.advanceChildToEnd();
        }
View Full Code Here

            while ( true );
        }
        if ( inputState.guessing == 0 )
        {
            modifiers_AST = (AST) currentAST.root;
            modifiers_AST = (AST) astFactory.make( (new ASTArray( 2 )).add( astFactory.create( MODIFIERS,
                                                                                               "MODIFIERS" ) ).add( modifiers_AST ) );
            currentAST.root = modifiers_AST;
            currentAST.child = modifiers_AST != null && modifiers_AST.getFirstChild() != null ? modifiers_AST.getFirstChild() : modifiers_AST;
            currentAST.advanceChildToEnd();
        }
View Full Code Here

TOP

Related Classes of antlr.collections.impl.ASTArray

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.