// tg.cd -- class dictionary for Demeter traversal graphs
// $Id: tg.cd,v 1.6 2000/09/19 21:08:39 dougo Exp $

package edu.neu.ccs.demeter.common.tg;

import java.util.*;
import java.io.*;

noparse

interface public NameI = .
interface public StrategyGraphI = .

// Data structures for traversal graph calculation.
// Cycles here are cycles in the object graph too!
public ClassGraph = <vertices> DList(Vertex).
public Vertex	= <name> NameI *l +
		  "incoming:" *l + <incoming> List(Edge) - *l
		  "outgoing:" *l + <outgoing> List(Edge) - *l
		  "intercopy:" *s <intercopyEdges> List(Pair(int,int))
		  *s "mark:" *s <mark> Mark "." -.
public Edge	: CEdge | AEdge | IEdge
		 common "from:" <source> Vertex
			"to:" <dest> Vertex
			<mark> Mark *l.
public CEdge	= "->" *s <name> NameI.		// construction
public AEdge	= "=>" *s.			// alternation
public IEdge	= ":>" *s.			// inheritance

Mark	= <forw> BitSet <back> BitSet <both> BitSet.

public TraversalGraph = <vertices> Dictionary	// NameI -> Vertex
			<edges> Dictionary	// Edge -> Edge (i.e. a set)
			.

// Parameterized class definitions.
List(S) ~ "{" {*s S} "}".
DList(S) ~ S { *l *l S } *l .
Pair(X,Y) = "<" <x> X "," *s <y> Y ">".

visitors

// abstract visitors
public EdgePartsVisitor	: .