Package org.antlr.runtime.tree

Examples of org.antlr.runtime.tree.Tree.toStringTree()

310
311
312
313
314
315
316
317
318
319
320
        QueryParser parser = QueryParserUtils.createParser(tokens);
        QueryParser.query_return result = parser.query();

        Tree ast = (Tree)result.getTree();

        System.out.println( ast.toStringTree() );
        TreePrinter.printTree((CommonTree) ast, 0);
        Assert.assertEquals(0, lexer.getNumberOfSyntaxErrors());
        return parser.getNumberOfSyntaxErrors();
    }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
        QueryParser parser = new QueryParser(tokens);
        QueryParser.query_return result = parser.query();

        Tree ast = (Tree)result.getTree();

        System.out.println( ast.toStringTree() );
        TreePrinter.printTree( (CommonTree)ast, 0 );
        Assert.assertEquals( 0, lexer.getNumberOfSyntaxErrors() );
        Assert.assertEquals( 0, parser.getNumberOfSyntaxErrors() );
    }
View Full Code Here
224
225
226
227
228
229
230
231
232
233
234
        QueryParser parser = new QueryParser(tokens);
        QueryParser.query_return result = parser.query();

        Tree ast = (Tree)result.getTree();

        System.out.println( ast.toStringTree() );
        TreePrinter.printTree( (CommonTree)ast, 0 );
        Assert.assertEquals( 0, lexer.getNumberOfSyntaxErrors() );
        Assert.assertEquals( 0, parser.getNumberOfSyntaxErrors() );
  
        Assert.assertEquals( "QUERY", ast.getText() );
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
        QueryParser parser = QueryParserUtils.createParser(tokens);
        QueryParser.query_return result = parser.query();

        Tree ast = (Tree)result.getTree();

        System.out.println( ast.toStringTree() );
        TreePrinter.printTree( (CommonTree)ast, 0 );

        CommonTreeNodeStream nodes = new CommonTreeNodeStream( ast );
        AstValidator walker = new AstValidator( nodes );
        AstValidator.query_return newResult = walker.query();
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
        QueryParser parser = new QueryParser(tokens);
        QueryParser.query_return result = parser.query();

        Tree ast = (Tree)result.getTree();

        System.out.println( ast.toStringTree() );
        TreePrinter.printTree( (CommonTree)ast, 0 );
        Assert.assertEquals( 0, lexer.getNumberOfSyntaxErrors() );
        Assert.assertEquals( 0, parser.getNumberOfSyntaxErrors() );
    }
View Full Code Here
315
316
317
318
319
320
321
322
323
324
325
        QueryParser parser = new QueryParser(tokens);
        QueryParser.query_return result = parser.query();

        Tree ast = (Tree)result.getTree();

        System.out.println( ast.toStringTree() );
        TreePrinter.printTree( (CommonTree)ast, 0 );
        Assert.assertEquals( 0, lexer.getNumberOfSyntaxErrors() );
        Assert.assertEquals( 0, parser.getNumberOfSyntaxErrors() );
  
        Assert.assertEquals( "QUERY", ast.getText() );
View Full Code Here
396
397
398
399
400
401
402
403
404
405
406
        QueryParser parser = QueryParserUtils.createParser(tokens);
        QueryParser.query_return result = parser.query();

        Tree ast = (Tree)result.getTree();

        System.out.println( ast.toStringTree() );
        TreePrinter.printTree((CommonTree) ast, 0);
        Assert.assertEquals(0, lexer.getNumberOfSyntaxErrors());
        return parser.getNumberOfSyntaxErrors();
    }
View Full Code Here
246
247
248
249
250
251
252
253
254
255
256
    }

    // Explore each sibling in this level
    for( int childNum = 1; childNum < tree.getChildCount(); childNum++ ) {
      child = tree.getChild(childNum);
      if( debug ) Gpr.debug("\t\tChild: " + child.toStringTree());
      String leaveName = child.getText();

      if( leaveName.equalsIgnoreCase("TERM") ) {
        LinguisticTerm linguisticTerm = fclTreeFuzzifyTerm(child, variable);
        variable.add(linguisticTerm);
View Full Code Here
372
373
374
375
376
377
378
379
380
381
382
    Value x[] = new Value[numberOfPoints];
    Value y[] = new Value[numberOfPoints];
    for( int childNum = 1; childNum < tree.getChildCount(); childNum++ ) {
      Tree child = tree.getChild(childNum);
      if( debug ) Gpr.debug("\t\tChild: " + child.toStringTree());
      String leaveName = child.getText();

      // It's a set of points? => Defines a piece-wise linear membership function
      if( leaveName.equalsIgnoreCase("POINT") ) {
        x[childNum - 1] = new Value(child.getChild(0), this); // Parse and add each point
View Full Code Here
380
381
382
383
384
385
386
387
388
389
390
      // It's a set of points? => Defines a piece-wise linear membership function
      if( leaveName.equalsIgnoreCase("POINT") ) {
        x[childNum - 1] = new Value(child.getChild(0), this); // Parse and add each point
        y[childNum - 1] = new Value(child.getChild(1), this);
        if( debug ) Gpr.debug("\t\tParsed point " + childNum + " x=" + x[childNum - 1] + ", y=" + y[childNum - 1]);
        if( (y[childNum - 1].getValue() < 0) || (y[childNum - 1].getValue() > 1) ) throw new RuntimeException("\n\tError parsing line " + child.getLine() + " character " + child.getCharPositionInLine() + ": Membership function out of range (should be between 0 and 1). Value: '" + y[childNum - 1] + "'\n\tTree: " + child.toStringTree());
      } else throw new RuntimeException("Unknown (or unimplemented) option : " + leaveName);
    }
    return new MembershipFunctionPieceWiseLinear(x, y);
  }
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.