|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface PairContainer
A container for critical pairs This interface represents the abstract class of a stategy. All classes which implements this interface are concrete strategies and can be used to confige the parser. This interface supports access to critical pairs.
Method Summary | |
---|---|
void |
addPairEventListener(ParserEventListener l)
Adds a PairEventListener. |
void |
clear()
Clears all container. |
void |
enableUseHostGraph(boolean enable,
Graph g)
|
ExcludePair |
getActiveExcludePair()
|
java.util.Hashtable<Rule,java.util.Hashtable<Rule,Pair<java.lang.Boolean,java.util.Vector<Pair<Pair<OrdinaryMorphism,OrdinaryMorphism>,Pair<OrdinaryMorphism,OrdinaryMorphism>>>>>> |
getContainer(int kind)
This container is a Hashtable with a rule as key. |
java.lang.Object |
getCritical(Rule r1,
Rule r2,
int kind)
Deprecated. replaced by getCriticalPair(Rule r1, Rule r2, int kind) |
java.util.Vector<Pair<Pair<OrdinaryMorphism,OrdinaryMorphism>,Pair<OrdinaryMorphism,OrdinaryMorphism>>> |
getCriticalPair(Rule r1,
Rule r2,
int kind)
Computes the critical part of two rules. |
java.util.Vector<Pair<Pair<OrdinaryMorphism,OrdinaryMorphism>,Pair<OrdinaryMorphism,OrdinaryMorphism>>> |
getCriticalPair(Rule r1,
Rule r2,
int kind,
boolean local)
|
java.util.Vector<Pair<Pair<OrdinaryMorphism,OrdinaryMorphism>,Pair<OrdinaryMorphism,OrdinaryMorphism>>> |
getCriticalSet(int kind,
Rule rule)
This method computes which rules are in a relation of a special kind. |
GraGra |
getGrammar()
Returns the grammar the critical pairs a computed for. |
int |
getKindOfConflict()
Returns CriticalPair.CONFLICT or CriticalPair.DEPENDENCY constant. |
LayerFunction |
getLayer()
|
MorphCompletionStrategy |
getMorphCompletionStrategy()
|
int |
getNumberOfContainers()
Returns the number of containers for the critical pair. |
java.util.List<Rule> |
getRules()
|
void |
initAllContainer()
Initials all containers. |
boolean |
isAlive()
|
boolean |
isComputed()
|
boolean |
isEmpty()
|
void |
setComputeAsymetrically(boolean b)
|
void |
setGrammar(GraGra grammar)
Sets the graph grammar the critical pairs are computed for. |
void |
setMorphCompletionStrategy(MorphCompletionStrategy strat)
|
void |
setRules(java.util.List<Rule> ruleList)
|
void |
setStop(boolean b)
|
void |
stop()
|
boolean |
useHostGraphEnabled()
|
boolean |
wasStopped()
|
Methods inherited from interface agg.util.XMLObject |
---|
XreadObject, XwriteObject |
Method Detail |
---|
java.util.Vector<Pair<Pair<OrdinaryMorphism,OrdinaryMorphism>,Pair<OrdinaryMorphism,OrdinaryMorphism>>> getCriticalPair(Rule r1, Rule r2, int kind) throws InvalidAlgorithmException
Vector
of overlaping graphs.
r1
- The first part of a critical pairr2
- The second part of a critical pairkind
- The kind of critical pair
InvalidAlgorithmException
- Thrown if a algorithm is desired which is not provided.java.util.Vector<Pair<Pair<OrdinaryMorphism,OrdinaryMorphism>,Pair<OrdinaryMorphism,OrdinaryMorphism>>> getCriticalPair(Rule r1, Rule r2, int kind, boolean local) throws InvalidAlgorithmException
InvalidAlgorithmException
java.lang.Object getCritical(Rule r1, Rule r2, int kind) throws InvalidAlgorithmException
getCriticalPair(Rule r1, Rule r2, int kind)
InvalidAlgorithmException
int getNumberOfContainers()
java.util.Hashtable<Rule,java.util.Hashtable<Rule,Pair<java.lang.Boolean,java.util.Vector<Pair<Pair<OrdinaryMorphism,OrdinaryMorphism>,Pair<OrdinaryMorphism,OrdinaryMorphism>>>>>> getContainer(int kind) throws InvalidAlgorithmException
Hashtable
with a rule as key. The
value will be a set of rules.
kind
- The kind of algorithm
InvalidAlgorithmException
- Thrown if a algorithm is desired which is not provided.java.util.Vector<Pair<Pair<OrdinaryMorphism,OrdinaryMorphism>,Pair<OrdinaryMorphism,OrdinaryMorphism>>> getCriticalSet(int kind, Rule rule) throws InvalidAlgorithmException
kind
- The kind of critical pairrule
- The rule which is the first part of a critical pair
InvalidAlgorithmException
- Thrown if a algorithm is desired which is not provided.void setGrammar(GraGra grammar)
grammar
- The graph grammar.GraGra getGrammar()
void setComputeAsymetrically(boolean b)
void setRules(java.util.List<Rule> ruleList)
java.util.List<Rule> getRules()
void setMorphCompletionStrategy(MorphCompletionStrategy strat)
MorphCompletionStrategy getMorphCompletionStrategy()
void initAllContainer()
void clear()
int getKindOfConflict()
void addPairEventListener(ParserEventListener l)
l
- The listener.LayerFunction getLayer()
boolean isAlive()
void stop()
void setStop(boolean b)
boolean wasStopped()
boolean isEmpty()
void enableUseHostGraph(boolean enable, Graph g)
boolean useHostGraphEnabled()
boolean isComputed()
ExcludePair getActiveExcludePair()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |