lalrpop 0.15.2

convenient LR(1) 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

use grammar::parse_tree::*;
use grammar::pattern::*;
use lalrpop_util;
use tok;

#[allow(dead_code)]
mod lrgrammar;

#[cfg(test)]
mod test;

pub type ParseError<'input> = lalrpop_util::ParseError<usize, tok::Tok<'input>, tok::Error>;

pub fn parse_grammar<'input>(input: &'input str) -> Result<Grammar, ParseError<'input>> {
    let tokenizer = tok::Tokenizer::new(input, 0);
    let mut grammar = try!(lrgrammar::GrammarParser::new().parse(input, tokenizer));

    // find a unique prefix that does not appear anywhere in the input
    while input.contains(&grammar.prefix) {
        grammar.prefix.push('_');
    }

    Ok(grammar)
}

fn parse_pattern<'input>(
    input: &'input str,
    offset: usize,
) -> Result<Pattern<TypeRef>, ParseError<'input>> {
    let tokenizer = tok::Tokenizer::new(input, offset);
    lrgrammar::PatternParser::new().parse(input, tokenizer)
}

fn parse_match_mapping<'input>(
    input: &'input str,
    offset: usize,
) -> Result<MatchMapping, ParseError<'input>> {
    let tokenizer = tok::Tokenizer::new(input, offset);
    lrgrammar::MatchMappingParser::new().parse(input, tokenizer)
}

#[cfg(test)]
pub fn parse_type_ref<'input>(input: &'input str) -> Result<TypeRef, ParseError<'input>> {
    let tokenizer = tok::Tokenizer::new(input, 0);
    lrgrammar::TypeRefParser::new().parse(input, tokenizer)
}

#[cfg(test)]
pub fn parse_where_clauses<'input>(
    input: &'input str,
) -> Result<Vec<WhereClause<TypeRef>>, ParseError<'input>> {
    let tokenizer = tok::Tokenizer::new(input, 0);
    lrgrammar::GrammarWhereClausesParser::new().parse(input, tokenizer)
}