public class BkvBinarizer extends Object
The input IRTG is binarized rule by rule. If a rule cannot be binarized, it is copied verbatim to the binarized IRTG. If the algebra does not support the operation symbols in the binarized rules, this rule will not be used when parsing with the binarized IRTG.
Modifier and Type | Class and Description |
---|---|
static interface |
BkvBinarizer.TreeWithPathVisitor<E,F> |
Constructor and Description |
---|
BkvBinarizer(Map<String,RegularSeed> regularSeeds) |
BkvBinarizer(Map<String,RegularSeed> regularSeeds,
Function<InterpretedTreeAutomaton,BinaryRuleFactory> ruleFactory) |
Modifier and Type | Method and Description |
---|---|
InterpretedTreeAutomaton |
binarize(InterpretedTreeAutomaton irtg,
Map<String,Algebra> newAlgebras) |
InterpretedTreeAutomaton |
binarize(InterpretedTreeAutomaton irtg,
Map<String,Algebra> newAlgebras,
ProgressListener listener) |
void |
setDebug(boolean debug) |
public BkvBinarizer(Map<String,RegularSeed> regularSeeds)
public BkvBinarizer(Map<String,RegularSeed> regularSeeds, Function<InterpretedTreeAutomaton,BinaryRuleFactory> ruleFactory)
public void setDebug(boolean debug)
public InterpretedTreeAutomaton binarize(InterpretedTreeAutomaton irtg, Map<String,Algebra> newAlgebras)
public InterpretedTreeAutomaton binarize(InterpretedTreeAutomaton irtg, Map<String,Algebra> newAlgebras, ProgressListener listener)
Copyright © 2017. All rights reserved.