[−][src]Module cfg::binarized
Binarized rules are rules that have at most two symbols on the right-hand side. A binarized grammar contains only such rules.
Structs
| BinarizedCfg | Representation for grammars where right-hand sides of all rules have at most two symbols. |
| BinarizedRule | Compact representation of a binarized rule. |
| BinarizedRuleToRuleRef | A wrapper for iteration over rule refs. |
| LhsWithHistoryToRuleRef | A wrapper for iteration over rule refs. |
Enums
| BinarizedRuleRhs | Compact representation of a binarized rule's RHS. |
Type Definitions
| BinarizedRules | Iterator over binarized rules. |
| LhsWithHistory | A type for iteration over rule refs. |