1 use super::{Parser, PResult, PathStyle};
3 use crate::{maybe_recover_from_interpolated_ty_qpath, maybe_whole};
5 use crate::ast::{self, Attribute, Pat, PatKind, FieldPat, RangeEnd, RangeSyntax, Mac_};
6 use crate::ast::{BindingMode, Ident, Mutability, Path, QSelf, Expr, ExprKind};
7 use crate::parse::token::{self};
8 use crate::print::pprust;
9 use crate::source_map::{respan, Span, Spanned};
10 use crate::symbol::kw;
13 use errors::{Applicability, DiagnosticBuilder};
17 pub fn parse_pat(&mut self, expected: Option<&'static str>) -> PResult<'a, P<Pat>> {
18 self.parse_pat_with_range_pat(true, expected)
21 /// Parses patterns, separated by '|' s.
22 pub(super) fn parse_pats(&mut self) -> PResult<'a, Vec<P<Pat>>> {
23 // Allow a '|' before the pats (RFC 1925 + RFC 2530)
24 self.eat(&token::BinOp(token::Or));
26 let mut pats = Vec::new();
28 pats.push(self.parse_top_level_pat()?);
30 if self.token == token::OrOr {
31 self.struct_span_err(self.token.span, "unexpected token `||` after pattern")
34 "use a single `|` to specify multiple patterns",
36 Applicability::MachineApplicable
40 } else if self.eat(&token::BinOp(token::Or)) {
41 // This is a No-op. Continue the loop to parse the next
49 /// A wrapper around `parse_pat` with some special error handling for the
50 /// "top-level" patterns in a match arm, `for` loop, `let`, &c. (in contrast
51 /// to subpatterns within such).
52 pub(super) fn parse_top_level_pat(&mut self) -> PResult<'a, P<Pat>> {
53 let pat = self.parse_pat(None)?;
54 if self.token == token::Comma {
55 // An unexpected comma after a top-level pattern is a clue that the
56 // user (perhaps more accustomed to some other language) forgot the
57 // parentheses in what should have been a tuple pattern; return a
58 // suggestion-enhanced error here rather than choking on the comma
60 let comma_span = self.token.span;
62 if let Err(mut err) = self.skip_pat_list() {
63 // We didn't expect this to work anyway; we just wanted
64 // to advance to the end of the comma-sequence so we know
65 // the span to suggest parenthesizing
68 let seq_span = pat.span.to(self.prev_span);
69 let mut err = self.struct_span_err(comma_span, "unexpected `,` in pattern");
70 if let Ok(seq_snippet) = self.span_to_snippet(seq_span) {
73 "try adding parentheses to match on a tuple..",
74 format!("({})", seq_snippet),
75 Applicability::MachineApplicable
78 "..or a vertical bar to match on multiple alternatives",
79 format!("{}", seq_snippet.replace(",", " |")),
80 Applicability::MachineApplicable
88 /// Parse and throw away a parentesized comma separated
89 /// sequence of patterns until `)` is reached.
90 fn skip_pat_list(&mut self) -> PResult<'a, ()> {
91 while !self.check(&token::CloseDelim(token::Paren)) {
92 self.parse_pat(None)?;
93 if !self.eat(&token::Comma) {
100 /// Parses a pattern, with a setting whether modern range patterns (e.g., `a..=b`, `a..b` are
102 fn parse_pat_with_range_pat(
104 allow_range_pat: bool,
105 expected: Option<&'static str>,
106 ) -> PResult<'a, P<Pat>> {
107 maybe_recover_from_interpolated_ty_qpath!(self, true);
108 maybe_whole!(self, NtPat, |x| x);
110 let lo = self.token.span;
111 let pat = match self.token.kind {
112 token::BinOp(token::And) | token::AndAnd => self.parse_pat_deref(expected)?,
113 token::OpenDelim(token::Paren) => self.parse_pat_tuple_or_parens()?,
114 token::OpenDelim(token::Bracket) => {
115 // Parse `[pat, pat,...]` as a slice pattern.
116 PatKind::Slice(self.parse_delim_comma_seq(token::Bracket, |p| p.parse_pat(None))?.0)
120 if self.is_pat_range_end_start() {
121 // Parse `..42` for recovery.
122 self.parse_pat_range_to(RangeEnd::Excluded, "..")?
124 // A rest pattern `..`.
129 // Parse `..=42` for recovery.
131 self.parse_pat_range_to(RangeEnd::Included(RangeSyntax::DotDotEq), "..=")?
133 token::DotDotDot => {
134 // Parse `...42` for recovery.
136 self.parse_pat_range_to(RangeEnd::Included(RangeSyntax::DotDotDot), "...")?
138 // At this point, token != &, &&, (, [
139 _ => if self.eat_keyword(kw::Underscore) {
142 } else if self.eat_keyword(kw::Mut) {
143 self.recover_pat_ident_mut_first()?
144 } else if self.eat_keyword(kw::Ref) {
145 // Parse ref ident @ pat / ref mut ident @ pat
146 let mutbl = self.parse_mutability();
147 self.parse_pat_ident(BindingMode::ByRef(mutbl))?
148 } else if self.eat_keyword(kw::Box) {
150 PatKind::Box(self.parse_pat_with_range_pat(false, None)?)
151 } else if self.token.is_ident() && !self.token.is_reserved_ident() &&
152 self.parse_as_ident() {
153 // Parse `ident @ pat`
154 // This can give false positives and parse nullary enums,
155 // they are dealt with later in resolve.
156 self.parse_pat_ident(BindingMode::ByValue(Mutability::Immutable))?
157 } else if self.token.is_path_start() {
158 // Parse pattern starting with a path
159 let (qself, path) = if self.eat_lt() {
160 // Parse a qualified path
161 let (qself, path) = self.parse_qpath(PathStyle::Expr)?;
164 // Parse an unqualified path
165 (None, self.parse_path(PathStyle::Expr)?)
167 match self.token.kind {
168 token::Not if qself.is_none() => self.parse_pat_mac_invoc(lo, path)?,
169 token::DotDotDot | token::DotDotEq | token::DotDot => {
170 self.parse_pat_range_starting_with_path(lo, qself, path)?
172 token::OpenDelim(token::Brace) => {
174 let msg = "unexpected `{` after qualified path";
175 let mut err = self.fatal(msg);
176 err.span_label(self.token.span, msg);
179 // Parse struct pattern
181 let (fields, etc) = self.parse_pat_fields().unwrap_or_else(|mut e| {
187 PatKind::Struct(path, fields, etc)
189 token::OpenDelim(token::Paren) => {
191 let msg = "unexpected `(` after qualified path";
192 let mut err = self.fatal(msg);
193 err.span_label(self.token.span, msg);
196 // Parse tuple struct or enum pattern
197 let (fields, _) = self.parse_paren_comma_seq(|p| p.parse_pat(None))?;
198 PatKind::TupleStruct(path, fields)
200 _ => PatKind::Path(qself, path),
203 // Try to parse everything else as literal with optional minus
204 match self.parse_literal_maybe_minus() {
205 Ok(begin) if self.check(&token::DotDot) || self.check(&token::DotDotEq)
206 || self.check(&token::DotDotDot)
207 => self.parse_pat_range_starting_with_lit(begin)?,
208 Ok(begin) => PatKind::Lit(begin),
210 self.cancel(&mut err);
211 let expected = expected.unwrap_or("pattern");
213 "expected {}, found {}",
215 self.this_token_descr(),
217 let mut err = self.fatal(&msg);
218 err.span_label(self.token.span, format!("expected {}", expected));
219 let sp = self.sess.source_map().start_point(self.token.span);
220 if let Some(sp) = self.sess.ambiguous_block_expr_parse.borrow().get(&sp) {
221 self.sess.expr_parentheses_needed(&mut err, *sp, None);
229 let pat = self.mk_pat(lo.to(self.prev_span), pat);
230 let pat = self.maybe_recover_from_bad_qpath(pat, true)?;
232 if !allow_range_pat {
233 self.ban_pat_range_if_ambiguous(&pat)?
239 /// Ban a range pattern if it has an ambiguous interpretation.
240 fn ban_pat_range_if_ambiguous(&self, pat: &Pat) -> PResult<'a, ()> {
243 .., Spanned { node: RangeEnd::Included(RangeSyntax::DotDotDot), .. }
245 PatKind::Range(..) => {}
249 let mut err = self.struct_span_err(
251 "the range pattern here has ambiguous interpretation",
255 "add parentheses to clarify the precedence",
256 format!("({})", pprust::pat_to_string(&pat)),
257 // "ambiguous interpretation" implies that we have to be guessing
258 Applicability::MaybeIncorrect
263 /// Parse `&pat` / `&mut pat`.
264 fn parse_pat_deref(&mut self, expected: Option<&'static str>) -> PResult<'a, PatKind> {
266 let mutbl = self.parse_mutability();
268 if let token::Lifetime(name) = self.token.kind {
269 let mut err = self.fatal(&format!("unexpected lifetime `{}` in pattern", name));
270 err.span_label(self.token.span, "unexpected lifetime");
274 let subpat = self.parse_pat_with_range_pat(false, expected)?;
275 Ok(PatKind::Ref(subpat, mutbl))
278 /// Parse a tuple or parenthesis pattern.
279 fn parse_pat_tuple_or_parens(&mut self) -> PResult<'a, PatKind> {
280 let (fields, trailing_comma) = self.parse_paren_comma_seq(|p| p.parse_pat(None))?;
282 // Here, `(pat,)` is a tuple pattern.
283 // For backward compatibility, `(..)` is a tuple pattern as well.
284 Ok(if fields.len() == 1 && !(trailing_comma || fields[0].is_rest()) {
285 PatKind::Paren(fields.into_iter().nth(0).unwrap())
287 PatKind::Tuple(fields)
291 /// Recover on `mut ref? ident @ pat` and suggest
292 /// that the order of `mut` and `ref` is incorrect.
293 fn recover_pat_ident_mut_first(&mut self) -> PResult<'a, PatKind> {
294 let mutref_span = self.prev_span.to(self.token.span);
295 let binding_mode = if self.eat_keyword(kw::Ref) {
296 self.struct_span_err(mutref_span, "the order of `mut` and `ref` is incorrect")
299 "try switching the order",
301 Applicability::MachineApplicable
304 BindingMode::ByRef(Mutability::Mutable)
306 BindingMode::ByValue(Mutability::Mutable)
308 self.parse_pat_ident(binding_mode)
311 /// Parse macro invocation
312 fn parse_pat_mac_invoc(&mut self, lo: Span, path: Path) -> PResult<'a, PatKind> {
314 let (delim, tts) = self.expect_delimited_token_tree()?;
315 let mac = respan(lo.to(self.prev_span), Mac_ {
319 prior_type_ascription: self.last_type_ascription,
321 Ok(PatKind::Mac(mac))
324 /// Parse a range pattern `$path $form $end?` where `$form = ".." | "..." | "..=" ;`.
325 /// The `$path` has already been parsed and the next token is the `$form`.
326 fn parse_pat_range_starting_with_path(
329 qself: Option<QSelf>,
331 ) -> PResult<'a, PatKind> {
332 let (end_kind, form) = match self.token.kind {
333 token::DotDot => (RangeEnd::Excluded, ".."),
334 token::DotDotDot => (RangeEnd::Included(RangeSyntax::DotDotDot), "..."),
335 token::DotDotEq => (RangeEnd::Included(RangeSyntax::DotDotEq), "..="),
336 _ => panic!("can only parse `..`/`...`/`..=` for ranges (checked above)"),
338 let op_span = self.token.span;
340 let span = lo.to(self.prev_span);
341 let begin = self.mk_expr(span, ExprKind::Path(qself, path), ThinVec::new());
343 let end = self.parse_pat_range_end_opt(&begin, form)?;
344 Ok(PatKind::Range(begin, end, respan(op_span, end_kind)))
347 /// Parse a range pattern `$literal $form $end?` where `$form = ".." | "..." | "..=" ;`.
348 /// The `$path` has already been parsed and the next token is the `$form`.
349 fn parse_pat_range_starting_with_lit(&mut self, begin: P<Expr>) -> PResult<'a, PatKind> {
350 let op_span = self.token.span;
351 let (end_kind, form) = if self.eat(&token::DotDotDot) {
352 (RangeEnd::Included(RangeSyntax::DotDotDot), "...")
353 } else if self.eat(&token::DotDotEq) {
354 (RangeEnd::Included(RangeSyntax::DotDotEq), "..=")
355 } else if self.eat(&token::DotDot) {
356 (RangeEnd::Excluded, "..")
358 panic!("impossible case: we already matched on a range-operator token")
360 let end = self.parse_pat_range_end_opt(&begin, form)?;
361 Ok(PatKind::Range(begin, end, respan(op_span, end_kind)))
364 // Helper function to decide whether to parse as ident binding
365 // or to try to do something more complex like range patterns.
366 fn parse_as_ident(&mut self) -> bool {
367 self.look_ahead(1, |t| match t.kind {
368 token::OpenDelim(token::Paren) | token::OpenDelim(token::Brace) |
369 token::DotDotDot | token::DotDotEq | token::DotDot |
370 token::ModSep | token::Not => false,
375 /// Is the current token suitable as the start of a range patterns end?
376 fn is_pat_range_end_start(&self) -> bool {
377 self.token.is_path_start() // e.g. `MY_CONST`;
378 || self.token == token::Dot // e.g. `.5` for recovery;
379 || self.token.can_begin_literal_or_bool() // e.g. `42`.
380 || self.token.is_whole_expr()
383 /// Parse a range-to pattern, e.g. `..X` and `..=X` for recovery.
384 fn parse_pat_range_to(&mut self, re: RangeEnd, form: &str) -> PResult<'a, PatKind> {
385 let lo = self.prev_span;
386 let end = self.parse_pat_range_end()?;
387 let range_span = lo.to(end.span);
388 let begin = self.mk_expr(range_span, ExprKind::Err, ThinVec::new());
391 .struct_span_err(range_span, &format!("`{}X` range patterns are not supported", form))
394 "try using the minimum value for the type",
395 format!("MIN{}{}", form, pprust::expr_to_string(&end)),
396 Applicability::HasPlaceholders,
400 Ok(PatKind::Range(begin, end, respan(lo, re)))
403 /// Parse the end of a `X..Y`, `X..=Y`, or `X...Y` range pattern or recover
404 /// if that end is missing treating it as `X..`, `X..=`, or `X...` respectively.
405 fn parse_pat_range_end_opt(&mut self, begin: &Expr, form: &str) -> PResult<'a, P<Expr>> {
406 if self.is_pat_range_end_start() {
407 // Parsing e.g. `X..=Y`.
408 self.parse_pat_range_end()
410 // Parsing e.g. `X..`.
411 let range_span = begin.span.to(self.prev_span);
416 &format!("`X{}` range patterns are not supported", form),
420 "try using the maximum value for the type",
421 format!("{}{}MAX", pprust::expr_to_string(&begin), form),
422 Applicability::HasPlaceholders,
426 Ok(self.mk_expr(range_span, ExprKind::Err, ThinVec::new()))
430 fn parse_pat_range_end(&mut self) -> PResult<'a, P<Expr>> {
431 if self.token.is_path_start() {
432 let lo = self.token.span;
433 let (qself, path) = if self.eat_lt() {
434 // Parse a qualified path
435 let (qself, path) = self.parse_qpath(PathStyle::Expr)?;
438 // Parse an unqualified path
439 (None, self.parse_path(PathStyle::Expr)?)
441 let hi = self.prev_span;
442 Ok(self.mk_expr(lo.to(hi), ExprKind::Path(qself, path), ThinVec::new()))
444 self.parse_literal_maybe_minus()
448 /// Parses `ident` or `ident @ pat`.
449 /// used by the copy foo and ref foo patterns to give a good
450 /// error message when parsing mistakes like `ref foo(a, b)`.
451 fn parse_pat_ident(&mut self,
452 binding_mode: ast::BindingMode)
453 -> PResult<'a, PatKind> {
454 let ident = self.parse_ident()?;
455 let sub = if self.eat(&token::At) {
456 Some(self.parse_pat(Some("binding pattern"))?)
461 // just to be friendly, if they write something like
463 // we end up here with ( as the current token. This shortly
464 // leads to a parse error. Note that if there is no explicit
465 // binding mode then we do not end up here, because the lookahead
466 // will direct us over to parse_enum_variant()
467 if self.token == token::OpenDelim(token::Paren) {
468 return Err(self.span_fatal(
470 "expected identifier, found enum pattern"))
473 Ok(PatKind::Ident(binding_mode, ident, sub))
476 /// Parses the fields of a struct-like pattern.
477 fn parse_pat_fields(&mut self) -> PResult<'a, (Vec<Spanned<FieldPat>>, bool)> {
478 let mut fields = Vec::new();
480 let mut ate_comma = true;
481 let mut delayed_err: Option<DiagnosticBuilder<'a>> = None;
482 let mut etc_span = None;
484 while self.token != token::CloseDelim(token::Brace) {
485 let attrs = match self.parse_outer_attributes() {
488 if let Some(mut delayed) = delayed_err {
494 let lo = self.token.span;
496 // check that a comma comes after every field
498 let err = self.struct_span_err(self.prev_span, "expected `,`");
499 if let Some(mut delayed) = delayed_err {
506 if self.check(&token::DotDot) || self.token == token::DotDotDot {
508 let mut etc_sp = self.token.span;
510 if self.token == token::DotDotDot { // Issue #46718
511 // Accept `...` as if it were `..` to avoid further errors
512 self.struct_span_err(self.token.span, "expected field pattern, found `...`")
515 "to omit remaining fields, use one fewer `.`",
517 Applicability::MachineApplicable
521 self.bump(); // `..` || `...`
523 if self.token == token::CloseDelim(token::Brace) {
524 etc_span = Some(etc_sp);
527 let token_str = self.this_token_descr();
528 let mut err = self.fatal(&format!("expected `}}`, found {}", token_str));
530 err.span_label(self.token.span, "expected `}`");
531 let mut comma_sp = None;
532 if self.token == token::Comma { // Issue #49257
533 let nw_span = self.sess.source_map().span_until_non_whitespace(self.token.span);
534 etc_sp = etc_sp.to(nw_span);
535 err.span_label(etc_sp,
536 "`..` must be at the end and cannot have a trailing comma");
537 comma_sp = Some(self.token.span);
542 etc_span = Some(etc_sp.until(self.token.span));
543 if self.token == token::CloseDelim(token::Brace) {
544 // If the struct looks otherwise well formed, recover and continue.
545 if let Some(sp) = comma_sp {
546 err.span_suggestion_short(
550 Applicability::MachineApplicable,
555 } else if self.token.is_ident() && ate_comma {
556 // Accept fields coming after `..,`.
557 // This way we avoid "pattern missing fields" errors afterwards.
558 // We delay this error until the end in order to have a span for a
560 if let Some(mut delayed_err) = delayed_err {
564 delayed_err = Some(err);
567 if let Some(mut err) = delayed_err {
574 fields.push(match self.parse_pat_field(lo, attrs) {
577 if let Some(mut delayed_err) = delayed_err {
583 ate_comma = self.eat(&token::Comma);
586 if let Some(mut err) = delayed_err {
587 if let Some(etc_span) = etc_span {
588 err.multipart_suggestion(
589 "move the `..` to the end of the field list",
591 (etc_span, String::new()),
592 (self.token.span, format!("{}.. }}", if ate_comma { "" } else { ", " })),
594 Applicability::MachineApplicable,
599 return Ok((fields, etc));
605 attrs: Vec<Attribute>
606 ) -> PResult<'a, Spanned<FieldPat>> {
607 // Check if a colon exists one ahead. This means we're parsing a fieldname.
609 let (subpat, fieldname, is_shorthand) = if self.look_ahead(1, |t| t == &token::Colon) {
610 // Parsing a pattern of the form "fieldname: pat"
611 let fieldname = self.parse_field_name()?;
613 let pat = self.parse_pat(None)?;
615 (pat, fieldname, false)
617 // Parsing a pattern of the form "(box) (ref) (mut) fieldname"
618 let is_box = self.eat_keyword(kw::Box);
619 let boxed_span = self.token.span;
620 let is_ref = self.eat_keyword(kw::Ref);
621 let is_mut = self.eat_keyword(kw::Mut);
622 let fieldname = self.parse_ident()?;
625 let bind_type = match (is_ref, is_mut) {
626 (true, true) => BindingMode::ByRef(Mutability::Mutable),
627 (true, false) => BindingMode::ByRef(Mutability::Immutable),
628 (false, true) => BindingMode::ByValue(Mutability::Mutable),
629 (false, false) => BindingMode::ByValue(Mutability::Immutable),
632 let fieldpat = self.mk_pat_ident(boxed_span.to(hi), bind_type, fieldname);
633 let subpat = if is_box {
634 self.mk_pat(lo.to(hi), PatKind::Box(fieldpat))
638 (subpat, fieldname, true)
652 pub(super) fn mk_pat_ident(&self, span: Span, bm: BindingMode, ident: Ident) -> P<Pat> {
653 self.mk_pat(span, PatKind::Ident(bm, ident, None))
656 fn mk_pat(&self, span: Span, node: PatKind) -> P<Pat> {
657 P(Pat { node, span, id: ast::DUMMY_NODE_ID })