Function binding_strength

prqlc/prqlc/src/codegen/ast.rs:248–285

(expr: &pr::ExprKind)

}

fn binding_strength(expr: &pr::ExprKind) -> u8 {
    match expr {
        // For example, if it's an Ident, it's basically infinite — a simple
        // ident never needs parentheses around it.
        pr::ExprKind::Ident(_) => 100,

        // Stronger than a range, since `-1..2` is `(-1)..2`
        // Stronger than binary op, since `-x == y` is `(-x) == y`
        // Stronger than a func call, since `exists !y` is `exists (!y)`
        pr::ExprKind::Unary(..) => 20,

        pr::ExprKind::Range(_) => 19,

        pr::ExprKind::Binary(pr::BinaryExpr { op, .. }) => match op {
            pr::BinOp::Pow => 19,
            pr::BinOp::Mul | pr::BinOp::DivInt | pr::BinOp::DivFloat | pr::BinOp::Mod => 18,
            pr::BinOp::Add | pr::BinOp::Sub => 17,
            pr::BinOp::Eq
            | pr::BinOp::Ne
            | pr::BinOp::Gt
            | pr::BinOp::Lt
            | pr::BinOp::Gte
            | pr::BinOp::Lte
            | pr::BinOp::RegexSearch => 16,
            pr::BinOp::Coalesce => 15,
            pr::BinOp::And => 14,
            pr::BinOp::Or => 13,
        },

        // Weaker than a child assign, since `select x = 1`
        // Weaker than a binary operator, since `filter x == 1`
        pr::ExprKind::FuncCall(_) => 10,
        pr::ExprKind::Func(_) => 7,

        // other nodes should not contain any inner exprs
        _ => 100,
    }
}

fn associativity(expr: &pr::ExprKind) -> super::Position {
    match expr {