lalrpop 0.4.0

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

use lexer::dfa::{DFA, Kind, NFAIndex, START};
use lexer::re::Test;

pub fn interpret<'text>(dfa: &DFA, input: &'text str) -> Option<(NFAIndex, &'text str)> {
    let mut longest: Option<(NFAIndex, usize)> = None;
    let mut state_index = START;

    for (offset, ch) in input.char_indices() {
        let state = &dfa.states[state_index.0];

        let target =
            dfa.state(state_index).test_edges
                                  .iter()
                                  .filter_map(|&(test, target)| {
                                      if test.meets(Test::Char(ch)) {
                                          Some(target)
                                      } else {
                                          None
                                      }
                                  })
                                  .next();

        if let Some(target) = target {
            state_index = target;
        } else {
            state_index = state.other_edge;
        }

        match dfa.state(state_index).kind {
            Kind::Accepts(nfa) => { longest = Some((nfa, offset + ch.len_utf8())); }
            Kind::Reject => { break; }
            Kind::Neither => { }
        }
    }

    longest.map(|(index, offset)| (index, &input[..offset]))
}