Package org.antlr.misc

Examples of org.antlr.misc.Graph.addEdge()

73
74
75
76
77
78
79
80
81
82
83
    public void testRepeatedEdges() throws Exception {
        Graph g = new Graph();
        g.addEdge("A", "B");
        g.addEdge("B", "C");
        g.addEdge("A", "B"); // dup
        g.addEdge("C", "D");

        String expecting = "[D, C, B, A]";
        List nodes = g.sort();
        String result = nodes.toString();
        assertEquals(expecting, result);
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
    }

    @Test
    public void testSimpleTokenDependence() throws Exception {
        Graph g = new Graph();
        g.addEdge("Java.g", "MyJava.tokens"); // Java feeds off manual token file
        g.addEdge("Java.tokens", "Java.g");       
        g.addEdge("Def.g", "Java.tokens");    // walkers feed off generated tokens
        g.addEdge("Ref.g", "Java.tokens");

        String expecting = "[MyJava.tokens, Java.g, Java.tokens, Ref.g, Def.g]";
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
    @Test
    public void testSimpleTokenDependence() throws Exception {
        Graph g = new Graph();
        g.addEdge("Java.g", "MyJava.tokens"); // Java feeds off manual token file
        g.addEdge("Java.tokens", "Java.g");       
        g.addEdge("Def.g", "Java.tokens");    // walkers feed off generated tokens
        g.addEdge("Ref.g", "Java.tokens");

        String expecting = "[MyJava.tokens, Java.g, Java.tokens, Ref.g, Def.g]";
        List nodes = g.sort();
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
    @Test
    public void testSimpleTokenDependence() throws Exception {
        Graph g = new Graph();
        g.addEdge("Java.g", "MyJava.tokens"); // Java feeds off manual token file
        g.addEdge("Java.tokens", "Java.g");       
        g.addEdge("Def.g", "Java.tokens");    // walkers feed off generated tokens
        g.addEdge("Ref.g", "Java.tokens");

        String expecting = "[MyJava.tokens, Java.g, Java.tokens, Ref.g, Def.g]";
        List nodes = g.sort();
        String result = nodes.toString();
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
    public void testSimpleTokenDependence() throws Exception {
        Graph g = new Graph();
        g.addEdge("Java.g", "MyJava.tokens"); // Java feeds off manual token file
        g.addEdge("Java.tokens", "Java.g");       
        g.addEdge("Def.g", "Java.tokens");    // walkers feed off generated tokens
        g.addEdge("Ref.g", "Java.tokens");

        String expecting = "[MyJava.tokens, Java.g, Java.tokens, Ref.g, Def.g]";
        List nodes = g.sort();
        String result = nodes.toString();
        assertEquals(expecting, result);
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
    }

    @Test
    public void testParserLexerCombo() throws Exception {
        Graph g = new Graph();
        g.addEdge("JavaLexer.tokens", "JavaLexer.g");
        g.addEdge("JavaParser.g", "JavaLexer.tokens");
        g.addEdge("Def.g", "JavaLexer.tokens");
        g.addEdge("Ref.g", "JavaLexer.tokens");

        String expecting = "[JavaLexer.g, JavaLexer.tokens, JavaParser.g, Ref.g, Def.g]";
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
    @Test
    public void testParserLexerCombo() throws Exception {
        Graph g = new Graph();
        g.addEdge("JavaLexer.tokens", "JavaLexer.g");
        g.addEdge("JavaParser.g", "JavaLexer.tokens");
        g.addEdge("Def.g", "JavaLexer.tokens");
        g.addEdge("Ref.g", "JavaLexer.tokens");

        String expecting = "[JavaLexer.g, JavaLexer.tokens, JavaParser.g, Ref.g, Def.g]";
        List nodes = g.sort();
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
    @Test
    public void testParserLexerCombo() throws Exception {
        Graph g = new Graph();
        g.addEdge("JavaLexer.tokens", "JavaLexer.g");
        g.addEdge("JavaParser.g", "JavaLexer.tokens");
        g.addEdge("Def.g", "JavaLexer.tokens");
        g.addEdge("Ref.g", "JavaLexer.tokens");

        String expecting = "[JavaLexer.g, JavaLexer.tokens, JavaParser.g, Ref.g, Def.g]";
        List nodes = g.sort();
        String result = nodes.toString();
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
    public void testParserLexerCombo() throws Exception {
        Graph g = new Graph();
        g.addEdge("JavaLexer.tokens", "JavaLexer.g");
        g.addEdge("JavaParser.g", "JavaLexer.tokens");
        g.addEdge("Def.g", "JavaLexer.tokens");
        g.addEdge("Ref.g", "JavaLexer.tokens");

        String expecting = "[JavaLexer.g, JavaLexer.tokens, JavaParser.g, Ref.g, Def.g]";
        List nodes = g.sort();
        String result = nodes.toString();
        assertEquals(expecting, result);
View Full Code Here
551
552
553
554
555
556
557
558
559
560
561
                GrammarSpelunker grammar = new GrammarSpelunker(inputDirectory, gfile);
                grammar.parse();
                String vocabName = grammar.getTokenVocab();
                String grammarName = grammar.getGrammarName();
                // Make all grammars depend on any tokenVocab options
                if ( vocabName!=null ) g.addEdge(gfile, vocabName+CodeGenerator.VOCAB_FILE_EXTENSION);
                // Make all generated tokens files depend on their grammars
                g.addEdge(grammarName+CodeGenerator.VOCAB_FILE_EXTENSION, gfile);
            }
            catch (FileNotFoundException fnfe) {
                ErrorManager.error(ErrorManager.MSG_CANNOT_OPEN_FILE, gfile);
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.