Function parse_binary_expression_rest

src/cosql/expression.rs:142–205

(
    mut input: &str,
    lhs: Expression,
    min_precedence: Precedence,
)

}

pub fn parse_binary_expression_rest(
    mut input: &str,
    lhs: Expression,
    min_precedence: Precedence,
) -> IResult<&str, Expression> {
    // Pratt Parsing Algorithm
    // <https://matklad.github.io/2020/04/13/simple-but-powerful-pratt-parsing.html>
    let mut lhs = lhs;
    loop {
        if let Ok((new_input, op)) = ws(parse_binary_expression_operator)(input) {
            let left_precedence = op.precedence();

            let stop = if left_precedence.is_right_associative() {
                left_precedence < min_precedence
            } else {
                left_precedence <= min_precedence
            };

            if stop {
                break;
            }

            input = new_input;

            let (new_input, rhs) = parse_binary_expression_or_highier(input, left_precedence)?;

            lhs = Expression::BinaryExpression(Box::new(BinaryExpression {
                left: lhs,
                operator: op,
                right: rhs,
            }));

            input = new_input;
        } else if let Ok((new_input, op)) = ws(parse_logical_operator)(input) {
            let left_precedence = op.precedence();

            let stop = if left_precedence.is_right_associative() {
                left_precedence < min_precedence
            } else {
                left_precedence <= min_precedence
            };

            if stop {
                break;
            }

            input = new_input;

            let (new_input, rhs) = parse_binary_expression_or_highier(input, left_precedence)?;

            lhs = Expression::LogicalExpression(Box::new(LogicalExpression {
                left: lhs,
                operator: op,
                right: rhs,
            }));

            input = new_input;
        } else {