Expand description
Binarized rules are rules that have at most two symbols on the right-hand side. A binarized grammar contains only such rules.
Structs
- Representation for grammars where right-hand sides of all rules have at most two symbols.
- Compact representation of a binarized rule.
- A wrapper for iteration over rule refs.
- A wrapper for iteration over rule refs.
Enums
- Compact representation of a binarized rule’s RHS.
Type Aliases
- Iterator over binarized rules.
- A type for iteration over rule refs.