Re-exports§
pub use cfg_classify as classify;pub use cfg_earley as earley;pub use cfg_generate as generate;pub use cfg_predict as predict;pub use cfg_sequence as sequence;
Modules§
- binarized_
cfg - Binarized rules are rules that have at most two symbols on the right-hand side. A binarized grammar contains only such rules.
- cfg
- history
- precedenced_
rule - Precedenced rules are built with the builder pattern.
- rhs_
closure - rule
- This module defines grammar rules. Each rule in a context-free grammar consists of a single symbol on its left-hand side and an array of symbols on its right-hand side. In this library, each rule carries additional value called “history.”
- rule_
container - symbol
Structs§
- Binarized
Cfg - Representation for grammars where right-hand sides of all rules have at most two symbols.
- Cfg
- Basic representation of context-free grammars.
- Symbol
- A common grammar symbol type.
- Symbol
Source - A source of numeric symbols.
Enums§
Traits§
- AsRule
Ref - Trait for rules of a context-free grammar.
- Rule
Container - Trait for rule and symbol containers.