compactp_parser 0.1.0-beta.1

Recursive-descent parser for the Compact language producing a lossless CST and structured diagnostics.
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

use criterion::{Criterion, criterion_group, criterion_main};

fn bench_lex_small(c: &mut Criterion) {
    let source = "pragma language_version >= 0.23.0;\nexport ledger count: Counter;\nexport circuit increment(): [] { count.increment(1); }\n";
    c.bench_function("lex small", |b| {
        b.iter(|| compactp_lexer::lex(source));
    });
}

fn bench_parse_small(c: &mut Criterion) {
    let source = "pragma language_version >= 0.23.0;\nexport ledger count: Counter;\nexport circuit increment(): [] { count.increment(1); }\n";
    c.bench_function("parse small", |b| {
        b.iter(|| compactp_parser::parse(source));
    });
}

fn bench_parse_medium(c: &mut Criterion) {
    // Build a moderately complex source file
    let mut source = String::from("pragma language_version >= 0.23.0;\n\n");
    for i in 0..20 {
        source.push_str(&format!(
            "export circuit func_{i}(x: Field, y: Field): Field {{\n  const result = x + y * {i} as Field;\n  return result;\n}}\n\n"
        ));
    }
    c.bench_function("parse medium (20 circuits)", |b| {
        b.iter(|| compactp_parser::parse(&source));
    });
}

criterion_group!(
    benches,
    bench_lex_small,
    bench_parse_small,
    bench_parse_medium
);
criterion_main!(benches);