Class Dictionary: *.cd
-------------------------------

// class dictionary
Cd_graph = <first> Adj <rest> Adj_list.
Adj = <vertex> Vertex <ns> Neighbors ".".
Neighbors: Construct | Alternat.
Construct = "=" <c_ns> Any_vertex_list.
Alternat = ":" <first> Vertex "|" <second> Vertex.
Any_vertex : Labeled_vertex | Syntax_vertex.
Syntax_vertex = <string> String.
Labeled_vertex = "<" <label_name> Ident ">" 
                     <class_name> Vertex.
Adj_list: Cd_graph | Empty_cd_graph.
Any_vertex_list: Nany_vertex_list | Empty.
Nany_vertex_list = 
  <first> Any_vertex <rest> Any_vertex_list.
Empty = .
Empty_cd_graph = .
Vertex = <name> Ident.

ExplorationVisitor = <total> Integer.

Main = .

Behavior file: *.beh
--------------------------
Cd_graph {
  traversal goToAll(ExplorationVisitor e) {
    to *;
  }
}

ExplorationVisitor {
  before 
    {Vertex,Adj} 
   (@ System.out.println("Entering "
      + host.getClass().toString()); 
      this.set_total(new Integer( total.intValue() + 1)) ;
   @)
  after 
    {Vertex,Adj} 
   (@ System.out.println("Leaving "
      + host.getClass().toString()); @)                         
}

Main {
(@
  static public void main(String args[]) throws Exception {
    Cd_graph graph = Cd_graph.parse(System.in);

    ExplorationVisitor e = ExplorationVisitor.parse("0");
    graph.goToAll(e);
    int result = e.get_total().intValue();

    System.out.println("result = " + result );
    if(result == 11) {
		System.out.println("SUCCESS");
			 } else {
				     System.out.println("FAILURE");
					      }                                
    System.out.println("done");
  }
@)
}

input file: *.input
-------------------------
// class dictionary
A = <b> B.
B : C | D.
C = "c".
D = "d".


Output:


java Main < class-graph.input
Entering class Adj
Entering class Vertex
Leaving class Vertex
Entering class Vertex
Leaving class Vertex
Leaving class Adj
Entering class Adj
Entering class Vertex
Leaving class Vertex
Entering class Vertex
Leaving class Vertex
Entering class Vertex
Leaving class Vertex
Leaving class Adj
Entering class Adj
Entering class Vertex
Leaving class Vertex
Leaving class Adj
Entering class Adj
Entering class Vertex
Leaving class Vertex
Leaving class Adj
result = 11
SUCCESS
done