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

org.antlr.misc.Graph.sort()
DFS-based topological sort. A valid sort is the reverse of the post-order DFA traversal. Amazingly simple but true. For sorting, I'm not following convention here since ANTLR needs the opposite. Here's what I assume for sorting: If there exists an edge u → v then u depends on v and v must happen before u. So if this gives nonreversed postorder traversal, I get the order I want.

        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, Def.g, Ref.g]";
        List nodes = g.sort();
        String result = nodes.toString();
        assertEquals(expecting, result);
    }


    @Test

View Full Code Here

        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, Def.g, Ref.g]";
        List nodes = g.sort();
        String result = nodes.toString();
        assertEquals(expecting, result);
    }
}

View Full Code Here

0 1

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.