Uses of Class
de.saar.chorus.domgraph.chart.ConcreteRegularTreeGrammar
Packages that use ConcreteRegularTreeGrammar
Package
Description
Provides classes for working with dominance charts.
-
Uses of ConcreteRegularTreeGrammar in de.saar.chorus.domgraph.chart
Subclasses of ConcreteRegularTreeGrammar in de.saar.chorus.domgraph.chartModifier and TypeClassDescriptionclassA chart for storing intermediate results of the graph-chart solver.Methods in de.saar.chorus.domgraph.chart that return ConcreteRegularTreeGrammarModifier and TypeMethodDescriptionstatic <E> ConcreteRegularTreeGrammar<E>ConcreteRegularTreeGrammar.makeExplicit(RegularTreeGrammar<E> rtg) Methods in de.saar.chorus.domgraph.chart with parameters of type ConcreteRegularTreeGrammarModifier and TypeMethodDescription<F extends GraphBasedNonterminal>
voidRegularTreeGrammar.intersect(RegularTreeGrammar<F> other, ConcreteRegularTreeGrammar<DecoratedNonterminal<F, E>> out) Call this method on the filtering grammar and pass the grammar that is to be filtered as the argument.voidCompleteSplitSource.reduceIfNecessary(ConcreteRegularTreeGrammar<SubgraphNonterminal> chart) voidOneSplitSource.reduceIfNecessary(ConcreteRegularTreeGrammar<SubgraphNonterminal> chart) abstract voidSplitSource.reduceIfNecessary(ConcreteRegularTreeGrammar<E> chart) Reduces the computed RTG.static booleanChartSolver.solve(DomGraph graph, ConcreteRegularTreeGrammar<SubgraphNonterminal> chart) Solves the given dominance graph using aCompleteSplitSource.static <E extends GraphBasedNonterminal>
booleanChartSolver.solve(DomGraph graph, ConcreteRegularTreeGrammar<E> chart, SplitSource<E> splitsource) Solves the given dominance graph using a specific split source. -
Uses of ConcreteRegularTreeGrammar in de.saar.chorus.domgraph.chart.wrtg
Subclasses of ConcreteRegularTreeGrammar in de.saar.chorus.domgraph.chart.wrtgModifier and TypeClassDescriptionclassWeightedRegularTreeGrammar<E extends GraphBasedNonterminal,T extends Comparable<T>>