tuck5 0.2.0

A pragmatic lexer/parser generator
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
65
66
67
68
69
70
71
72
73

use super::*;
use test_case::test_case;

#[test_case("", "a"; "empty program")]
#[test_case("
%raw(a). it_works;
", "a"; "basic raw sequence")]
#[test_case("
%choose(raw(a), raw(b)). chosen;
", "abac"; "basic choose sequence")]
#[test_case("
%choose(choose(raw(a)), raw(b)). chosen;
", "abac"; "basic recursive choose sequence")]
#[test_case("
%mult(raw(a), raw(b)). seq;
", "abac"; "basic multiple sequence")]
#[test_case("
%mult(raw(a), opt(raw(b))). seq;
", "abac"; "basic optional sequence")]
#[test_case("
%mult(raw(a), repeat(raw(b))). seq;
", "ababbbbac"; "basic repeated sequence")]
#[test_case("
%raw(a). foo;
%raw(b). bar;
%mult(has(foo), has(bar)): baz;
", "baab"; "basic has_tag sequence")]
#[test_case("
%has(ws)~;
%mult(raw(a), raw(b)). ab;
", "a  
 b"; "basic whitespace removal")]
#[test_case("
%raw(a). foo, bar;
", "a"; "more than one tag")]
#[test_case("
%raw(a). foo;
%raw(b). bar;
%foo & bar: baz;
", "baab"; "sugared has_tag sequence")]
#[test_case("
%'a'. it_works;
", "a"; "sugared raw sequence")]
#[test_case("
%a..c. it_works;
", "abcd"; "sugared range sequence")]
#[test_case("
%a+. it_works;
", "a"; "sugared one or more sequence")]
#[test_case("
# pre-comment
%raw(a) # inline comment
. it_works;
", "a"; "comments")]
#[test_case("
## pre-comment with misleading code
%'a'. b;
##
%raw(a) ## inline comment ##
. it_works;
", "a"; "long comments")]
#[test_case("
%{.quote.}. quote;
", "quotea"; "quotes")]
#[test_case("
%'a' & ('b' & 'a')*. foo;
", "a aba ababa"; "many in parens sequence")]
#[test_case("
%'a' & ('b' & 'a')+. foo;
", "a aba ababa"; "one or more in parens sequence")]
pub fn eval_simple_prog(prog: &str, text: &str) {
    graph_with_tags(&eval_prog_from_text(prog, text));
}