oak-lean 0.0.11

Lean theorem prover language parser with support for dependent types and formal verification.
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

/// Element types and tree structure definitions for Lean.
pub mod element_type;

use crate::{language::LeanLanguage, lexer::LeanLexer, parser::element_type::LeanElementType};
use oak_core::{
    parser::{ParseCache, ParseOutput, Parser, ParserState, parse_with_lexer},
    source::{Source, TextEdit},
};

pub(crate) type State<'a, S> = ParserState<'a, LeanLanguage, S>;

/// Parser implementation for the Lean language.
pub struct LeanParser<'config> {
    pub(crate) config: &'config LeanLanguage,
}

impl<'config> LeanParser<'config> {
    /// Creates a new instance of the Lean parser with the given configuration.
    pub fn new(config: &'config LeanLanguage) -> Self {
        Self { config }
    }
}

impl<'config> Parser<LeanLanguage> for LeanParser<'config> {
    fn parse<'a, S: Source + ?Sized>(&self, text: &'a S, edits: &[TextEdit], cache: &'a mut impl ParseCache<LeanLanguage>) -> ParseOutput<'a, LeanLanguage> {
        let lexer = LeanLexer::new(&self.config);
        parse_with_lexer(&lexer, text, edits, cache, |state| {
            let checkpoint = state.checkpoint();

            while state.not_at_end() {
                state.advance();
            }

            Ok(state.finish_at(checkpoint, LeanElementType::Root))
        })
    }
}