mipl 0.2.1

Minimal Imperative Parsing 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
65
66
67

use crate::prelude::*;

/// Consume a sequence of tokens into a new parser while the
/// concrete parsers return something. Stop consuming once
/// all values are exhausted, or if one of then returned
/// `None`.
pub struct CollectIfSeq<Cp: ConcreteParser>(Cp);
impl<Cp> VariadicConcreteSubparser<Cp> for CollectIfSeq<Cp>
where
    Cp: ConcreteParser
{
    fn subparse
    (values: Vec<Cp::Input>, parser: &mut Parser) -> Parser
    where
    Cp: concrete_parser::ContainerCp
    {
        let mut tokens = Tokens::new_empty();
        
        for v in values {
            let cp = Cp::new(v);

            if let Some(token) = cp.try_next_token(parser) {
                tokens.add_token(token);
            }
        }

        Parser::new(tokens)
    }
}

/// Consume a sequence of tokens into a new parser **if**
/// the coming sequence of tokens match a sequence.
pub struct CollectIfExactSeq<Cp: ConcreteParser>(Cp);
impl<Cp> VariadicConcreteSubparser<Cp> for CollectIfExactSeq<Cp>
where 
    Cp: ConcreteParser
{
    fn subparse
    (values: Vec<Cp::Input>, parser: &mut Parser) -> Parser
    where
    Cp: concrete_parser::ContainerCp
    {
        let mut toks_buffer: Tokens = Tokens::new_empty();

        let mut exact: bool = true;
        
        for v in values {
            let cp = Cp::new(v);
            
            if let Some(token) = cp.try_next_token(parser) {
                toks_buffer.add_token(token)
            } else {
                if let Some(token) = parser.next() {
                    toks_buffer.add_token(token);
                }
                exact = false;
            }
        }

        if exact {
            Parser::new(toks_buffer)
        } else {
            parser.extend(toks_buffer);
            Parser::new_empty()
        }
    }
}