bnf 0.6.0

A library for parsing Backus–Naur form context-free grammars
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

//! Example: Parse a tree from input using a `GrammarParser`
//!
//! This example demonstrates how to use a `GrammarParser` to parse an input string and print the resulting parse tree(s).
//! It uses the DNA grammar from the README and parses the input "GATTACA".

#![allow(clippy::print_stdout, clippy::print_stderr)]

use bnf::Grammar;

fn main() {
    // Define a simple BNF grammar for DNA sequences
    let bnf_input = r#"
        <dna> ::= <base> | <base> <dna>
        <base> ::= 'A' | 'C' | 'G' | 'T'
    "#;

    // Parse the BNF string into a Grammar object
    let grammar: Grammar = match bnf_input.parse() {
        Ok(g) => g,
        Err(e) => {
            eprintln!("Failed to create grammar from BNF string: {e}");
            return;
        }
    };

    // Create a parser from the grammar (validates all nonterminals are defined)
    let parser = match grammar.build_parser() {
        Ok(p) => p,
        Err(e) => {
            eprintln!("Failed to create parser: {e}");
            return;
        }
    };

    // Input string to parse
    let sentence = "GATTACA";
    println!("Parsing input: {sentence}");

    // Parse the input string using the parser
    let mut parse_trees = parser.parse_input(sentence);
    match parse_trees.next() {
        Some(parse_tree) => {
            println!("Parse tree:\n{parse_tree}");
        }
        None => {
            println!("Grammar could not parse the sentence");
        }
    }
}