Package | Description |
---|---|
org.stekikun.dolmen.codegen |
Modifier and Type | Class and Description |
---|---|
static class |
DecisionTree.Impossible
A specific implementation of
DecisionTree to represents
empty transition tables |
static class |
DecisionTree.Return
An implementation of
DecisionTree which maps
some specific shifting action
to all possible characters. |
static class |
DecisionTree.Split
An implementation of
DecisionTree which represents
a binary choice with respect to some DecisionTree.Split.pivot character:
every character below or equal to the DecisionTree.Split.pivot
is mapped to the result of a recursive decision tree DecisionTree.Split.left
every character higher than the DecisionTree.Split.pivot
is mapped to the result of a recursive decision tree DecisionTree.Split.right
This implementation is used as an internal node to implement
binary decision trees. |
static class |
DecisionTree.Switch
An implementation of
DecisionTree which represents the
transition table as a switch mapping some character sets
to DFA.TransActions . |
static class |
DecisionTree.Table
An implementation of
DecisionTree which represents the transitions
from a contiguous set of characters, starting at character DecisionTree.Table.base ,
as an array of actions. |
Modifier and Type | Field and Description |
---|---|
DecisionTree |
DecisionTree.Split.left
The decision tree to use for characters
c <= pivot |
DecisionTree |
DecisionTree.Split.right
The decision tree to use for characters
c > pivot |
Modifier and Type | Method and Description |
---|---|
static DecisionTree |
DecisionTree.compile(TreeMap<CSet,DFA.TransActions> partition) |
static DecisionTree |
DecisionTree.simplify(DecisionTree tree)
This method tries to simplify the given tree in order to
obtain an equivalent decision tree by removing useless
parts.
|
static DecisionTree |
DecisionTree.split(char pivot,
DecisionTree left,
DecisionTree right) |
static DecisionTree |
DecisionTree.switchTable(TreeMap<CSet,DFA.TransActions> table) |
static DecisionTree |
DecisionTree.tabulated(char base,
@NonNull DFA.TransActions[] table) |
Modifier and Type | Method and Description |
---|---|
static DecisionTree |
DecisionTree.simplify(DecisionTree tree)
This method tries to simplify the given tree in order to
obtain an equivalent decision tree by removing useless
parts.
|
static DecisionTree |
DecisionTree.split(char pivot,
DecisionTree left,
DecisionTree right) |