Method parse_lhs_expression

crates/ruff_python_parser/src/parser/expression.rs:346–364

Parses the left-hand side of an expression. This includes prefix expressions such as unary operators, boolean `not`, `await`, `lambda`. It also parses atoms and postfix expressions. The given [`OperatorPrecedence`] is used to determine if the parsed expression is valid in that context. For example, a unary operator is not valid in an `await` expression in which case the `left_precedence` would b

(
        &mut self,
        left_precedence: OperatorPrecedence,
        context: ExpressionContext,
    )

    /// in an `await` expression in which case the `left_precedence` would
    /// be [`OperatorPrecedence::Await`].
    fn parse_lhs_expression(
        &mut self,
        left_precedence: OperatorPrecedence,
        context: ExpressionContext,
    ) -> ParsedExpr {
        let token = self.current_token_kind();
        if !Self::token_starts_recursive_lhs(token) {
            return self.parse_lhs_expression_inner(left_precedence, context, token);
        }

        if let Some(result) = self.with_recursion(|parser| {
            parser.parse_lhs_expression_inner(left_precedence, context, token)
        }) {
            result
        } else {
            self.report_recursion_limit_exceeded(self.current_token_range());
            self.recursion_recovery_expr()
        }
    }

    /// Returns whether parsing an expression that starts with `token` can
    /// immediately recurse through another expression parse.