Package de.saar.chorus.domgraph.chart

package de.saar.chorus.domgraph.chart

Provides classes for working with dominance charts. Dominance charts are underspecified representations that are a bit more explicit (and potentially larger) than dominance graphs, but still exponentially smaller than the set of solved forms itself.

Roughly speaking, this package contains three types of classes:

• classes for representing dominance charts: Chart, Split;
• classes for computing dominance charts: ChartSolver and SplitSource and its subclasses;
• classes for enumerating solved forms from a dominance chart: SolvedFormIterator.

The lifecycle of a chart is as follows. You can compute it from a compact weakly normal dominance graph by calling a solve method of the class ChartSolver for the graph. You may then apply further operations to the chart, such as redundancy elimination. Finally you can extract the solved forms from a chart by creating a SolvedFormIterator for it.

Related Packages

Package	Description
de.saar.chorus.domgraph	Provides classes for accessing global properties of the system, such as the Domgraph version number and the example database.
de.saar.chorus.domgraph.chart.lethal
de.saar.chorus.domgraph.chart.rtgparser
de.saar.chorus.domgraph.chart.wrtg
de.saar.chorus.domgraph.codec	Provides basic classes for implementing codecs.
de.saar.chorus.domgraph.graph	Provides basic classes for representing labelled dominance graphs and basic algorithms running on them.
de.saar.chorus.domgraph.layout
de.saar.chorus.domgraph.utool	Provides the main programme for Utool.

Class	Description
Chart	A chart for storing intermediate results of the graph-chart solver.
ChartPresenter
ChartSolver<E extends GraphBasedNonterminal>	A solver for compact weakly normal dominance graphs.
CompleteSplitSource	A split source which computes the complete list of splits for a subgraph.
ConcreteRegularTreeGrammar<E>
DecoratedNonterminal<E extends GraphBasedNonterminal,DecorationType>
GraphBasedNonterminal
OneSplitSource	A split source which only computes the first split for each subgraph.
RegularTreeGrammar<E>
RewritingRtg<E>
RtgFreeFragmentAnalyzer<E extends GraphBasedNonterminal>
SolvedFormIterator<E extends GraphBasedNonterminal>	An iterator over the different solved forms represented by a Chart.
SolvedFormSpec
SolverNotApplicableException	An exception that signals that the chart solver doesn't understand the dominance graph it is given to solve.
Split<E>	A split in a dominance chart.
SplitComputer<E extends GraphBasedNonterminal>	A utility class for computing the split of a free root.
SplitSource<E extends GraphBasedNonterminal>	An abstract superclass for classes that compute splits.
SubgraphNonterminal
SubgraphSplitComputer
UnsolvableSubgraphException