5 releases
0.1.4 | Apr 14, 2023 |
---|---|
0.1.3 | Feb 8, 2023 |
0.1.2 | Mar 20, 2022 |
0.1.1 | Mar 18, 2022 |
0.1.0 | Mar 18, 2022 |
#2 in #successor
38 downloads per month
17KB
402 lines
ebnf
A successor bnf parsing library of bnf parsing library, for parsing Extended Backus–Naur form context-free grammars
The code is available on GitHub
Disclaimer:
There are various variants of EBNF, which uses somewhat different syntactic conventions. This library takes EBNF Evaluator's example code as standard, which has almost most syntactic conventions on Wikipedia's page.
What does a valid EBNF grammar looks like?
The following example is taken from EBNF Evaluator:
filter ::= ( first ' ' )? ( number '~ ' )? ( number '-' number ) ( ' ' number '~' )? ( ' hz' )? ( ' b' )? ( ' i' )? ( ' a' )?;
first ::= #'[a-za-z][a-za-z0-9_+]*';
number ::= digits ( ( '.' | ',' ) digits? )?;
digits ::= #'[0-9]+';
How to use this library?
extern crate ebnf;
fn main() {
let source = r"
filter ::= ( first ' ' )? ( number '~ ' )? ( number '-' number ) ( ' ' number '~' )? ( ' hz' )? ( ' b' )? ( ' i' )? ( ' a' )?;
first ::= #'[a-za-z][a-za-z0-9_+]*';
number ::= digits ( ( '.' | ',' ) digits? )?;
digits ::= #'[0-9]+';
";
let result = ebnf::get_grammar(source);
}
Dependencies
~1.8–2.6MB
~54K SLoC