sipha 3.0.0

PEG parser, syntax trees, and code generation
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

#![cfg(feature = "std")]

mod common;

use common::{expr_grammar, parse_doc, sexp};

#[test]
fn parses_expression_and_builds_tree() {
    let built = expr_grammar();
    let graph = built.as_graph();
    let doc = parse_doc(&graph, b"1+2*3");

    // Multiplication binds tighter than addition, so the tree should reflect:
    // expr: mul ('+' mul)*
    // mul: atom ('*' atom)*
    let got = sexp(doc.root());
    assert!(
        got.contains("ROOT") && got.contains("NUMBER"),
        "expected a structured tree, got: {got}"
    );
}

#[test]
fn trivia_is_skipped_between_tokens_in_parser_rules() {
    let built = expr_grammar();
    let graph = built.as_graph();
    let doc = parse_doc(&graph, b"1 + 2 * ( 3 + 4 )");
    let got = sexp(doc.root());

    // If trivia skipping is working, we should still get a successful parse and a semantic tree.
    assert!(got.contains("LPAREN") && got.contains("RPAREN"), "{got}");
}