Examples of ParseTree

com.google.javascript.jscomp.parsing.parser.trees.ParseTree
An abstract syntax tree for JavaScript parse trees. Immutable. A plain old data structure. Should include data members and simple accessors only. Derived classes should have a 'Tree' suffix. Each concrete derived class should have a ParseTreeType whose name matches the derived class name. A parse tree derived from source should have a non-null location. A parse tree that is synthesized by the compiler may have a null location. When adding a new subclass of ParseTree you must also do the following: - add a new entry to ParseTreeType - add ParseTree.asXTree()
org.antlr.runtime.tree.ParseTree
A record of the rules used to match a token sequence. The tokens end up as the leaves of this tree and rule nodes are the interior nodes. This really adds no functionality, it is just an alias for CommonTree that is more meaningful (specific) and holds a String to display for a node.
org.antlr.runtime3_3_0.tree.ParseTree
A record of the rules used to match a token sequence. The tokens end up as the leaves of this tree and rule nodes are the interior nodes. This really adds no functionality, it is just an alias for CommonTree that is more meaningful (specific) and holds a String to display for a node.
org.antlr.v4.runtime.tree.ParseTree
An interface to access the tree of {@link RuleContext} objects createdduring a parse that makes the data structure look like a simple parse tree. This node represents both internal nodes, rule invocations, and leaf nodes, token matches.
The payload is either a {@link Token} or a {@link RuleContext} object.
org.eclipse.persistence.internal.libraries.antlr.runtime.tree.ParseTree
A record of the rules used to match a token sequence. The tokens end up as the leaves of this tree and rule nodes are the interior nodes. This really adds no functionality, it is just an alias for CommonTree that is more meaningful (specific) and holds a String to display for a node.

Examples of com.google.javascript.jscomp.parsing.parser.trees.ParseTree

      return newNode(Token.TEMPLATELIT_SUB, transform(tree.expression));
    }


    @Override
    Node processSwitchCase(CaseClauseTree caseNode) {
      ParseTree expr = caseNode.expression;
      Node node = newNode(Token.CASE, transform(expr));
      Node block = newNode(Token.BLOCK);
      block.putBooleanProp(Node.SYNTHETIC_BLOCK_PROP, true);
      setSourceInfo(block, caseNode);
      if (caseNode.statements != null) {

View Full Code Here

Examples of com.google.javascript.jscomp.parsing.parser.trees.ParseTree

      Node node = newNode(Token.TRY,
          transformBlock(statementNode.body));
      Node block = newNode(Token.BLOCK);
      boolean lineSet = false;


      ParseTree cc = statementNode.catchBlock;
      if (cc != null) {
        // Mark the enclosing block at the same line as the first catch
        // clause.
        setSourceInfo(block, cc);
        lineSet = true;
        block.addChildToBack(transform(cc));
      }


      node.addChildToBack(block);


      ParseTree finallyBlock = statementNode.finallyBlock;
      if (finallyBlock != null) {
        node.addChildToBack(transformBlock(finallyBlock));
      }


      // If we didn't set the line on the catch clause, then

View Full Code Here

Examples of com.google.javascript.jscomp.parsing.parser.trees.ParseTree

      case CONDITIONAL_EXPRESSION:
      case BINARY_OPERATOR:
      case MEMBER_EXPRESSION:
      case MEMBER_LOOKUP_EXPRESSION:
      case POSTFIX_EXPRESSION:
        ParseTree nearest = findNearestNode(tree);
        if (nearest.type == ParseTreeType.PAREN_EXPRESSION) {
          return false;
        }
        return true;
      default:

View Full Code Here

Examples of org.antlr.runtime.tree.ParseTree

            tokens.setTokenTypeChannel(lexer.getTokenType(tokenName), Token.HIDDEN_CHANNEL);
        }


        Interpreter parseEngine = new CustomInterpreter(parser, tokens);


        ParseTree t = null;
        try {
            if(ATEToken.isLexerName(startSymbol)) {
                t = lexEngine.parse(startSymbol);
            } else {
                t = parseEngine.parse(startSymbol);

View Full Code Here

Examples of org.antlr.runtime.tree.ParseTree

    if ( parser.getRule(startRule)==null ) {
      System.err.println("Rule "+startRule+" does not exist in "+grammarFileName);
      return;
    }
    Interpreter parseEngine = new Interpreter(parser, tokens);
    ParseTree t = parseEngine.parse(startRule);
    System.out.println(t.toStringTree());
  }

View Full Code Here

Examples of org.antlr.runtime.tree.ParseTree

  Stack callStack = new Stack();
  List hiddenTokens = new ArrayList();
  int backtracking = 0;


  public ParseTreeBuilder(String grammarName) {
    ParseTree root = create("<grammar "+grammarName+">");
    callStack.push(root);
  }

View Full Code Here

Examples of org.antlr.runtime.tree.ParseTree


  /**  What kind of node to create.  You might want to override
   *   so I factored out creation here.
   */
  public ParseTree create(Object payload) {
    return new ParseTree(payload);
  }

View Full Code Here

Examples of org.antlr.runtime.tree.ParseTree

  public void enterDecision(int d) { backtracking++; }
  public void exitDecision(int i) { backtracking--; }


  public void enterRule(String filename, String ruleName) {
    if ( backtracking>0 ) return;
    ParseTree parentRuleNode = (ParseTree)callStack.peek();
    ParseTree ruleNode = create(ruleName);
    parentRuleNode.addChild(ruleNode);
    callStack.push(ruleNode);
  }

View Full Code Here

Examples of org.antlr.runtime.tree.ParseTree

    callStack.push(ruleNode);
  }


  public void exitRule(String filename, String ruleName) {
    if ( backtracking>0 ) return;
    ParseTree ruleNode = (ParseTree)callStack.peek();
    if ( ruleNode.getChildCount()==0 ) {
      ruleNode.addChild(epsilonNode());
    }
    callStack.pop();    
  }

View Full Code Here

Examples of org.antlr.runtime.tree.ParseTree

    callStack.pop();    
  }


  public void consumeToken(Token token) {
    if ( backtracking>0 ) return;
    ParseTree ruleNode = (ParseTree)callStack.peek();
    ParseTree elementNode = create(token);
    elementNode.hiddenTokens = this.hiddenTokens;
    this.hiddenTokens = new ArrayList();
    ruleNode.addChild(elementNode);
  }

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.