1 use super::diagnostics::SnapshotParser;
2 use super::pat::{CommaRecoveryMode, RecoverColon, RecoverComma, PARAM_EXPECTED};
3 use super::ty::{AllowPlus, RecoverQPath, RecoverReturnSign};
5 AttrWrapper, BlockMode, ClosureSpans, ForceCollect, Parser, PathStyle, Restrictions,
6 SemiColonMode, SeqSep, TokenExpectType, TokenType, TrailingToken,
8 use crate::maybe_recover_from_interpolated_ty_qpath;
11 use rustc_ast::ptr::P;
12 use rustc_ast::token::{self, Delimiter, Token, TokenKind};
13 use rustc_ast::tokenstream::Spacing;
14 use rustc_ast::util::classify;
15 use rustc_ast::util::literal::LitError;
16 use rustc_ast::util::parser::{prec_let_scrutinee_needs_par, AssocOp, Fixity};
17 use rustc_ast::visit::Visitor;
18 use rustc_ast::{self as ast, AttrStyle, AttrVec, CaptureBy, ExprField, Lit, UnOp, DUMMY_NODE_ID};
19 use rustc_ast::{AnonConst, BinOp, BinOpKind, FnDecl, FnRetTy, MacCall, Param, Ty, TyKind};
20 use rustc_ast::{Arm, Async, BlockCheckMode, Expr, ExprKind, Label, Movability, RangeLimits};
21 use rustc_ast::{ClosureBinder, StmtKind};
22 use rustc_ast_pretty::pprust;
23 use rustc_data_structures::thin_vec::ThinVec;
24 use rustc_errors::{Applicability, Diagnostic, DiagnosticBuilder, ErrorGuaranteed, PResult};
25 use rustc_session::lint::builtin::BREAK_WITH_LABEL_AND_LOOP;
26 use rustc_session::lint::BuiltinLintDiagnostics;
27 use rustc_span::source_map::{self, Span, Spanned};
28 use rustc_span::symbol::{kw, sym, Ident, Symbol};
29 use rustc_span::{BytePos, Pos};
31 /// Possibly accepts an `token::Interpolated` expression (a pre-parsed expression
32 /// dropped into the token stream, which happens while parsing the result of
33 /// macro expansion). Placement of these is not as complex as I feared it would
34 /// be. The important thing is to make sure that lookahead doesn't balk at
35 /// `token::Interpolated` tokens.
36 macro_rules! maybe_whole_expr {
38 if let token::Interpolated(nt) = &$p.token.kind {
40 token::NtExpr(e) | token::NtLiteral(e) => {
45 token::NtPath(path) => {
46 let path = (**path).clone();
50 ExprKind::Path(None, path),
54 token::NtBlock(block) => {
55 let block = block.clone();
59 ExprKind::Block(block, None),
70 pub(super) enum LhsExpr {
72 AttributesParsed(AttrWrapper),
73 AlreadyParsed(P<Expr>),
76 impl From<Option<AttrWrapper>> for LhsExpr {
77 /// Converts `Some(attrs)` into `LhsExpr::AttributesParsed(attrs)`
78 /// and `None` into `LhsExpr::NotYetParsed`.
80 /// This conversion does not allocate.
81 fn from(o: Option<AttrWrapper>) -> Self {
82 if let Some(attrs) = o { LhsExpr::AttributesParsed(attrs) } else { LhsExpr::NotYetParsed }
86 impl From<P<Expr>> for LhsExpr {
87 /// Converts the `expr: P<Expr>` into `LhsExpr::AlreadyParsed(expr)`.
89 /// This conversion does not allocate.
90 fn from(expr: P<Expr>) -> Self {
91 LhsExpr::AlreadyParsed(expr)
96 /// Parses an expression.
98 pub fn parse_expr(&mut self) -> PResult<'a, P<Expr>> {
99 self.current_closure.take();
101 self.parse_expr_res(Restrictions::empty(), None)
104 /// Parses an expression, forcing tokens to be collected
105 pub fn parse_expr_force_collect(&mut self) -> PResult<'a, P<Expr>> {
106 self.collect_tokens_no_attrs(|this| this.parse_expr())
109 pub fn parse_anon_const_expr(&mut self) -> PResult<'a, AnonConst> {
110 self.parse_expr().map(|value| AnonConst { id: DUMMY_NODE_ID, value })
113 fn parse_expr_catch_underscore(&mut self) -> PResult<'a, P<Expr>> {
114 match self.parse_expr() {
115 Ok(expr) => Ok(expr),
116 Err(mut err) => match self.token.ident() {
117 Some((Ident { name: kw::Underscore, .. }, false))
118 if self.look_ahead(1, |t| t == &token::Comma) =>
120 // Special-case handling of `foo(_, _, _)`
123 Ok(self.mk_expr(self.prev_token.span, ExprKind::Err, AttrVec::new()))
130 /// Parses a sequence of expressions delimited by parentheses.
131 fn parse_paren_expr_seq(&mut self) -> PResult<'a, Vec<P<Expr>>> {
132 self.parse_paren_comma_seq(|p| p.parse_expr_catch_underscore()).map(|(r, _)| r)
135 /// Parses an expression, subject to the given restrictions.
137 pub(super) fn parse_expr_res(
140 already_parsed_attrs: Option<AttrWrapper>,
141 ) -> PResult<'a, P<Expr>> {
142 self.with_res(r, |this| this.parse_assoc_expr(already_parsed_attrs))
145 /// Parses an associative expression.
147 /// This parses an expression accounting for associativity and precedence of the operators in
152 already_parsed_attrs: Option<AttrWrapper>,
153 ) -> PResult<'a, P<Expr>> {
154 self.parse_assoc_expr_with(0, already_parsed_attrs.into())
157 /// Parses an associative expression with operators of at least `min_prec` precedence.
158 pub(super) fn parse_assoc_expr_with(
162 ) -> PResult<'a, P<Expr>> {
163 let mut lhs = if let LhsExpr::AlreadyParsed(expr) = lhs {
166 let attrs = match lhs {
167 LhsExpr::AttributesParsed(attrs) => Some(attrs),
170 if [token::DotDot, token::DotDotDot, token::DotDotEq].contains(&self.token.kind) {
171 return self.parse_prefix_range_expr(attrs);
173 self.parse_prefix_expr(attrs)?
176 let last_type_ascription_set = self.last_type_ascription.is_some();
178 if !self.should_continue_as_assoc_expr(&lhs) {
179 self.last_type_ascription = None;
183 self.expected_tokens.push(TokenType::Operator);
184 while let Some(op) = self.check_assoc_op() {
185 // Adjust the span for interpolated LHS to point to the `$lhs` token
186 // and not to what it refers to.
187 let lhs_span = match self.prev_token.kind {
188 TokenKind::Interpolated(..) => self.prev_token.span,
192 let cur_op_span = self.token.span;
193 let restrictions = if op.node.is_assign_like() {
194 self.restrictions & Restrictions::NO_STRUCT_LITERAL
198 let prec = op.node.precedence();
202 // Check for deprecated `...` syntax
203 if self.token == token::DotDotDot && op.node == AssocOp::DotDotEq {
204 self.err_dotdotdot_syntax(self.token.span);
207 if self.token == token::LArrow {
208 self.err_larrow_operator(self.token.span);
212 if op.node.is_comparison() {
213 if let Some(expr) = self.check_no_chained_comparison(&lhs, &op)? {
218 // Look for JS' `===` and `!==` and recover
219 if (op.node == AssocOp::Equal || op.node == AssocOp::NotEqual)
220 && self.token.kind == token::Eq
221 && self.prev_token.span.hi() == self.token.span.lo()
223 let sp = op.span.to(self.token.span);
224 let sugg = match op.node {
225 AssocOp::Equal => "==",
226 AssocOp::NotEqual => "!=",
229 self.struct_span_err(sp, &format!("invalid comparison operator `{sugg}=`"))
230 .span_suggestion_short(
232 &format!("`{s}=` is not a valid comparison operator, use `{s}`", s = sugg),
234 Applicability::MachineApplicable,
240 // Look for PHP's `<>` and recover
241 if op.node == AssocOp::Less
242 && self.token.kind == token::Gt
243 && self.prev_token.span.hi() == self.token.span.lo()
245 let sp = op.span.to(self.token.span);
246 self.struct_span_err(sp, "invalid comparison operator `<>`")
247 .span_suggestion_short(
249 "`<>` is not a valid comparison operator, use `!=`",
251 Applicability::MachineApplicable,
257 // Look for C++'s `<=>` and recover
258 if op.node == AssocOp::LessEqual
259 && self.token.kind == token::Gt
260 && self.prev_token.span.hi() == self.token.span.lo()
262 let sp = op.span.to(self.token.span);
263 self.struct_span_err(sp, "invalid comparison operator `<=>`")
266 "`<=>` is not a valid comparison operator, use `std::cmp::Ordering`",
272 if self.prev_token == token::BinOp(token::Plus)
273 && self.token == token::BinOp(token::Plus)
274 && self.prev_token.span.between(self.token.span).is_empty()
276 let op_span = self.prev_token.span.to(self.token.span);
277 // Eat the second `+`
279 lhs = self.recover_from_postfix_increment(lhs, op_span)?;
285 if op == AssocOp::As {
286 lhs = self.parse_assoc_op_cast(lhs, lhs_span, ExprKind::Cast)?;
288 } else if op == AssocOp::Colon {
289 lhs = self.parse_assoc_op_ascribe(lhs, lhs_span)?;
291 } else if op == AssocOp::DotDot || op == AssocOp::DotDotEq {
292 // If we didn't have to handle `x..`/`x..=`, it would be pretty easy to
293 // generalise it to the Fixity::None code.
294 lhs = self.parse_range_expr(prec, lhs, op, cur_op_span)?;
298 let fixity = op.fixity();
299 let prec_adjustment = match fixity {
302 // We currently have no non-associative operators that are not handled above by
303 // the special cases. The code is here only for future convenience.
306 let rhs = self.with_res(restrictions - Restrictions::STMT_EXPR, |this| {
307 this.parse_assoc_expr_with(prec + prec_adjustment, LhsExpr::NotYetParsed)
310 let span = self.mk_expr_sp(&lhs, lhs_span, rhs.span);
323 | AssocOp::ShiftRight
329 | AssocOp::GreaterEqual => {
330 let ast_op = op.to_ast_binop().unwrap();
331 let binary = self.mk_binary(source_map::respan(cur_op_span, ast_op), lhs, rhs);
332 self.mk_expr(span, binary, AttrVec::new())
335 self.mk_expr(span, ExprKind::Assign(lhs, rhs, cur_op_span), AttrVec::new())
337 AssocOp::AssignOp(k) => {
339 token::Plus => BinOpKind::Add,
340 token::Minus => BinOpKind::Sub,
341 token::Star => BinOpKind::Mul,
342 token::Slash => BinOpKind::Div,
343 token::Percent => BinOpKind::Rem,
344 token::Caret => BinOpKind::BitXor,
345 token::And => BinOpKind::BitAnd,
346 token::Or => BinOpKind::BitOr,
347 token::Shl => BinOpKind::Shl,
348 token::Shr => BinOpKind::Shr,
350 let aopexpr = self.mk_assign_op(source_map::respan(cur_op_span, aop), lhs, rhs);
351 self.mk_expr(span, aopexpr, AttrVec::new())
353 AssocOp::As | AssocOp::Colon | AssocOp::DotDot | AssocOp::DotDotEq => {
354 self.span_bug(span, "AssocOp should have been handled by special case")
358 if let Fixity::None = fixity {
362 if last_type_ascription_set {
363 self.last_type_ascription = None;
368 fn should_continue_as_assoc_expr(&mut self, lhs: &Expr) -> bool {
369 match (self.expr_is_complete(lhs), AssocOp::from_token(&self.token)) {
370 // Semi-statement forms are odd:
371 // See https://github.com/rust-lang/rust/issues/29071
372 (true, None) => false,
373 (false, _) => true, // Continue parsing the expression.
374 // An exhaustive check is done in the following block, but these are checked first
375 // because they *are* ambiguous but also reasonable looking incorrect syntax, so we
376 // want to keep their span info to improve diagnostics in these cases in a later stage.
377 (true, Some(AssocOp::Multiply)) | // `{ 42 } *foo = bar;` or `{ 42 } * 3`
378 (true, Some(AssocOp::Subtract)) | // `{ 42 } -5`
379 (true, Some(AssocOp::Add)) // `{ 42 } + 42
380 // If the next token is a keyword, then the tokens above *are* unambiguously incorrect:
381 // `if x { a } else { b } && if y { c } else { d }`
382 if !self.look_ahead(1, |t| t.is_used_keyword()) => {
383 // These cases are ambiguous and can't be identified in the parser alone.
384 let sp = self.sess.source_map().start_point(self.token.span);
385 self.sess.ambiguous_block_expr_parse.borrow_mut().insert(sp, lhs.span);
388 (true, Some(AssocOp::LAnd)) |
389 (true, Some(AssocOp::LOr)) |
390 (true, Some(AssocOp::BitOr)) => {
391 // `{ 42 } &&x` (#61475) or `{ 42 } && if x { 1 } else { 0 }`. Separated from the
392 // above due to #74233.
393 // These cases are ambiguous and can't be identified in the parser alone.
395 // Bitwise AND is left out because guessing intent is hard. We can make
396 // suggestions based on the assumption that double-refs are rarely intentional,
397 // and closures are distinct enough that they don't get mixed up with their
399 let sp = self.sess.source_map().start_point(self.token.span);
400 self.sess.ambiguous_block_expr_parse.borrow_mut().insert(sp, lhs.span);
403 (true, Some(ref op)) if !op.can_continue_expr_unambiguously() => false,
405 self.error_found_expr_would_be_stmt(lhs);
411 /// We've found an expression that would be parsed as a statement,
412 /// but the next token implies this should be parsed as an expression.
413 /// For example: `if let Some(x) = x { x } else { 0 } / 2`.
414 fn error_found_expr_would_be_stmt(&self, lhs: &Expr) {
415 let mut err = self.struct_span_err(
417 &format!("expected expression, found `{}`", pprust::token_to_string(&self.token),),
419 err.span_label(self.token.span, "expected expression");
420 self.sess.expr_parentheses_needed(&mut err, lhs.span);
424 /// Possibly translate the current token to an associative operator.
425 /// The method does not advance the current token.
427 /// Also performs recovery for `and` / `or` which are mistaken for `&&` and `||` respectively.
428 fn check_assoc_op(&self) -> Option<Spanned<AssocOp>> {
429 let (op, span) = match (AssocOp::from_token(&self.token), self.token.ident()) {
430 // When parsing const expressions, stop parsing when encountering `>`.
435 | AssocOp::GreaterEqual
436 | AssocOp::AssignOp(token::BinOpToken::Shr),
439 ) if self.restrictions.contains(Restrictions::CONST_EXPR) => {
442 (Some(op), _) => (op, self.token.span),
443 (None, Some((Ident { name: sym::and, span }, false))) => {
444 self.error_bad_logical_op("and", "&&", "conjunction");
445 (AssocOp::LAnd, span)
447 (None, Some((Ident { name: sym::or, span }, false))) => {
448 self.error_bad_logical_op("or", "||", "disjunction");
453 Some(source_map::respan(span, op))
456 /// Error on `and` and `or` suggesting `&&` and `||` respectively.
457 fn error_bad_logical_op(&self, bad: &str, good: &str, english: &str) {
458 self.struct_span_err(self.token.span, &format!("`{bad}` is not a logical operator"))
459 .span_suggestion_short(
461 &format!("use `{good}` to perform logical {english}"),
463 Applicability::MachineApplicable,
465 .note("unlike in e.g., python and PHP, `&&` and `||` are used for logical operators")
469 /// Checks if this expression is a successfully parsed statement.
470 fn expr_is_complete(&self, e: &Expr) -> bool {
471 self.restrictions.contains(Restrictions::STMT_EXPR)
472 && !classify::expr_requires_semi_to_be_stmt(e)
475 /// Parses `x..y`, `x..=y`, and `x..`/`x..=`.
476 /// The other two variants are handled in `parse_prefix_range_expr` below.
483 ) -> PResult<'a, P<Expr>> {
484 let rhs = if self.is_at_start_of_range_notation_rhs() {
485 Some(self.parse_assoc_expr_with(prec + 1, LhsExpr::NotYetParsed)?)
489 let rhs_span = rhs.as_ref().map_or(cur_op_span, |x| x.span);
490 let span = self.mk_expr_sp(&lhs, lhs.span, rhs_span);
492 if op == AssocOp::DotDot { RangeLimits::HalfOpen } else { RangeLimits::Closed };
493 let range = self.mk_range(Some(lhs), rhs, limits);
494 Ok(self.mk_expr(span, range, AttrVec::new()))
497 fn is_at_start_of_range_notation_rhs(&self) -> bool {
498 if self.token.can_begin_expr() {
499 // Parse `for i in 1.. { }` as infinite loop, not as `for i in (1..{})`.
500 if self.token == token::OpenDelim(Delimiter::Brace) {
501 return !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL);
509 /// Parses prefix-forms of range notation: `..expr`, `..`, `..=expr`.
510 fn parse_prefix_range_expr(&mut self, attrs: Option<AttrWrapper>) -> PResult<'a, P<Expr>> {
511 // Check for deprecated `...` syntax.
512 if self.token == token::DotDotDot {
513 self.err_dotdotdot_syntax(self.token.span);
517 [token::DotDot, token::DotDotDot, token::DotDotEq].contains(&self.token.kind),
518 "parse_prefix_range_expr: token {:?} is not DotDot/DotDotEq",
522 let limits = match self.token.kind {
523 token::DotDot => RangeLimits::HalfOpen,
524 _ => RangeLimits::Closed,
526 let op = AssocOp::from_token(&self.token);
527 // FIXME: `parse_prefix_range_expr` is called when the current
528 // token is `DotDot`, `DotDotDot`, or `DotDotEq`. If we haven't already
529 // parsed attributes, then trying to parse them here will always fail.
530 // We should figure out how we want attributes on range expressions to work.
531 let attrs = self.parse_or_use_outer_attributes(attrs)?;
532 self.collect_tokens_for_expr(attrs, |this, attrs| {
533 let lo = this.token.span;
535 let (span, opt_end) = if this.is_at_start_of_range_notation_rhs() {
536 // RHS must be parsed with more associativity than the dots.
537 this.parse_assoc_expr_with(op.unwrap().precedence() + 1, LhsExpr::NotYetParsed)
538 .map(|x| (lo.to(x.span), Some(x)))?
542 let range = this.mk_range(None, opt_end, limits);
543 Ok(this.mk_expr(span, range, attrs.into()))
547 /// Parses a prefix-unary-operator expr.
548 fn parse_prefix_expr(&mut self, attrs: Option<AttrWrapper>) -> PResult<'a, P<Expr>> {
549 let attrs = self.parse_or_use_outer_attributes(attrs)?;
550 let lo = self.token.span;
552 macro_rules! make_it {
553 ($this:ident, $attrs:expr, |this, _| $body:expr) => {
554 $this.collect_tokens_for_expr($attrs, |$this, attrs| {
555 let (hi, ex) = $body?;
556 Ok($this.mk_expr(lo.to(hi), ex, attrs.into()))
563 // Note: when adding new unary operators, don't forget to adjust TokenKind::can_begin_expr()
564 match this.token.uninterpolate().kind {
565 token::Not => make_it!(this, attrs, |this, _| this.parse_unary_expr(lo, UnOp::Not)), // `!expr`
566 token::Tilde => make_it!(this, attrs, |this, _| this.recover_tilde_expr(lo)), // `~expr`
567 token::BinOp(token::Minus) => {
568 make_it!(this, attrs, |this, _| this.parse_unary_expr(lo, UnOp::Neg))
570 token::BinOp(token::Star) => {
571 make_it!(this, attrs, |this, _| this.parse_unary_expr(lo, UnOp::Deref))
573 token::BinOp(token::And) | token::AndAnd => {
574 make_it!(this, attrs, |this, _| this.parse_borrow_expr(lo))
576 token::BinOp(token::Plus) if this.look_ahead(1, |tok| tok.is_numeric_lit()) => {
577 let mut err = this.struct_span_err(lo, "leading `+` is not supported");
578 err.span_label(lo, "unexpected `+`");
580 // a block on the LHS might have been intended to be an expression instead
581 if let Some(sp) = this.sess.ambiguous_block_expr_parse.borrow().get(&lo) {
582 this.sess.expr_parentheses_needed(&mut err, *sp);
584 err.span_suggestion_verbose(
586 "try removing the `+`",
588 Applicability::MachineApplicable,
594 this.parse_prefix_expr(None)
596 // Recover from `++x`:
597 token::BinOp(token::Plus)
598 if this.look_ahead(1, |t| *t == token::BinOp(token::Plus)) =>
600 let prev_is_semi = this.prev_token == token::Semi;
601 let pre_span = this.token.span.to(this.look_ahead(1, |t| t.span));
606 let operand_expr = this.parse_dot_or_call_expr(Default::default())?;
607 this.recover_from_prefix_increment(operand_expr, pre_span, prev_is_semi)
609 token::Ident(..) if this.token.is_keyword(kw::Box) => {
610 make_it!(this, attrs, |this, _| this.parse_box_expr(lo))
612 token::Ident(..) if this.is_mistaken_not_ident_negation() => {
613 make_it!(this, attrs, |this, _| this.recover_not_expr(lo))
615 _ => return this.parse_dot_or_call_expr(Some(attrs)),
619 fn parse_prefix_expr_common(&mut self, lo: Span) -> PResult<'a, (Span, P<Expr>)> {
621 let expr = self.parse_prefix_expr(None);
622 let (span, expr) = self.interpolated_or_expr_span(expr)?;
623 Ok((lo.to(span), expr))
626 fn parse_unary_expr(&mut self, lo: Span, op: UnOp) -> PResult<'a, (Span, ExprKind)> {
627 let (span, expr) = self.parse_prefix_expr_common(lo)?;
628 Ok((span, self.mk_unary(op, expr)))
631 // Recover on `!` suggesting for bitwise negation instead.
632 fn recover_tilde_expr(&mut self, lo: Span) -> PResult<'a, (Span, ExprKind)> {
633 self.struct_span_err(lo, "`~` cannot be used as a unary operator")
634 .span_suggestion_short(
636 "use `!` to perform bitwise not",
638 Applicability::MachineApplicable,
642 self.parse_unary_expr(lo, UnOp::Not)
645 /// Parse `box expr`.
646 fn parse_box_expr(&mut self, lo: Span) -> PResult<'a, (Span, ExprKind)> {
647 let (span, expr) = self.parse_prefix_expr_common(lo)?;
648 self.sess.gated_spans.gate(sym::box_syntax, span);
649 Ok((span, ExprKind::Box(expr)))
652 fn is_mistaken_not_ident_negation(&self) -> bool {
653 let token_cannot_continue_expr = |t: &Token| match t.uninterpolate().kind {
654 // These tokens can start an expression after `!`, but
655 // can't continue an expression after an ident
656 token::Ident(name, is_raw) => token::ident_can_begin_expr(name, t.span, is_raw),
657 token::Literal(..) | token::Pound => true,
658 _ => t.is_whole_expr(),
660 self.token.is_ident_named(sym::not) && self.look_ahead(1, token_cannot_continue_expr)
663 /// Recover on `not expr` in favor of `!expr`.
664 fn recover_not_expr(&mut self, lo: Span) -> PResult<'a, (Span, ExprKind)> {
666 let not_token = self.look_ahead(1, |t| t.clone());
667 self.struct_span_err(
669 &format!("unexpected {} after identifier", super::token_descr(¬_token)),
671 .span_suggestion_short(
672 // Span the `not` plus trailing whitespace to avoid
673 // trailing whitespace after the `!` in our suggestion
674 self.sess.source_map().span_until_non_whitespace(lo.to(not_token.span)),
675 "use `!` to perform logical negation",
677 Applicability::MachineApplicable,
682 self.parse_unary_expr(lo, UnOp::Not)
685 /// Returns the span of expr, if it was not interpolated or the span of the interpolated token.
686 fn interpolated_or_expr_span(
688 expr: PResult<'a, P<Expr>>,
689 ) -> PResult<'a, (Span, P<Expr>)> {
692 match self.prev_token.kind {
693 TokenKind::Interpolated(..) => self.prev_token.span,
701 fn parse_assoc_op_cast(
705 expr_kind: fn(P<Expr>, P<Ty>) -> ExprKind,
706 ) -> PResult<'a, P<Expr>> {
707 let mk_expr = |this: &mut Self, lhs: P<Expr>, rhs: P<Ty>| {
709 this.mk_expr_sp(&lhs, lhs_span, rhs.span),
715 // Save the state of the parser before parsing type normally, in case there is a
716 // LessThan comparison after this cast.
717 let parser_snapshot_before_type = self.clone();
718 let cast_expr = match self.parse_as_cast_ty() {
719 Ok(rhs) => mk_expr(self, lhs, rhs),
721 // Rewind to before attempting to parse the type with generics, to recover
722 // from situations like `x as usize < y` in which we first tried to parse
723 // `usize < y` as a type with generic arguments.
724 let parser_snapshot_after_type = mem::replace(self, parser_snapshot_before_type);
726 // Check for typo of `'a: loop { break 'a }` with a missing `'`.
727 match (&lhs.kind, &self.token.kind) {
730 ExprKind::Path(None, ast::Path { segments, .. }),
731 TokenKind::Ident(kw::For | kw::Loop | kw::While, false),
732 ) if segments.len() == 1 => {
733 let snapshot = self.create_snapshot_for_diagnostic();
735 ident: Ident::from_str_and_span(
736 &format!("'{}", segments[0].ident),
737 segments[0].ident.span,
740 match self.parse_labeled_expr(label, AttrVec::new(), false) {
743 self.struct_span_err(label.ident.span, "malformed loop label")
746 "use the correct loop label format",
748 Applicability::MachineApplicable,
755 self.restore_snapshot(snapshot);
762 match self.parse_path(PathStyle::Expr) {
764 let (op_noun, op_verb) = match self.token.kind {
765 token::Lt => ("comparison", "comparing"),
766 token::BinOp(token::Shl) => ("shift", "shifting"),
768 // We can end up here even without `<` being the next token, for
769 // example because `parse_ty_no_plus` returns `Err` on keywords,
770 // but `parse_path` returns `Ok` on them due to error recovery.
771 // Return original error and parser state.
772 *self = parser_snapshot_after_type;
773 return Err(type_err);
777 // Successfully parsed the type path leaving a `<` yet to parse.
780 // Report non-fatal diagnostics, keep `x as usize` as an expression
781 // in AST and continue parsing.
783 "`<` is interpreted as a start of generic arguments for `{}`, not a {}",
784 pprust::path_to_string(&path),
787 let span_after_type = parser_snapshot_after_type.token.span;
789 mk_expr(self, lhs, self.mk_ty(path.span, TyKind::Path(None, path)));
791 self.struct_span_err(self.token.span, &msg)
793 self.look_ahead(1, |t| t.span).to(span_after_type),
794 "interpreted as generic arguments",
796 .span_label(self.token.span, format!("not interpreted as {op_noun}"))
797 .multipart_suggestion(
798 &format!("try {op_verb} the cast value"),
800 (expr.span.shrink_to_lo(), "(".to_string()),
801 (expr.span.shrink_to_hi(), ")".to_string()),
803 Applicability::MachineApplicable,
810 // Couldn't parse as a path, return original error and parser state.
812 *self = parser_snapshot_after_type;
813 return Err(type_err);
819 self.parse_and_disallow_postfix_after_cast(cast_expr)
822 /// Parses a postfix operators such as `.`, `?`, or index (`[]`) after a cast,
823 /// then emits an error and returns the newly parsed tree.
824 /// The resulting parse tree for `&x as T[0]` has a precedence of `((&x) as T)[0]`.
825 fn parse_and_disallow_postfix_after_cast(
828 ) -> PResult<'a, P<Expr>> {
829 let span = cast_expr.span;
830 let (cast_kind, maybe_ascription_span) =
831 if let ExprKind::Type(ascripted_expr, _) = &cast_expr.kind {
832 ("type ascription", Some(ascripted_expr.span.shrink_to_hi().with_hi(span.hi())))
837 // Save the memory location of expr before parsing any following postfix operators.
838 // This will be compared with the memory location of the output expression.
839 // If they different we can assume we parsed another expression because the existing expression is not reallocated.
840 let addr_before = &*cast_expr as *const _ as usize;
841 let with_postfix = self.parse_dot_or_call_expr_with_(cast_expr, span)?;
842 let changed = addr_before != &*with_postfix as *const _ as usize;
844 // Check if an illegal postfix operator has been added after the cast.
845 // If the resulting expression is not a cast, or has a different memory location, it is an illegal postfix operator.
846 if !matches!(with_postfix.kind, ExprKind::Cast(_, _) | ExprKind::Type(_, _)) || changed {
848 "{cast_kind} cannot be followed by {}",
849 match with_postfix.kind {
850 ExprKind::Index(_, _) => "indexing",
851 ExprKind::Try(_) => "`?`",
852 ExprKind::Field(_, _) => "a field access",
853 ExprKind::MethodCall(_, _, _) => "a method call",
854 ExprKind::Call(_, _) => "a function call",
855 ExprKind::Await(_) => "`.await`",
856 ExprKind::Err => return Ok(with_postfix),
857 _ => unreachable!("parse_dot_or_call_expr_with_ shouldn't produce this"),
860 let mut err = self.struct_span_err(span, &msg);
862 let suggest_parens = |err: &mut DiagnosticBuilder<'_, _>| {
863 let suggestions = vec![
864 (span.shrink_to_lo(), "(".to_string()),
865 (span.shrink_to_hi(), ")".to_string()),
867 err.multipart_suggestion(
868 "try surrounding the expression in parentheses",
870 Applicability::MachineApplicable,
874 // If type ascription is "likely an error", the user will already be getting a useful
875 // help message, and doesn't need a second.
876 if self.last_type_ascription.map_or(false, |last_ascription| last_ascription.1) {
877 self.maybe_annotate_with_ascription(&mut err, false);
878 } else if let Some(ascription_span) = maybe_ascription_span {
879 let is_nightly = self.sess.unstable_features.is_nightly_build();
881 suggest_parens(&mut err);
886 "{}remove the type ascription",
887 if is_nightly { "alternatively, " } else { "" }
891 Applicability::MaybeIncorrect
893 Applicability::MachineApplicable
897 suggest_parens(&mut err);
904 fn parse_assoc_op_ascribe(&mut self, lhs: P<Expr>, lhs_span: Span) -> PResult<'a, P<Expr>> {
905 let maybe_path = self.could_ascription_be_path(&lhs.kind);
906 self.last_type_ascription = Some((self.prev_token.span, maybe_path));
907 let lhs = self.parse_assoc_op_cast(lhs, lhs_span, ExprKind::Type)?;
908 self.sess.gated_spans.gate(sym::type_ascription, lhs.span);
912 /// Parse `& mut? <expr>` or `& raw [ const | mut ] <expr>`.
913 fn parse_borrow_expr(&mut self, lo: Span) -> PResult<'a, (Span, ExprKind)> {
915 let has_lifetime = self.token.is_lifetime() && self.look_ahead(1, |t| t != &token::Colon);
916 let lifetime = has_lifetime.then(|| self.expect_lifetime()); // For recovery, see below.
917 let (borrow_kind, mutbl) = self.parse_borrow_modifiers(lo);
918 let expr = self.parse_prefix_expr(None);
919 let (hi, expr) = self.interpolated_or_expr_span(expr)?;
920 let span = lo.to(hi);
921 if let Some(lt) = lifetime {
922 self.error_remove_borrow_lifetime(span, lt.ident.span);
924 Ok((span, ExprKind::AddrOf(borrow_kind, mutbl, expr)))
927 fn error_remove_borrow_lifetime(&self, span: Span, lt_span: Span) {
928 self.struct_span_err(span, "borrow expressions cannot be annotated with lifetimes")
929 .span_label(lt_span, "annotated with lifetime here")
932 "remove the lifetime annotation",
934 Applicability::MachineApplicable,
939 /// Parse `mut?` or `raw [ const | mut ]`.
940 fn parse_borrow_modifiers(&mut self, lo: Span) -> (ast::BorrowKind, ast::Mutability) {
941 if self.check_keyword(kw::Raw) && self.look_ahead(1, Token::is_mutability) {
942 // `raw [ const | mut ]`.
943 let found_raw = self.eat_keyword(kw::Raw);
945 let mutability = self.parse_const_or_mut().unwrap();
946 self.sess.gated_spans.gate(sym::raw_ref_op, lo.to(self.prev_token.span));
947 (ast::BorrowKind::Raw, mutability)
950 (ast::BorrowKind::Ref, self.parse_mutability())
954 /// Parses `a.b` or `a(13)` or `a[4]` or just `a`.
955 fn parse_dot_or_call_expr(&mut self, attrs: Option<AttrWrapper>) -> PResult<'a, P<Expr>> {
956 let attrs = self.parse_or_use_outer_attributes(attrs)?;
957 self.collect_tokens_for_expr(attrs, |this, attrs| {
958 let base = this.parse_bottom_expr();
959 let (span, base) = this.interpolated_or_expr_span(base)?;
960 this.parse_dot_or_call_expr_with(base, span, attrs)
964 pub(super) fn parse_dot_or_call_expr_with(
968 mut attrs: Vec<ast::Attribute>,
969 ) -> PResult<'a, P<Expr>> {
970 // Stitch the list of outer attributes onto the return value.
971 // A little bit ugly, but the best way given the current code
973 self.parse_dot_or_call_expr_with_(e0, lo).map(|expr| {
974 expr.map(|mut expr| {
975 attrs.extend::<Vec<_>>(expr.attrs.into());
976 expr.attrs = attrs.into();
982 fn parse_dot_or_call_expr_with_(&mut self, mut e: P<Expr>, lo: Span) -> PResult<'a, P<Expr>> {
984 let has_question = if self.prev_token.kind == TokenKind::Ident(kw::Return, false) {
985 // we are using noexpect here because we don't expect a `?` directly after a `return`
986 // which could be suggested otherwise
987 self.eat_noexpect(&token::Question)
989 self.eat(&token::Question)
993 e = self.mk_expr(lo.to(self.prev_token.span), ExprKind::Try(e), AttrVec::new());
996 let has_dot = if self.prev_token.kind == TokenKind::Ident(kw::Return, false) {
997 // we are using noexpect here because we don't expect a `.` directly after a `return`
998 // which could be suggested otherwise
999 self.eat_noexpect(&token::Dot)
1001 self.eat(&token::Dot)
1005 e = self.parse_dot_suffix_expr(lo, e)?;
1008 if self.expr_is_complete(&e) {
1011 e = match self.token.kind {
1012 token::OpenDelim(Delimiter::Parenthesis) => self.parse_fn_call_expr(lo, e),
1013 token::OpenDelim(Delimiter::Bracket) => self.parse_index_expr(lo, e)?,
1019 fn look_ahead_type_ascription_as_field(&mut self) -> bool {
1020 self.look_ahead(1, |t| t.is_ident())
1021 && self.look_ahead(2, |t| t == &token::Colon)
1022 && self.look_ahead(3, |t| t.can_begin_expr())
1025 fn parse_dot_suffix_expr(&mut self, lo: Span, base: P<Expr>) -> PResult<'a, P<Expr>> {
1026 match self.token.uninterpolate().kind {
1027 token::Ident(..) => self.parse_dot_suffix(base, lo),
1028 token::Literal(token::Lit { kind: token::Integer, symbol, suffix }) => {
1029 Ok(self.parse_tuple_field_access_expr(lo, base, symbol, suffix, None))
1031 token::Literal(token::Lit { kind: token::Float, symbol, suffix }) => {
1032 Ok(self.parse_tuple_field_access_expr_float(lo, base, symbol, suffix))
1035 self.error_unexpected_after_dot();
1041 fn error_unexpected_after_dot(&self) {
1042 // FIXME Could factor this out into non_fatal_unexpected or something.
1043 let actual = pprust::token_to_string(&self.token);
1044 self.struct_span_err(self.token.span, &format!("unexpected token: `{actual}`")).emit();
1047 // We need an identifier or integer, but the next token is a float.
1048 // Break the float into components to extract the identifier or integer.
1049 // FIXME: With current `TokenCursor` it's hard to break tokens into more than 2
1050 // parts unless those parts are processed immediately. `TokenCursor` should either
1051 // support pushing "future tokens" (would be also helpful to `break_and_eat`), or
1052 // we should break everything including floats into more basic proc-macro style
1053 // tokens in the lexer (probably preferable).
1054 fn parse_tuple_field_access_expr_float(
1059 suffix: Option<Symbol>,
1062 enum FloatComponent {
1066 use FloatComponent::*;
1068 let float_str = float.as_str();
1069 let mut components = Vec::new();
1070 let mut ident_like = String::new();
1071 for c in float_str.chars() {
1072 if c == '_' || c.is_ascii_alphanumeric() {
1074 } else if matches!(c, '.' | '+' | '-') {
1075 if !ident_like.is_empty() {
1076 components.push(IdentLike(mem::take(&mut ident_like)));
1078 components.push(Punct(c));
1080 panic!("unexpected character in a float token: {:?}", c)
1083 if !ident_like.is_empty() {
1084 components.push(IdentLike(ident_like));
1087 // With proc macros the span can refer to anything, the source may be too short,
1088 // or too long, or non-ASCII. It only makes sense to break our span into components
1089 // if its underlying text is identical to our float literal.
1090 let span = self.token.span;
1091 let can_take_span_apart =
1092 || self.span_to_snippet(span).as_deref() == Ok(float_str).as_deref();
1094 match &*components {
1097 self.parse_tuple_field_access_expr(lo, base, Symbol::intern(&i), suffix, None)
1100 [IdentLike(i), Punct('.')] => {
1101 let (ident_span, dot_span) = if can_take_span_apart() {
1102 let (span, ident_len) = (span.data(), BytePos::from_usize(i.len()));
1103 let ident_span = span.with_hi(span.lo + ident_len);
1104 let dot_span = span.with_lo(span.lo + ident_len);
1105 (ident_span, dot_span)
1109 assert!(suffix.is_none());
1110 let symbol = Symbol::intern(&i);
1111 self.token = Token::new(token::Ident(symbol, false), ident_span);
1112 let next_token = (Token::new(token::Dot, dot_span), self.token_spacing);
1113 self.parse_tuple_field_access_expr(lo, base, symbol, None, Some(next_token))
1116 [IdentLike(i1), Punct('.'), IdentLike(i2)] => {
1117 let (ident1_span, dot_span, ident2_span) = if can_take_span_apart() {
1118 let (span, ident1_len) = (span.data(), BytePos::from_usize(i1.len()));
1119 let ident1_span = span.with_hi(span.lo + ident1_len);
1121 .with_lo(span.lo + ident1_len)
1122 .with_hi(span.lo + ident1_len + BytePos(1));
1123 let ident2_span = self.token.span.with_lo(span.lo + ident1_len + BytePos(1));
1124 (ident1_span, dot_span, ident2_span)
1128 let symbol1 = Symbol::intern(&i1);
1129 self.token = Token::new(token::Ident(symbol1, false), ident1_span);
1130 // This needs to be `Spacing::Alone` to prevent regressions.
1131 // See issue #76399 and PR #76285 for more details
1132 let next_token1 = (Token::new(token::Dot, dot_span), Spacing::Alone);
1134 self.parse_tuple_field_access_expr(lo, base, symbol1, None, Some(next_token1));
1135 let symbol2 = Symbol::intern(&i2);
1136 let next_token2 = Token::new(token::Ident(symbol2, false), ident2_span);
1137 self.bump_with((next_token2, self.token_spacing)); // `.`
1138 self.parse_tuple_field_access_expr(lo, base1, symbol2, suffix, None)
1140 // 1e+ | 1e- (recovered)
1141 [IdentLike(_), Punct('+' | '-')] |
1143 [IdentLike(_), Punct('+' | '-'), IdentLike(_)] |
1145 [IdentLike(_), Punct('.'), IdentLike(_), Punct('+' | '-')] |
1147 [IdentLike(_), Punct('.'), IdentLike(_), Punct('+' | '-'), IdentLike(_)] => {
1148 // See the FIXME about `TokenCursor` above.
1149 self.error_unexpected_after_dot();
1152 _ => panic!("unexpected components in a float token: {:?}", components),
1156 fn parse_tuple_field_access_expr(
1161 suffix: Option<Symbol>,
1162 next_token: Option<(Token, Spacing)>,
1165 Some(next_token) => self.bump_with(next_token),
1166 None => self.bump(),
1168 let span = self.prev_token.span;
1169 let field = ExprKind::Field(base, Ident::new(field, span));
1170 self.expect_no_suffix(span, "a tuple index", suffix);
1171 self.mk_expr(lo.to(span), field, AttrVec::new())
1174 /// Parse a function call expression, `expr(...)`.
1175 fn parse_fn_call_expr(&mut self, lo: Span, fun: P<Expr>) -> P<Expr> {
1176 let snapshot = if self.token.kind == token::OpenDelim(Delimiter::Parenthesis)
1177 && self.look_ahead_type_ascription_as_field()
1179 Some((self.create_snapshot_for_diagnostic(), fun.kind.clone()))
1183 let open_paren = self.token.span;
1185 let mut seq = self.parse_paren_expr_seq().map(|args| {
1186 self.mk_expr(lo.to(self.prev_token.span), self.mk_call(fun, args), AttrVec::new())
1189 self.maybe_recover_struct_lit_bad_delims(lo, open_paren, &mut seq, snapshot)
1193 self.recover_seq_parse_error(Delimiter::Parenthesis, lo, seq)
1196 /// If we encounter a parser state that looks like the user has written a `struct` literal with
1197 /// parentheses instead of braces, recover the parser state and provide suggestions.
1198 #[instrument(skip(self, seq, snapshot), level = "trace")]
1199 fn maybe_recover_struct_lit_bad_delims(
1203 seq: &mut PResult<'a, P<Expr>>,
1204 snapshot: Option<(SnapshotParser<'a>, ExprKind)>,
1205 ) -> Option<P<Expr>> {
1206 match (seq.as_mut(), snapshot) {
1207 (Err(err), Some((mut snapshot, ExprKind::Path(None, path)))) => {
1208 let name = pprust::path_to_string(&path);
1209 snapshot.bump(); // `(`
1210 match snapshot.parse_struct_fields(path, false, Delimiter::Parenthesis) {
1212 if snapshot.eat(&token::CloseDelim(Delimiter::Parenthesis)) =>
1214 // We are certain we have `Enum::Foo(a: 3, b: 4)`, suggest
1215 // `Enum::Foo { a: 3, b: 4 }` or `Enum::Foo(3, 4)`.
1216 self.restore_snapshot(snapshot);
1217 let close_paren = self.prev_token.span;
1218 let span = lo.to(self.prev_token.span);
1219 if !fields.is_empty() {
1220 let replacement_err = self.struct_span_err(
1222 "invalid `struct` delimiters or `fn` call arguments",
1224 mem::replace(err, replacement_err).cancel();
1226 err.multipart_suggestion(
1227 &format!("if `{name}` is a struct, use braces as delimiters"),
1229 (open_paren, " { ".to_string()),
1230 (close_paren, " }".to_string()),
1232 Applicability::MaybeIncorrect,
1234 err.multipart_suggestion(
1235 &format!("if `{name}` is a function, use the arguments directly"),
1238 .map(|field| (field.span.until(field.expr.span), String::new()))
1240 Applicability::MaybeIncorrect,
1246 return Some(self.mk_expr_err(span));
1259 /// Parse an indexing expression `expr[...]`.
1260 fn parse_index_expr(&mut self, lo: Span, base: P<Expr>) -> PResult<'a, P<Expr>> {
1261 let prev_span = self.prev_token.span;
1262 let open_delim_span = self.token.span;
1264 let index = self.parse_expr()?;
1265 self.suggest_missing_semicolon_before_array(prev_span, open_delim_span)?;
1266 self.expect(&token::CloseDelim(Delimiter::Bracket))?;
1267 Ok(self.mk_expr(lo.to(self.prev_token.span), self.mk_index(base, index), AttrVec::new()))
1270 /// Assuming we have just parsed `.`, continue parsing into an expression.
1271 fn parse_dot_suffix(&mut self, self_arg: P<Expr>, lo: Span) -> PResult<'a, P<Expr>> {
1272 if self.token.uninterpolated_span().rust_2018() && self.eat_keyword(kw::Await) {
1273 return Ok(self.mk_await_expr(self_arg, lo));
1276 let fn_span_lo = self.token.span;
1277 let mut segment = self.parse_path_segment(PathStyle::Expr, None)?;
1278 self.check_trailing_angle_brackets(&segment, &[&token::OpenDelim(Delimiter::Parenthesis)]);
1279 self.check_turbofish_missing_angle_brackets(&mut segment);
1281 if self.check(&token::OpenDelim(Delimiter::Parenthesis)) {
1282 // Method call `expr.f()`
1283 let mut args = self.parse_paren_expr_seq()?;
1284 args.insert(0, self_arg);
1286 let fn_span = fn_span_lo.to(self.prev_token.span);
1287 let span = lo.to(self.prev_token.span);
1288 Ok(self.mk_expr(span, ExprKind::MethodCall(segment, args, fn_span), AttrVec::new()))
1290 // Field access `expr.f`
1291 if let Some(args) = segment.args {
1292 self.struct_span_err(
1294 "field expressions cannot have generic arguments",
1299 let span = lo.to(self.prev_token.span);
1300 Ok(self.mk_expr(span, ExprKind::Field(self_arg, segment.ident), AttrVec::new()))
1304 /// At the bottom (top?) of the precedence hierarchy,
1305 /// Parses things like parenthesized exprs, macros, `return`, etc.
1307 /// N.B., this does not parse outer attributes, and is private because it only works
1308 /// correctly if called from `parse_dot_or_call_expr()`.
1309 fn parse_bottom_expr(&mut self) -> PResult<'a, P<Expr>> {
1310 maybe_recover_from_interpolated_ty_qpath!(self, true);
1311 maybe_whole_expr!(self);
1313 // Outer attributes are already parsed and will be
1314 // added to the return value after the fact.
1316 // Therefore, prevent sub-parser from parsing
1317 // attributes by giving them an empty "already-parsed" list.
1318 let attrs = AttrVec::new();
1320 // Note: when adding new syntax here, don't forget to adjust `TokenKind::can_begin_expr()`.
1321 let lo = self.token.span;
1322 if let token::Literal(_) = self.token.kind {
1323 // This match arm is a special-case of the `_` match arm below and
1324 // could be removed without changing functionality, but it's faster
1325 // to have it here, especially for programs with large constants.
1326 self.parse_lit_expr(attrs)
1327 } else if self.check(&token::OpenDelim(Delimiter::Parenthesis)) {
1328 self.parse_tuple_parens_expr(attrs)
1329 } else if self.check(&token::OpenDelim(Delimiter::Brace)) {
1330 self.parse_block_expr(None, lo, BlockCheckMode::Default, attrs)
1331 } else if self.check(&token::BinOp(token::Or)) || self.check(&token::OrOr) {
1332 self.parse_closure_expr(attrs).map_err(|mut err| {
1333 // If the input is something like `if a { 1 } else { 2 } | if a { 3 } else { 4 }`
1334 // then suggest parens around the lhs.
1335 if let Some(sp) = self.sess.ambiguous_block_expr_parse.borrow().get(&lo) {
1336 self.sess.expr_parentheses_needed(&mut err, *sp);
1340 } else if self.check(&token::OpenDelim(Delimiter::Bracket)) {
1341 self.parse_array_or_repeat_expr(attrs, Delimiter::Bracket)
1342 } else if self.check_path() {
1343 self.parse_path_start_expr(attrs)
1344 } else if self.check_keyword(kw::Move) || self.check_keyword(kw::Static) {
1345 self.parse_closure_expr(attrs)
1346 } else if self.eat_keyword(kw::If) {
1347 self.parse_if_expr(attrs)
1348 } else if self.check_keyword(kw::For) {
1349 if self.choose_generics_over_qpath(1) {
1350 self.parse_closure_expr(attrs)
1352 assert!(self.eat_keyword(kw::For));
1353 self.parse_for_expr(None, self.prev_token.span, attrs)
1355 } else if self.eat_keyword(kw::While) {
1356 self.parse_while_expr(None, self.prev_token.span, attrs)
1357 } else if let Some(label) = self.eat_label() {
1358 self.parse_labeled_expr(label, attrs, true)
1359 } else if self.eat_keyword(kw::Loop) {
1360 let sp = self.prev_token.span;
1361 self.parse_loop_expr(None, self.prev_token.span, attrs).map_err(|mut err| {
1362 err.span_label(sp, "while parsing this `loop` expression");
1365 } else if self.eat_keyword(kw::Continue) {
1366 let kind = ExprKind::Continue(self.eat_label());
1367 Ok(self.mk_expr(lo.to(self.prev_token.span), kind, attrs))
1368 } else if self.eat_keyword(kw::Match) {
1369 let match_sp = self.prev_token.span;
1370 self.parse_match_expr(attrs).map_err(|mut err| {
1371 err.span_label(match_sp, "while parsing this `match` expression");
1374 } else if self.eat_keyword(kw::Unsafe) {
1375 let sp = self.prev_token.span;
1376 self.parse_block_expr(None, lo, BlockCheckMode::Unsafe(ast::UserProvided), attrs)
1377 .map_err(|mut err| {
1378 err.span_label(sp, "while parsing this `unsafe` expression");
1381 } else if self.check_inline_const(0) {
1382 self.parse_const_block(lo.to(self.token.span), false)
1383 } else if self.is_do_catch_block() {
1384 self.recover_do_catch(attrs)
1385 } else if self.is_try_block() {
1386 self.expect_keyword(kw::Try)?;
1387 self.parse_try_block(lo, attrs)
1388 } else if self.eat_keyword(kw::Return) {
1389 self.parse_return_expr(attrs)
1390 } else if self.eat_keyword(kw::Break) {
1391 self.parse_break_expr(attrs)
1392 } else if self.eat_keyword(kw::Yield) {
1393 self.parse_yield_expr(attrs)
1394 } else if self.is_do_yeet() {
1395 self.parse_yeet_expr(attrs)
1396 } else if self.check_keyword(kw::Let) {
1397 self.parse_let_expr(attrs)
1398 } else if self.eat_keyword(kw::Underscore) {
1399 Ok(self.mk_expr(self.prev_token.span, ExprKind::Underscore, attrs))
1400 } else if !self.unclosed_delims.is_empty() && self.check(&token::Semi) {
1401 // Don't complain about bare semicolons after unclosed braces
1402 // recovery in order to keep the error count down. Fixing the
1403 // delimiters will possibly also fix the bare semicolon found in
1404 // expression context. For example, silence the following error:
1406 // error: expected expression, found `;`
1410 // | ^ expected expression
1412 Ok(self.mk_expr_err(self.token.span))
1413 } else if self.token.uninterpolated_span().rust_2018() {
1414 // `Span::rust_2018()` is somewhat expensive; don't get it repeatedly.
1415 if self.check_keyword(kw::Async) {
1416 if self.is_async_block() {
1417 // Check for `async {` and `async move {`.
1418 self.parse_async_block(attrs)
1420 self.parse_closure_expr(attrs)
1422 } else if self.eat_keyword(kw::Await) {
1423 self.recover_incorrect_await_syntax(lo, self.prev_token.span, attrs)
1425 self.parse_lit_expr(attrs)
1428 self.parse_lit_expr(attrs)
1432 fn parse_lit_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
1433 let lo = self.token.span;
1434 match self.parse_opt_lit() {
1436 let expr = self.mk_expr(lo.to(self.prev_token.span), ExprKind::Lit(literal), attrs);
1437 self.maybe_recover_from_bad_qpath(expr)
1439 None => self.try_macro_suggestion(),
1443 fn parse_tuple_parens_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
1444 let lo = self.token.span;
1445 self.expect(&token::OpenDelim(Delimiter::Parenthesis))?;
1446 let (es, trailing_comma) = match self.parse_seq_to_end(
1447 &token::CloseDelim(Delimiter::Parenthesis),
1448 SeqSep::trailing_allowed(token::Comma),
1449 |p| p.parse_expr_catch_underscore(),
1453 return Ok(self.recover_seq_parse_error(Delimiter::Parenthesis, lo, Err(err)));
1456 let kind = if es.len() == 1 && !trailing_comma {
1457 // `(e)` is parenthesized `e`.
1458 ExprKind::Paren(es.into_iter().next().unwrap())
1460 // `(e,)` is a tuple with only one field, `e`.
1463 let expr = self.mk_expr(lo.to(self.prev_token.span), kind, attrs);
1464 self.maybe_recover_from_bad_qpath(expr)
1467 fn parse_array_or_repeat_expr(
1470 close_delim: Delimiter,
1471 ) -> PResult<'a, P<Expr>> {
1472 let lo = self.token.span;
1473 self.bump(); // `[` or other open delim
1475 let close = &token::CloseDelim(close_delim);
1476 let kind = if self.eat(close) {
1478 ExprKind::Array(Vec::new())
1481 let first_expr = self.parse_expr()?;
1482 if self.eat(&token::Semi) {
1483 // Repeating array syntax: `[ 0; 512 ]`
1484 let count = self.parse_anon_const_expr()?;
1485 self.expect(close)?;
1486 ExprKind::Repeat(first_expr, count)
1487 } else if self.eat(&token::Comma) {
1488 // Vector with two or more elements.
1489 let sep = SeqSep::trailing_allowed(token::Comma);
1490 let (remaining_exprs, _) = self.parse_seq_to_end(close, sep, |p| p.parse_expr())?;
1491 let mut exprs = vec![first_expr];
1492 exprs.extend(remaining_exprs);
1493 ExprKind::Array(exprs)
1495 // Vector with one element
1496 self.expect(close)?;
1497 ExprKind::Array(vec![first_expr])
1500 let expr = self.mk_expr(lo.to(self.prev_token.span), kind, attrs);
1501 self.maybe_recover_from_bad_qpath(expr)
1504 fn parse_path_start_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
1505 let (qself, path) = if self.eat_lt() {
1506 let (qself, path) = self.parse_qpath(PathStyle::Expr)?;
1509 (None, self.parse_path(PathStyle::Expr)?)
1513 // `!`, as an operator, is prefix, so we know this isn't that.
1514 let (hi, kind) = if self.eat(&token::Not) {
1515 // MACRO INVOCATION expression
1516 if qself.is_some() {
1517 self.struct_span_err(path.span, "macros cannot use qualified paths").emit();
1521 args: self.parse_mac_args()?,
1522 prior_type_ascription: self.last_type_ascription,
1524 (self.prev_token.span, ExprKind::MacCall(mac))
1525 } else if self.check(&token::OpenDelim(Delimiter::Brace)) {
1526 if let Some(expr) = self.maybe_parse_struct_expr(qself.as_ref(), &path, &attrs) {
1527 if qself.is_some() {
1528 self.sess.gated_spans.gate(sym::more_qualified_paths, path.span);
1532 (path.span, ExprKind::Path(qself, path))
1535 (path.span, ExprKind::Path(qself, path))
1538 let expr = self.mk_expr(lo.to(hi), kind, attrs);
1539 self.maybe_recover_from_bad_qpath(expr)
1542 /// Parse `'label: $expr`. The label is already parsed.
1543 fn parse_labeled_expr(
1547 mut consume_colon: bool,
1548 ) -> PResult<'a, P<Expr>> {
1549 let lo = label.ident.span;
1550 let label = Some(label);
1551 let ate_colon = self.eat(&token::Colon);
1552 let expr = if self.eat_keyword(kw::While) {
1553 self.parse_while_expr(label, lo, attrs)
1554 } else if self.eat_keyword(kw::For) {
1555 self.parse_for_expr(label, lo, attrs)
1556 } else if self.eat_keyword(kw::Loop) {
1557 self.parse_loop_expr(label, lo, attrs)
1558 } else if self.check_noexpect(&token::OpenDelim(Delimiter::Brace))
1559 || self.token.is_whole_block()
1561 self.parse_block_expr(label, lo, BlockCheckMode::Default, attrs)
1562 } else if !ate_colon
1563 && (self.check_noexpect(&TokenKind::Comma) || self.check_noexpect(&TokenKind::Gt))
1565 // We're probably inside of a `Path<'a>` that needs a turbofish
1566 let msg = "expected `while`, `for`, `loop` or `{` after a label";
1567 self.struct_span_err(self.token.span, msg).span_label(self.token.span, msg).emit();
1568 consume_colon = false;
1569 Ok(self.mk_expr_err(lo))
1571 let msg = "expected `while`, `for`, `loop` or `{` after a label";
1573 let mut err = self.struct_span_err(self.token.span, msg);
1574 err.span_label(self.token.span, msg);
1576 // Continue as an expression in an effort to recover on `'label: non_block_expr`.
1577 let expr = self.parse_expr().map(|expr| {
1578 let span = expr.span;
1580 let found_labeled_breaks = {
1581 struct FindLabeledBreaksVisitor(bool);
1583 impl<'ast> Visitor<'ast> for FindLabeledBreaksVisitor {
1584 fn visit_expr_post(&mut self, ex: &'ast Expr) {
1585 if let ExprKind::Break(Some(_label), _) = ex.kind {
1591 let mut vis = FindLabeledBreaksVisitor(false);
1592 vis.visit_expr(&expr);
1596 // Suggestion involves adding a (as of time of writing this, unstable) labeled block.
1598 // If there are no breaks that may use this label, suggest removing the label and
1599 // recover to the unmodified expression.
1600 if !found_labeled_breaks {
1601 let msg = "consider removing the label";
1602 err.span_suggestion_verbose(
1606 Applicability::MachineApplicable,
1612 let sugg_msg = "consider enclosing expression in a block";
1613 let suggestions = vec![
1614 (span.shrink_to_lo(), "{ ".to_owned()),
1615 (span.shrink_to_hi(), " }".to_owned()),
1618 err.multipart_suggestion_verbose(
1621 Applicability::MachineApplicable,
1624 // Replace `'label: non_block_expr` with `'label: {non_block_expr}` in order to supress future errors about `break 'label`.
1625 let stmt = self.mk_stmt(span, StmtKind::Expr(expr));
1626 let blk = self.mk_block(vec![stmt], BlockCheckMode::Default, span);
1627 self.mk_expr(span, ExprKind::Block(blk, label), ThinVec::new())
1634 if !ate_colon && consume_colon {
1635 self.error_labeled_expr_must_be_followed_by_colon(lo, expr.span);
1641 fn error_labeled_expr_must_be_followed_by_colon(&self, lo: Span, span: Span) {
1642 self.struct_span_err(span, "labeled expression must be followed by `:`")
1643 .span_label(lo, "the label")
1644 .span_suggestion_short(
1646 "add `:` after the label",
1648 Applicability::MachineApplicable,
1650 .note("labels are used before loops and blocks, allowing e.g., `break 'label` to them")
1654 /// Recover on the syntax `do catch { ... }` suggesting `try { ... }` instead.
1655 fn recover_do_catch(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
1656 let lo = self.token.span;
1658 self.bump(); // `do`
1659 self.bump(); // `catch`
1661 let span_dc = lo.to(self.prev_token.span);
1662 self.struct_span_err(span_dc, "found removed `do catch` syntax")
1665 "replace with the new syntax",
1667 Applicability::MachineApplicable,
1669 .note("following RFC #2388, the new non-placeholder syntax is `try`")
1672 self.parse_try_block(lo, attrs)
1675 /// Parse an expression if the token can begin one.
1676 fn parse_expr_opt(&mut self) -> PResult<'a, Option<P<Expr>>> {
1677 Ok(if self.token.can_begin_expr() { Some(self.parse_expr()?) } else { None })
1680 /// Parse `"return" expr?`.
1681 fn parse_return_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
1682 let lo = self.prev_token.span;
1683 let kind = ExprKind::Ret(self.parse_expr_opt()?);
1684 let expr = self.mk_expr(lo.to(self.prev_token.span), kind, attrs);
1685 self.maybe_recover_from_bad_qpath(expr)
1688 /// Parse `"do" "yeet" expr?`.
1689 fn parse_yeet_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
1690 let lo = self.token.span;
1692 self.bump(); // `do`
1693 self.bump(); // `yeet`
1695 let kind = ExprKind::Yeet(self.parse_expr_opt()?);
1697 let span = lo.to(self.prev_token.span);
1698 self.sess.gated_spans.gate(sym::yeet_expr, span);
1699 let expr = self.mk_expr(span, kind, attrs);
1700 self.maybe_recover_from_bad_qpath(expr)
1703 /// Parse `"break" (('label (:? expr)?) | expr?)` with `"break"` token already eaten.
1704 /// If the label is followed immediately by a `:` token, the label and `:` are
1705 /// parsed as part of the expression (i.e. a labeled loop). The language team has
1706 /// decided in #87026 to require parentheses as a visual aid to avoid confusion if
1707 /// the break expression of an unlabeled break is a labeled loop (as in
1708 /// `break 'lbl: loop {}`); a labeled break with an unlabeled loop as its value
1709 /// expression only gets a warning for compatibility reasons; and a labeled break
1710 /// with a labeled loop does not even get a warning because there is no ambiguity.
1711 fn parse_break_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
1712 let lo = self.prev_token.span;
1713 let mut label = self.eat_label();
1714 let kind = if label.is_some() && self.token == token::Colon {
1715 // The value expression can be a labeled loop, see issue #86948, e.g.:
1716 // `loop { break 'label: loop { break 'label 42; }; }`
1717 let lexpr = self.parse_labeled_expr(label.take().unwrap(), AttrVec::new(), true)?;
1718 self.struct_span_err(
1720 "parentheses are required around this expression to avoid confusion with a labeled break expression",
1722 .multipart_suggestion(
1723 "wrap the expression in parentheses",
1725 (lexpr.span.shrink_to_lo(), "(".to_string()),
1726 (lexpr.span.shrink_to_hi(), ")".to_string()),
1728 Applicability::MachineApplicable,
1732 } else if self.token != token::OpenDelim(Delimiter::Brace)
1733 || !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL)
1735 let expr = self.parse_expr_opt()?;
1736 if let Some(ref expr) = expr {
1740 ExprKind::While(_, _, None)
1741 | ExprKind::ForLoop(_, _, _, None)
1742 | ExprKind::Loop(_, None)
1743 | ExprKind::Block(_, None)
1746 self.sess.buffer_lint_with_diagnostic(
1747 BREAK_WITH_LABEL_AND_LOOP,
1750 "this labeled break expression is easy to confuse with an unlabeled break with a labeled value expression",
1751 BuiltinLintDiagnostics::BreakWithLabelAndLoop(expr.span),
1759 let expr = self.mk_expr(lo.to(self.prev_token.span), ExprKind::Break(label, kind), attrs);
1760 self.maybe_recover_from_bad_qpath(expr)
1763 /// Parse `"yield" expr?`.
1764 fn parse_yield_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
1765 let lo = self.prev_token.span;
1766 let kind = ExprKind::Yield(self.parse_expr_opt()?);
1767 let span = lo.to(self.prev_token.span);
1768 self.sess.gated_spans.gate(sym::generators, span);
1769 let expr = self.mk_expr(span, kind, attrs);
1770 self.maybe_recover_from_bad_qpath(expr)
1773 /// Returns a string literal if the next token is a string literal.
1774 /// In case of error returns `Some(lit)` if the next token is a literal with a wrong kind,
1775 /// and returns `None` if the next token is not literal at all.
1776 pub fn parse_str_lit(&mut self) -> Result<ast::StrLit, Option<Lit>> {
1777 match self.parse_opt_lit() {
1778 Some(lit) => match lit.kind {
1779 ast::LitKind::Str(symbol_unescaped, style) => Ok(ast::StrLit {
1781 symbol: lit.token.symbol,
1782 suffix: lit.token.suffix,
1786 _ => Err(Some(lit)),
1792 pub(super) fn parse_lit(&mut self) -> PResult<'a, Lit> {
1793 self.parse_opt_lit().ok_or_else(|| {
1794 if let token::Interpolated(inner) = &self.token.kind {
1795 let expr = match inner.as_ref() {
1796 token::NtExpr(expr) => Some(expr),
1797 token::NtLiteral(expr) => Some(expr),
1800 if let Some(expr) = expr {
1801 if matches!(expr.kind, ExprKind::Err) {
1804 .struct_span_err(self.token.span, "invalid interpolated expression");
1805 err.downgrade_to_delayed_bug();
1810 let msg = format!("unexpected token: {}", super::token_descr(&self.token));
1811 self.struct_span_err(self.token.span, &msg)
1815 /// Matches `lit = true | false | token_lit`.
1816 /// Returns `None` if the next token is not a literal.
1817 pub(super) fn parse_opt_lit(&mut self) -> Option<Lit> {
1818 let mut recovered = None;
1819 if self.token == token::Dot {
1820 // Attempt to recover `.4` as `0.4`. We don't currently have any syntax where
1821 // dot would follow an optional literal, so we do this unconditionally.
1822 recovered = self.look_ahead(1, |next_token| {
1823 if let token::Literal(token::Lit { kind: token::Integer, symbol, suffix }) =
1826 if self.token.span.hi() == next_token.span.lo() {
1827 let s = String::from("0.") + symbol.as_str();
1828 let kind = TokenKind::lit(token::Float, Symbol::intern(&s), suffix);
1829 return Some(Token::new(kind, self.token.span.to(next_token.span)));
1834 if let Some(token) = &recovered {
1836 self.error_float_lits_must_have_int_part(&token);
1840 let token = recovered.as_ref().unwrap_or(&self.token);
1841 match Lit::from_token(token) {
1846 Err(LitError::NotLiteral) => None,
1848 let span = token.span;
1849 let token::Literal(lit) = token.kind else {
1853 self.report_lit_error(err, lit, span);
1854 // Pack possible quotes and prefixes from the original literal into
1855 // the error literal's symbol so they can be pretty-printed faithfully.
1856 let suffixless_lit = token::Lit::new(lit.kind, lit.symbol, None);
1857 let symbol = Symbol::intern(&suffixless_lit.to_string());
1858 let lit = token::Lit::new(token::Err, symbol, lit.suffix);
1859 Some(Lit::from_lit_token(lit, span).unwrap_or_else(|_| unreachable!()))
1864 fn error_float_lits_must_have_int_part(&self, token: &Token) {
1865 self.struct_span_err(token.span, "float literals must have an integer part")
1868 "must have an integer part",
1869 pprust::token_to_string(token),
1870 Applicability::MachineApplicable,
1875 fn report_lit_error(&self, err: LitError, lit: token::Lit, span: Span) {
1876 // Checks if `s` looks like i32 or u1234 etc.
1877 fn looks_like_width_suffix(first_chars: &[char], s: &str) -> bool {
1878 s.len() > 1 && s.starts_with(first_chars) && s[1..].chars().all(|c| c.is_ascii_digit())
1881 // Try to lowercase the prefix if it's a valid base prefix.
1882 fn fix_base_capitalisation(s: &str) -> Option<String> {
1883 if let Some(stripped) = s.strip_prefix('B') {
1884 Some(format!("0b{stripped}"))
1885 } else if let Some(stripped) = s.strip_prefix('O') {
1886 Some(format!("0o{stripped}"))
1887 } else if let Some(stripped) = s.strip_prefix('X') {
1888 Some(format!("0x{stripped}"))
1894 let token::Lit { kind, suffix, .. } = lit;
1896 // `NotLiteral` is not an error by itself, so we don't report
1897 // it and give the parser opportunity to try something else.
1898 LitError::NotLiteral => {}
1899 // `LexerError` *is* an error, but it was already reported
1900 // by lexer, so here we don't report it the second time.
1901 LitError::LexerError => {}
1902 LitError::InvalidSuffix => {
1903 self.expect_no_suffix(
1905 &format!("{} {} literal", kind.article(), kind.descr()),
1909 LitError::InvalidIntSuffix => {
1910 let suf = suffix.expect("suffix error with no suffix");
1911 let suf = suf.as_str();
1912 if looks_like_width_suffix(&['i', 'u'], &suf) {
1913 // If it looks like a width, try to be helpful.
1914 let msg = format!("invalid width `{}` for integer literal", &suf[1..]);
1915 self.struct_span_err(span, &msg)
1916 .help("valid widths are 8, 16, 32, 64 and 128")
1918 } else if let Some(fixed) = fix_base_capitalisation(suf) {
1919 let msg = "invalid base prefix for number literal";
1921 self.struct_span_err(span, msg)
1922 .note("base prefixes (`0xff`, `0b1010`, `0o755`) are lowercase")
1925 "try making the prefix lowercase",
1927 Applicability::MaybeIncorrect,
1931 let msg = format!("invalid suffix `{suf}` for number literal");
1932 self.struct_span_err(span, &msg)
1933 .span_label(span, format!("invalid suffix `{suf}`"))
1934 .help("the suffix must be one of the numeric types (`u32`, `isize`, `f32`, etc.)")
1938 LitError::InvalidFloatSuffix => {
1939 let suf = suffix.expect("suffix error with no suffix");
1940 let suf = suf.as_str();
1941 if looks_like_width_suffix(&['f'], suf) {
1942 // If it looks like a width, try to be helpful.
1943 let msg = format!("invalid width `{}` for float literal", &suf[1..]);
1944 self.struct_span_err(span, &msg).help("valid widths are 32 and 64").emit();
1946 let msg = format!("invalid suffix `{suf}` for float literal");
1947 self.struct_span_err(span, &msg)
1948 .span_label(span, format!("invalid suffix `{suf}`"))
1949 .help("valid suffixes are `f32` and `f64`")
1953 LitError::NonDecimalFloat(base) => {
1954 let descr = match base {
1955 16 => "hexadecimal",
1958 _ => unreachable!(),
1960 self.struct_span_err(span, &format!("{descr} float literal is not supported"))
1961 .span_label(span, "not supported")
1964 LitError::IntTooLarge => {
1965 self.struct_span_err(span, "integer literal is too large").emit();
1970 pub(super) fn expect_no_suffix(&self, sp: Span, kind: &str, suffix: Option<Symbol>) {
1971 if let Some(suf) = suffix {
1972 let mut err = if kind == "a tuple index"
1973 && [sym::i32, sym::u32, sym::isize, sym::usize].contains(&suf)
1975 // #59553: warn instead of reject out of hand to allow the fix to percolate
1976 // through the ecosystem when people fix their macros
1980 .struct_span_warn(sp, &format!("suffixes on {kind} are invalid"));
1982 "`{}` is *temporarily* accepted on tuple index fields as it was \
1983 incorrectly accepted on stable for a few releases",
1987 "on proc macros, you'll want to use `syn::Index::from` or \
1988 `proc_macro::Literal::*_unsuffixed` for code that will desugar \
1989 to tuple field access",
1992 "see issue #60210 <https://github.com/rust-lang/rust/issues/60210> \
1993 for more information",
1997 self.struct_span_err(sp, &format!("suffixes on {kind} are invalid"))
2000 err.span_label(sp, format!("invalid suffix `{suf}`"));
2005 /// Matches `'-' lit | lit` (cf. `ast_validation::AstValidator::check_expr_within_pat`).
2006 /// Keep this in sync with `Token::can_begin_literal_maybe_minus`.
2007 pub fn parse_literal_maybe_minus(&mut self) -> PResult<'a, P<Expr>> {
2008 maybe_whole_expr!(self);
2010 let lo = self.token.span;
2011 let minus_present = self.eat(&token::BinOp(token::Minus));
2012 let lit = self.parse_lit()?;
2013 let expr = self.mk_expr(lit.span, ExprKind::Lit(lit), AttrVec::new());
2017 lo.to(self.prev_token.span),
2018 self.mk_unary(UnOp::Neg, expr),
2026 fn is_array_like_block(&mut self) -> bool {
2027 self.look_ahead(1, |t| matches!(t.kind, TokenKind::Ident(..) | TokenKind::Literal(_)))
2028 && self.look_ahead(2, |t| t == &token::Comma)
2029 && self.look_ahead(3, |t| t.can_begin_expr())
2032 /// Emits a suggestion if it looks like the user meant an array but
2033 /// accidentally used braces, causing the code to be interpreted as a block
2035 fn maybe_suggest_brackets_instead_of_braces(
2039 ) -> Option<P<Expr>> {
2040 let mut snapshot = self.create_snapshot_for_diagnostic();
2041 match snapshot.parse_array_or_repeat_expr(attrs, Delimiter::Brace) {
2043 let hi = snapshot.prev_token.span;
2044 self.struct_span_err(arr.span, "this is a block expression, not an array")
2045 .multipart_suggestion(
2046 "to make an array, use square brackets instead of curly braces",
2047 vec![(lo, "[".to_owned()), (hi, "]".to_owned())],
2048 Applicability::MaybeIncorrect,
2052 self.restore_snapshot(snapshot);
2053 Some(self.mk_expr_err(arr.span))
2062 fn suggest_missing_semicolon_before_array(
2065 open_delim_span: Span,
2066 ) -> PResult<'a, ()> {
2067 if self.token.kind == token::Comma {
2068 let mut snapshot = self.create_snapshot_for_diagnostic();
2070 match snapshot.parse_seq_to_before_end(
2071 &token::CloseDelim(Delimiter::Bracket),
2072 SeqSep::trailing_allowed(token::Comma),
2076 // When the close delim is `)`, `token.kind` is expected to be `token::CloseDelim(Delimiter::Parenthesis)`,
2077 // but the actual `token.kind` is `token::CloseDelim(Delimiter::Bracket)`.
2078 // This is because the `token.kind` of the close delim is treated as the same as
2079 // that of the open delim in `TokenTreesReader::parse_token_tree`, even if the delimiters of them are different.
2080 // Therefore, `token.kind` should not be compared here.
2082 .span_to_snippet(snapshot.token.span)
2083 .map_or(false, |snippet| snippet == "]") =>
2085 let mut err = self.struct_span_err(open_delim_span, "expected `;`, found `[`");
2086 err.span_suggestion_verbose(
2087 prev_span.shrink_to_hi(),
2088 "consider adding `;` here",
2090 Applicability::MaybeIncorrect,
2095 Err(err) => err.cancel(),
2101 /// Parses a block or unsafe block.
2102 pub(super) fn parse_block_expr(
2104 opt_label: Option<Label>,
2106 blk_mode: BlockCheckMode,
2108 ) -> PResult<'a, P<Expr>> {
2109 if self.is_array_like_block() {
2110 if let Some(arr) = self.maybe_suggest_brackets_instead_of_braces(lo, attrs.clone()) {
2115 if let Some(label) = opt_label {
2116 self.sess.gated_spans.gate(sym::label_break_value, label.ident.span);
2119 if self.token.is_whole_block() {
2120 self.struct_span_err(self.token.span, "cannot use a `block` macro fragment here")
2121 .span_label(lo.to(self.token.span), "the `block` fragment is within this context")
2125 let (inner_attrs, blk) = self.parse_block_common(lo, blk_mode)?;
2126 attrs.extend(inner_attrs);
2127 Ok(self.mk_expr(blk.span, ExprKind::Block(blk, opt_label), attrs))
2130 /// Parse a block which takes no attributes and has no label
2131 fn parse_simple_block(&mut self) -> PResult<'a, P<Expr>> {
2132 let blk = self.parse_block()?;
2133 Ok(self.mk_expr(blk.span, ExprKind::Block(blk, None), AttrVec::new()))
2136 /// Parses a closure expression (e.g., `move |args| expr`).
2137 fn parse_closure_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
2138 let lo = self.token.span;
2140 let binder = if self.check_keyword(kw::For) {
2141 let lo = self.token.span;
2142 let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
2143 let span = lo.to(self.prev_token.span);
2145 self.sess.gated_spans.gate(sym::closure_lifetime_binder, span);
2147 ClosureBinder::For { span, generic_params: P::from_vec(lifetime_defs) }
2149 ClosureBinder::NotPresent
2153 if self.eat_keyword(kw::Static) { Movability::Static } else { Movability::Movable };
2155 let asyncness = if self.token.uninterpolated_span().rust_2018() {
2156 self.parse_asyncness()
2161 let capture_clause = self.parse_capture_clause()?;
2162 let decl = self.parse_fn_block_decl()?;
2163 let decl_hi = self.prev_token.span;
2164 let mut body = match decl.output {
2165 FnRetTy::Default(_) => {
2166 let restrictions = self.restrictions - Restrictions::STMT_EXPR;
2167 self.parse_expr_res(restrictions, None)?
2170 // If an explicit return type is given, require a block to appear (RFC 968).
2171 let body_lo = self.token.span;
2172 self.parse_block_expr(None, body_lo, BlockCheckMode::Default, AttrVec::new())?
2176 if let Async::Yes { span, .. } = asyncness {
2177 // Feature-gate `async ||` closures.
2178 self.sess.gated_spans.gate(sym::async_closure, span);
2181 if self.token.kind == TokenKind::Semi
2182 && matches!(self.token_cursor.frame.delim_sp, Some((Delimiter::Parenthesis, _)))
2184 // It is likely that the closure body is a block but where the
2185 // braces have been removed. We will recover and eat the next
2186 // statements later in the parsing process.
2187 body = self.mk_expr_err(body.span);
2190 let body_span = body.span;
2192 let closure = self.mk_expr(
2206 // Disable recovery for closure body
2208 ClosureSpans { whole_closure: closure.span, closing_pipe: decl_hi, body: body_span };
2209 self.current_closure = Some(spans);
2214 /// Parses an optional `move` prefix to a closure-like construct.
2215 fn parse_capture_clause(&mut self) -> PResult<'a, CaptureBy> {
2216 if self.eat_keyword(kw::Move) {
2217 // Check for `move async` and recover
2218 if self.check_keyword(kw::Async) {
2219 let move_async_span = self.token.span.with_lo(self.prev_token.span.data().lo);
2220 Err(self.incorrect_move_async_order_found(move_async_span))
2222 Ok(CaptureBy::Value)
2229 /// Parses the `|arg, arg|` header of a closure.
2230 fn parse_fn_block_decl(&mut self) -> PResult<'a, P<FnDecl>> {
2231 let inputs = if self.eat(&token::OrOr) {
2234 self.expect(&token::BinOp(token::Or))?;
2236 .parse_seq_to_before_tokens(
2237 &[&token::BinOp(token::Or), &token::OrOr],
2238 SeqSep::trailing_allowed(token::Comma),
2239 TokenExpectType::NoExpect,
2240 |p| p.parse_fn_block_param(),
2247 self.parse_ret_ty(AllowPlus::Yes, RecoverQPath::Yes, RecoverReturnSign::Yes)?;
2249 Ok(P(FnDecl { inputs, output }))
2252 /// Parses a parameter in a closure header (e.g., `|arg, arg|`).
2253 fn parse_fn_block_param(&mut self) -> PResult<'a, Param> {
2254 let lo = self.token.span;
2255 let attrs = self.parse_outer_attributes()?;
2256 self.collect_tokens_trailing_token(attrs, ForceCollect::No, |this, attrs| {
2257 let pat = this.parse_pat_no_top_alt(PARAM_EXPECTED)?;
2258 let ty = if this.eat(&token::Colon) {
2261 this.mk_ty(this.prev_token.span, TyKind::Infer)
2266 attrs: attrs.into(),
2269 span: lo.to(this.token.span),
2271 is_placeholder: false,
2273 TrailingToken::MaybeComma,
2278 /// Parses an `if` expression (`if` token already eaten).
2279 fn parse_if_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
2280 let lo = self.prev_token.span;
2281 let cond = self.parse_cond_expr()?;
2283 self.parse_if_after_cond(attrs, lo, cond)
2286 fn parse_if_after_cond(
2291 ) -> PResult<'a, P<Expr>> {
2292 let cond_span = cond.span;
2293 // Tries to interpret `cond` as either a missing expression if it's a block,
2294 // or as an unfinished expression if it's a binop and the RHS is a block.
2295 // We could probably add more recoveries here too...
2296 let mut recover_block_from_condition = |this: &mut Self| {
2297 let block = match &mut cond.kind {
2298 ExprKind::Binary(Spanned { span: binop_span, .. }, _, right)
2299 if let ExprKind::Block(_, None) = right.kind => {
2300 this.error_missing_if_then_block(lo, cond_span.shrink_to_lo().to(*binop_span), true).emit();
2301 std::mem::replace(right, this.mk_expr_err(binop_span.shrink_to_hi()))
2303 ExprKind::Block(_, None) => {
2304 this.error_missing_if_cond(lo, cond_span).emit();
2305 std::mem::replace(&mut cond, this.mk_expr_err(cond_span.shrink_to_hi()))
2311 if let ExprKind::Block(block, _) = &block.kind {
2318 let thn = if self.token.is_keyword(kw::Else) {
2319 if let Some(block) = recover_block_from_condition(self) {
2322 self.error_missing_if_then_block(lo, cond_span, false).emit();
2323 self.mk_block_err(cond_span.shrink_to_hi())
2326 let attrs = self.parse_outer_attributes()?.take_for_recovery(); // For recovery.
2327 let block = if self.check(&token::OpenDelim(Delimiter::Brace)) {
2330 if let Some(block) = recover_block_from_condition(self) {
2333 // Parse block, which will always fail, but we can add a nice note to the error
2334 self.parse_block().map_err(|mut err| {
2337 "the `if` expression is missing a block after this condition",
2343 self.error_on_if_block_attrs(lo, false, block.span, &attrs);
2346 let els = if self.eat_keyword(kw::Else) { Some(self.parse_else_expr()?) } else { None };
2347 Ok(self.mk_expr(lo.to(self.prev_token.span), ExprKind::If(cond, thn, els), attrs))
2350 fn error_missing_if_then_block(
2354 is_unfinished: bool,
2355 ) -> DiagnosticBuilder<'a, ErrorGuaranteed> {
2356 let mut err = self.struct_span_err(
2358 "this `if` expression is missing a block after the condition",
2361 err.span_help(cond_span, "this binary operation is possibly unfinished");
2363 err.span_help(cond_span.shrink_to_hi(), "add a block here");
2368 fn error_missing_if_cond(
2372 ) -> DiagnosticBuilder<'a, ErrorGuaranteed> {
2373 let next_span = self.sess.source_map().next_point(lo);
2374 let mut err = self.struct_span_err(next_span, "missing condition for `if` expression");
2375 err.span_label(next_span, "expected condition here");
2377 self.sess.source_map().start_point(span),
2378 "if this block is the condition of the `if` expression, then it must be followed by another block"
2383 /// Parses the condition of a `if` or `while` expression.
2384 fn parse_cond_expr(&mut self) -> PResult<'a, P<Expr>> {
2385 self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL | Restrictions::ALLOW_LET, None)
2388 /// Parses a `let $pat = $expr` pseudo-expression.
2389 fn parse_let_expr(&mut self, attrs: AttrVec) -> PResult<'a, P<Expr>> {
2390 // This is a *approximate* heuristic that detects if `let` chains are
2391 // being parsed in the right position. It's approximate because it
2392 // doesn't deny all invalid `let` expressions, just completely wrong usages.
2393 let not_in_chain = !matches!(
2394 self.prev_token.kind,
2395 TokenKind::AndAnd | TokenKind::Ident(kw::If, _) | TokenKind::Ident(kw::While, _)
2397 if !self.restrictions.contains(Restrictions::ALLOW_LET) || not_in_chain {
2398 self.struct_span_err(self.token.span, "expected expression, found `let` statement")
2402 self.bump(); // Eat `let` token
2403 let lo = self.prev_token.span;
2404 let pat = self.parse_pat_allow_top_alt(
2408 CommaRecoveryMode::LikelyTuple,
2410 self.expect(&token::Eq)?;
2411 let expr = self.with_res(self.restrictions | Restrictions::NO_STRUCT_LITERAL, |this| {
2412 this.parse_assoc_expr_with(1 + prec_let_scrutinee_needs_par(), None.into())
2414 let span = lo.to(expr.span);
2415 Ok(self.mk_expr(span, ExprKind::Let(pat, expr, span), attrs))
2418 /// Parses an `else { ... }` expression (`else` token already eaten).
2419 fn parse_else_expr(&mut self) -> PResult<'a, P<Expr>> {
2420 let else_span = self.prev_token.span; // `else`
2421 let attrs = self.parse_outer_attributes()?.take_for_recovery(); // For recovery.
2422 let expr = if self.eat_keyword(kw::If) {
2423 self.parse_if_expr(AttrVec::new())?
2424 } else if self.check(&TokenKind::OpenDelim(Delimiter::Brace)) {
2425 self.parse_simple_block()?
2427 let snapshot = self.create_snapshot_for_diagnostic();
2428 let first_tok = super::token_descr(&self.token);
2429 let first_tok_span = self.token.span;
2430 match self.parse_expr() {
2432 // If it's not a free-standing expression, and is followed by a block,
2433 // then it's very likely the condition to an `else if`.
2434 if self.check(&TokenKind::OpenDelim(Delimiter::Brace))
2435 && classify::expr_requires_semi_to_be_stmt(&cond) =>
2437 self.struct_span_err(first_tok_span, format!("expected `{{`, found {first_tok}"))
2438 .span_label(else_span, "expected an `if` or a block after this `else`")
2440 cond.span.shrink_to_lo(),
2441 "add an `if` if this is the condition of a chained `else if` statement",
2443 Applicability::MaybeIncorrect,
2446 self.parse_if_after_cond(AttrVec::new(), cond.span.shrink_to_lo(), cond)?
2450 self.restore_snapshot(snapshot);
2451 self.parse_simple_block()?
2454 self.restore_snapshot(snapshot);
2455 self.parse_simple_block()?
2459 self.error_on_if_block_attrs(else_span, true, expr.span, &attrs);
2463 fn error_on_if_block_attrs(
2468 attrs: &[ast::Attribute],
2470 let (span, last) = match attrs {
2472 [x0 @ xn] | [x0, .., xn] => (x0.span.to(xn.span), xn.span),
2474 let ctx = if is_ctx_else { "else" } else { "if" };
2475 self.struct_span_err(last, "outer attributes are not allowed on `if` and `else` branches")
2476 .span_label(branch_span, "the attributes are attached to this branch")
2477 .span_label(ctx_span, format!("the branch belongs to this `{ctx}`"))
2478 .span_suggestion(span, "remove the attributes", "", Applicability::MachineApplicable)
2482 /// Parses `for <src_pat> in <src_expr> <src_loop_block>` (`for` token already eaten).
2485 opt_label: Option<Label>,
2488 ) -> PResult<'a, P<Expr>> {
2489 // Record whether we are about to parse `for (`.
2490 // This is used below for recovery in case of `for ( $stuff ) $block`
2491 // in which case we will suggest `for $stuff $block`.
2492 let begin_paren = match self.token.kind {
2493 token::OpenDelim(Delimiter::Parenthesis) => Some(self.token.span),
2497 let pat = self.parse_pat_allow_top_alt(
2501 CommaRecoveryMode::LikelyTuple,
2503 if !self.eat_keyword(kw::In) {
2504 self.error_missing_in_for_loop();
2506 self.check_for_for_in_in_typo(self.prev_token.span);
2507 let expr = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
2509 let pat = self.recover_parens_around_for_head(pat, begin_paren);
2511 let (iattrs, loop_block) = self.parse_inner_attrs_and_block()?;
2512 attrs.extend(iattrs);
2514 let kind = ExprKind::ForLoop(pat, expr, loop_block, opt_label);
2515 Ok(self.mk_expr(lo.to(self.prev_token.span), kind, attrs))
2518 fn error_missing_in_for_loop(&mut self) {
2519 let (span, msg, sugg) = if self.token.is_ident_named(sym::of) {
2520 // Possibly using JS syntax (#75311).
2521 let span = self.token.span;
2523 (span, "try using `in` here instead", "in")
2525 (self.prev_token.span.between(self.token.span), "try adding `in` here", " in ")
2527 self.struct_span_err(span, "missing `in` in `for` loop")
2528 .span_suggestion_short(
2532 // Has been misleading, at least in the past (closed Issue #48492).
2533 Applicability::MaybeIncorrect,
2538 /// Parses a `while` or `while let` expression (`while` token already eaten).
2539 fn parse_while_expr(
2541 opt_label: Option<Label>,
2544 ) -> PResult<'a, P<Expr>> {
2545 let cond = self.parse_cond_expr().map_err(|mut err| {
2546 err.span_label(lo, "while parsing the condition of this `while` expression");
2549 let (iattrs, body) = self.parse_inner_attrs_and_block().map_err(|mut err| {
2550 err.span_label(lo, "while parsing the body of this `while` expression");
2551 err.span_label(cond.span, "this `while` condition successfully parsed");
2554 attrs.extend(iattrs);
2555 Ok(self.mk_expr(lo.to(self.prev_token.span), ExprKind::While(cond, body, opt_label), attrs))
2558 /// Parses `loop { ... }` (`loop` token already eaten).
2561 opt_label: Option<Label>,
2564 ) -> PResult<'a, P<Expr>> {
2565 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
2566 attrs.extend(iattrs);
2567 Ok(self.mk_expr(lo.to(self.prev_token.span), ExprKind::Loop(body, opt_label), attrs))
2570 pub(crate) fn eat_label(&mut self) -> Option<Label> {
2571 self.token.lifetime().map(|ident| {
2577 /// Parses a `match ... { ... }` expression (`match` token already eaten).
2578 fn parse_match_expr(&mut self, mut attrs: AttrVec) -> PResult<'a, P<Expr>> {
2579 let match_span = self.prev_token.span;
2580 let lo = self.prev_token.span;
2581 let scrutinee = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
2582 if let Err(mut e) = self.expect(&token::OpenDelim(Delimiter::Brace)) {
2583 if self.token == token::Semi {
2584 e.span_suggestion_short(
2586 "try removing this `match`",
2588 Applicability::MaybeIncorrect, // speculative
2591 if self.maybe_recover_unexpected_block_label() {
2598 attrs.extend(self.parse_inner_attributes()?);
2600 let mut arms: Vec<Arm> = Vec::new();
2601 while self.token != token::CloseDelim(Delimiter::Brace) {
2602 match self.parse_arm() {
2603 Ok(arm) => arms.push(arm),
2605 // Recover by skipping to the end of the block.
2607 self.recover_stmt();
2608 let span = lo.to(self.token.span);
2609 if self.token == token::CloseDelim(Delimiter::Brace) {
2612 return Ok(self.mk_expr(span, ExprKind::Match(scrutinee, arms), attrs));
2616 let hi = self.token.span;
2618 Ok(self.mk_expr(lo.to(hi), ExprKind::Match(scrutinee, arms), attrs))
2621 /// Attempt to recover from match arm body with statements and no surrounding braces.
2622 fn parse_arm_body_missing_braces(
2624 first_expr: &P<Expr>,
2626 ) -> Option<P<Expr>> {
2627 if self.token.kind != token::Semi {
2630 let start_snapshot = self.create_snapshot_for_diagnostic();
2631 let semi_sp = self.token.span;
2634 vec![self.mk_stmt(first_expr.span, ast::StmtKind::Expr(first_expr.clone()))];
2635 let err = |this: &mut Parser<'_>, stmts: Vec<ast::Stmt>| {
2636 let span = stmts[0].span.to(stmts[stmts.len() - 1].span);
2637 let mut err = this.struct_span_err(span, "`match` arm body without braces");
2638 let (these, s, are) =
2639 if stmts.len() > 1 { ("these", "s", "are") } else { ("this", "", "is") };
2643 "{these} statement{s} {are} not surrounded by a body",
2649 err.span_label(arrow_span, "while parsing the `match` arm starting here");
2650 if stmts.len() > 1 {
2651 err.multipart_suggestion(
2652 &format!("surround the statement{s} with a body"),
2654 (span.shrink_to_lo(), "{ ".to_string()),
2655 (span.shrink_to_hi(), " }".to_string()),
2657 Applicability::MachineApplicable,
2660 err.span_suggestion(
2662 "use a comma to end a `match` arm expression",
2664 Applicability::MachineApplicable,
2668 this.mk_expr_err(span)
2670 // We might have either a `,` -> `;` typo, or a block without braces. We need
2671 // a more subtle parsing strategy.
2673 if self.token.kind == token::CloseDelim(Delimiter::Brace) {
2674 // We have reached the closing brace of the `match` expression.
2675 return Some(err(self, stmts));
2677 if self.token.kind == token::Comma {
2678 self.restore_snapshot(start_snapshot);
2681 let pre_pat_snapshot = self.create_snapshot_for_diagnostic();
2682 match self.parse_pat_no_top_alt(None) {
2684 if self.token.kind == token::FatArrow {
2686 self.restore_snapshot(pre_pat_snapshot);
2687 return Some(err(self, stmts));
2695 self.restore_snapshot(pre_pat_snapshot);
2696 match self.parse_stmt_without_recovery(true, ForceCollect::No) {
2697 // Consume statements for as long as possible.
2702 self.restore_snapshot(start_snapshot);
2705 // We couldn't parse either yet another statement missing it's
2706 // enclosing block nor the next arm's pattern or closing brace.
2709 self.restore_snapshot(start_snapshot);
2717 pub(super) fn parse_arm(&mut self) -> PResult<'a, Arm> {
2718 // Used to check the `let_chains` and `if_let_guard` features mostly by scaning
2720 fn check_let_expr(expr: &Expr) -> bool {
2722 ExprKind::Binary(BinOp { node: BinOpKind::And, .. }, ref lhs, ref rhs) => {
2723 check_let_expr(lhs) || check_let_expr(rhs)
2725 ExprKind::Let(..) => true,
2729 let attrs = self.parse_outer_attributes()?;
2730 self.collect_tokens_trailing_token(attrs, ForceCollect::No, |this, attrs| {
2731 let lo = this.token.span;
2732 let pat = this.parse_pat_allow_top_alt(
2736 CommaRecoveryMode::EitherTupleOrPipe,
2738 let guard = if this.eat_keyword(kw::If) {
2739 let if_span = this.prev_token.span;
2740 let cond = this.parse_expr_res(Restrictions::ALLOW_LET, None)?;
2741 if check_let_expr(&cond) {
2742 let span = if_span.to(cond.span);
2743 this.sess.gated_spans.gate(sym::if_let_guard, span);
2749 let arrow_span = this.token.span;
2750 if let Err(mut err) = this.expect(&token::FatArrow) {
2751 // We might have a `=>` -> `=` or `->` typo (issue #89396).
2752 if TokenKind::FatArrow
2754 .map_or(false, |similar_tokens| similar_tokens.contains(&this.token.kind))
2756 err.span_suggestion(
2758 "try using a fat arrow here",
2760 Applicability::MaybeIncorrect,
2768 let arm_start_span = this.token.span;
2770 let expr = this.parse_expr_res(Restrictions::STMT_EXPR, None).map_err(|mut err| {
2771 err.span_label(arrow_span, "while parsing the `match` arm starting here");
2775 let require_comma = classify::expr_requires_semi_to_be_stmt(&expr)
2776 && this.token != token::CloseDelim(Delimiter::Brace);
2778 let hi = this.prev_token.span;
2781 let sm = this.sess.source_map();
2782 if let Some(body) = this.parse_arm_body_missing_braces(&expr, arrow_span) {
2783 let span = body.span;
2786 attrs: attrs.into(),
2792 is_placeholder: false,
2794 TrailingToken::None,
2797 this.expect_one_of(&[token::Comma], &[token::CloseDelim(Delimiter::Brace)])
2798 .or_else(|mut err| {
2799 if this.token == token::FatArrow {
2800 if let Ok(expr_lines) = sm.span_to_lines(expr.span)
2801 && let Ok(arm_start_lines) = sm.span_to_lines(arm_start_span)
2802 && arm_start_lines.lines[0].end_col == expr_lines.lines[0].end_col
2803 && expr_lines.lines.len() == 2
2805 // We check whether there's any trailing code in the parse span,
2806 // if there isn't, we very likely have the following:
2809 // | -- - missing comma
2813 // | - ^^ self.token.span
2815 // | parsed until here as `"y" & X`
2816 err.span_suggestion_short(
2817 arm_start_span.shrink_to_hi(),
2818 "missing a comma here to end this `match` arm",
2820 Applicability::MachineApplicable,
2825 // FIXME(compiler-errors): We could also recover `; PAT =>` here
2827 // Try to parse a following `PAT =>`, if successful
2828 // then we should recover.
2829 let mut snapshot = this.create_snapshot_for_diagnostic();
2830 let pattern_follows = snapshot
2831 .parse_pat_allow_top_alt(
2835 CommaRecoveryMode::EitherTupleOrPipe,
2837 .map_err(|err| err.cancel())
2839 if pattern_follows && snapshot.check(&TokenKind::FatArrow) {
2841 this.struct_span_err(
2843 "expected `,` following `match` arm",
2847 "missing a comma here to end this `match` arm",
2849 Applicability::MachineApplicable,
2855 err.span_label(arrow_span, "while parsing the `match` arm starting here");
2859 this.eat(&token::Comma);
2864 attrs: attrs.into(),
2870 is_placeholder: false,
2872 TrailingToken::None,
2877 /// Parses a `try {...}` expression (`try` token already eaten).
2878 fn parse_try_block(&mut self, span_lo: Span, mut attrs: AttrVec) -> PResult<'a, P<Expr>> {
2879 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
2880 attrs.extend(iattrs);
2881 if self.eat_keyword(kw::Catch) {
2882 let mut error = self.struct_span_err(
2883 self.prev_token.span,
2884 "keyword `catch` cannot follow a `try` block",
2886 error.help("try using `match` on the result of the `try` block instead");
2890 let span = span_lo.to(body.span);
2891 self.sess.gated_spans.gate(sym::try_blocks, span);
2892 Ok(self.mk_expr(span, ExprKind::TryBlock(body), attrs))
2896 fn is_do_catch_block(&self) -> bool {
2897 self.token.is_keyword(kw::Do)
2898 && self.is_keyword_ahead(1, &[kw::Catch])
2899 && self.look_ahead(2, |t| *t == token::OpenDelim(Delimiter::Brace))
2900 && !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL)
2903 fn is_do_yeet(&self) -> bool {
2904 self.token.is_keyword(kw::Do) && self.is_keyword_ahead(1, &[kw::Yeet])
2907 fn is_try_block(&self) -> bool {
2908 self.token.is_keyword(kw::Try)
2909 && self.look_ahead(1, |t| *t == token::OpenDelim(Delimiter::Brace))
2910 && self.token.uninterpolated_span().rust_2018()
2913 /// Parses an `async move? {...}` expression.
2914 fn parse_async_block(&mut self, mut attrs: AttrVec) -> PResult<'a, P<Expr>> {
2915 let lo = self.token.span;
2916 self.expect_keyword(kw::Async)?;
2917 let capture_clause = self.parse_capture_clause()?;
2918 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
2919 attrs.extend(iattrs);
2920 let kind = ExprKind::Async(capture_clause, DUMMY_NODE_ID, body);
2921 Ok(self.mk_expr(lo.to(self.prev_token.span), kind, attrs))
2924 fn is_async_block(&self) -> bool {
2925 self.token.is_keyword(kw::Async)
2928 self.is_keyword_ahead(1, &[kw::Move])
2929 && self.look_ahead(2, |t| *t == token::OpenDelim(Delimiter::Brace))
2932 self.look_ahead(1, |t| *t == token::OpenDelim(Delimiter::Brace))
2936 fn is_certainly_not_a_block(&self) -> bool {
2937 self.look_ahead(1, |t| t.is_ident())
2939 // `{ ident, ` cannot start a block.
2940 self.look_ahead(2, |t| t == &token::Comma)
2941 || self.look_ahead(2, |t| t == &token::Colon)
2943 // `{ ident: token, ` cannot start a block.
2944 self.look_ahead(4, |t| t == &token::Comma) ||
2945 // `{ ident: ` cannot start a block unless it's a type ascription `ident: Type`.
2946 self.look_ahead(3, |t| !t.can_begin_type())
2951 fn maybe_parse_struct_expr(
2953 qself: Option<&ast::QSelf>,
2956 ) -> Option<PResult<'a, P<Expr>>> {
2957 let struct_allowed = !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL);
2958 if struct_allowed || self.is_certainly_not_a_block() {
2959 if let Err(err) = self.expect(&token::OpenDelim(Delimiter::Brace)) {
2960 return Some(Err(err));
2962 let expr = self.parse_struct_expr(qself.cloned(), path.clone(), attrs.clone(), true);
2963 if let (Ok(expr), false) = (&expr, struct_allowed) {
2964 // This is a struct literal, but we don't can't accept them here.
2965 self.error_struct_lit_not_allowed_here(path.span, expr.span);
2972 fn error_struct_lit_not_allowed_here(&self, lo: Span, sp: Span) {
2973 self.struct_span_err(sp, "struct literals are not allowed here")
2974 .multipart_suggestion(
2975 "surround the struct literal with parentheses",
2976 vec![(lo.shrink_to_lo(), "(".to_string()), (sp.shrink_to_hi(), ")".to_string())],
2977 Applicability::MachineApplicable,
2982 pub(super) fn parse_struct_fields(
2986 close_delim: Delimiter,
2987 ) -> PResult<'a, (Vec<ExprField>, ast::StructRest, bool)> {
2988 let mut fields = Vec::new();
2989 let mut base = ast::StructRest::None;
2990 let mut recover_async = false;
2992 let mut async_block_err = |e: &mut Diagnostic, span: Span| {
2993 recover_async = true;
2994 e.span_label(span, "`async` blocks are only allowed in Rust 2018 or later");
2995 e.help_use_latest_edition();
2998 while self.token != token::CloseDelim(close_delim) {
2999 if self.eat(&token::DotDot) {
3000 let exp_span = self.prev_token.span;
3001 // We permit `.. }` on the left-hand side of a destructuring assignment.
3002 if self.check(&token::CloseDelim(close_delim)) {
3003 base = ast::StructRest::Rest(self.prev_token.span.shrink_to_hi());
3006 match self.parse_expr() {
3007 Ok(e) => base = ast::StructRest::Base(e),
3008 Err(mut e) if recover => {
3010 self.recover_stmt();
3012 Err(e) => return Err(e),
3014 self.recover_struct_comma_after_dotdot(exp_span);
3018 let recovery_field = self.find_struct_error_after_field_looking_code();
3019 let parsed_field = match self.parse_expr_field() {
3022 if pth == kw::Async {
3023 async_block_err(&mut e, pth.span);
3025 e.span_label(pth.span, "while parsing this struct");
3029 // If the next token is a comma, then try to parse
3030 // what comes next as additional fields, rather than
3031 // bailing out until next `}`.
3032 if self.token != token::Comma {
3033 self.recover_stmt_(SemiColonMode::Comma, BlockMode::Ignore);
3034 if self.token != token::Comma {
3042 let is_shorthand = parsed_field.as_ref().map_or(false, |f| f.is_shorthand);
3043 // A shorthand field can be turned into a full field with `:`.
3044 // We should point this out.
3045 self.check_or_expected(!is_shorthand, TokenType::Token(token::Colon));
3047 match self.expect_one_of(&[token::Comma], &[token::CloseDelim(close_delim)]) {
3049 if let Some(f) = parsed_field.or(recovery_field) {
3050 // Only include the field if there's no parse error for the field name.
3055 if pth == kw::Async {
3056 async_block_err(&mut e, pth.span);
3058 e.span_label(pth.span, "while parsing this struct");
3059 if let Some(f) = recovery_field {
3062 self.prev_token.span.shrink_to_hi(),
3063 "try adding a comma",
3065 Applicability::MachineApplicable,
3067 } else if is_shorthand
3068 && (AssocOp::from_token(&self.token).is_some()
3069 || matches!(&self.token.kind, token::OpenDelim(_))
3070 || self.token.kind == token::Dot)
3072 // Looks like they tried to write a shorthand, complex expression.
3073 let ident = parsed_field.expect("is_shorthand implies Some").ident;
3075 ident.span.shrink_to_lo(),
3076 "try naming a field",
3077 &format!("{ident}: "),
3078 Applicability::HasPlaceholders,
3086 self.recover_stmt_(SemiColonMode::Comma, BlockMode::Ignore);
3087 self.eat(&token::Comma);
3091 Ok((fields, base, recover_async))
3094 /// Precondition: already parsed the '{'.
3095 pub(super) fn parse_struct_expr(
3097 qself: Option<ast::QSelf>,
3101 ) -> PResult<'a, P<Expr>> {
3103 let (fields, base, recover_async) =
3104 self.parse_struct_fields(pth.clone(), recover, Delimiter::Brace)?;
3105 let span = lo.to(self.token.span);
3106 self.expect(&token::CloseDelim(Delimiter::Brace))?;
3107 let expr = if recover_async {
3110 ExprKind::Struct(P(ast::StructExpr { qself, path: pth, fields, rest: base }))
3112 Ok(self.mk_expr(span, expr, attrs))
3115 /// Use in case of error after field-looking code: `S { foo: () with a }`.
3116 fn find_struct_error_after_field_looking_code(&self) -> Option<ExprField> {
3117 match self.token.ident() {
3118 Some((ident, is_raw))
3119 if (is_raw || !ident.is_reserved())
3120 && self.look_ahead(1, |t| *t == token::Colon) =>
3122 Some(ast::ExprField {
3124 span: self.token.span,
3125 expr: self.mk_expr_err(self.token.span),
3126 is_shorthand: false,
3127 attrs: AttrVec::new(),
3129 is_placeholder: false,
3136 fn recover_struct_comma_after_dotdot(&mut self, span: Span) {
3137 if self.token != token::Comma {
3140 self.struct_span_err(
3141 span.to(self.prev_token.span),
3142 "cannot use a comma after the base struct",
3144 .span_suggestion_short(
3146 "remove this comma",
3148 Applicability::MachineApplicable,
3150 .note("the base struct must always be the last field")
3152 self.recover_stmt();
3155 /// Parses `ident (COLON expr)?`.
3156 fn parse_expr_field(&mut self) -> PResult<'a, ExprField> {
3157 let attrs = self.parse_outer_attributes()?;
3158 self.collect_tokens_trailing_token(attrs, ForceCollect::No, |this, attrs| {
3159 let lo = this.token.span;
3161 // Check if a colon exists one ahead. This means we're parsing a fieldname.
3162 let is_shorthand = !this.look_ahead(1, |t| t == &token::Colon || t == &token::Eq);
3163 let (ident, expr) = if is_shorthand {
3164 // Mimic `x: x` for the `x` field shorthand.
3165 let ident = this.parse_ident_common(false)?;
3166 let path = ast::Path::from_ident(ident);
3167 (ident, this.mk_expr(ident.span, ExprKind::Path(None, path), AttrVec::new()))
3169 let ident = this.parse_field_name()?;
3170 this.error_on_eq_field_init(ident);
3172 (ident, this.parse_expr()?)
3178 span: lo.to(expr.span),
3181 attrs: attrs.into(),
3183 is_placeholder: false,
3185 TrailingToken::MaybeComma,
3190 /// Check for `=`. This means the source incorrectly attempts to
3191 /// initialize a field with an eq rather than a colon.
3192 fn error_on_eq_field_init(&self, field_name: Ident) {
3193 if self.token != token::Eq {
3197 self.struct_span_err(self.token.span, "expected `:`, found `=`")
3199 field_name.span.shrink_to_hi().to(self.token.span),
3200 "replace equals symbol with a colon",
3202 Applicability::MachineApplicable,
3207 fn err_dotdotdot_syntax(&self, span: Span) {
3208 self.struct_span_err(span, "unexpected token: `...`")
3211 "use `..` for an exclusive range",
3213 Applicability::MaybeIncorrect,
3217 "or `..=` for an inclusive range",
3219 Applicability::MaybeIncorrect,
3224 fn err_larrow_operator(&self, span: Span) {
3225 self.struct_span_err(span, "unexpected token: `<-`")
3228 "if you meant to write a comparison against a negative value, add a \
3229 space in between `<` and `-`",
3231 Applicability::MaybeIncorrect,
3236 fn mk_assign_op(&self, binop: BinOp, lhs: P<Expr>, rhs: P<Expr>) -> ExprKind {
3237 ExprKind::AssignOp(binop, lhs, rhs)
3242 start: Option<P<Expr>>,
3243 end: Option<P<Expr>>,
3244 limits: RangeLimits,
3246 if end.is_none() && limits == RangeLimits::Closed {
3247 self.inclusive_range_with_incorrect_end(self.prev_token.span);
3250 ExprKind::Range(start, end, limits)
3254 fn mk_unary(&self, unop: UnOp, expr: P<Expr>) -> ExprKind {
3255 ExprKind::Unary(unop, expr)
3258 fn mk_binary(&self, binop: BinOp, lhs: P<Expr>, rhs: P<Expr>) -> ExprKind {
3259 ExprKind::Binary(binop, lhs, rhs)
3262 fn mk_index(&self, expr: P<Expr>, idx: P<Expr>) -> ExprKind {
3263 ExprKind::Index(expr, idx)
3266 fn mk_call(&self, f: P<Expr>, args: Vec<P<Expr>>) -> ExprKind {
3267 ExprKind::Call(f, args)
3270 fn mk_await_expr(&mut self, self_arg: P<Expr>, lo: Span) -> P<Expr> {
3271 let span = lo.to(self.prev_token.span);
3272 let await_expr = self.mk_expr(span, ExprKind::Await(self_arg), AttrVec::new());
3273 self.recover_from_await_method_call();
3277 pub(crate) fn mk_expr(&self, span: Span, kind: ExprKind, attrs: AttrVec) -> P<Expr> {
3278 P(Expr { kind, span, attrs, id: DUMMY_NODE_ID, tokens: None })
3281 pub(super) fn mk_expr_err(&self, span: Span) -> P<Expr> {
3282 self.mk_expr(span, ExprKind::Err, AttrVec::new())
3285 /// Create expression span ensuring the span of the parent node
3286 /// is larger than the span of lhs and rhs, including the attributes.
3287 fn mk_expr_sp(&self, lhs: &P<Expr>, lhs_span: Span, rhs_span: Span) -> Span {
3290 .find(|a| a.style == AttrStyle::Outer)
3291 .map_or(lhs_span, |a| a.span)
3295 fn collect_tokens_for_expr(
3298 f: impl FnOnce(&mut Self, Vec<ast::Attribute>) -> PResult<'a, P<Expr>>,
3299 ) -> PResult<'a, P<Expr>> {
3300 self.collect_tokens_trailing_token(attrs, ForceCollect::No, |this, attrs| {
3301 let res = f(this, attrs)?;
3302 let trailing = if this.restrictions.contains(Restrictions::STMT_EXPR)
3303 && this.token.kind == token::Semi
3307 // FIXME - pass this through from the place where we know
3308 // we need a comma, rather than assuming that `#[attr] expr,`
3309 // always captures a trailing comma
3310 TrailingToken::MaybeComma