Package org.antlr.v4.runtime.tree

Examples of org.antlr.v4.runtime.tree.TerminalNode

222
223
224
225
226
227
228
229
230
231
232
233
    }

    List<TerminalNode> tokens = null;
    for (ParseTree o : children) {
      if ( o instanceof TerminalNode ) {
        TerminalNode tnode = (TerminalNode)o;
        Token symbol = tnode.getSymbol();
        if ( symbol.getType()==ttype ) {
          if ( tokens==null ) {
            tokens = new ArrayList<TerminalNode>();
          }
          tokens.add(tnode);
View Full Code Here
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
      throw new IllegalArgumentException("patternTree cannot be null");
    }

    // x and <ID>, x and y, or x and x; or could be mismatched types
    if ( tree instanceof TerminalNode && patternTree instanceof TerminalNode ) {
      TerminalNode t1 = (TerminalNode)tree;
      TerminalNode t2 = (TerminalNode)patternTree;
      ParseTree mismatchedNode = null;
      // both are tokens and they have same type
      if ( t1.getSymbol().getType() == t2.getSymbol().getType() ) {
        if ( t2.getSymbol() instanceof TokenTagToken ) { // x and <ID>
          TokenTagToken tokenTagToken = (TokenTagToken)t2.getSymbol();
          // track label->list-of-nodes for both token name and label (if any)
          labels.map(tokenTagToken.getTokenName(), tree);
          if ( tokenTagToken.getLabel()!=null ) {
            labels.map(tokenTagToken.getLabel(), tree);
          }
        }
        else if ( t1.getText().equals(t2.getText()) ) {
          // x and x
        }
        else {
          // x and y
          if (mismatchedNode == null) {
View Full Code Here
376
377
378
379
380
381
382
383
384
385
386
387
388
389
  /** Is {@code t} {@code (expr <expr>)} subtree? */
  protected RuleTagToken getRuleTagToken(ParseTree t) {
    if ( t instanceof RuleNode ) {
      RuleNode r = (RuleNode)t;
      if ( r.getChildCount()==1 && r.getChild(0) instanceof TerminalNode ) {
        TerminalNode c = (TerminalNode)r.getChild(0);
        if ( c.getSymbol() instanceof RuleTagToken ) {
//          System.out.println("rule tag subtree "+t.toStringTree(parser));
          return (RuleTagToken)c.getSymbol();
        }
      }
    }
    return null;
  }
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
31
32
  public Collection<ParseTree> evaluate(ParseTree t) {
    // return all children of t that match nodeName
    List<ParseTree> nodes = new ArrayList<ParseTree>();
    for (Tree c : Trees.getChildren(t)) {
      if ( c instanceof TerminalNode ) {
        TerminalNode tnode = (TerminalNode)c;
        if ( (tnode.getSymbol().getType() == tokenType && !invert) ||
           (tnode.getSymbol().getType() != tokenType && invert) )
        {
          nodes.add(tnode);
        }
      }
    }
View Full Code Here
558
559
560
561
562
563
564
565
566
567
    return visitChildren(ctx);
  }

  @Override
  public BinaryOperator visitComparison_predicate(SQLParser.Comparison_predicateContext ctx) {
    TerminalNode operator = (TerminalNode) ctx.comp_op().getChild(0);
    return new BinaryOperator(tokenToExprType(operator.getSymbol().getType()),
        visitNumeric_value_expression(ctx.left),
        visitNumeric_value_expression(ctx.right));
  }
View Full Code Here
572
573
574
575
576
577
578
579
580
581
582
583
584
585
    Expr left;
    Expr right;
    for (int i = 1; i < ctx.getChildCount(); i++) {
      left = current;
      TerminalNode operator = (TerminalNode) ctx.getChild(i++);
      right = visitTerm((TermContext) ctx.getChild(i));

      if (operator.getSymbol().getType() == PLUS) {
        current = new BinaryOperator(OpType.Plus, left, right);
      } else {
        current = new BinaryOperator(OpType.Minus, left, right);
      }
    }
View Full Code Here
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
    Expr left;
    Expr right;
    for (int i = 1; i < ctx.getChildCount(); i++) {
      left = current;
      TerminalNode operator = (TerminalNode) ctx.getChild(i++);
      right = visitNumeric_primary((Numeric_primaryContext) ctx.getChild(i));

      if (operator.getSymbol().getType() == MULTIPLY) {
        current = new BinaryOperator(OpType.Multiply, left, right);
      } else if (operator.getSymbol().getType() == DIVIDE) {
        current = new BinaryOperator(OpType.Divide, left, right);
      } else {
        current = new BinaryOperator(OpType.Modular, left, right);
      }
    }
View Full Code Here
629
630
631
632
633
634
635
636
637
638
    }
  }

  @Override
  public BinaryOperator visitComparison_predicate(SQLParser.Comparison_predicateContext ctx) {
    TerminalNode operator = (TerminalNode) ctx.comp_op().getChild(0);
    return new BinaryOperator(tokenToExprType(operator.getSymbol().getType()),
        visitRow_value_predicand(ctx.left),
        visitRow_value_predicand(ctx.right));
  }
View Full Code Here
643
644
645
646
647
648
649
650
651
652
653
654
655
656
    Expr left;
    Expr right;
    for (int i = 1; i < ctx.getChildCount(); i++) {
      left = current;
      TerminalNode operator = (TerminalNode) ctx.getChild(i++);
      right = visitTerm((TermContext) ctx.getChild(i));

      if (operator.getSymbol().getType() == PLUS) {
        current = new BinaryOperator(OpType.Plus, left, right);
      } else {
        current = new BinaryOperator(OpType.Minus, left, right);
      }
    }
View Full Code Here
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
    Expr left;
    Expr right;
    for (int i = 1; i < ctx.getChildCount(); i++) {
      left = current;
      TerminalNode operator = (TerminalNode) ctx.getChild(i++);
      right = visitFactor((FactorContext) ctx.getChild(i));

      if (operator.getSymbol().getType() == MULTIPLY) {
        current = new BinaryOperator(OpType.Multiply, left, right);
      } else if (operator.getSymbol().getType() == DIVIDE) {
        current = new BinaryOperator(OpType.Divide, left, right);
      } else {
        current = new BinaryOperator(OpType.Modular, left, right);
      }
    }
View Full Code Here
TOP

Related Classes of org.antlr.v4.runtime.tree.TerminalNode

  • com.bacoder.parser.core.Adapter
  • com.bacoder.parser.java.adapter.ExpressionAdapter
  • com.bacoder.parser.java.adapter.JavaAdapter
  • com.bacoder.parser.java.adapter.StatementAdapter
  • com.espertech.esper.epl.parse.ASTUtil
  • com.wesleyhome.math.equation.InfixEvaluator
  • org.antlr.runtime.ANTLRFileStream
  • org.antlr.runtime.ANTLRStringStream
  • org.antlr.runtime.CharStream
  • org.antlr.runtime.CommonToken
    • 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.