cfg •

Rust library for manipulating context-free grammars. You can check the documentation here.

Analyzing and modifying grammars

The following features are implemented thus far:

• cycle detection and elimination,
• useless rule detection and elimination,
• grammar binarization,
• nulling rule elimination for binarized grammars,
• FIRST and FOLLOW set computation,
• minimal distance computation,
• unused symbol removal.

Building grammars

cfg includes an interface that simplifies grammar construction.

Generating symbols

The easiest way of generating symbols is with the sym method. The library is unaware of the start symbol.

rust let mut grammar: Cfg = Cfg::new(); let (start, expr, identifier, number, plus, multiply, power, l_paren, r_paren, digit) = grammar.sym();

Building grammar rules

Rules have a LHS symbol and zero or more RHS symbols.

rust grammar.rule(start).rhs([expr]) .rhs([identifier, l_paren, expr, r_paren]);

Building sequence rules

Sequence rules have a LHS symbol, a RHS symbol, a range of repetitions, and optional separation. Aside from separation, they closely resemble regular expression repetitions.

rust grammar.sequence(number).inclusive(1, None).rhs(digit);

Building precedenced rules

Precedenced rules are the most convenient way to describe operators. Once built, they are immediately rewritten into basic grammar rules, and unique symbols are generated. Operator associativity can be set to Right or Group. It's Left by default.

```rust use cfg::precedence::Associativity::{Right, Group};

grammar.precedencedrule(expr) .rhs([number]) .rhs([identifier]) .associativity(Group) .rhs([lparen, expr, rparen]) .lowerprecedence() .associativity(Right) .rhs([expr, power, expr]) .lowerprecedence() .rhs([expr, multiply, expr]) .lowerprecedence() .rhs([expr, plus, expr]); ```

Using a custom grammar representation

Your grammar type has to implement several traits:

• RuleContainer
• ContextFree
• ContextFreeRef
• ContextFreeMut

License

Dual-licensed for compatibility with the Rust project.

Licensed under the Apache License Version 2.0: http://www.apache.org/licenses/LICENSE-2.0, or the MIT license: http://opensource.org/licenses/MIT, at your option.