cypress 0.1.0

Build simple yet expressive parsers
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

use crate::parser::*;

/// A parser combinator that parses a sequence of two parsers in order.
///
/// `PSeq` runs the first parser `p1` followed by the second parser `p2`,
/// returning a tuple of their parsed outputs.
///
/// # Type Parameters
///
/// * `P1` - The first parser type.
/// * `P2` - The second parser type.
#[derive(Clone)]
pub struct PSeq<P1, P2> {
    /// The first parser to run.
    p1: P1,
    /// The second parser to run after `p1`.
    p2: P2,
}

/// Creates a new `PSeq` parser combinator that parses two parsers in sequence.
///
/// # Arguments
///
/// * `p1` - The first parser to run.
/// * `p2` - The second parser to run after `p1`.
///
/// # Returns
///
/// A `PSeq` instance implementing `ParserCore` which returns a tuple of
/// `(output_of_p1, output_of_p2)`.
pub fn pseq<P1, P2>(p1: P1, p2: P2) -> PSeq<P1, P2> {
    PSeq { p1, p2 }
}

impl<'a, P1, P2, K, O1, O2> ParserCore<'a, K, (O1, O2)> for PSeq<P1, P2>
where
    K: PartialEq + Clone + 'a,
    O1: 'a,
    O2: 'a,
    P1: Parser<'a, K, O1>,
    P2: Parser<'a, K, O2>,
{
    /// Parses input sequentially with `p1` and then `p2`.
    ///
    /// First, attempts to parse input with `p1`.
    /// If successful, uses the remaining input to parse with `p2`.
    /// Returns a tuple of both parsed results.
    ///
    /// # Arguments
    ///
    /// * `i` - The parser input.
    ///
    /// # Returns
    ///
    /// * `Ok(PSuccess)` with a tuple `(O1, O2)` containing results of both parsers and the remaining input.
    /// * `Err(PFail)` if either parser fails.
    fn parse(&self, i: PInput<'a, K>) -> Result<PSuccess<'a, K, (O1, O2)>, PFail<'a, K>> {
        // Parse with the first parser
        let PSuccess { val: f_val, rest } = self.p1.parse(i)?;
        // Parse with the second parser from the remaining input
        let PSuccess { val: s_val, rest } = self.p2.parse(rest)?;

        Ok(PSuccess {
            val: (f_val, s_val),
            rest,
        })
    }
}

impl<'a, P1, P2, K, O1, O2> Parser<'a, K, (O1, O2)> for PSeq<P1, P2>
where
    K: PartialEq + Clone + 'a,
    O1: 'a,
    O2: 'a,
    P1: Parser<'a, K, O1>,
    P2: Parser<'a, K, O2>,
{
}