kul 0.1.2

Parser for a unique textual notation that can be used as both a data format and a markup language and that has powerful extensibility of both lexical syntax and semantics. Inspired by the little-known Curl programming language. Has no unsafe code and has no external dependencies. This is the full crate that builds on and re-exports the core crate and that uses the std library.
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

use std::iter::FromIterator;

use kul::{
    Parser, Datum, Text as _,
    parser::CharClassifier,
    common::inmem
};


pub struct CustomCharClassifier;

impl CharClassifier for CustomCharClassifier {
    #[inline]
    fn is_nest_start(&self, c: char) -> bool {
        '⟪' == c
    }

    #[inline]
    fn is_nest_end(&self, c: char) -> bool {
        '⟫' == c
    }

    #[inline]
    fn is_nest_escape(&self, c: char) -> bool {
        '␛' == c
    }

    #[inline]
    fn is_whitespace(&self, c: char) -> bool {
        c.is_whitespace()
    }
}


fn main() {
    let input = r#"
Using non-default delimiters:

⟪⟪source-code Rust⟫
    use kul::common::inmem::parse_str;

    fn main() {
        let input = "Escaped the {bold non-default} delimiters: ␛⟪, ␛⟫, ␛␛";
        dbg!(parse_str(input));
    }
⟫
"#;
    let mut parser = Parser {
        classifier: CustomCharClassifier,
        allocator: inmem::DatumAllocator::<'_, ()>::default(),
        bindings: inmem::OperatorBindings::<'_, _, ()>::default(),
    };
    let ast = parser.parse(inmem::Text::from_str(input).iter()).collect::<Vec<_>>();
    dbg!(&ast);

    if let Ok(Datum::Combination{operands, ..}) = &ast[1] {
        if let Datum::List{elem, ..} = &**operands {
            if let Datum::Text(text) = &**elem {
                let selected = String::from_iter(text.chars());
                println!("\nSelected text:\n{}", selected);
            }
        }
    }
}