oak-coq 0.0.11

Coq 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
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107

/// Element type definitions.
pub mod element_type;
pub use element_type::CoqElementType;

use crate::{
    language::CoqLanguage,
    lexer::{CoqLexer, token_type::CoqTokenType},
};
use oak_core::{
    GreenNode, OakError,
    parser::{ParseCache, ParseOutput, Parser, ParserState, parse_with_lexer},
    source::{Source, TextEdit},
};

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

/// Coq parser implementation.
pub struct CoqParser<'config> {
    #[allow(dead_code)]
    pub(crate) config: &'config CoqLanguage,
}

impl<'config> CoqParser<'config> {
    /// Creates a new Coq parser with the given language configuration.
    pub fn new(config: &'config CoqLanguage) -> Self {
        Self { config }
    }

    /// Parses a declaration (Theorem, Lemma, Definition).
    fn parse_declaration<'a, S: Source + ?Sized>(&self, state: &mut State<'a, S>) -> Result<(), OakError> {
        let checkpoint = state.checkpoint();
        state.bump(); // Theorem/Lemma/Definition
        state.expect(CoqTokenType::Identifier)?;

        if state.at(CoqTokenType::Colon) {
            state.expect(CoqTokenType::Colon)?;
            self.parse_term(state)?
        }

        if state.at(CoqTokenType::Dot) {
            state.expect(CoqTokenType::Dot)?
        }

        state.finish_at(checkpoint, CoqElementType::Declaration);
        Ok(())
    }

    /// Parses a proof block.
    fn parse_proof<'a, S: Source + ?Sized>(&self, state: &mut State<'a, S>) -> Result<(), OakError> {
        let checkpoint = state.checkpoint();
        state.expect(CoqTokenType::Proof)?;
        if state.at(CoqTokenType::Dot) {
            state.expect(CoqTokenType::Dot)?
        }

        while state.not_at_end() && !state.at(CoqTokenType::Qed) && !state.at(CoqTokenType::Admitted) {
            state.bump()
        }

        if state.at(CoqTokenType::Qed) {
            state.expect(CoqTokenType::Qed)?
        }
        else {
            state.expect(CoqTokenType::Admitted)?
        }

        if state.at(CoqTokenType::Dot) {
            state.expect(CoqTokenType::Dot)?
        }

        state.finish_at(checkpoint, CoqElementType::Statement);
        Ok(())
    }

    /// Parses a term.
    fn parse_term<'a, S: Source + ?Sized>(&self, state: &mut State<'a, S>) -> Result<(), OakError> {
        let checkpoint = state.checkpoint();
        while state.not_at_end() && !state.at(CoqTokenType::Dot) && !state.at(CoqTokenType::Semicolon) {
            state.bump()
        }
        state.finish_at(checkpoint, CoqElementType::Expression);
        Ok(())
    }
}

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

            while state.not_at_end() && !state.at(CoqTokenType::Eof) {
                if state.at(CoqTokenType::Theorem) || state.at(CoqTokenType::Lemma) || state.at(CoqTokenType::Definition) {
                    self.parse_declaration(state)?
                }
                else if state.at(CoqTokenType::Proof) {
                    self.parse_proof(state)?
                }
                else {
                    state.bump()
                }
            }

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