lang_pt 0.1.2

A parser tool to generate recursive descent top down parser.
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

use crate::{ASTNode, SuccessData};

impl<I, TNode> SuccessData<I, TNode> {
    pub fn new(consumed_index: I, children: Vec<ASTNode<TNode>>) -> Self {
        Self {
            consumed_index,
            children,
        }
    }
    pub fn hidden(consumed_index: I) -> Self {
        Self {
            consumed_index,
            children: Vec::with_capacity(0),
        }
    }
    pub fn tree(consumed_index: I, tree: ASTNode<TNode>) -> Self {
        Self {
            consumed_index,
            children: vec![tree],
        }
    }

    pub fn range(&self) -> Option<(usize, usize)> {
        if self.children.len() > 0 {
            Some((
                self.children[0].start,
                self.children[self.children.len() - 1].end,
            ))
        } else {
            None
        }
    }
}