All Classes and Interfaces
Class
Description
An input codec that generates pure chains.
A chart for storing intermediate results of the graph-chart solver.
A solver for compact weakly normal dominance graphs.
A
JFrame containing a GUI for visualising a
Chart of a dominance graph and
highlighting parts of it in a JDomGraph.This
ActionListener processes all actions
of one (and only one) ChartViewer.An annotation type for marking the constructor of a codec
class that should be used to construct new objects of this
class from the codec manager.
A registry and factory for codecs.
An annotation type for adding metadata to a codec class.
An annotation type for adding metadata to codec options.
This exception represents an error that occurs while registering
a codec.
Methods that are useful in the implementation of codecs.
A split source which computes the complete list of
splits for a subgraph.
The Utool main program for accessing the Domgraph functionality
in server mode.
This class encapsulates the GNU Getopt library and makes it more convenient
to use from Java programs.
An input codec for weakly normal dominance constraints in Oz syntax.
Token literal values and constants.
Token Manager.
An output codec for weakly normal dominance constraints in Oz syntax.
An output codec for pluggings in Oz syntax.
A representation of a dominance edge, as a pair of a source and
a target node.
A dominance graph.
This is a draft for a new chart-based layout algorithm.
A class to determine the coordinates of a node relative to the graph root.
An input codec for weakly normal dominance graphs in GXL syntax.
An output codec for arbitrary dominance graphs in GXL syntax.
A layout algorithm for a dominance graph represented by
a JDomGraph.
A class to determine the positions of nodes in a graph that
is a tree, relative to their direct parents.
Storing the general parameters (distances between
nodes and fragments).
Class to layout solved forms implementing the
NodeCursorInterface.An output codec that represents a dominance graph in the uDraw(Graph)
format.
An output codec that represents a dominance graph using the Dot
graph description language.
The data associated with an edge.
The data that can be stored in the edge of a dominance graph -- namely,
a name and an edge type.
An edge type.
An edge type -- either solid or dominance.
An example manager for facilitating access to example input files.
A parser exception that occurred while reading an examples
specification file.
Exit codes for Utool.
This is a class providing methods to mark Splits and Subgraphs
via a
ChartViewer.A fragment in a dominance graph.
A special part for the layout of a dominance graph.
A layout algorithm for a solved form of a dominance graph
represented by a
JDomGraph.Storing the general parameters (distances between
nodes and fragments).
Provides methods for accessing global properties of the Domgraph
system, such as the version number.
An experimental input codec for LFG-style Glue Semantics
axiom sets.
Token literal values and constants.
Token Manager.
A class to determine the coordinates of a node relative to the graph root.
A class to determine the coordinates of a node relative to the graph root.
A class to determine the positions of nodes in a graph that
is a tree, relative to their direct parents.
A class to determine the positions of nodes in a graph that
is a tree, relative to their direct parents.
An input codec for Hole Semantics.
Token literal values and constants.
Token Manager.
ImprovedJGraph<NodeType,NodeData extends INodeData<NodeType>,EdgeType,EdgeData extends IEdgeData<EdgeType>>
ImprovedJGraphAdapter<NodeType,NodeData extends INodeData<NodeType>,EdgeType,EdgeData extends IEdgeData<EdgeType>>
The abstract base class for all input codecs.
A Swing component that represents a labelled dominance graph.
A
JGraphLayoutAlgorithm designed to
leave the node and edge positions unchanged but
triggers the refreshing of the JGraph's
appearance so as to make color or font changes
visible.An exception that signals that an error occurred during a run of a layout algorithm.
An output codec for pluggings in Lisp syntax.
An exception representing semantic errors in codecs.
Token literal values and constants.
Token Manager.
The data associated with a node.
The data that can be stored in the node of a dominance graph -- namely,
a name, a label, and a node type.
A map which is used for storing the node labels of a labelled
dominance graph.
A node type.
A node type -- either labelled or unlabelled (i.e. non-hole or hole).
A split source which only computes the first split for each
subgraph.
The abstract base class for all output codecs.
An output codec for terms in Oz syntax.
This exception is thrown when parse errors are encountered.
This exception is thrown when parse errors are encountered.
This exception is thrown when parse errors are encountered.
This exception is thrown when parse errors are encountered.
This exception is thrown when parse errors are encountered.
This exception is thrown when parse errors are encountered.
This exception is thrown when parse errors are encountered.
An exception representing parsing errors of various types.
This contains several preferences for layouting and solving
graphs and a master object containing the general used
preferences.
An output codec for terms in Prolog syntax.
Token literal values and constants.
Token Manager.
An input codec for weakly normal dominance constraints in Oz syntax.
Token literal values and constants.
Token Manager.
Token literal values and constants.
Token Manager.
A layout algorithm for a solved form of a dominance graph
represented by a
JDomGraph.A class to determine the coordinates of a node relative to the graph root.
A class to determine the positions of nodes in a graph that
is a tree, relative to their direct parents.
An implementation of interface CharStream, where the stream is assumed to
contain only ASCII characters (without unicode processing).
An implementation of interface CharStream, where the stream is assumed to
contain only ASCII characters (without unicode processing).
An implementation of interface CharStream, where the stream is assumed to
contain only ASCII characters (without unicode processing).
An implementation of interface CharStream, where the stream is assumed to
contain only ASCII characters (without unicode processing).
An implementation of interface CharStream, where the stream is assumed to
contain only ASCII characters (without unicode processing).
An implementation of interface CharStream, where the stream is assumed to
contain only ASCII characters (without unicode processing).
An implementation of interface CharStream, where the stream is assumed to
contain only ASCII characters (without unicode processing).
An iterator over the different solved forms represented by
a
Chart.An exception that signals that the chart solver doesn't understand the dominance
graph it is given to solve.
A split in a dominance chart.
A utility class for computing the split of a free root.
An abstract superclass for classes that compute splits.
A generic output codec for terms.
Describes the input token stream.
Describes the input token stream.
Describes the input token stream.
Describes the input token stream.
Describes the input token stream.
Describes the input token stream.
Describes the input token stream.
Token Manager Error.
Token Manager Error.
Token Manager Error.
Token Manager Error.
Token Manager Error.
Token Manager Error.
Token Manager Error.
Storing the general parameters (distances between
nodes and fragments).
The main class of Ubench.
A class representing user-specific properties which are stored in a File
".utool" in the user's home directory.
The Utool main program for accessing the Domgraph functionality from the
command-line.