[Demetercop-info] my undergraduates

[<li...@cc...>]

Hi Jeff:

my undergraduates do manually what you do automatically.

What happens if the traversal methods are not written
using a systematic naming convention?

Can you handle that case too?

-- Karl


Help with hw 1:
http://www.ccs.neu.edu/home/lieber/com1205/f02/hw/1/

Execute the Unix command 

fgrep "_trv(" *.java

in the graph/gen subdirectory. 

We get:

Adj.java:    void allInh_Cd_graph_trv(CountingVisitor c) {
Adj.java:    vertex.allInh_Cd_graph_trv(c);
Adj.java:    ns.allInh_Cd_graph_trv(c);
Adj_list.java:    void allInh_Cd_graph_trv(CountingVisitor c) {  }
Alternat.java:    void allInh_Cd_graph_trv(CountingVisitor c) {
Alternat.java:    first.allInh_Cd_graph_trv(c);
Alternat.java:    second.allInh_Cd_graph_trv(c);
Any_vertex.java:    void allInh_Cd_graph_trv(CountingVisitor c) {  }
Any_vertex_list.java:    void allInh_Cd_graph_trv(CountingVisitor c) {  }
Cd_graph.java:    allInh_Cd_graph_trv(c);
Cd_graph.java:    void allInh_Cd_graph_trv(CountingVisitor c) {
Cd_graph.java:    first.allInh_Cd_graph_trv(c);
Cd_graph.java:    rest.allInh_Cd_graph_trv(c);
Construct.java:    void allInh_Cd_graph_trv(CountingVisitor c) {
Construct.java:    c_ns.allInh_Cd_graph_trv(c);
Empty.java:    void allInh_Cd_graph_trv(CountingVisitor c) {  }
Empty_cd_graph.java:    void allInh_Cd_graph_trv(CountingVisitor c) {  }
Labeled_vertex.java:    void allInh_Cd_graph_trv(CountingVisitor c) {
Labeled_vertex.java:    class_name.allInh_Cd_graph_trv(c);
Nany_vertex_list.java:    void allInh_Cd_graph_trv(CountingVisitor c) {
Nany_vertex_list.java:    first.allInh_Cd_graph_trv(c);
Nany_vertex_list.java:    rest.allInh_Cd_graph_trv(c);
Neighbors.java:    void allInh_Cd_graph_trv(CountingVisitor c) {  }
Syntax_vertex.java:    void allInh_Cd_graph_trv(CountingVisitor c) {  }
Vertex.java:    void allInh_Cd_graph_trv(CountingVisitor c) {


How can you succinctly describe this traversal program as 
a traversal specification?