Examples of ASTVisitor

dtool.ast.ASTVisitor
Default generic visitor
org.apache.derby.iapi.sql.compile.ASTVisitor
ialize your visitor MyASTVisitor myVisitor = new MyASTVisitor(); myVisitor.initializeVisitor(); languageConnectionContext.setASTVisitor( myVisitor ); // then run your queries. ... // when you're done inspecting query trees, release resources and // remove your visitor languageConnectionContext.setASTVisitor( null ); myVisitor.teardownVisitor();
org.aspectj.org.eclipse.jdt.core.dom.ASTVisitor
A visitor for abstract syntax trees.
For each different concrete AST node type T there are a pair of methods:
- public boolean visit(T node) - Visits the given node to perform some arbitrary operation. If true is returned, the given node's child nodes will be visited next; however, if false is returned, the given node's child nodes will not be visited. The default implementation provided by this class does nothing and returns true (with the exception of {@link #visit(Javadoc) ASTVisitor.visit(Javadoc)}). Subclasses may reimplement this method as needed.
- public void endVisit(T node) - Visits the given node to perform some arbitrary operation. When used in the conventional way, this method is called after all of the given node's children have been visited (or immediately, if visit returned false). The default implementation provided by this class does nothing. Subclasses may reimplement this method as needed.
In addition, there are a pair of methods for visiting AST nodes in the abstract, regardless of node type:
- public void preVisit(ASTNode node) - Visits the given node to perform some arbitrary operation. This method is invoked prior to the appropriate type-specific visit method. The default implementation of this method does nothing. Subclasses may reimplement this method as needed.
- public void postVisit(ASTNode node) - Visits the given node to perform some arbitrary operation. This method is invoked after the appropriate type-specific endVisit method. The default implementation of this method does nothing. Subclasses may reimplement this method as needed.
For nodes with list-valued properties, the child nodes within the list are visited in order. For nodes with multiple properties, the child nodes are visited in the order that most closely corresponds to the lexical reading order of the source program. For instance, for a type declaration node, the child ordering is: name, superclass, superinterfaces, and body declarations.

While it is possible to modify the tree in the visitor, care is required to ensure that the consequences are as expected and desirable. During the course of an ordinary visit starting at a given node, every node in the subtree is visited exactly twice, first with visit and then with endVisit. During a traversal of a stationary tree, each node is either behind (after endVisit), ahead (before visit), or in progress (between visit and the matching endVisit). Changes to the "behind" region of the tree are of no consequence to the visit in progress. Changes to the "ahead" region will be taken in stride. Changes to the "in progress" portion are the more interesting cases. With a node, the various properties are arranged in a linear list, with a cursor that separates the properties that have been visited from the ones that are still to be visited (the cursor is between the elements, rather than on an element). The cursor moves from the head to the tail of this list, advancing to the next position just before visit if called for that child. After the child subtree has been completely visited, the visit moves on the child immediately after the cursor. Removing a child while it is being visited does not alter the course of the visit. But any children added at positions after the cursor are considered in the "ahead" portion and will be visited.

Cases to watch out for:
- Moving a child node further down the list. This could result in the child subtree being visited multiple times; these visits are sequential.
- Moving a child node up into an ancestor. If the new home for the node is in the "ahead" portion, the subtree will be visited a second time; again, these visits are sequential.
- Moving a node down into a child. If the new home for the node is in the "ahead" portion, the subtree will be visited a second time; in this case, the visits will be nested. In some cases, this can lead to a stack overflow or out of memory condition.
Note that {@link LineComment} and {@link BlockComment} nodes arenot normally visited in an AST because they are not considered part of main structure of the AST. Use {@link CompilationUnit#getCommentList()} to find these additionalcomments nodes.
@see org.aspectj.org.eclipse.jdt.core.dom.ASTNode#accept(ASTVisitor)
org.eclipse.dltk.ast.ASTVisitor
org.eclipse.jdt.core.dom.ASTVisitor
A visitor for abstract syntax trees.
For each different concrete AST node type T there are a pair of methods:
- public boolean visit(T node) - Visits the given node to perform some arbitrary operation. If true is returned, the given node's child nodes will be visited next; however, if false is returned, the given node's child nodes will not be visited. The default implementation provided by this class does nothing and returns true (with the exception of {@link #visit(Javadoc) ASTVisitor.visit(Javadoc)}). Subclasses may reimplement this method as needed.
- public void endVisit(T node) - Visits the given node to perform some arbitrary operation. When used in the conventional way, this method is called after all of the given node's children have been visited (or immediately, if visit returned false). The default implementation provided by this class does nothing. Subclasses may reimplement this method as needed.
In addition, there are a pair of methods for visiting AST nodes in the abstract, regardless of node type:
- public void preVisit(ASTNode node) - Visits the given node to perform some arbitrary operation. This method is invoked prior to the appropriate type-specific visit method. The default implementation of this method does nothing. Subclasses may reimplement this method as needed.
- public void postVisit(ASTNode node) - Visits the given node to perform some arbitrary operation. This method is invoked after the appropriate type-specific endVisit method. The default implementation of this method does nothing. Subclasses may reimplement this method as needed.
For nodes with list-valued properties, the child nodes within the list are visited in order. For nodes with multiple properties, the child nodes are visited in the order that most closely corresponds to the lexical reading order of the source program. For instance, for a type declaration node, the child ordering is: name, superclass, superinterfaces, and body declarations.

While it is possible to modify the tree in the visitor, care is required to ensure that the consequences are as expected and desirable. During the course of an ordinary visit starting at a given node, every node in the subtree is visited exactly twice, first with visit and then with endVisit. During a traversal of a stationary tree, each node is either behind (after endVisit), ahead (before visit), or in progress (between visit and the matching endVisit). Changes to the "behind" region of the tree are of no consequence to the visit in progress. Changes to the "ahead" region will be taken in stride. Changes to the "in progress" portion are the more interesting cases. With a node, the various properties are arranged in a linear list, with a cursor that separates the properties that have been visited from the ones that are still to be visited (the cursor is between the elements, rather than on an element). The cursor moves from the head to the tail of this list, advancing to the next position just before visit if called for that child. After the child subtree has been completely visited, the visit moves on the child immediately after the cursor. Removing a child while it is being visited does not alter the course of the visit. But any children added at positions after the cursor are considered in the "ahead" portion and will be visited.

Cases to watch out for:
- Moving a child node further down the list. This could result in the child subtree being visited multiple times; these visits are sequential.
- Moving a child node up into an ancestor. If the new home for the node is in the "ahead" portion, the subtree will be visited a second time; again, these visits are sequential.
- Moving a node down into a child. If the new home for the node is in the "ahead" portion, the subtree will be visited a second time; in this case, the visits will be nested. In some cases, this can lead to a stack overflow or out of memory condition.
Note that {@link LineComment} and {@link BlockComment} nodes arenot normally visited in an AST because they are not considered part of main structure of the AST. Use {@link CompilationUnit#getCommentList()} to find these additionalcomments nodes.
@see org.eclipse.jdt.core.dom.ASTNode#accept(ASTVisitor)
org.eclipse.jdt.internal.compiler.ASTVisitor
A visitor for iterating through the parse tree.

Examples of dtool.ast.ASTVisitor

  
  /* ============= Structure Checkers ============= */
  
  public static void checkBasicStructureContracts(ASTNode parsedNode) {
    assertTrue(parsedNode.getParent() == null);
    parsedNode.accept(new ASTVisitor() {
      ASTNode parent = null;
      ASTNode lastVisitedNode = null;
      
      @Override
      public boolean preVisit(ASTNode node) {

View Full Code Here

Examples of dtool.ast.ASTVisitor

  @Override
  public void computeFoldableBlocks(IFoldingContent content) {
    Module deeModule = EditorUtil.getParsedModule_NoWaitInUI(content);
    
    if (deeModule != null) {
      deeModule.accept(new ASTVisitor() {
        
        @Override
        public boolean preVisit(ASTNode node) {
          switch (node.getNodeType()) {
          case DEFINITION_STRUCT:

View Full Code Here

Examples of dtool.ast.ASTVisitor

  }
  
  // TODO: this could be optimized
  protected static ArrayList<ParserError> collectErrors(final ArrayList<ParserError> errors, ASTNode node) {
    if(node != null) {
      node.accept(new ASTVisitor() {
        @Override
        public void postVisit(ASTNode node) {
          for (ParserError parserError : node.getData().getNodeErrors()) {
            errors.add(parserError);
          }

View Full Code Here

Examples of dtool.ast.ASTVisitor

        ParsedModule parseModule = DToolClient.getDefaultModuleCache().getParsedModuleOrNull(filePath);
        if(parseModule == null)
          return;
        
        Module module = parseModule.module;
        module.accept(new ASTVisitor() {
          @Override
          public boolean preVisit(ASTNode node) {
            visitNode(node, sourceModule);
            return true;
          }

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.ASTVisitor

  }


    /** Walk the AST, using a (user-supplied) Visitor */
    private void walkAST( LanguageConnectionContext lcc, Visitable queryTree, int phase ) throws StandardException
    {
        ASTVisitor visitor = lcc.getASTVisitor();
        if ( visitor != null )
        {
            visitor.begin( statementText, phase );
            queryTree.accept( visitor );
            visitor.end( phase );
        }
    }

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.ASTVisitor

  }


    /** Walk the AST, using a (user-supplied) Visitor */
    private void walkAST( LanguageConnectionContext lcc, Visitable queryTree, int phase ) throws StandardException
    {
        ASTVisitor visitor = lcc.getASTVisitor();
        if ( visitor != null )
        {
            visitor.begin( statementText, phase );
            queryTree.accept( visitor );
            visitor.end( phase );
        }
    }

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.ASTVisitor

  }


    /** Walk the AST, using a (user-supplied) Visitor */
    private void walkAST( LanguageConnectionContext lcc, Visitable queryTree, int phase ) throws StandardException
    {
        ASTVisitor visitor = lcc.getASTVisitor();
        if ( visitor != null )
        {
            visitor.begin( statementText, phase );
            queryTree.accept( visitor );
            visitor.end( phase );
        }
    }

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.ASTVisitor

  }


    /** Walk the AST, using a (user-supplied) Visitor */
    private void walkAST( LanguageConnectionContext lcc, Visitable queryTree, int phase ) throws StandardException
    {
        ASTVisitor visitor = lcc.getASTVisitor();
        if ( visitor != null )
        {
            visitor.begin( statementText, phase );
            queryTree.accept( visitor );
            visitor.end( phase );
        }
    }

View Full Code Here

Examples of org.aspectj.org.eclipse.jdt.core.dom.ASTVisitor

    TargetSourceRangeComputer sourceRangeComputer= getExtendedSourceRangeComputer();
    this.eventStore.prepareMovedNodes(sourceRangeComputer);
    
    // AspectJ extension - ask the factory in ASTRewriteAnalyzer for a visitor rather than building it directly.
    // ASTRewriteAnalyzer visitor= new ASTRewriteAnalyzer(content, lineInfo, lineDelim, result, this.eventStore, this.nodeStore, commentNodes, options, sourceRangeComputer);
    ASTVisitor visitor = ASTRewriteAnalyzer.getAnalyzerVisitor(content, lineInfo, lineDelim, result, this.eventStore, this.nodeStore, commentNodes, options, sourceRangeComputer);
    // End AspectJ Extension
    
    rootNode.accept(visitor); // throws IllegalArgumentException
    
    this.eventStore.revertMovedNodes();

View Full Code Here

Examples of org.aspectj.org.eclipse.jdt.core.dom.ASTVisitor

    return document.get();
  }
  
  
  private ASTRewrite sortCompilationUnit(org.aspectj.org.eclipse.jdt.core.dom.CompilationUnit ast, final TextEditGroup group) {
    ast.accept(new ASTVisitor() {
      public boolean visit(org.aspectj.org.eclipse.jdt.core.dom.CompilationUnit compilationUnit) {
        List types = compilationUnit.types();
        for (Iterator iter = types.iterator(); iter.hasNext();) {
          AbstractTypeDeclaration typeDeclaration = (AbstractTypeDeclaration) iter.next();
          typeDeclaration.setProperty(CompilationUnitSorter.RELATIVE_ORDER, new Integer(typeDeclaration.getStartPosition()));
          compilationUnit.setProperty(CONTAINS_MALFORMED_NODES, Boolean.valueOf(isMalformed(typeDeclaration)));
        }
        return true;
      }
      public boolean visit(AnnotationTypeDeclaration annotationTypeDeclaration) {
        List bodyDeclarations = annotationTypeDeclaration.bodyDeclarations();
        for (Iterator iter = bodyDeclarations.iterator(); iter.hasNext();) {
          BodyDeclaration bodyDeclaration = (BodyDeclaration) iter.next();
          bodyDeclaration.setProperty(CompilationUnitSorter.RELATIVE_ORDER, new Integer(bodyDeclaration.getStartPosition()));
          annotationTypeDeclaration.setProperty(CONTAINS_MALFORMED_NODES, Boolean.valueOf(isMalformed(bodyDeclaration)));
        }
        return true;
      }


      public boolean visit(AnonymousClassDeclaration anonymousClassDeclaration) {
        List bodyDeclarations = anonymousClassDeclaration.bodyDeclarations();
        for (Iterator iter = bodyDeclarations.iterator(); iter.hasNext();) {
          BodyDeclaration bodyDeclaration = (BodyDeclaration) iter.next();
          bodyDeclaration.setProperty(CompilationUnitSorter.RELATIVE_ORDER, new Integer(bodyDeclaration.getStartPosition()));
          anonymousClassDeclaration.setProperty(CONTAINS_MALFORMED_NODES, Boolean.valueOf(isMalformed(bodyDeclaration)));
        }
        return true;
      }
      
      public boolean visit(TypeDeclaration typeDeclaration) {
        List bodyDeclarations = typeDeclaration.bodyDeclarations();
        for (Iterator iter = bodyDeclarations.iterator(); iter.hasNext();) {
          BodyDeclaration bodyDeclaration = (BodyDeclaration) iter.next();
          bodyDeclaration.setProperty(CompilationUnitSorter.RELATIVE_ORDER, new Integer(bodyDeclaration.getStartPosition()));
          typeDeclaration.setProperty(CONTAINS_MALFORMED_NODES, Boolean.valueOf(isMalformed(bodyDeclaration)));
        }
        return true;
      }


      public boolean visit(EnumDeclaration enumDeclaration) {
        List bodyDeclarations = enumDeclaration.bodyDeclarations();
        for (Iterator iter = bodyDeclarations.iterator(); iter.hasNext();) {
          BodyDeclaration bodyDeclaration = (BodyDeclaration) iter.next();
          bodyDeclaration.setProperty(CompilationUnitSorter.RELATIVE_ORDER, new Integer(bodyDeclaration.getStartPosition()));
          enumDeclaration.setProperty(CONTAINS_MALFORMED_NODES, Boolean.valueOf(isMalformed(bodyDeclaration)));
        }
        List enumConstants = enumDeclaration.enumConstants();
        for (Iterator iter = enumConstants.iterator(); iter.hasNext();) {
          EnumConstantDeclaration enumConstantDeclaration = (EnumConstantDeclaration) iter.next();
          enumConstantDeclaration.setProperty(CompilationUnitSorter.RELATIVE_ORDER, new Integer(enumConstantDeclaration.getStartPosition()));
          enumDeclaration.setProperty(CONTAINS_MALFORMED_NODES, Boolean.valueOf(isMalformed(enumConstantDeclaration)));
        }        
        return true;
      }
    });
    
    final ASTRewrite rewriter= ASTRewrite.create(ast.getAST()); 
    final boolean[] hasChanges= new boolean[] {false}; 
    
    ast.accept(new ASTVisitor() {
    
      private void sortElements(List elements, ListRewrite listRewrite) {
        if (elements.size() == 0)
          return;

View Full Code Here

0 1 2 3 4 5

TOP

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.