Hi Shriram:

You are quite close.

The input to Demeter/Java consists of:

1. A class graph G (similar to a UML class diagram), 
   also defining a context-free grammar.
2. An adaptive program P consisting of:
   - Traversal specifications (called strategies)
   - Visitors, specifying the non-traversal operations to perform
     before, after or around each node or edge.
   - Glue code which links traversals and visitors. The glue code can take
     different forms by instantiating the visitors manually or by using
     so called adaptive methods which instantiate the visitors for you.

Demeter/Java will partially evaluate P with respect to G
and produce a Java program P(G).

-- Karl

>From shriram@cs.rice.edu Sat Feb 21 21:26:19 1998
>From: Shriram Krishnamurthi <shriram@cs.rice.edu>
>To: lieber@ccs.neu.edu
>Subject: Question about Demeter
>Reply-To: shriram@cs.rice.edu
>
>If I understand correctly, the input to Demeter (at least in the
>abstract) consists of three things:
>
>- a description of the class tree
>- traversal specifications
>- the non-traversal operations to perform at each node for each operation
>
>Is this correct?
>
>Thanks.
>
>'shriram
>