1 // ignore-tidy-filelength
3 use crate::ast::{AngleBracketedArgs, AsyncArgument, ParenthesizedArgs, AttrStyle, BareFnTy};
4 use crate::ast::{GenericBound, TraitBoundModifier};
5 use crate::ast::Unsafety;
6 use crate::ast::{Mod, AnonConst, Arg, ArgSource, Arm, Guard, Attribute, BindingMode, TraitItemKind};
8 use crate::ast::{BlockCheckMode, CaptureBy, Movability};
9 use crate::ast::{Constness, Crate};
10 use crate::ast::Defaultness;
11 use crate::ast::EnumDef;
12 use crate::ast::{Expr, ExprKind, RangeLimits};
13 use crate::ast::{Field, FnDecl, FnHeader};
14 use crate::ast::{ForeignItem, ForeignItemKind, FunctionRetTy};
15 use crate::ast::{GenericParam, GenericParamKind};
16 use crate::ast::GenericArg;
17 use crate::ast::{Ident, ImplItem, IsAsync, IsAuto, Item, ItemKind};
18 use crate::ast::{Label, Lifetime, Lit, LitKind};
19 use crate::ast::{Local, LocalSource};
20 use crate::ast::MacStmtStyle;
21 use crate::ast::{Mac, Mac_, MacDelimiter};
22 use crate::ast::{MutTy, Mutability};
23 use crate::ast::{Pat, PatKind, PathSegment};
24 use crate::ast::{PolyTraitRef, QSelf};
25 use crate::ast::{Stmt, StmtKind};
26 use crate::ast::{VariantData, StructField};
27 use crate::ast::StrStyle;
28 use crate::ast::SelfKind;
29 use crate::ast::{TraitItem, TraitRef, TraitObjectSyntax};
30 use crate::ast::{Ty, TyKind, TypeBinding, GenericBounds};
31 use crate::ast::{Visibility, VisibilityKind, WhereClause, CrateSugar};
32 use crate::ast::{UseTree, UseTreeKind};
33 use crate::ast::{BinOpKind, UnOp};
34 use crate::ast::{RangeEnd, RangeSyntax};
35 use crate::{ast, attr};
36 use crate::ext::base::DummyResult;
37 use crate::source_map::{self, SourceMap, Spanned, respan};
38 use crate::parse::{self, SeqSep, classify, token};
39 use crate::parse::lexer::{TokenAndSpan, UnmatchedBrace};
40 use crate::parse::lexer::comments::{doc_comment_style, strip_doc_comment_decoration};
41 use crate::parse::token::DelimToken;
42 use crate::parse::{new_sub_parser_from_file, ParseSess, Directory, DirectoryOwnership};
43 use crate::util::parser::{AssocOp, Fixity};
44 use crate::print::pprust;
46 use crate::parse::PResult;
48 use crate::tokenstream::{self, DelimSpan, TokenTree, TokenStream, TreeAndJoint};
49 use crate::symbol::{Symbol, keywords};
51 use errors::{Applicability, DiagnosticBuilder, DiagnosticId, FatalError};
52 use rustc_target::spec::abi::{self, Abi};
53 use syntax_pos::{Span, MultiSpan, BytePos, FileName};
54 use log::{debug, trace};
59 use std::path::{self, Path, PathBuf};
63 /// Whether the type alias or associated type is a concrete type or an existential type
65 /// Just a new name for the same type
67 /// Only trait impls of the type will be usable, not the actual type itself
68 Existential(GenericBounds),
72 struct Restrictions: u8 {
73 const STMT_EXPR = 1 << 0;
74 const NO_STRUCT_LITERAL = 1 << 1;
78 type ItemInfo = (Ident, ItemKind, Option<Vec<Attribute>>);
80 /// Specifies how to parse a path.
81 #[derive(Copy, Clone, PartialEq)]
83 /// In some contexts, notably in expressions, paths with generic arguments are ambiguous
84 /// with something else. For example, in expressions `segment < ....` can be interpreted
85 /// as a comparison and `segment ( ....` can be interpreted as a function call.
86 /// In all such contexts the non-path interpretation is preferred by default for practical
87 /// reasons, but the path interpretation can be forced by the disambiguator `::`, e.g.
88 /// `x<y>` - comparisons, `x::<y>` - unambiguously a path.
90 /// In other contexts, notably in types, no ambiguity exists and paths can be written
91 /// without the disambiguator, e.g., `x<y>` - unambiguously a path.
92 /// Paths with disambiguators are still accepted, `x::<Y>` - unambiguously a path too.
94 /// A path with generic arguments disallowed, e.g., `foo::bar::Baz`, used in imports,
95 /// visibilities or attributes.
96 /// Technically, this variant is unnecessary and e.g., `Expr` can be used instead
97 /// (paths in "mod" contexts have to be checked later for absence of generic arguments
98 /// anyway, due to macros), but it is used to avoid weird suggestions about expected
99 /// tokens when something goes wrong.
103 #[derive(Clone, Copy, PartialEq, Debug)]
110 #[derive(Clone, Copy, PartialEq, Debug)]
116 /// Possibly accepts an `token::Interpolated` expression (a pre-parsed expression
117 /// dropped into the token stream, which happens while parsing the result of
118 /// macro expansion). Placement of these is not as complex as I feared it would
119 /// be. The important thing is to make sure that lookahead doesn't balk at
120 /// `token::Interpolated` tokens.
121 macro_rules! maybe_whole_expr {
123 if let token::Interpolated(nt) = &$p.token {
125 token::NtExpr(e) | token::NtLiteral(e) => {
130 token::NtPath(path) => {
131 let path = path.clone();
133 return Ok($p.mk_expr($p.span, ExprKind::Path(None, path), ThinVec::new()));
135 token::NtBlock(block) => {
136 let block = block.clone();
138 return Ok($p.mk_expr($p.span, ExprKind::Block(block, None), ThinVec::new()));
146 /// As maybe_whole_expr, but for things other than expressions
147 macro_rules! maybe_whole {
148 ($p:expr, $constructor:ident, |$x:ident| $e:expr) => {
149 if let token::Interpolated(nt) = &$p.token {
150 if let token::$constructor(x) = &**nt {
159 /// If the next tokens are ill-formed `$ty::` recover them as `<$ty>::`.
160 macro_rules! maybe_recover_from_interpolated_ty_qpath {
161 ($self: expr, $allow_qpath_recovery: expr) => {
162 if $allow_qpath_recovery && $self.look_ahead(1, |t| t == &token::ModSep) {
163 if let token::Interpolated(nt) = &$self.token {
164 if let token::NtTy(ty) = &**nt {
167 return $self.maybe_recover_from_bad_qpath_stage_2($self.prev_span, ty);
174 fn maybe_append(mut lhs: Vec<Attribute>, mut rhs: Option<Vec<Attribute>>) -> Vec<Attribute> {
175 if let Some(ref mut rhs) = rhs {
181 #[derive(Debug, Clone, Copy, PartialEq)]
192 /* ident is handled by common.rs */
195 pub struct Parser<'a> {
196 pub sess: &'a ParseSess,
197 /// the current token:
198 pub token: token::Token,
199 /// the span of the current token:
201 /// the span of the previous token:
202 meta_var_span: Option<Span>,
204 /// the previous token kind
205 prev_token_kind: PrevTokenKind,
206 restrictions: Restrictions,
207 /// Used to determine the path to externally loaded source files
208 crate directory: Directory<'a>,
209 /// Whether to parse sub-modules in other files.
210 pub recurse_into_file_modules: bool,
211 /// Name of the root module this parser originated from. If `None`, then the
212 /// name is not known. This does not change while the parser is descending
213 /// into modules, and sub-parsers have new values for this name.
214 pub root_module_name: Option<String>,
215 crate expected_tokens: Vec<TokenType>,
216 token_cursor: TokenCursor,
217 desugar_doc_comments: bool,
218 /// Whether we should configure out of line modules as we parse.
220 /// This field is used to keep track of how many left angle brackets we have seen. This is
221 /// required in order to detect extra leading left angle brackets (`<` characters) and error
224 /// See the comments in the `parse_path_segment` function for more details.
225 crate unmatched_angle_bracket_count: u32,
226 crate max_angle_bracket_count: u32,
227 /// List of all unclosed delimiters found by the lexer. If an entry is used for error recovery
228 /// it gets removed from here. Every entry left at the end gets emitted as an independent
230 crate unclosed_delims: Vec<UnmatchedBrace>,
231 last_unexpected_token_span: Option<Span>,
234 impl<'a> Drop for Parser<'a> {
236 let diag = self.diagnostic();
237 emit_unclosed_delims(&mut self.unclosed_delims, diag);
243 frame: TokenCursorFrame,
244 stack: Vec<TokenCursorFrame>,
248 struct TokenCursorFrame {
249 delim: token::DelimToken,
252 tree_cursor: tokenstream::Cursor,
254 last_token: LastToken,
257 /// This is used in `TokenCursorFrame` above to track tokens that are consumed
258 /// by the parser, and then that's transitively used to record the tokens that
259 /// each parse AST item is created with.
261 /// Right now this has two states, either collecting tokens or not collecting
262 /// tokens. If we're collecting tokens we just save everything off into a local
263 /// `Vec`. This should eventually though likely save tokens from the original
264 /// token stream and just use slicing of token streams to avoid creation of a
265 /// whole new vector.
267 /// The second state is where we're passively not recording tokens, but the last
268 /// token is still tracked for when we want to start recording tokens. This
269 /// "last token" means that when we start recording tokens we'll want to ensure
270 /// that this, the first token, is included in the output.
272 /// You can find some more example usage of this in the `collect_tokens` method
276 Collecting(Vec<TreeAndJoint>),
277 Was(Option<TreeAndJoint>),
280 impl TokenCursorFrame {
281 fn new(sp: DelimSpan, delim: DelimToken, tts: &TokenStream) -> Self {
285 open_delim: delim == token::NoDelim,
286 tree_cursor: tts.clone().into_trees(),
287 close_delim: delim == token::NoDelim,
288 last_token: LastToken::Was(None),
294 fn next(&mut self) -> TokenAndSpan {
296 let tree = if !self.frame.open_delim {
297 self.frame.open_delim = true;
298 TokenTree::open_tt(self.frame.span.open, self.frame.delim)
299 } else if let Some(tree) = self.frame.tree_cursor.next() {
301 } else if !self.frame.close_delim {
302 self.frame.close_delim = true;
303 TokenTree::close_tt(self.frame.span.close, self.frame.delim)
304 } else if let Some(frame) = self.stack.pop() {
308 return TokenAndSpan { tok: token::Eof, sp: syntax_pos::DUMMY_SP }
311 match self.frame.last_token {
312 LastToken::Collecting(ref mut v) => v.push(tree.clone().into()),
313 LastToken::Was(ref mut t) => *t = Some(tree.clone().into()),
317 TokenTree::Token(sp, tok) => return TokenAndSpan { tok: tok, sp: sp },
318 TokenTree::Delimited(sp, delim, tts) => {
319 let frame = TokenCursorFrame::new(sp, delim, &tts);
320 self.stack.push(mem::replace(&mut self.frame, frame));
326 fn next_desugared(&mut self) -> TokenAndSpan {
327 let (sp, name) = match self.next() {
328 TokenAndSpan { sp, tok: token::DocComment(name) } => (sp, name),
332 let stripped = strip_doc_comment_decoration(&name.as_str());
334 // Searches for the occurrences of `"#*` and returns the minimum number of `#`s
335 // required to wrap the text.
336 let mut num_of_hashes = 0;
338 for ch in stripped.chars() {
341 '#' if count > 0 => count + 1,
344 num_of_hashes = cmp::max(num_of_hashes, count);
347 let delim_span = DelimSpan::from_single(sp);
348 let body = TokenTree::Delimited(
351 [TokenTree::Token(sp, token::Ident(ast::Ident::from_str("doc"), false)),
352 TokenTree::Token(sp, token::Eq),
353 TokenTree::Token(sp, token::Literal(
354 token::StrRaw(Symbol::intern(&stripped), num_of_hashes), None))
356 .iter().cloned().collect::<TokenStream>().into(),
359 self.stack.push(mem::replace(&mut self.frame, TokenCursorFrame::new(
362 &if doc_comment_style(&name.as_str()) == AttrStyle::Inner {
363 [TokenTree::Token(sp, token::Pound), TokenTree::Token(sp, token::Not), body]
364 .iter().cloned().collect::<TokenStream>().into()
366 [TokenTree::Token(sp, token::Pound), body]
367 .iter().cloned().collect::<TokenStream>().into()
375 #[derive(Clone, PartialEq)]
376 crate enum TokenType {
378 Keyword(keywords::Keyword),
388 fn to_string(&self) -> String {
390 TokenType::Token(ref t) => format!("`{}`", pprust::token_to_string(t)),
391 TokenType::Keyword(kw) => format!("`{}`", kw.name()),
392 TokenType::Operator => "an operator".to_string(),
393 TokenType::Lifetime => "lifetime".to_string(),
394 TokenType::Ident => "identifier".to_string(),
395 TokenType::Path => "path".to_string(),
396 TokenType::Type => "type".to_string(),
397 TokenType::Const => "const".to_string(),
402 /// Returns `true` if `IDENT t` can start a type -- `IDENT::a::b`, `IDENT<u8, u8>`,
403 /// `IDENT<<u8 as Trait>::AssocTy>`.
405 /// Types can also be of the form `IDENT(u8, u8) -> u8`, however this assumes
406 /// that `IDENT` is not the ident of a fn trait.
407 fn can_continue_type_after_non_fn_ident(t: &token::Token) -> bool {
408 t == &token::ModSep || t == &token::Lt ||
409 t == &token::BinOp(token::Shl)
412 /// Information about the path to a module.
413 pub struct ModulePath {
416 pub result: Result<ModulePathSuccess, Error>,
419 pub struct ModulePathSuccess {
421 pub directory_ownership: DirectoryOwnership,
426 FileNotFoundForModule {
428 default_path: String,
429 secondary_path: String,
434 default_path: String,
435 secondary_path: String,
438 InclusiveRangeWithNoEnd,
442 fn span_err<S: Into<MultiSpan>>(self,
444 handler: &errors::Handler) -> DiagnosticBuilder<'_> {
446 Error::FileNotFoundForModule { ref mod_name,
450 let mut err = struct_span_err!(handler, sp, E0583,
451 "file not found for module `{}`", mod_name);
452 err.help(&format!("name the file either {} or {} inside the directory \"{}\"",
458 Error::DuplicatePaths { ref mod_name, ref default_path, ref secondary_path } => {
459 let mut err = struct_span_err!(handler, sp, E0584,
460 "file for module `{}` found at both {} and {}",
464 err.help("delete or rename one of them to remove the ambiguity");
467 Error::UselessDocComment => {
468 let mut err = struct_span_err!(handler, sp, E0585,
469 "found a documentation comment that doesn't document anything");
470 err.help("doc comments must come before what they document, maybe a comment was \
471 intended with `//`?");
474 Error::InclusiveRangeWithNoEnd => {
475 let mut err = struct_span_err!(handler, sp, E0586,
476 "inclusive range with no end");
477 err.help("inclusive ranges must be bounded at the end (`..=b` or `a..=b`)");
487 AttributesParsed(ThinVec<Attribute>),
488 AlreadyParsed(P<Expr>),
491 impl From<Option<ThinVec<Attribute>>> for LhsExpr {
492 fn from(o: Option<ThinVec<Attribute>>) -> Self {
493 if let Some(attrs) = o {
494 LhsExpr::AttributesParsed(attrs)
496 LhsExpr::NotYetParsed
501 impl From<P<Expr>> for LhsExpr {
502 fn from(expr: P<Expr>) -> Self {
503 LhsExpr::AlreadyParsed(expr)
507 /// Creates a placeholder argument.
508 fn dummy_arg(span: Span) -> Arg {
509 let ident = Ident::new(keywords::Invalid.name(), span);
511 id: ast::DUMMY_NODE_ID,
512 node: PatKind::Ident(BindingMode::ByValue(Mutability::Immutable), ident, None),
518 id: ast::DUMMY_NODE_ID
520 Arg { ty: P(ty), pat: pat, id: ast::DUMMY_NODE_ID, source: ast::ArgSource::Normal }
523 #[derive(Copy, Clone, Debug)]
524 enum TokenExpectType {
529 impl<'a> Parser<'a> {
530 pub fn new(sess: &'a ParseSess,
532 directory: Option<Directory<'a>>,
533 recurse_into_file_modules: bool,
534 desugar_doc_comments: bool)
536 let mut parser = Parser {
538 token: token::Whitespace,
539 span: syntax_pos::DUMMY_SP,
540 prev_span: syntax_pos::DUMMY_SP,
542 prev_token_kind: PrevTokenKind::Other,
543 restrictions: Restrictions::empty(),
544 recurse_into_file_modules,
545 directory: Directory {
546 path: Cow::from(PathBuf::new()),
547 ownership: DirectoryOwnership::Owned { relative: None }
549 root_module_name: None,
550 expected_tokens: Vec::new(),
551 token_cursor: TokenCursor {
552 frame: TokenCursorFrame::new(
559 desugar_doc_comments,
561 unmatched_angle_bracket_count: 0,
562 max_angle_bracket_count: 0,
563 unclosed_delims: Vec::new(),
564 last_unexpected_token_span: None,
567 let tok = parser.next_tok();
568 parser.token = tok.tok;
569 parser.span = tok.sp;
571 if let Some(directory) = directory {
572 parser.directory = directory;
573 } else if !parser.span.is_dummy() {
574 if let FileName::Real(mut path) = sess.source_map().span_to_unmapped_path(parser.span) {
576 parser.directory.path = Cow::from(path);
580 parser.process_potential_macro_variable();
584 fn next_tok(&mut self) -> TokenAndSpan {
585 let mut next = if self.desugar_doc_comments {
586 self.token_cursor.next_desugared()
588 self.token_cursor.next()
590 if next.sp.is_dummy() {
591 // Tweak the location for better diagnostics, but keep syntactic context intact.
592 next.sp = self.prev_span.with_ctxt(next.sp.ctxt());
597 /// Converts the current token to a string using `self`'s reader.
598 pub fn this_token_to_string(&self) -> String {
599 pprust::token_to_string(&self.token)
602 fn token_descr(&self) -> Option<&'static str> {
603 Some(match &self.token {
604 t if t.is_special_ident() => "reserved identifier",
605 t if t.is_used_keyword() => "keyword",
606 t if t.is_unused_keyword() => "reserved keyword",
607 token::DocComment(..) => "doc comment",
612 fn this_token_descr(&self) -> String {
613 if let Some(prefix) = self.token_descr() {
614 format!("{} `{}`", prefix, self.this_token_to_string())
616 format!("`{}`", self.this_token_to_string())
620 fn unexpected_last<T>(&self, t: &token::Token) -> PResult<'a, T> {
621 let token_str = pprust::token_to_string(t);
622 Err(self.span_fatal(self.prev_span, &format!("unexpected token: `{}`", token_str)))
625 crate fn unexpected<T>(&mut self) -> PResult<'a, T> {
626 match self.expect_one_of(&[], &[]) {
628 Ok(_) => unreachable!(),
632 /// Expects and consumes the token `t`. Signals an error if the next token is not `t`.
633 pub fn expect(&mut self, t: &token::Token) -> PResult<'a, bool /* recovered */> {
634 if self.expected_tokens.is_empty() {
635 if self.token == *t {
639 let token_str = pprust::token_to_string(t);
640 let this_token_str = self.this_token_descr();
641 let mut err = self.fatal(&format!("expected `{}`, found {}",
645 let sp = if self.token == token::Token::Eof {
646 // EOF, don't want to point at the following char, but rather the last token
649 self.sess.source_map().next_point(self.prev_span)
651 let label_exp = format!("expected `{}`", token_str);
652 match self.recover_closing_delimiter(&[t.clone()], err) {
655 return Ok(recovered);
658 let cm = self.sess.source_map();
659 match (cm.lookup_line(self.span.lo()), cm.lookup_line(sp.lo())) {
660 (Ok(ref a), Ok(ref b)) if a.line == b.line => {
661 // When the spans are in the same line, it means that the only content
662 // between them is whitespace, point only at the found token.
663 err.span_label(self.span, label_exp);
666 err.span_label(sp, label_exp);
667 err.span_label(self.span, "unexpected token");
673 self.expect_one_of(slice::from_ref(t), &[])
677 fn recover_closing_delimiter(
679 tokens: &[token::Token],
680 mut err: DiagnosticBuilder<'a>,
681 ) -> PResult<'a, bool> {
683 // we want to use the last closing delim that would apply
684 for (i, unmatched) in self.unclosed_delims.iter().enumerate().rev() {
685 if tokens.contains(&token::CloseDelim(unmatched.expected_delim))
686 && Some(self.span) > unmatched.unclosed_span
693 // Recover and assume that the detected unclosed delimiter was meant for
694 // this location. Emit the diagnostic and act as if the delimiter was
695 // present for the parser's sake.
697 // Don't attempt to recover from this unclosed delimiter more than once.
698 let unmatched = self.unclosed_delims.remove(pos);
699 let delim = TokenType::Token(token::CloseDelim(unmatched.expected_delim));
701 // We want to suggest the inclusion of the closing delimiter where it makes
702 // the most sense, which is immediately after the last token:
707 // | help: `)` may belong here (FIXME: #58270)
709 // unclosed delimiter
710 if let Some(sp) = unmatched.unclosed_span {
711 err.span_label(sp, "unclosed delimiter");
713 err.span_suggestion_short(
714 self.sess.source_map().next_point(self.prev_span),
715 &format!("{} may belong here", delim.to_string()),
717 Applicability::MaybeIncorrect,
720 self.expected_tokens.clear(); // reduce errors
727 /// Expect next token to be edible or inedible token. If edible,
728 /// then consume it; if inedible, then return without consuming
729 /// anything. Signal a fatal error if next token is unexpected.
730 pub fn expect_one_of(
732 edible: &[token::Token],
733 inedible: &[token::Token],
734 ) -> PResult<'a, bool /* recovered */> {
735 fn tokens_to_string(tokens: &[TokenType]) -> String {
736 let mut i = tokens.iter();
737 // This might be a sign we need a connect method on Iterator.
739 .map_or(String::new(), |t| t.to_string());
740 i.enumerate().fold(b, |mut b, (i, a)| {
741 if tokens.len() > 2 && i == tokens.len() - 2 {
743 } else if tokens.len() == 2 && i == tokens.len() - 2 {
748 b.push_str(&a.to_string());
752 if edible.contains(&self.token) {
755 } else if inedible.contains(&self.token) {
756 // leave it in the input
758 } else if self.last_unexpected_token_span == Some(self.span) {
761 let mut expected = edible.iter()
762 .map(|x| TokenType::Token(x.clone()))
763 .chain(inedible.iter().map(|x| TokenType::Token(x.clone())))
764 .chain(self.expected_tokens.iter().cloned())
765 .collect::<Vec<_>>();
766 expected.sort_by_cached_key(|x| x.to_string());
768 let expect = tokens_to_string(&expected[..]);
769 let actual = self.this_token_to_string();
770 let (msg_exp, (label_sp, label_exp)) = if expected.len() > 1 {
771 let short_expect = if expected.len() > 6 {
772 format!("{} possible tokens", expected.len())
776 (format!("expected one of {}, found `{}`", expect, actual),
777 (self.sess.source_map().next_point(self.prev_span),
778 format!("expected one of {} here", short_expect)))
779 } else if expected.is_empty() {
780 (format!("unexpected token: `{}`", actual),
781 (self.prev_span, "unexpected token after this".to_string()))
783 (format!("expected {}, found `{}`", expect, actual),
784 (self.sess.source_map().next_point(self.prev_span),
785 format!("expected {} here", expect)))
787 self.last_unexpected_token_span = Some(self.span);
788 let mut err = self.fatal(&msg_exp);
789 if self.token.is_ident_named("and") {
790 err.span_suggestion_short(
792 "use `&&` instead of `and` for the boolean operator",
794 Applicability::MaybeIncorrect,
797 if self.token.is_ident_named("or") {
798 err.span_suggestion_short(
800 "use `||` instead of `or` for the boolean operator",
802 Applicability::MaybeIncorrect,
805 let sp = if self.token == token::Token::Eof {
806 // This is EOF, don't want to point at the following char, but rather the last token
811 match self.recover_closing_delimiter(&expected.iter().filter_map(|tt| match tt {
812 TokenType::Token(t) => Some(t.clone()),
814 }).collect::<Vec<_>>(), err) {
817 return Ok(recovered);
821 let is_semi_suggestable = expected.iter().any(|t| match t {
822 TokenType::Token(token::Semi) => true, // we expect a `;` here
824 }) && ( // a `;` would be expected before the current keyword
825 self.token.is_keyword(keywords::Break) ||
826 self.token.is_keyword(keywords::Continue) ||
827 self.token.is_keyword(keywords::For) ||
828 self.token.is_keyword(keywords::If) ||
829 self.token.is_keyword(keywords::Let) ||
830 self.token.is_keyword(keywords::Loop) ||
831 self.token.is_keyword(keywords::Match) ||
832 self.token.is_keyword(keywords::Return) ||
833 self.token.is_keyword(keywords::While)
835 let cm = self.sess.source_map();
836 match (cm.lookup_line(self.span.lo()), cm.lookup_line(sp.lo())) {
837 (Ok(ref a), Ok(ref b)) if a.line != b.line && is_semi_suggestable => {
838 // The spans are in different lines, expected `;` and found `let` or `return`.
839 // High likelihood that it is only a missing `;`.
840 err.span_suggestion_short(
842 "a semicolon may be missing here",
844 Applicability::MaybeIncorrect,
849 (Ok(ref a), Ok(ref b)) if a.line == b.line => {
850 // When the spans are in the same line, it means that the only content between
851 // them is whitespace, point at the found token in that case:
853 // X | () => { syntax error };
854 // | ^^^^^ expected one of 8 possible tokens here
856 // instead of having:
858 // X | () => { syntax error };
859 // | -^^^^^ unexpected token
861 // | expected one of 8 possible tokens here
862 err.span_label(self.span, label_exp);
864 _ if self.prev_span == syntax_pos::DUMMY_SP => {
865 // Account for macro context where the previous span might not be
866 // available to avoid incorrect output (#54841).
867 err.span_label(self.span, "unexpected token");
870 err.span_label(sp, label_exp);
871 err.span_label(self.span, "unexpected token");
878 /// Returns the span of expr, if it was not interpolated or the span of the interpolated token.
879 fn interpolated_or_expr_span(&self,
880 expr: PResult<'a, P<Expr>>)
881 -> PResult<'a, (Span, P<Expr>)> {
883 if self.prev_token_kind == PrevTokenKind::Interpolated {
891 fn expected_ident_found(&self) -> DiagnosticBuilder<'a> {
892 let mut err = self.struct_span_err(self.span,
893 &format!("expected identifier, found {}",
894 self.this_token_descr()));
895 if let token::Ident(ident, false) = &self.token {
896 if ident.is_raw_guess() {
899 "you can escape reserved keywords to use them as identifiers",
900 format!("r#{}", ident),
901 Applicability::MaybeIncorrect,
905 if let Some(token_descr) = self.token_descr() {
906 err.span_label(self.span, format!("expected identifier, found {}", token_descr));
908 err.span_label(self.span, "expected identifier");
909 if self.token == token::Comma && self.look_ahead(1, |t| t.is_ident()) {
914 Applicability::MachineApplicable,
921 pub fn parse_ident(&mut self) -> PResult<'a, ast::Ident> {
922 self.parse_ident_common(true)
925 fn parse_ident_common(&mut self, recover: bool) -> PResult<'a, ast::Ident> {
927 token::Ident(ident, _) => {
928 if self.token.is_reserved_ident() {
929 let mut err = self.expected_ident_found();
936 let span = self.span;
938 Ok(Ident::new(ident.name, span))
941 Err(if self.prev_token_kind == PrevTokenKind::DocComment {
942 self.span_fatal_err(self.prev_span, Error::UselessDocComment)
944 self.expected_ident_found()
950 /// Checks if the next token is `tok`, and returns `true` if so.
952 /// This method will automatically add `tok` to `expected_tokens` if `tok` is not
954 crate fn check(&mut self, tok: &token::Token) -> bool {
955 let is_present = self.token == *tok;
956 if !is_present { self.expected_tokens.push(TokenType::Token(tok.clone())); }
960 /// Consumes a token 'tok' if it exists. Returns whether the given token was present.
961 pub fn eat(&mut self, tok: &token::Token) -> bool {
962 let is_present = self.check(tok);
963 if is_present { self.bump() }
967 fn check_keyword(&mut self, kw: keywords::Keyword) -> bool {
968 self.expected_tokens.push(TokenType::Keyword(kw));
969 self.token.is_keyword(kw)
972 /// If the next token is the given keyword, eats it and returns
973 /// `true`. Otherwise, returns `false`.
974 pub fn eat_keyword(&mut self, kw: keywords::Keyword) -> bool {
975 if self.check_keyword(kw) {
983 fn eat_keyword_noexpect(&mut self, kw: keywords::Keyword) -> bool {
984 if self.token.is_keyword(kw) {
992 /// If the given word is not a keyword, signals an error.
993 /// If the next token is not the given word, signals an error.
994 /// Otherwise, eats it.
995 fn expect_keyword(&mut self, kw: keywords::Keyword) -> PResult<'a, ()> {
996 if !self.eat_keyword(kw) {
1003 fn check_ident(&mut self) -> bool {
1004 if self.token.is_ident() {
1007 self.expected_tokens.push(TokenType::Ident);
1012 fn check_path(&mut self) -> bool {
1013 if self.token.is_path_start() {
1016 self.expected_tokens.push(TokenType::Path);
1021 fn check_type(&mut self) -> bool {
1022 if self.token.can_begin_type() {
1025 self.expected_tokens.push(TokenType::Type);
1030 fn check_const_arg(&mut self) -> bool {
1031 if self.token.can_begin_const_arg() {
1034 self.expected_tokens.push(TokenType::Const);
1039 /// Expects and consumes a `+`. if `+=` is seen, replaces it with a `=`
1040 /// and continues. If a `+` is not seen, returns `false`.
1042 /// This is used when token-splitting `+=` into `+`.
1043 /// See issue #47856 for an example of when this may occur.
1044 fn eat_plus(&mut self) -> bool {
1045 self.expected_tokens.push(TokenType::Token(token::BinOp(token::Plus)));
1047 token::BinOp(token::Plus) => {
1051 token::BinOpEq(token::Plus) => {
1052 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1053 self.bump_with(token::Eq, span);
1061 /// Checks to see if the next token is either `+` or `+=`.
1062 /// Otherwise returns `false`.
1063 fn check_plus(&mut self) -> bool {
1064 if self.token.is_like_plus() {
1068 self.expected_tokens.push(TokenType::Token(token::BinOp(token::Plus)));
1073 /// Expects and consumes an `&`. If `&&` is seen, replaces it with a single
1074 /// `&` and continues. If an `&` is not seen, signals an error.
1075 fn expect_and(&mut self) -> PResult<'a, ()> {
1076 self.expected_tokens.push(TokenType::Token(token::BinOp(token::And)));
1078 token::BinOp(token::And) => {
1083 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1084 Ok(self.bump_with(token::BinOp(token::And), span))
1086 _ => self.unexpected()
1090 /// Expects and consumes an `|`. If `||` is seen, replaces it with a single
1091 /// `|` and continues. If an `|` is not seen, signals an error.
1092 fn expect_or(&mut self) -> PResult<'a, ()> {
1093 self.expected_tokens.push(TokenType::Token(token::BinOp(token::Or)));
1095 token::BinOp(token::Or) => {
1100 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1101 Ok(self.bump_with(token::BinOp(token::Or), span))
1103 _ => self.unexpected()
1107 fn expect_no_suffix(&self, sp: Span, kind: &str, suffix: Option<ast::Name>) {
1109 None => {/* everything ok */}
1111 let text = suf.as_str();
1112 if text.is_empty() {
1113 self.span_bug(sp, "found empty literal suffix in Some")
1115 let mut err = if kind == "a tuple index" &&
1116 ["i32", "u32", "isize", "usize"].contains(&text.to_string().as_str())
1118 // #59553: warn instead of reject out of hand to allow the fix to percolate
1119 // through the ecosystem when people fix their macros
1120 let mut err = self.struct_span_warn(
1122 &format!("suffixes on {} are invalid", kind),
1125 "`{}` is *temporarily* accepted on tuple index fields as it was \
1126 incorrectly accepted on stable for a few releases",
1130 "on proc macros, you'll want to use `syn::Index::from` or \
1131 `proc_macro::Literal::*_unsuffixed` for code that will desugar \
1132 to tuple field access",
1135 "for more context, see https://github.com/rust-lang/rust/issues/60210",
1139 self.struct_span_err(sp, &format!("suffixes on {} are invalid", kind))
1141 err.span_label(sp, format!("invalid suffix `{}`", text));
1147 /// Attempts to consume a `<`. If `<<` is seen, replaces it with a single
1148 /// `<` and continue. If `<-` is seen, replaces it with a single `<`
1149 /// and continue. If a `<` is not seen, returns false.
1151 /// This is meant to be used when parsing generics on a path to get the
1153 fn eat_lt(&mut self) -> bool {
1154 self.expected_tokens.push(TokenType::Token(token::Lt));
1155 let ate = match self.token {
1160 token::BinOp(token::Shl) => {
1161 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1162 self.bump_with(token::Lt, span);
1166 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1167 self.bump_with(token::BinOp(token::Minus), span);
1174 // See doc comment for `unmatched_angle_bracket_count`.
1175 self.unmatched_angle_bracket_count += 1;
1176 self.max_angle_bracket_count += 1;
1177 debug!("eat_lt: (increment) count={:?}", self.unmatched_angle_bracket_count);
1183 fn expect_lt(&mut self) -> PResult<'a, ()> {
1191 /// Expects and consumes a single `>` token. if a `>>` is seen, replaces it
1192 /// with a single `>` and continues. If a `>` is not seen, signals an error.
1193 fn expect_gt(&mut self) -> PResult<'a, ()> {
1194 self.expected_tokens.push(TokenType::Token(token::Gt));
1195 let ate = match self.token {
1200 token::BinOp(token::Shr) => {
1201 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1202 Some(self.bump_with(token::Gt, span))
1204 token::BinOpEq(token::Shr) => {
1205 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1206 Some(self.bump_with(token::Ge, span))
1209 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1210 Some(self.bump_with(token::Eq, span))
1217 // See doc comment for `unmatched_angle_bracket_count`.
1218 if self.unmatched_angle_bracket_count > 0 {
1219 self.unmatched_angle_bracket_count -= 1;
1220 debug!("expect_gt: (decrement) count={:?}", self.unmatched_angle_bracket_count);
1225 None => self.unexpected(),
1229 /// Eats and discards tokens until one of `kets` is encountered. Respects token trees,
1230 /// passes through any errors encountered. Used for error recovery.
1231 fn eat_to_tokens(&mut self, kets: &[&token::Token]) {
1232 let handler = self.diagnostic();
1234 if let Err(ref mut err) = self.parse_seq_to_before_tokens(kets,
1236 TokenExpectType::Expect,
1237 |p| Ok(p.parse_token_tree())) {
1238 handler.cancel(err);
1242 /// Parses a sequence, including the closing delimiter. The function
1243 /// `f` must consume tokens until reaching the next separator or
1244 /// closing bracket.
1245 pub fn parse_seq_to_end<T, F>(&mut self,
1249 -> PResult<'a, Vec<T>> where
1250 F: FnMut(&mut Parser<'a>) -> PResult<'a, T>,
1252 let (val, recovered) = self.parse_seq_to_before_end(ket, sep, f)?;
1259 /// Parses a sequence, not including the closing delimiter. The function
1260 /// `f` must consume tokens until reaching the next separator or
1261 /// closing bracket.
1262 pub fn parse_seq_to_before_end<T, F>(
1267 ) -> PResult<'a, (Vec<T>, bool)>
1268 where F: FnMut(&mut Parser<'a>) -> PResult<'a, T>
1270 self.parse_seq_to_before_tokens(&[ket], sep, TokenExpectType::Expect, f)
1273 fn parse_seq_to_before_tokens<T, F>(
1275 kets: &[&token::Token],
1277 expect: TokenExpectType,
1279 ) -> PResult<'a, (Vec<T>, bool /* recovered */)>
1280 where F: FnMut(&mut Parser<'a>) -> PResult<'a, T>
1282 let mut first = true;
1283 let mut recovered = false;
1285 while !kets.iter().any(|k| {
1287 TokenExpectType::Expect => self.check(k),
1288 TokenExpectType::NoExpect => self.token == **k,
1292 token::CloseDelim(..) | token::Eof => break,
1295 if let Some(ref t) = sep.sep {
1299 match self.expect(t) {
1306 // Attempt to keep parsing if it was a similar separator
1307 if let Some(ref tokens) = t.similar_tokens() {
1308 if tokens.contains(&self.token) {
1313 // Attempt to keep parsing if it was an omitted separator
1328 if sep.trailing_sep_allowed && kets.iter().any(|k| {
1330 TokenExpectType::Expect => self.check(k),
1331 TokenExpectType::NoExpect => self.token == **k,
1344 /// Parses a sequence, including the closing delimiter. The function
1345 /// `f` must consume tokens until reaching the next separator or
1346 /// closing bracket.
1347 fn parse_unspanned_seq<T, F>(
1353 ) -> PResult<'a, Vec<T>> where
1354 F: FnMut(&mut Parser<'a>) -> PResult<'a, T>,
1357 let (result, recovered) = self.parse_seq_to_before_end(ket, sep, f)?;
1364 /// Advance the parser by one token
1365 pub fn bump(&mut self) {
1366 if self.prev_token_kind == PrevTokenKind::Eof {
1367 // Bumping after EOF is a bad sign, usually an infinite loop.
1368 self.bug("attempted to bump the parser past EOF (may be stuck in a loop)");
1371 self.prev_span = self.meta_var_span.take().unwrap_or(self.span);
1373 // Record last token kind for possible error recovery.
1374 self.prev_token_kind = match self.token {
1375 token::DocComment(..) => PrevTokenKind::DocComment,
1376 token::Comma => PrevTokenKind::Comma,
1377 token::BinOp(token::Plus) => PrevTokenKind::Plus,
1378 token::Interpolated(..) => PrevTokenKind::Interpolated,
1379 token::Eof => PrevTokenKind::Eof,
1380 token::Ident(..) => PrevTokenKind::Ident,
1381 _ => PrevTokenKind::Other,
1384 let next = self.next_tok();
1385 self.span = next.sp;
1386 self.token = next.tok;
1387 self.expected_tokens.clear();
1388 // check after each token
1389 self.process_potential_macro_variable();
1392 /// Advance the parser using provided token as a next one. Use this when
1393 /// consuming a part of a token. For example a single `<` from `<<`.
1394 fn bump_with(&mut self, next: token::Token, span: Span) {
1395 self.prev_span = self.span.with_hi(span.lo());
1396 // It would be incorrect to record the kind of the current token, but
1397 // fortunately for tokens currently using `bump_with`, the
1398 // prev_token_kind will be of no use anyway.
1399 self.prev_token_kind = PrevTokenKind::Other;
1402 self.expected_tokens.clear();
1405 pub fn look_ahead<R, F>(&self, dist: usize, f: F) -> R where
1406 F: FnOnce(&token::Token) -> R,
1409 return f(&self.token)
1412 f(&match self.token_cursor.frame.tree_cursor.look_ahead(dist - 1) {
1413 Some(tree) => match tree {
1414 TokenTree::Token(_, tok) => tok,
1415 TokenTree::Delimited(_, delim, _) => token::OpenDelim(delim),
1417 None => token::CloseDelim(self.token_cursor.frame.delim),
1421 fn look_ahead_span(&self, dist: usize) -> Span {
1426 match self.token_cursor.frame.tree_cursor.look_ahead(dist - 1) {
1427 Some(TokenTree::Token(span, _)) => span,
1428 Some(TokenTree::Delimited(span, ..)) => span.entire(),
1429 None => self.look_ahead_span(dist - 1),
1432 pub fn fatal(&self, m: &str) -> DiagnosticBuilder<'a> {
1433 self.sess.span_diagnostic.struct_span_fatal(self.span, m)
1435 pub fn span_fatal<S: Into<MultiSpan>>(&self, sp: S, m: &str) -> DiagnosticBuilder<'a> {
1436 self.sess.span_diagnostic.struct_span_fatal(sp, m)
1438 fn span_fatal_err<S: Into<MultiSpan>>(&self, sp: S, err: Error) -> DiagnosticBuilder<'a> {
1439 err.span_err(sp, self.diagnostic())
1441 fn bug(&self, m: &str) -> ! {
1442 self.sess.span_diagnostic.span_bug(self.span, m)
1444 fn span_err<S: Into<MultiSpan>>(&self, sp: S, m: &str) {
1445 self.sess.span_diagnostic.span_err(sp, m)
1447 crate fn struct_span_err<S: Into<MultiSpan>>(&self, sp: S, m: &str) -> DiagnosticBuilder<'a> {
1448 self.sess.span_diagnostic.struct_span_err(sp, m)
1450 fn struct_span_warn<S: Into<MultiSpan>>(&self, sp: S, m: &str) -> DiagnosticBuilder<'a> {
1451 self.sess.span_diagnostic.struct_span_warn(sp, m)
1453 crate fn span_bug<S: Into<MultiSpan>>(&self, sp: S, m: &str) -> ! {
1454 self.sess.span_diagnostic.span_bug(sp, m)
1457 fn cancel(&self, err: &mut DiagnosticBuilder<'_>) {
1458 self.sess.span_diagnostic.cancel(err)
1461 crate fn diagnostic(&self) -> &'a errors::Handler {
1462 &self.sess.span_diagnostic
1465 /// Is the current token one of the keywords that signals a bare function type?
1466 fn token_is_bare_fn_keyword(&mut self) -> bool {
1467 self.check_keyword(keywords::Fn) ||
1468 self.check_keyword(keywords::Unsafe) ||
1469 self.check_keyword(keywords::Extern)
1472 /// Parses a `TyKind::BareFn` type.
1473 fn parse_ty_bare_fn(&mut self, generic_params: Vec<GenericParam>) -> PResult<'a, TyKind> {
1476 [unsafe] [extern "ABI"] fn (S) -> T
1486 let unsafety = self.parse_unsafety();
1487 let abi = if self.eat_keyword(keywords::Extern) {
1488 self.parse_opt_abi()?.unwrap_or(Abi::C)
1493 self.expect_keyword(keywords::Fn)?;
1494 let (inputs, c_variadic) = self.parse_fn_args(false, true)?;
1495 let ret_ty = self.parse_ret_ty(false)?;
1496 let decl = P(FnDecl {
1501 Ok(TyKind::BareFn(P(BareFnTy {
1509 /// Parses asyncness: `async` or nothing.
1510 fn parse_asyncness(&mut self) -> IsAsync {
1511 if self.eat_keyword(keywords::Async) {
1513 closure_id: ast::DUMMY_NODE_ID,
1514 return_impl_trait_id: ast::DUMMY_NODE_ID,
1515 arguments: Vec::new(),
1522 /// Parses unsafety: `unsafe` or nothing.
1523 fn parse_unsafety(&mut self) -> Unsafety {
1524 if self.eat_keyword(keywords::Unsafe) {
1531 /// Parses the items in a trait declaration.
1532 pub fn parse_trait_item(&mut self, at_end: &mut bool) -> PResult<'a, TraitItem> {
1533 maybe_whole!(self, NtTraitItem, |x| x);
1534 let attrs = self.parse_outer_attributes()?;
1535 let mut unclosed_delims = vec![];
1536 let (mut item, tokens) = self.collect_tokens(|this| {
1537 let item = this.parse_trait_item_(at_end, attrs);
1538 unclosed_delims.append(&mut this.unclosed_delims);
1541 self.unclosed_delims.append(&mut unclosed_delims);
1542 // See `parse_item` for why this clause is here.
1543 if !item.attrs.iter().any(|attr| attr.style == AttrStyle::Inner) {
1544 item.tokens = Some(tokens);
1549 fn parse_trait_item_(&mut self,
1551 mut attrs: Vec<Attribute>) -> PResult<'a, TraitItem> {
1554 let (name, node, generics) = if self.eat_keyword(keywords::Type) {
1555 self.parse_trait_item_assoc_ty()?
1556 } else if self.is_const_item() {
1557 self.expect_keyword(keywords::Const)?;
1558 let ident = self.parse_ident()?;
1559 self.expect(&token::Colon)?;
1560 let ty = self.parse_ty()?;
1561 let default = if self.eat(&token::Eq) {
1562 let expr = self.parse_expr()?;
1563 self.expect(&token::Semi)?;
1566 self.expect(&token::Semi)?;
1569 (ident, TraitItemKind::Const(ty, default), ast::Generics::default())
1570 } else if let Some(mac) = self.parse_assoc_macro_invoc("trait", None, &mut false)? {
1571 // trait item macro.
1572 (keywords::Invalid.ident(), ast::TraitItemKind::Macro(mac), ast::Generics::default())
1574 let (constness, unsafety, mut asyncness, abi) = self.parse_fn_front_matter()?;
1576 let ident = self.parse_ident()?;
1577 let mut generics = self.parse_generics()?;
1579 let d = self.parse_fn_decl_with_self(|p: &mut Parser<'a>| {
1580 // This is somewhat dubious; We don't want to allow
1581 // argument names to be left off if there is a
1584 // We don't allow argument names to be left off in edition 2018.
1585 p.parse_arg_general(p.span.rust_2018(), true, false)
1587 generics.where_clause = self.parse_where_clause()?;
1588 self.construct_async_arguments(&mut asyncness, &d);
1590 let sig = ast::MethodSig {
1600 let body = match self.token {
1604 debug!("parse_trait_methods(): parsing required method");
1607 token::OpenDelim(token::Brace) => {
1608 debug!("parse_trait_methods(): parsing provided method");
1610 let (inner_attrs, body) = self.parse_inner_attrs_and_block()?;
1611 attrs.extend(inner_attrs.iter().cloned());
1614 token::Interpolated(ref nt) => {
1616 token::NtBlock(..) => {
1618 let (inner_attrs, body) = self.parse_inner_attrs_and_block()?;
1619 attrs.extend(inner_attrs.iter().cloned());
1623 let token_str = self.this_token_descr();
1624 let mut err = self.fatal(&format!("expected `;` or `{{`, found {}",
1626 err.span_label(self.span, "expected `;` or `{`");
1632 let token_str = self.this_token_descr();
1633 let mut err = self.fatal(&format!("expected `;` or `{{`, found {}",
1635 err.span_label(self.span, "expected `;` or `{`");
1639 (ident, ast::TraitItemKind::Method(sig, body), generics)
1643 id: ast::DUMMY_NODE_ID,
1648 span: lo.to(self.prev_span),
1653 /// Parses an optional return type `[ -> TY ]` in a function declaration.
1654 fn parse_ret_ty(&mut self, allow_plus: bool) -> PResult<'a, FunctionRetTy> {
1655 if self.eat(&token::RArrow) {
1656 Ok(FunctionRetTy::Ty(self.parse_ty_common(allow_plus, true, false)?))
1658 Ok(FunctionRetTy::Default(self.span.shrink_to_lo()))
1663 pub fn parse_ty(&mut self) -> PResult<'a, P<Ty>> {
1664 self.parse_ty_common(true, true, false)
1667 /// Parses a type in restricted contexts where `+` is not permitted.
1669 /// Example 1: `&'a TYPE`
1670 /// `+` is prohibited to maintain operator priority (P(+) < P(&)).
1671 /// Example 2: `value1 as TYPE + value2`
1672 /// `+` is prohibited to avoid interactions with expression grammar.
1673 fn parse_ty_no_plus(&mut self) -> PResult<'a, P<Ty>> {
1674 self.parse_ty_common(false, true, false)
1677 fn parse_ty_common(&mut self, allow_plus: bool, allow_qpath_recovery: bool,
1678 allow_c_variadic: bool) -> PResult<'a, P<Ty>> {
1679 maybe_recover_from_interpolated_ty_qpath!(self, allow_qpath_recovery);
1680 maybe_whole!(self, NtTy, |x| x);
1683 let mut impl_dyn_multi = false;
1684 let node = if self.eat(&token::OpenDelim(token::Paren)) {
1685 // `(TYPE)` is a parenthesized type.
1686 // `(TYPE,)` is a tuple with a single field of type TYPE.
1687 let mut ts = vec![];
1688 let mut last_comma = false;
1689 while self.token != token::CloseDelim(token::Paren) {
1690 ts.push(self.parse_ty()?);
1691 if self.eat(&token::Comma) {
1698 let trailing_plus = self.prev_token_kind == PrevTokenKind::Plus;
1699 self.expect(&token::CloseDelim(token::Paren))?;
1701 if ts.len() == 1 && !last_comma {
1702 let ty = ts.into_iter().nth(0).unwrap().into_inner();
1703 let maybe_bounds = allow_plus && self.token.is_like_plus();
1705 // `(TY_BOUND_NOPAREN) + BOUND + ...`.
1706 TyKind::Path(None, ref path) if maybe_bounds => {
1707 self.parse_remaining_bounds(Vec::new(), path.clone(), lo, true)?
1709 TyKind::TraitObject(ref bounds, TraitObjectSyntax::None)
1710 if maybe_bounds && bounds.len() == 1 && !trailing_plus => {
1711 let path = match bounds[0] {
1712 GenericBound::Trait(ref pt, ..) => pt.trait_ref.path.clone(),
1713 GenericBound::Outlives(..) => self.bug("unexpected lifetime bound"),
1715 self.parse_remaining_bounds(Vec::new(), path, lo, true)?
1718 _ => TyKind::Paren(P(ty))
1723 } else if self.eat(&token::Not) {
1726 } else if self.eat(&token::BinOp(token::Star)) {
1728 TyKind::Ptr(self.parse_ptr()?)
1729 } else if self.eat(&token::OpenDelim(token::Bracket)) {
1731 let t = self.parse_ty()?;
1732 // Parse optional `; EXPR` in `[TYPE; EXPR]`
1733 let t = match self.maybe_parse_fixed_length_of_vec()? {
1734 None => TyKind::Slice(t),
1735 Some(length) => TyKind::Array(t, AnonConst {
1736 id: ast::DUMMY_NODE_ID,
1740 self.expect(&token::CloseDelim(token::Bracket))?;
1742 } else if self.check(&token::BinOp(token::And)) || self.check(&token::AndAnd) {
1745 self.parse_borrowed_pointee()?
1746 } else if self.eat_keyword_noexpect(keywords::Typeof) {
1748 // In order to not be ambiguous, the type must be surrounded by parens.
1749 self.expect(&token::OpenDelim(token::Paren))?;
1751 id: ast::DUMMY_NODE_ID,
1752 value: self.parse_expr()?,
1754 self.expect(&token::CloseDelim(token::Paren))?;
1756 } else if self.eat_keyword(keywords::Underscore) {
1757 // A type to be inferred `_`
1759 } else if self.token_is_bare_fn_keyword() {
1760 // Function pointer type
1761 self.parse_ty_bare_fn(Vec::new())?
1762 } else if self.check_keyword(keywords::For) {
1763 // Function pointer type or bound list (trait object type) starting with a poly-trait.
1764 // `for<'lt> [unsafe] [extern "ABI"] fn (&'lt S) -> T`
1765 // `for<'lt> Trait1<'lt> + Trait2 + 'a`
1767 let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
1768 if self.token_is_bare_fn_keyword() {
1769 self.parse_ty_bare_fn(lifetime_defs)?
1771 let path = self.parse_path(PathStyle::Type)?;
1772 let parse_plus = allow_plus && self.check_plus();
1773 self.parse_remaining_bounds(lifetime_defs, path, lo, parse_plus)?
1775 } else if self.eat_keyword(keywords::Impl) {
1776 // Always parse bounds greedily for better error recovery.
1777 let bounds = self.parse_generic_bounds(None)?;
1778 impl_dyn_multi = bounds.len() > 1 || self.prev_token_kind == PrevTokenKind::Plus;
1779 TyKind::ImplTrait(ast::DUMMY_NODE_ID, bounds)
1780 } else if self.check_keyword(keywords::Dyn) &&
1781 (self.span.rust_2018() ||
1782 self.look_ahead(1, |t| t.can_begin_bound() &&
1783 !can_continue_type_after_non_fn_ident(t))) {
1784 self.bump(); // `dyn`
1785 // Always parse bounds greedily for better error recovery.
1786 let bounds = self.parse_generic_bounds(None)?;
1787 impl_dyn_multi = bounds.len() > 1 || self.prev_token_kind == PrevTokenKind::Plus;
1788 TyKind::TraitObject(bounds, TraitObjectSyntax::Dyn)
1789 } else if self.check(&token::Question) ||
1790 self.check_lifetime() && self.look_ahead(1, |t| t.is_like_plus()) {
1791 // Bound list (trait object type)
1792 TyKind::TraitObject(self.parse_generic_bounds_common(allow_plus, None)?,
1793 TraitObjectSyntax::None)
1794 } else if self.eat_lt() {
1796 let (qself, path) = self.parse_qpath(PathStyle::Type)?;
1797 TyKind::Path(Some(qself), path)
1798 } else if self.token.is_path_start() {
1800 let path = self.parse_path(PathStyle::Type)?;
1801 if self.eat(&token::Not) {
1802 // Macro invocation in type position
1803 let (delim, tts) = self.expect_delimited_token_tree()?;
1804 let node = Mac_ { path, tts, delim };
1805 TyKind::Mac(respan(lo.to(self.prev_span), node))
1807 // Just a type path or bound list (trait object type) starting with a trait.
1809 // `Trait1 + Trait2 + 'a`
1810 if allow_plus && self.check_plus() {
1811 self.parse_remaining_bounds(Vec::new(), path, lo, true)?
1813 TyKind::Path(None, path)
1816 } else if self.check(&token::DotDotDot) {
1817 if allow_c_variadic {
1818 self.eat(&token::DotDotDot);
1821 return Err(self.fatal(
1822 "only foreign functions are allowed to be C-variadic"
1826 let msg = format!("expected type, found {}", self.this_token_descr());
1827 return Err(self.fatal(&msg));
1830 let span = lo.to(self.prev_span);
1831 let ty = P(Ty { node, span, id: ast::DUMMY_NODE_ID });
1833 // Try to recover from use of `+` with incorrect priority.
1834 self.maybe_report_ambiguous_plus(allow_plus, impl_dyn_multi, &ty);
1835 self.maybe_recover_from_bad_type_plus(allow_plus, &ty)?;
1836 self.maybe_recover_from_bad_qpath(ty, allow_qpath_recovery)
1839 fn parse_remaining_bounds(&mut self, generic_params: Vec<GenericParam>, path: ast::Path,
1840 lo: Span, parse_plus: bool) -> PResult<'a, TyKind> {
1841 let poly_trait_ref = PolyTraitRef::new(generic_params, path, lo.to(self.prev_span));
1842 let mut bounds = vec![GenericBound::Trait(poly_trait_ref, TraitBoundModifier::None)];
1844 self.eat_plus(); // `+`, or `+=` gets split and `+` is discarded
1845 bounds.append(&mut self.parse_generic_bounds(Some(self.prev_span))?);
1847 Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::None))
1850 fn parse_borrowed_pointee(&mut self) -> PResult<'a, TyKind> {
1851 let opt_lifetime = if self.check_lifetime() { Some(self.expect_lifetime()) } else { None };
1852 let mutbl = self.parse_mutability();
1853 let ty = self.parse_ty_no_plus()?;
1854 return Ok(TyKind::Rptr(opt_lifetime, MutTy { ty: ty, mutbl: mutbl }));
1857 fn parse_ptr(&mut self) -> PResult<'a, MutTy> {
1858 let mutbl = if self.eat_keyword(keywords::Mut) {
1860 } else if self.eat_keyword(keywords::Const) {
1861 Mutability::Immutable
1863 let span = self.prev_span;
1864 let msg = "expected mut or const in raw pointer type";
1865 self.struct_span_err(span, msg)
1866 .span_label(span, msg)
1867 .help("use `*mut T` or `*const T` as appropriate")
1869 Mutability::Immutable
1871 let t = self.parse_ty_no_plus()?;
1872 Ok(MutTy { ty: t, mutbl: mutbl })
1875 fn is_named_argument(&mut self) -> bool {
1876 let offset = match self.token {
1877 token::Interpolated(ref nt) => match **nt {
1878 token::NtPat(..) => return self.look_ahead(1, |t| t == &token::Colon),
1881 token::BinOp(token::And) | token::AndAnd => 1,
1882 _ if self.token.is_keyword(keywords::Mut) => 1,
1886 self.look_ahead(offset, |t| t.is_ident()) &&
1887 self.look_ahead(offset + 1, |t| t == &token::Colon)
1890 /// Skips unexpected attributes and doc comments in this position and emits an appropriate
1892 fn eat_incorrect_doc_comment(&mut self, applied_to: &str) {
1893 if let token::DocComment(_) = self.token {
1894 let mut err = self.diagnostic().struct_span_err(
1896 &format!("documentation comments cannot be applied to {}", applied_to),
1898 err.span_label(self.span, "doc comments are not allowed here");
1901 } else if self.token == token::Pound && self.look_ahead(1, |t| {
1902 *t == token::OpenDelim(token::Bracket)
1905 // Skip every token until next possible arg.
1906 while self.token != token::CloseDelim(token::Bracket) {
1909 let sp = lo.to(self.span);
1911 let mut err = self.diagnostic().struct_span_err(
1913 &format!("attributes cannot be applied to {}", applied_to),
1915 err.span_label(sp, "attributes are not allowed here");
1920 /// This version of parse arg doesn't necessarily require identifier names.
1921 fn parse_arg_general(&mut self, require_name: bool, is_trait_item: bool,
1922 allow_c_variadic: bool) -> PResult<'a, Arg> {
1923 maybe_whole!(self, NtArg, |x| x);
1925 if let Ok(Some(_)) = self.parse_self_arg() {
1926 let mut err = self.struct_span_err(self.prev_span,
1927 "unexpected `self` argument in function");
1928 err.span_label(self.prev_span,
1929 "`self` is only valid as the first argument of an associated function");
1933 let (pat, ty) = if require_name || self.is_named_argument() {
1934 debug!("parse_arg_general parse_pat (require_name:{})",
1936 self.eat_incorrect_doc_comment("method arguments");
1937 let pat = self.parse_pat(Some("argument name"))?;
1939 if let Err(mut err) = self.expect(&token::Colon) {
1940 // If we find a pattern followed by an identifier, it could be an (incorrect)
1941 // C-style parameter declaration.
1942 if self.check_ident() && self.look_ahead(1, |t| {
1943 *t == token::Comma || *t == token::CloseDelim(token::Paren)
1945 let ident = self.parse_ident().unwrap();
1946 let span = pat.span.with_hi(ident.span.hi());
1948 err.span_suggestion(
1950 "declare the type after the parameter binding",
1951 String::from("<identifier>: <type>"),
1952 Applicability::HasPlaceholders,
1954 } else if require_name && is_trait_item {
1955 if let PatKind::Ident(_, ident, _) = pat.node {
1956 err.span_suggestion(
1958 "explicitly ignore parameter",
1959 format!("_: {}", ident),
1960 Applicability::MachineApplicable,
1964 err.note("anonymous parameters are removed in the 2018 edition (see RFC 1685)");
1970 self.eat_incorrect_doc_comment("a method argument's type");
1971 (pat, self.parse_ty_common(true, true, allow_c_variadic)?)
1973 debug!("parse_arg_general ident_to_pat");
1974 let parser_snapshot_before_ty = self.clone();
1975 self.eat_incorrect_doc_comment("a method argument's type");
1976 let mut ty = self.parse_ty_common(true, true, allow_c_variadic);
1977 if ty.is_ok() && self.token != token::Comma &&
1978 self.token != token::CloseDelim(token::Paren) {
1979 // This wasn't actually a type, but a pattern looking like a type,
1980 // so we are going to rollback and re-parse for recovery.
1981 ty = self.unexpected();
1985 let ident = Ident::new(keywords::Invalid.name(), self.prev_span);
1987 id: ast::DUMMY_NODE_ID,
1988 node: PatKind::Ident(
1989 BindingMode::ByValue(Mutability::Immutable), ident, None),
1995 // If this is a C-variadic argument and we hit an error, return the
1997 if self.token == token::DotDotDot {
2000 // Recover from attempting to parse the argument as a type without pattern.
2002 mem::replace(self, parser_snapshot_before_ty);
2003 let pat = self.parse_pat(Some("argument name"))?;
2004 self.expect(&token::Colon)?;
2005 let ty = self.parse_ty()?;
2007 let mut err = self.diagnostic().struct_span_err_with_code(
2009 "patterns aren't allowed in methods without bodies",
2010 DiagnosticId::Error("E0642".into()),
2012 err.span_suggestion_short(
2014 "give this argument a name or use an underscore to ignore it",
2016 Applicability::MachineApplicable,
2020 // Pretend the pattern is `_`, to avoid duplicate errors from AST validation.
2022 node: PatKind::Wild,
2024 id: ast::DUMMY_NODE_ID
2031 Ok(Arg { ty, pat, id: ast::DUMMY_NODE_ID, source: ast::ArgSource::Normal })
2034 /// Parses a single function argument.
2035 crate fn parse_arg(&mut self) -> PResult<'a, Arg> {
2036 self.parse_arg_general(true, false, false)
2039 /// Parses an argument in a lambda header (e.g., `|arg, arg|`).
2040 fn parse_fn_block_arg(&mut self) -> PResult<'a, Arg> {
2041 let pat = self.parse_pat(Some("argument name"))?;
2042 let t = if self.eat(&token::Colon) {
2046 id: ast::DUMMY_NODE_ID,
2047 node: TyKind::Infer,
2048 span: self.prev_span,
2054 id: ast::DUMMY_NODE_ID,
2055 source: ast::ArgSource::Normal,
2059 fn maybe_parse_fixed_length_of_vec(&mut self) -> PResult<'a, Option<P<ast::Expr>>> {
2060 if self.eat(&token::Semi) {
2061 Ok(Some(self.parse_expr()?))
2067 /// Matches `token_lit = LIT_INTEGER | ...`.
2068 fn parse_lit_token(&mut self) -> PResult<'a, LitKind> {
2069 let out = match self.token {
2070 token::Interpolated(ref nt) => match **nt {
2071 token::NtExpr(ref v) | token::NtLiteral(ref v) => match v.node {
2072 ExprKind::Lit(ref lit) => { lit.node.clone() }
2073 _ => { return self.unexpected_last(&self.token); }
2075 _ => { return self.unexpected_last(&self.token); }
2077 token::Literal(lit, suf) => {
2078 let diag = Some((self.span, &self.sess.span_diagnostic));
2079 let (suffix_illegal, result) = parse::lit_token(lit, suf, diag);
2083 self.expect_no_suffix(sp, &format!("a {}", lit.literal_name()), suf)
2088 token::Dot if self.look_ahead(1, |t| match t {
2089 token::Literal(parse::token::Lit::Integer(_) , _) => true,
2091 }) => { // recover from `let x = .4;`
2094 if let token::Literal(
2095 parse::token::Lit::Integer(val),
2098 let suffix = suffix.and_then(|s| {
2102 } else if s == "f64" {
2109 let sp = lo.to(self.prev_span);
2110 let mut err = self.diagnostic()
2111 .struct_span_err(sp, "float literals must have an integer part");
2112 err.span_suggestion(
2114 "must have an integer part",
2115 format!("0.{}{}", val, suffix),
2116 Applicability::MachineApplicable,
2119 return Ok(match suffix {
2120 "f32" => ast::LitKind::Float(val, ast::FloatTy::F32),
2121 "f64" => ast::LitKind::Float(val, ast::FloatTy::F64),
2122 _ => ast::LitKind::FloatUnsuffixed(val),
2128 _ => { return self.unexpected_last(&self.token); }
2135 /// Matches `lit = true | false | token_lit`.
2136 crate fn parse_lit(&mut self) -> PResult<'a, Lit> {
2138 let lit = if self.eat_keyword(keywords::True) {
2140 } else if self.eat_keyword(keywords::False) {
2141 LitKind::Bool(false)
2143 let lit = self.parse_lit_token()?;
2146 Ok(source_map::Spanned { node: lit, span: lo.to(self.prev_span) })
2149 /// Matches `'-' lit | lit` (cf. `ast_validation::AstValidator::check_expr_within_pat`).
2150 crate fn parse_literal_maybe_minus(&mut self) -> PResult<'a, P<Expr>> {
2151 maybe_whole_expr!(self);
2153 let minus_lo = self.span;
2154 let minus_present = self.eat(&token::BinOp(token::Minus));
2156 let literal = self.parse_lit()?;
2157 let hi = self.prev_span;
2158 let expr = self.mk_expr(lo.to(hi), ExprKind::Lit(literal), ThinVec::new());
2161 let minus_hi = self.prev_span;
2162 let unary = self.mk_unary(UnOp::Neg, expr);
2163 Ok(self.mk_expr(minus_lo.to(minus_hi), unary, ThinVec::new()))
2169 fn parse_path_segment_ident(&mut self) -> PResult<'a, ast::Ident> {
2171 token::Ident(ident, _) if self.token.is_path_segment_keyword() => {
2172 let span = self.span;
2174 Ok(Ident::new(ident.name, span))
2176 _ => self.parse_ident(),
2180 fn parse_ident_or_underscore(&mut self) -> PResult<'a, ast::Ident> {
2182 token::Ident(ident, false) if ident.name == keywords::Underscore.name() => {
2183 let span = self.span;
2185 Ok(Ident::new(ident.name, span))
2187 _ => self.parse_ident(),
2191 /// Parses a qualified path.
2192 /// Assumes that the leading `<` has been parsed already.
2194 /// `qualified_path = <type [as trait_ref]>::path`
2199 /// `<T as U>::F::a<S>` (without disambiguator)
2200 /// `<T as U>::F::a::<S>` (with disambiguator)
2201 fn parse_qpath(&mut self, style: PathStyle) -> PResult<'a, (QSelf, ast::Path)> {
2202 let lo = self.prev_span;
2203 let ty = self.parse_ty()?;
2205 // `path` will contain the prefix of the path up to the `>`,
2206 // if any (e.g., `U` in the `<T as U>::*` examples
2207 // above). `path_span` has the span of that path, or an empty
2208 // span in the case of something like `<T>::Bar`.
2209 let (mut path, path_span);
2210 if self.eat_keyword(keywords::As) {
2211 let path_lo = self.span;
2212 path = self.parse_path(PathStyle::Type)?;
2213 path_span = path_lo.to(self.prev_span);
2215 path = ast::Path { segments: Vec::new(), span: syntax_pos::DUMMY_SP };
2216 path_span = self.span.to(self.span);
2219 // See doc comment for `unmatched_angle_bracket_count`.
2220 self.expect(&token::Gt)?;
2221 if self.unmatched_angle_bracket_count > 0 {
2222 self.unmatched_angle_bracket_count -= 1;
2223 debug!("parse_qpath: (decrement) count={:?}", self.unmatched_angle_bracket_count);
2226 self.expect(&token::ModSep)?;
2228 let qself = QSelf { ty, path_span, position: path.segments.len() };
2229 self.parse_path_segments(&mut path.segments, style)?;
2231 Ok((qself, ast::Path { segments: path.segments, span: lo.to(self.prev_span) }))
2234 /// Parses simple paths.
2236 /// `path = [::] segment+`
2237 /// `segment = ident | ident[::]<args> | ident[::](args) [-> type]`
2240 /// `a::b::C<D>` (without disambiguator)
2241 /// `a::b::C::<D>` (with disambiguator)
2242 /// `Fn(Args)` (without disambiguator)
2243 /// `Fn::(Args)` (with disambiguator)
2244 pub fn parse_path(&mut self, style: PathStyle) -> PResult<'a, ast::Path> {
2245 maybe_whole!(self, NtPath, |path| {
2246 if style == PathStyle::Mod &&
2247 path.segments.iter().any(|segment| segment.args.is_some()) {
2248 self.diagnostic().span_err(path.span, "unexpected generic arguments in path");
2253 let lo = self.meta_var_span.unwrap_or(self.span);
2254 let mut segments = Vec::new();
2255 let mod_sep_ctxt = self.span.ctxt();
2256 if self.eat(&token::ModSep) {
2257 segments.push(PathSegment::path_root(lo.shrink_to_lo().with_ctxt(mod_sep_ctxt)));
2259 self.parse_path_segments(&mut segments, style)?;
2261 Ok(ast::Path { segments, span: lo.to(self.prev_span) })
2264 /// Like `parse_path`, but also supports parsing `Word` meta items into paths for
2265 /// backwards-compatibility. This is used when parsing derive macro paths in `#[derive]`
2267 pub fn parse_path_allowing_meta(&mut self, style: PathStyle) -> PResult<'a, ast::Path> {
2268 let meta_ident = match self.token {
2269 token::Interpolated(ref nt) => match **nt {
2270 token::NtMeta(ref meta) => match meta.node {
2271 ast::MetaItemKind::Word => Some(meta.path.clone()),
2278 if let Some(path) = meta_ident {
2282 self.parse_path(style)
2285 crate fn parse_path_segments(&mut self,
2286 segments: &mut Vec<PathSegment>,
2288 -> PResult<'a, ()> {
2290 let segment = self.parse_path_segment(style)?;
2291 if style == PathStyle::Expr {
2292 // In order to check for trailing angle brackets, we must have finished
2293 // recursing (`parse_path_segment` can indirectly call this function),
2294 // that is, the next token must be the highlighted part of the below example:
2296 // `Foo::<Bar as Baz<T>>::Qux`
2299 // As opposed to the below highlight (if we had only finished the first
2302 // `Foo::<Bar as Baz<T>>::Qux`
2305 // `PathStyle::Expr` is only provided at the root invocation and never in
2306 // `parse_path_segment` to recurse and therefore can be checked to maintain
2308 self.check_trailing_angle_brackets(&segment, token::ModSep);
2310 segments.push(segment);
2312 if self.is_import_coupler() || !self.eat(&token::ModSep) {
2318 fn parse_path_segment(&mut self, style: PathStyle) -> PResult<'a, PathSegment> {
2319 let ident = self.parse_path_segment_ident()?;
2321 let is_args_start = |token: &token::Token| match *token {
2322 token::Lt | token::BinOp(token::Shl) | token::OpenDelim(token::Paren) => true,
2325 let check_args_start = |this: &mut Self| {
2326 this.expected_tokens.extend_from_slice(
2327 &[TokenType::Token(token::Lt), TokenType::Token(token::OpenDelim(token::Paren))]
2329 is_args_start(&this.token)
2332 Ok(if style == PathStyle::Type && check_args_start(self) ||
2333 style != PathStyle::Mod && self.check(&token::ModSep)
2334 && self.look_ahead(1, |t| is_args_start(t)) {
2335 // We use `style == PathStyle::Expr` to check if this is in a recursion or not. If
2336 // it isn't, then we reset the unmatched angle bracket count as we're about to start
2337 // parsing a new path.
2338 if style == PathStyle::Expr {
2339 self.unmatched_angle_bracket_count = 0;
2340 self.max_angle_bracket_count = 0;
2343 // Generic arguments are found - `<`, `(`, `::<` or `::(`.
2344 self.eat(&token::ModSep);
2346 let args = if self.eat_lt() {
2348 let (args, bindings) =
2349 self.parse_generic_args_with_leaning_angle_bracket_recovery(style, lo)?;
2351 let span = lo.to(self.prev_span);
2352 AngleBracketedArgs { args, bindings, span }.into()
2356 let (inputs, recovered) = self.parse_seq_to_before_tokens(
2357 &[&token::CloseDelim(token::Paren)],
2358 SeqSep::trailing_allowed(token::Comma),
2359 TokenExpectType::Expect,
2364 let span = lo.to(self.prev_span);
2365 let output = if self.eat(&token::RArrow) {
2366 Some(self.parse_ty_common(false, false, false)?)
2370 ParenthesizedArgs { inputs, output, span }.into()
2373 PathSegment { ident, args, id: ast::DUMMY_NODE_ID }
2375 // Generic arguments are not found.
2376 PathSegment::from_ident(ident)
2380 crate fn check_lifetime(&mut self) -> bool {
2381 self.expected_tokens.push(TokenType::Lifetime);
2382 self.token.is_lifetime()
2385 /// Parses a single lifetime `'a` or panics.
2386 crate fn expect_lifetime(&mut self) -> Lifetime {
2387 if let Some(ident) = self.token.lifetime() {
2388 let span = self.span;
2390 Lifetime { ident: Ident::new(ident.name, span), id: ast::DUMMY_NODE_ID }
2392 self.span_bug(self.span, "not a lifetime")
2396 fn eat_label(&mut self) -> Option<Label> {
2397 if let Some(ident) = self.token.lifetime() {
2398 let span = self.span;
2400 Some(Label { ident: Ident::new(ident.name, span) })
2406 /// Parses mutability (`mut` or nothing).
2407 fn parse_mutability(&mut self) -> Mutability {
2408 if self.eat_keyword(keywords::Mut) {
2411 Mutability::Immutable
2415 fn parse_field_name(&mut self) -> PResult<'a, Ident> {
2416 if let token::Literal(token::Integer(name), suffix) = self.token {
2417 self.expect_no_suffix(self.span, "a tuple index", suffix);
2419 Ok(Ident::new(name, self.prev_span))
2421 self.parse_ident_common(false)
2425 /// Parse ident (COLON expr)?
2426 fn parse_field(&mut self) -> PResult<'a, Field> {
2427 let attrs = self.parse_outer_attributes()?;
2430 // Check if a colon exists one ahead. This means we're parsing a fieldname.
2431 let (fieldname, expr, is_shorthand) = if self.look_ahead(1, |t| {
2432 t == &token::Colon || t == &token::Eq
2434 let fieldname = self.parse_field_name()?;
2436 // Check for an equals token. This means the source incorrectly attempts to
2437 // initialize a field with an eq rather than a colon.
2438 if self.token == token::Eq {
2440 .struct_span_err(self.span, "expected `:`, found `=`")
2442 fieldname.span.shrink_to_hi().to(self.span),
2443 "replace equals symbol with a colon",
2445 Applicability::MachineApplicable,
2450 (fieldname, self.parse_expr()?, false)
2452 let fieldname = self.parse_ident_common(false)?;
2454 // Mimic `x: x` for the `x` field shorthand.
2455 let path = ast::Path::from_ident(fieldname);
2456 let expr = self.mk_expr(fieldname.span, ExprKind::Path(None, path), ThinVec::new());
2457 (fieldname, expr, true)
2461 span: lo.to(expr.span),
2464 attrs: attrs.into(),
2468 fn mk_expr(&mut self, span: Span, node: ExprKind, attrs: ThinVec<Attribute>) -> P<Expr> {
2469 P(Expr { node, span, attrs, id: ast::DUMMY_NODE_ID })
2472 fn mk_unary(&mut self, unop: ast::UnOp, expr: P<Expr>) -> ast::ExprKind {
2473 ExprKind::Unary(unop, expr)
2476 fn mk_binary(&mut self, binop: ast::BinOp, lhs: P<Expr>, rhs: P<Expr>) -> ast::ExprKind {
2477 ExprKind::Binary(binop, lhs, rhs)
2480 fn mk_call(&mut self, f: P<Expr>, args: Vec<P<Expr>>) -> ast::ExprKind {
2481 ExprKind::Call(f, args)
2484 fn mk_index(&mut self, expr: P<Expr>, idx: P<Expr>) -> ast::ExprKind {
2485 ExprKind::Index(expr, idx)
2488 fn mk_range(&mut self,
2489 start: Option<P<Expr>>,
2490 end: Option<P<Expr>>,
2491 limits: RangeLimits)
2492 -> PResult<'a, ast::ExprKind> {
2493 if end.is_none() && limits == RangeLimits::Closed {
2494 Err(self.span_fatal_err(self.span, Error::InclusiveRangeWithNoEnd))
2496 Ok(ExprKind::Range(start, end, limits))
2500 fn mk_assign_op(&mut self, binop: ast::BinOp,
2501 lhs: P<Expr>, rhs: P<Expr>) -> ast::ExprKind {
2502 ExprKind::AssignOp(binop, lhs, rhs)
2505 fn expect_delimited_token_tree(&mut self) -> PResult<'a, (MacDelimiter, TokenStream)> {
2506 let delim = match self.token {
2507 token::OpenDelim(delim) => delim,
2509 let msg = "expected open delimiter";
2510 let mut err = self.fatal(msg);
2511 err.span_label(self.span, msg);
2515 let tts = match self.parse_token_tree() {
2516 TokenTree::Delimited(_, _, tts) => tts,
2517 _ => unreachable!(),
2519 let delim = match delim {
2520 token::Paren => MacDelimiter::Parenthesis,
2521 token::Bracket => MacDelimiter::Bracket,
2522 token::Brace => MacDelimiter::Brace,
2523 token::NoDelim => self.bug("unexpected no delimiter"),
2525 Ok((delim, tts.into()))
2528 /// At the bottom (top?) of the precedence hierarchy,
2529 /// Parses things like parenthesized exprs, macros, `return`, etc.
2531 /// N.B., this does not parse outer attributes, and is private because it only works
2532 /// correctly if called from `parse_dot_or_call_expr()`.
2533 fn parse_bottom_expr(&mut self) -> PResult<'a, P<Expr>> {
2534 maybe_recover_from_interpolated_ty_qpath!(self, true);
2535 maybe_whole_expr!(self);
2537 // Outer attributes are already parsed and will be
2538 // added to the return value after the fact.
2540 // Therefore, prevent sub-parser from parsing
2541 // attributes by giving them a empty "already parsed" list.
2542 let mut attrs = ThinVec::new();
2545 let mut hi = self.span;
2549 // Note: when adding new syntax here, don't forget to adjust Token::can_begin_expr().
2551 token::OpenDelim(token::Paren) => {
2554 attrs.extend(self.parse_inner_attributes()?);
2556 // (e) is parenthesized e
2557 // (e,) is a tuple with only one field, e
2558 let mut es = vec![];
2559 let mut trailing_comma = false;
2560 let mut recovered = false;
2561 while self.token != token::CloseDelim(token::Paren) {
2562 es.push(match self.parse_expr() {
2565 // recover from parse error in tuple list
2566 return Ok(self.recover_seq_parse_error(token::Paren, lo, Err(err)));
2569 recovered = self.expect_one_of(
2571 &[token::Comma, token::CloseDelim(token::Paren)],
2573 if self.eat(&token::Comma) {
2574 trailing_comma = true;
2576 trailing_comma = false;
2584 hi = self.prev_span;
2585 ex = if es.len() == 1 && !trailing_comma {
2586 ExprKind::Paren(es.into_iter().nth(0).unwrap())
2591 token::OpenDelim(token::Brace) => {
2592 return self.parse_block_expr(None, lo, BlockCheckMode::Default, attrs);
2594 token::BinOp(token::Or) | token::OrOr => {
2595 return self.parse_lambda_expr(attrs);
2597 token::OpenDelim(token::Bracket) => {
2600 attrs.extend(self.parse_inner_attributes()?);
2602 if self.eat(&token::CloseDelim(token::Bracket)) {
2604 ex = ExprKind::Array(Vec::new());
2607 let first_expr = self.parse_expr()?;
2608 if self.eat(&token::Semi) {
2609 // Repeating array syntax: [ 0; 512 ]
2610 let count = AnonConst {
2611 id: ast::DUMMY_NODE_ID,
2612 value: self.parse_expr()?,
2614 self.expect(&token::CloseDelim(token::Bracket))?;
2615 ex = ExprKind::Repeat(first_expr, count);
2616 } else if self.eat(&token::Comma) {
2617 // Vector with two or more elements.
2618 let remaining_exprs = self.parse_seq_to_end(
2619 &token::CloseDelim(token::Bracket),
2620 SeqSep::trailing_allowed(token::Comma),
2621 |p| Ok(p.parse_expr()?)
2623 let mut exprs = vec![first_expr];
2624 exprs.extend(remaining_exprs);
2625 ex = ExprKind::Array(exprs);
2627 // Vector with one element.
2628 self.expect(&token::CloseDelim(token::Bracket))?;
2629 ex = ExprKind::Array(vec![first_expr]);
2632 hi = self.prev_span;
2636 let (qself, path) = self.parse_qpath(PathStyle::Expr)?;
2638 return Ok(self.mk_expr(lo.to(hi), ExprKind::Path(Some(qself), path), attrs));
2640 if self.span.rust_2018() && self.check_keyword(keywords::Async)
2642 if self.is_async_block() { // check for `async {` and `async move {`
2643 return self.parse_async_block(attrs);
2645 return self.parse_lambda_expr(attrs);
2648 if self.check_keyword(keywords::Move) || self.check_keyword(keywords::Static) {
2649 return self.parse_lambda_expr(attrs);
2651 if self.eat_keyword(keywords::If) {
2652 return self.parse_if_expr(attrs);
2654 if self.eat_keyword(keywords::For) {
2655 let lo = self.prev_span;
2656 return self.parse_for_expr(None, lo, attrs);
2658 if self.eat_keyword(keywords::While) {
2659 let lo = self.prev_span;
2660 return self.parse_while_expr(None, lo, attrs);
2662 if let Some(label) = self.eat_label() {
2663 let lo = label.ident.span;
2664 self.expect(&token::Colon)?;
2665 if self.eat_keyword(keywords::While) {
2666 return self.parse_while_expr(Some(label), lo, attrs)
2668 if self.eat_keyword(keywords::For) {
2669 return self.parse_for_expr(Some(label), lo, attrs)
2671 if self.eat_keyword(keywords::Loop) {
2672 return self.parse_loop_expr(Some(label), lo, attrs)
2674 if self.token == token::OpenDelim(token::Brace) {
2675 return self.parse_block_expr(Some(label),
2677 BlockCheckMode::Default,
2680 let msg = "expected `while`, `for`, `loop` or `{` after a label";
2681 let mut err = self.fatal(msg);
2682 err.span_label(self.span, msg);
2685 if self.eat_keyword(keywords::Loop) {
2686 let lo = self.prev_span;
2687 return self.parse_loop_expr(None, lo, attrs);
2689 if self.eat_keyword(keywords::Continue) {
2690 let label = self.eat_label();
2691 let ex = ExprKind::Continue(label);
2692 let hi = self.prev_span;
2693 return Ok(self.mk_expr(lo.to(hi), ex, attrs));
2695 if self.eat_keyword(keywords::Match) {
2696 let match_sp = self.prev_span;
2697 return self.parse_match_expr(attrs).map_err(|mut err| {
2698 err.span_label(match_sp, "while parsing this match expression");
2702 if self.eat_keyword(keywords::Unsafe) {
2703 return self.parse_block_expr(
2706 BlockCheckMode::Unsafe(ast::UserProvided),
2709 if self.is_do_catch_block() {
2710 let mut db = self.fatal("found removed `do catch` syntax");
2711 db.help("Following RFC #2388, the new non-placeholder syntax is `try`");
2714 if self.is_try_block() {
2716 assert!(self.eat_keyword(keywords::Try));
2717 return self.parse_try_block(lo, attrs);
2719 if self.eat_keyword(keywords::Return) {
2720 if self.token.can_begin_expr() {
2721 let e = self.parse_expr()?;
2723 ex = ExprKind::Ret(Some(e));
2725 ex = ExprKind::Ret(None);
2727 } else if self.eat_keyword(keywords::Break) {
2728 let label = self.eat_label();
2729 let e = if self.token.can_begin_expr()
2730 && !(self.token == token::OpenDelim(token::Brace)
2731 && self.restrictions.contains(
2732 Restrictions::NO_STRUCT_LITERAL)) {
2733 Some(self.parse_expr()?)
2737 ex = ExprKind::Break(label, e);
2738 hi = self.prev_span;
2739 } else if self.eat_keyword(keywords::Yield) {
2740 if self.token.can_begin_expr() {
2741 let e = self.parse_expr()?;
2743 ex = ExprKind::Yield(Some(e));
2745 ex = ExprKind::Yield(None);
2747 } else if self.token.is_keyword(keywords::Let) {
2748 // Catch this syntax error here, instead of in `parse_ident`, so
2749 // that we can explicitly mention that let is not to be used as an expression
2750 let mut db = self.fatal("expected expression, found statement (`let`)");
2751 db.span_label(self.span, "expected expression");
2752 db.note("variable declaration using `let` is a statement");
2754 } else if self.token.is_path_start() {
2755 let path = self.parse_path(PathStyle::Expr)?;
2757 // `!`, as an operator, is prefix, so we know this isn't that
2758 if self.eat(&token::Not) {
2759 // MACRO INVOCATION expression
2760 let (delim, tts) = self.expect_delimited_token_tree()?;
2761 hi = self.prev_span;
2762 ex = ExprKind::Mac(respan(lo.to(hi), Mac_ { path, tts, delim }));
2763 } else if self.check(&token::OpenDelim(token::Brace)) {
2764 if let Some(expr) = self.maybe_parse_struct_expr(lo, &path, &attrs) {
2768 ex = ExprKind::Path(None, path);
2772 ex = ExprKind::Path(None, path);
2775 if !self.unclosed_delims.is_empty() && self.check(&token::Semi) {
2776 // Don't complain about bare semicolons after unclosed braces
2777 // recovery in order to keep the error count down. Fixing the
2778 // delimiters will possibly also fix the bare semicolon found in
2779 // expression context. For example, silence the following error:
2781 // error: expected expression, found `;`
2785 // | ^ expected expression
2788 return Ok(self.mk_expr(self.span, ExprKind::Err, ThinVec::new()));
2790 match self.parse_literal_maybe_minus() {
2793 ex = expr.node.clone();
2796 self.cancel(&mut err);
2797 let msg = format!("expected expression, found {}",
2798 self.this_token_descr());
2799 let mut err = self.fatal(&msg);
2800 err.span_label(self.span, "expected expression");
2808 let expr = self.mk_expr(lo.to(hi), ex, attrs);
2809 self.maybe_recover_from_bad_qpath(expr, true)
2812 fn maybe_parse_struct_expr(
2816 attrs: &ThinVec<Attribute>,
2817 ) -> Option<PResult<'a, P<Expr>>> {
2818 let struct_allowed = !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL);
2819 let certainly_not_a_block = || self.look_ahead(1, |t| t.is_ident()) && (
2820 // `{ ident, ` cannot start a block
2821 self.look_ahead(2, |t| t == &token::Comma) ||
2822 self.look_ahead(2, |t| t == &token::Colon) && (
2823 // `{ ident: token, ` cannot start a block
2824 self.look_ahead(4, |t| t == &token::Comma) ||
2825 // `{ ident: ` cannot start a block unless it's a type ascription `ident: Type`
2826 self.look_ahead(3, |t| !t.can_begin_type())
2830 if struct_allowed || certainly_not_a_block() {
2831 // This is a struct literal, but we don't can't accept them here
2832 let expr = self.parse_struct_expr(lo, path.clone(), attrs.clone());
2833 if let (Ok(expr), false) = (&expr, struct_allowed) {
2834 let mut err = self.diagnostic().struct_span_err(
2836 "struct literals are not allowed here",
2838 err.multipart_suggestion(
2839 "surround the struct literal with parenthesis",
2841 (lo.shrink_to_lo(), "(".to_string()),
2842 (expr.span.shrink_to_hi(), ")".to_string()),
2844 Applicability::MachineApplicable,
2853 fn parse_struct_expr(&mut self, lo: Span, pth: ast::Path, mut attrs: ThinVec<Attribute>)
2854 -> PResult<'a, P<Expr>> {
2855 let struct_sp = lo.to(self.prev_span);
2857 let mut fields = Vec::new();
2858 let mut base = None;
2860 attrs.extend(self.parse_inner_attributes()?);
2862 while self.token != token::CloseDelim(token::Brace) {
2863 if self.eat(&token::DotDot) {
2864 let exp_span = self.prev_span;
2865 match self.parse_expr() {
2871 self.recover_stmt();
2874 if self.token == token::Comma {
2875 let mut err = self.sess.span_diagnostic.mut_span_err(
2876 exp_span.to(self.prev_span),
2877 "cannot use a comma after the base struct",
2879 err.span_suggestion_short(
2881 "remove this comma",
2883 Applicability::MachineApplicable
2885 err.note("the base struct must always be the last field");
2887 self.recover_stmt();
2892 let mut recovery_field = None;
2893 if let token::Ident(ident, _) = self.token {
2894 if !self.token.is_reserved_ident() && self.look_ahead(1, |t| *t == token::Colon) {
2895 // Use in case of error after field-looking code: `S { foo: () with a }`
2896 let mut ident = ident.clone();
2897 ident.span = self.span;
2898 recovery_field = Some(ast::Field {
2901 expr: self.mk_expr(self.span, ExprKind::Err, ThinVec::new()),
2902 is_shorthand: false,
2903 attrs: ThinVec::new(),
2907 let mut parsed_field = None;
2908 match self.parse_field() {
2909 Ok(f) => parsed_field = Some(f),
2911 e.span_label(struct_sp, "while parsing this struct");
2914 // If the next token is a comma, then try to parse
2915 // what comes next as additional fields, rather than
2916 // bailing out until next `}`.
2917 if self.token != token::Comma {
2918 self.recover_stmt_(SemiColonMode::Comma, BlockMode::Ignore);
2919 if self.token != token::Comma {
2926 match self.expect_one_of(&[token::Comma],
2927 &[token::CloseDelim(token::Brace)]) {
2928 Ok(_) => if let Some(f) = parsed_field.or(recovery_field) {
2929 // only include the field if there's no parse error for the field name
2933 if let Some(f) = recovery_field {
2936 e.span_label(struct_sp, "while parsing this struct");
2938 self.recover_stmt_(SemiColonMode::Comma, BlockMode::Ignore);
2939 self.eat(&token::Comma);
2944 let span = lo.to(self.span);
2945 self.expect(&token::CloseDelim(token::Brace))?;
2946 return Ok(self.mk_expr(span, ExprKind::Struct(pth, fields, base), attrs));
2949 fn parse_or_use_outer_attributes(&mut self,
2950 already_parsed_attrs: Option<ThinVec<Attribute>>)
2951 -> PResult<'a, ThinVec<Attribute>> {
2952 if let Some(attrs) = already_parsed_attrs {
2955 self.parse_outer_attributes().map(|a| a.into())
2959 /// Parses a block or unsafe block.
2960 fn parse_block_expr(&mut self, opt_label: Option<Label>,
2961 lo: Span, blk_mode: BlockCheckMode,
2962 outer_attrs: ThinVec<Attribute>)
2963 -> PResult<'a, P<Expr>> {
2964 self.expect(&token::OpenDelim(token::Brace))?;
2966 let mut attrs = outer_attrs;
2967 attrs.extend(self.parse_inner_attributes()?);
2969 let blk = self.parse_block_tail(lo, blk_mode)?;
2970 return Ok(self.mk_expr(blk.span, ExprKind::Block(blk, opt_label), attrs));
2973 /// Parses `a.b` or `a(13)` or `a[4]` or just `a`.
2974 fn parse_dot_or_call_expr(&mut self,
2975 already_parsed_attrs: Option<ThinVec<Attribute>>)
2976 -> PResult<'a, P<Expr>> {
2977 let attrs = self.parse_or_use_outer_attributes(already_parsed_attrs)?;
2979 let b = self.parse_bottom_expr();
2980 let (span, b) = self.interpolated_or_expr_span(b)?;
2981 self.parse_dot_or_call_expr_with(b, span, attrs)
2984 fn parse_dot_or_call_expr_with(&mut self,
2987 mut attrs: ThinVec<Attribute>)
2988 -> PResult<'a, P<Expr>> {
2989 // Stitch the list of outer attributes onto the return value.
2990 // A little bit ugly, but the best way given the current code
2992 self.parse_dot_or_call_expr_with_(e0, lo)
2994 expr.map(|mut expr| {
2995 attrs.extend::<Vec<_>>(expr.attrs.into());
2998 ExprKind::If(..) | ExprKind::IfLet(..) => {
2999 if !expr.attrs.is_empty() {
3000 // Just point to the first attribute in there...
3001 let span = expr.attrs[0].span;
3004 "attributes are not yet allowed on `if` \
3015 // Assuming we have just parsed `.`, continue parsing into an expression.
3016 fn parse_dot_suffix(&mut self, self_arg: P<Expr>, lo: Span) -> PResult<'a, P<Expr>> {
3017 let segment = self.parse_path_segment(PathStyle::Expr)?;
3018 self.check_trailing_angle_brackets(&segment, token::OpenDelim(token::Paren));
3020 Ok(match self.token {
3021 token::OpenDelim(token::Paren) => {
3022 // Method call `expr.f()`
3023 let mut args = self.parse_unspanned_seq(
3024 &token::OpenDelim(token::Paren),
3025 &token::CloseDelim(token::Paren),
3026 SeqSep::trailing_allowed(token::Comma),
3027 |p| Ok(p.parse_expr()?)
3029 args.insert(0, self_arg);
3031 let span = lo.to(self.prev_span);
3032 self.mk_expr(span, ExprKind::MethodCall(segment, args), ThinVec::new())
3035 // Field access `expr.f`
3036 if let Some(args) = segment.args {
3037 self.span_err(args.span(),
3038 "field expressions may not have generic arguments");
3041 let span = lo.to(self.prev_span);
3042 self.mk_expr(span, ExprKind::Field(self_arg, segment.ident), ThinVec::new())
3047 /// This function checks if there are trailing angle brackets and produces
3048 /// a diagnostic to suggest removing them.
3050 /// ```ignore (diagnostic)
3051 /// let _ = vec![1, 2, 3].into_iter().collect::<Vec<usize>>>>();
3052 /// ^^ help: remove extra angle brackets
3054 fn check_trailing_angle_brackets(&mut self, segment: &PathSegment, end: token::Token) {
3055 // This function is intended to be invoked after parsing a path segment where there are two
3058 // 1. A specific token is expected after the path segment.
3059 // eg. `x.foo(`, `x.foo::<u32>(` (parenthesis - method call),
3060 // `Foo::`, or `Foo::<Bar>::` (mod sep - continued path).
3061 // 2. No specific token is expected after the path segment.
3062 // eg. `x.foo` (field access)
3064 // This function is called after parsing `.foo` and before parsing the token `end` (if
3065 // present). This includes any angle bracket arguments, such as `.foo::<u32>` or
3068 // We only care about trailing angle brackets if we previously parsed angle bracket
3069 // arguments. This helps stop us incorrectly suggesting that extra angle brackets be
3070 // removed in this case:
3072 // `x.foo >> (3)` (where `x.foo` is a `u32` for example)
3074 // This case is particularly tricky as we won't notice it just looking at the tokens -
3075 // it will appear the same (in terms of upcoming tokens) as below (since the `::<u32>` will
3076 // have already been parsed):
3078 // `x.foo::<u32>>>(3)`
3079 let parsed_angle_bracket_args = segment.args
3081 .map(|args| args.is_angle_bracketed())
3085 "check_trailing_angle_brackets: parsed_angle_bracket_args={:?}",
3086 parsed_angle_bracket_args,
3088 if !parsed_angle_bracket_args {
3092 // Keep the span at the start so we can highlight the sequence of `>` characters to be
3096 // We need to look-ahead to see if we have `>` characters without moving the cursor forward
3097 // (since we might have the field access case and the characters we're eating are
3098 // actual operators and not trailing characters - ie `x.foo >> 3`).
3099 let mut position = 0;
3101 // We can encounter `>` or `>>` tokens in any order, so we need to keep track of how
3102 // many of each (so we can correctly pluralize our error messages) and continue to
3104 let mut number_of_shr = 0;
3105 let mut number_of_gt = 0;
3106 while self.look_ahead(position, |t| {
3107 trace!("check_trailing_angle_brackets: t={:?}", t);
3108 if *t == token::BinOp(token::BinOpToken::Shr) {
3111 } else if *t == token::Gt {
3121 // If we didn't find any trailing `>` characters, then we have nothing to error about.
3123 "check_trailing_angle_brackets: number_of_gt={:?} number_of_shr={:?}",
3124 number_of_gt, number_of_shr,
3126 if number_of_gt < 1 && number_of_shr < 1 {
3130 // Finally, double check that we have our end token as otherwise this is the
3132 if self.look_ahead(position, |t| {
3133 trace!("check_trailing_angle_brackets: t={:?}", t);
3136 // Eat from where we started until the end token so that parsing can continue
3137 // as if we didn't have those extra angle brackets.
3138 self.eat_to_tokens(&[&end]);
3139 let span = lo.until(self.span);
3141 let plural = number_of_gt > 1 || number_of_shr >= 1;
3145 &format!("unmatched angle bracket{}", if plural { "s" } else { "" }),
3149 &format!("remove extra angle bracket{}", if plural { "s" } else { "" }),
3151 Applicability::MachineApplicable,
3157 fn parse_dot_or_call_expr_with_(&mut self, e0: P<Expr>, lo: Span) -> PResult<'a, P<Expr>> {
3162 while self.eat(&token::Question) {
3163 let hi = self.prev_span;
3164 e = self.mk_expr(lo.to(hi), ExprKind::Try(e), ThinVec::new());
3168 if self.eat(&token::Dot) {
3170 token::Ident(..) => {
3171 e = self.parse_dot_suffix(e, lo)?;
3173 token::Literal(token::Integer(name), suffix) => {
3174 let span = self.span;
3176 let field = ExprKind::Field(e, Ident::new(name, span));
3177 e = self.mk_expr(lo.to(span), field, ThinVec::new());
3179 self.expect_no_suffix(span, "a tuple index", suffix);
3181 token::Literal(token::Float(n), _suf) => {
3183 let fstr = n.as_str();
3184 let mut err = self.diagnostic()
3185 .struct_span_err(self.prev_span, &format!("unexpected token: `{}`", n));
3186 err.span_label(self.prev_span, "unexpected token");
3187 if fstr.chars().all(|x| "0123456789.".contains(x)) {
3188 let float = match fstr.parse::<f64>().ok() {
3192 let sugg = pprust::to_string(|s| {
3193 use crate::print::pprust::PrintState;
3197 s.print_usize(float.trunc() as usize)?;
3200 s.s.word(fstr.splitn(2, ".").last().unwrap().to_string())
3202 err.span_suggestion(
3203 lo.to(self.prev_span),
3204 "try parenthesizing the first index",
3206 Applicability::MachineApplicable
3213 // FIXME Could factor this out into non_fatal_unexpected or something.
3214 let actual = self.this_token_to_string();
3215 self.span_err(self.span, &format!("unexpected token: `{}`", actual));
3220 if self.expr_is_complete(&e) { break; }
3223 token::OpenDelim(token::Paren) => {
3224 let seq = self.parse_unspanned_seq(
3225 &token::OpenDelim(token::Paren),
3226 &token::CloseDelim(token::Paren),
3227 SeqSep::trailing_allowed(token::Comma),
3228 |p| Ok(p.parse_expr()?)
3230 let nd = self.mk_call(e, es);
3231 let hi = self.prev_span;
3232 self.mk_expr(lo.to(hi), nd, ThinVec::new())
3234 e = self.recover_seq_parse_error(token::Paren, lo, seq);
3238 // Could be either an index expression or a slicing expression.
3239 token::OpenDelim(token::Bracket) => {
3241 let ix = self.parse_expr()?;
3243 self.expect(&token::CloseDelim(token::Bracket))?;
3244 let index = self.mk_index(e, ix);
3245 e = self.mk_expr(lo.to(hi), index, ThinVec::new())
3253 fn recover_seq_parse_error(
3255 delim: token::DelimToken,
3257 result: PResult<'a, P<Expr>>,
3263 // recover from parse error
3264 self.consume_block(delim);
3265 self.mk_expr(lo.to(self.prev_span), ExprKind::Err, ThinVec::new())
3270 crate fn process_potential_macro_variable(&mut self) {
3271 let (token, span) = match self.token {
3272 token::Dollar if self.span.ctxt() != syntax_pos::hygiene::SyntaxContext::empty() &&
3273 self.look_ahead(1, |t| t.is_ident()) => {
3275 let name = match self.token {
3276 token::Ident(ident, _) => ident,
3279 let mut err = self.fatal(&format!("unknown macro variable `{}`", name));
3280 err.span_label(self.span, "unknown macro variable");
3285 token::Interpolated(ref nt) => {
3286 self.meta_var_span = Some(self.span);
3287 // Interpolated identifier and lifetime tokens are replaced with usual identifier
3288 // and lifetime tokens, so the former are never encountered during normal parsing.
3290 token::NtIdent(ident, is_raw) => (token::Ident(ident, is_raw), ident.span),
3291 token::NtLifetime(ident) => (token::Lifetime(ident), ident.span),
3301 /// Parses a single token tree from the input.
3302 crate fn parse_token_tree(&mut self) -> TokenTree {
3304 token::OpenDelim(..) => {
3305 let frame = mem::replace(&mut self.token_cursor.frame,
3306 self.token_cursor.stack.pop().unwrap());
3307 self.span = frame.span.entire();
3309 TokenTree::Delimited(
3312 frame.tree_cursor.stream.into(),
3315 token::CloseDelim(_) | token::Eof => unreachable!(),
3317 let (token, span) = (mem::replace(&mut self.token, token::Whitespace), self.span);
3319 TokenTree::Token(span, token)
3324 // parse a stream of tokens into a list of TokenTree's,
3326 pub fn parse_all_token_trees(&mut self) -> PResult<'a, Vec<TokenTree>> {
3327 let mut tts = Vec::new();
3328 while self.token != token::Eof {
3329 tts.push(self.parse_token_tree());
3334 pub fn parse_tokens(&mut self) -> TokenStream {
3335 let mut result = Vec::new();
3338 token::Eof | token::CloseDelim(..) => break,
3339 _ => result.push(self.parse_token_tree().into()),
3342 TokenStream::new(result)
3345 /// Parse a prefix-unary-operator expr
3346 fn parse_prefix_expr(&mut self,
3347 already_parsed_attrs: Option<ThinVec<Attribute>>)
3348 -> PResult<'a, P<Expr>> {
3349 let attrs = self.parse_or_use_outer_attributes(already_parsed_attrs)?;
3351 // Note: when adding new unary operators, don't forget to adjust Token::can_begin_expr()
3352 let (hi, ex) = match self.token {
3355 let e = self.parse_prefix_expr(None);
3356 let (span, e) = self.interpolated_or_expr_span(e)?;
3357 (lo.to(span), self.mk_unary(UnOp::Not, e))
3359 // Suggest `!` for bitwise negation when encountering a `~`
3362 let e = self.parse_prefix_expr(None);
3363 let (span, e) = self.interpolated_or_expr_span(e)?;
3364 let span_of_tilde = lo;
3365 let mut err = self.diagnostic()
3366 .struct_span_err(span_of_tilde, "`~` cannot be used as a unary operator");
3367 err.span_suggestion_short(
3369 "use `!` to perform bitwise negation",
3371 Applicability::MachineApplicable
3374 (lo.to(span), self.mk_unary(UnOp::Not, e))
3376 token::BinOp(token::Minus) => {
3378 let e = self.parse_prefix_expr(None);
3379 let (span, e) = self.interpolated_or_expr_span(e)?;
3380 (lo.to(span), self.mk_unary(UnOp::Neg, e))
3382 token::BinOp(token::Star) => {
3384 let e = self.parse_prefix_expr(None);
3385 let (span, e) = self.interpolated_or_expr_span(e)?;
3386 (lo.to(span), self.mk_unary(UnOp::Deref, e))
3388 token::BinOp(token::And) | token::AndAnd => {
3390 let m = self.parse_mutability();
3391 let e = self.parse_prefix_expr(None);
3392 let (span, e) = self.interpolated_or_expr_span(e)?;
3393 (lo.to(span), ExprKind::AddrOf(m, e))
3395 token::Ident(..) if self.token.is_keyword(keywords::In) => {
3397 let place = self.parse_expr_res(
3398 Restrictions::NO_STRUCT_LITERAL,
3401 let blk = self.parse_block()?;
3402 let span = blk.span;
3403 let blk_expr = self.mk_expr(span, ExprKind::Block(blk, None), ThinVec::new());
3404 (lo.to(span), ExprKind::ObsoleteInPlace(place, blk_expr))
3406 token::Ident(..) if self.token.is_keyword(keywords::Box) => {
3408 let e = self.parse_prefix_expr(None);
3409 let (span, e) = self.interpolated_or_expr_span(e)?;
3410 (lo.to(span), ExprKind::Box(e))
3412 token::Ident(..) if self.token.is_ident_named("not") => {
3413 // `not` is just an ordinary identifier in Rust-the-language,
3414 // but as `rustc`-the-compiler, we can issue clever diagnostics
3415 // for confused users who really want to say `!`
3416 let token_cannot_continue_expr = |t: &token::Token| match *t {
3417 // These tokens can start an expression after `!`, but
3418 // can't continue an expression after an ident
3419 token::Ident(ident, is_raw) => token::ident_can_begin_expr(ident, is_raw),
3420 token::Literal(..) | token::Pound => true,
3421 token::Interpolated(ref nt) => match **nt {
3422 token::NtIdent(..) | token::NtExpr(..) |
3423 token::NtBlock(..) | token::NtPath(..) => true,
3428 let cannot_continue_expr = self.look_ahead(1, token_cannot_continue_expr);
3429 if cannot_continue_expr {
3431 // Emit the error ...
3432 let mut err = self.diagnostic()
3433 .struct_span_err(self.span,
3434 &format!("unexpected {} after identifier",
3435 self.this_token_descr()));
3436 // span the `not` plus trailing whitespace to avoid
3437 // trailing whitespace after the `!` in our suggestion
3438 let to_replace = self.sess.source_map()
3439 .span_until_non_whitespace(lo.to(self.span));
3440 err.span_suggestion_short(
3442 "use `!` to perform logical negation",
3444 Applicability::MachineApplicable
3447 // —and recover! (just as if we were in the block
3448 // for the `token::Not` arm)
3449 let e = self.parse_prefix_expr(None);
3450 let (span, e) = self.interpolated_or_expr_span(e)?;
3451 (lo.to(span), self.mk_unary(UnOp::Not, e))
3453 return self.parse_dot_or_call_expr(Some(attrs));
3456 _ => { return self.parse_dot_or_call_expr(Some(attrs)); }
3458 return Ok(self.mk_expr(lo.to(hi), ex, attrs));
3461 /// Parses an associative expression.
3463 /// This parses an expression accounting for associativity and precedence of the operators in
3466 fn parse_assoc_expr(&mut self,
3467 already_parsed_attrs: Option<ThinVec<Attribute>>)
3468 -> PResult<'a, P<Expr>> {
3469 self.parse_assoc_expr_with(0, already_parsed_attrs.into())
3472 /// Parses an associative expression with operators of at least `min_prec` precedence.
3473 fn parse_assoc_expr_with(&mut self,
3476 -> PResult<'a, P<Expr>> {
3477 let mut lhs = if let LhsExpr::AlreadyParsed(expr) = lhs {
3480 let attrs = match lhs {
3481 LhsExpr::AttributesParsed(attrs) => Some(attrs),
3484 if [token::DotDot, token::DotDotDot, token::DotDotEq].contains(&self.token) {
3485 return self.parse_prefix_range_expr(attrs);
3487 self.parse_prefix_expr(attrs)?
3491 if self.expr_is_complete(&lhs) {
3492 // Semi-statement forms are odd. See https://github.com/rust-lang/rust/issues/29071
3495 self.expected_tokens.push(TokenType::Operator);
3496 while let Some(op) = AssocOp::from_token(&self.token) {
3498 // Adjust the span for interpolated LHS to point to the `$lhs` token and not to what
3499 // it refers to. Interpolated identifiers are unwrapped early and never show up here
3500 // as `PrevTokenKind::Interpolated` so if LHS is a single identifier we always process
3501 // it as "interpolated", it doesn't change the answer for non-interpolated idents.
3502 let lhs_span = match (self.prev_token_kind, &lhs.node) {
3503 (PrevTokenKind::Interpolated, _) => self.prev_span,
3504 (PrevTokenKind::Ident, &ExprKind::Path(None, ref path))
3505 if path.segments.len() == 1 => self.prev_span,
3509 let cur_op_span = self.span;
3510 let restrictions = if op.is_assign_like() {
3511 self.restrictions & Restrictions::NO_STRUCT_LITERAL
3515 if op.precedence() < min_prec {
3518 // Check for deprecated `...` syntax
3519 if self.token == token::DotDotDot && op == AssocOp::DotDotEq {
3520 self.err_dotdotdot_syntax(self.span);
3524 if op.is_comparison() {
3525 self.check_no_chained_comparison(&lhs, &op);
3528 if op == AssocOp::As {
3529 lhs = self.parse_assoc_op_cast(lhs, lhs_span, ExprKind::Cast)?;
3531 } else if op == AssocOp::Colon {
3532 let maybe_path = self.could_ascription_be_path(&lhs.node);
3533 let next_sp = self.span;
3535 lhs = match self.parse_assoc_op_cast(lhs, lhs_span, ExprKind::Type) {
3538 self.bad_type_ascription(
3549 } else if op == AssocOp::DotDot || op == AssocOp::DotDotEq {
3550 // If we didn’t have to handle `x..`/`x..=`, it would be pretty easy to
3551 // generalise it to the Fixity::None code.
3553 // We have 2 alternatives here: `x..y`/`x..=y` and `x..`/`x..=` The other
3554 // two variants are handled with `parse_prefix_range_expr` call above.
3555 let rhs = if self.is_at_start_of_range_notation_rhs() {
3556 Some(self.parse_assoc_expr_with(op.precedence() + 1,
3557 LhsExpr::NotYetParsed)?)
3561 let (lhs_span, rhs_span) = (lhs.span, if let Some(ref x) = rhs {
3566 let limits = if op == AssocOp::DotDot {
3567 RangeLimits::HalfOpen
3572 let r = self.mk_range(Some(lhs), rhs, limits)?;
3573 lhs = self.mk_expr(lhs_span.to(rhs_span), r, ThinVec::new());
3577 let rhs = match op.fixity() {
3578 Fixity::Right => self.with_res(
3579 restrictions - Restrictions::STMT_EXPR,
3581 this.parse_assoc_expr_with(op.precedence(),
3582 LhsExpr::NotYetParsed)
3584 Fixity::Left => self.with_res(
3585 restrictions - Restrictions::STMT_EXPR,
3587 this.parse_assoc_expr_with(op.precedence() + 1,
3588 LhsExpr::NotYetParsed)
3590 // We currently have no non-associative operators that are not handled above by
3591 // the special cases. The code is here only for future convenience.
3592 Fixity::None => self.with_res(
3593 restrictions - Restrictions::STMT_EXPR,
3595 this.parse_assoc_expr_with(op.precedence() + 1,
3596 LhsExpr::NotYetParsed)
3600 // Make sure that the span of the parent node is larger than the span of lhs and rhs,
3601 // including the attributes.
3605 .filter(|a| a.style == AttrStyle::Outer)
3607 .map_or(lhs_span, |a| a.span);
3608 let span = lhs_span.to(rhs.span);
3610 AssocOp::Add | AssocOp::Subtract | AssocOp::Multiply | AssocOp::Divide |
3611 AssocOp::Modulus | AssocOp::LAnd | AssocOp::LOr | AssocOp::BitXor |
3612 AssocOp::BitAnd | AssocOp::BitOr | AssocOp::ShiftLeft | AssocOp::ShiftRight |
3613 AssocOp::Equal | AssocOp::Less | AssocOp::LessEqual | AssocOp::NotEqual |
3614 AssocOp::Greater | AssocOp::GreaterEqual => {
3615 let ast_op = op.to_ast_binop().unwrap();
3616 let binary = self.mk_binary(source_map::respan(cur_op_span, ast_op), lhs, rhs);
3617 self.mk_expr(span, binary, ThinVec::new())
3620 self.mk_expr(span, ExprKind::Assign(lhs, rhs), ThinVec::new()),
3621 AssocOp::ObsoleteInPlace =>
3622 self.mk_expr(span, ExprKind::ObsoleteInPlace(lhs, rhs), ThinVec::new()),
3623 AssocOp::AssignOp(k) => {
3625 token::Plus => BinOpKind::Add,
3626 token::Minus => BinOpKind::Sub,
3627 token::Star => BinOpKind::Mul,
3628 token::Slash => BinOpKind::Div,
3629 token::Percent => BinOpKind::Rem,
3630 token::Caret => BinOpKind::BitXor,
3631 token::And => BinOpKind::BitAnd,
3632 token::Or => BinOpKind::BitOr,
3633 token::Shl => BinOpKind::Shl,
3634 token::Shr => BinOpKind::Shr,
3636 let aopexpr = self.mk_assign_op(source_map::respan(cur_op_span, aop), lhs, rhs);
3637 self.mk_expr(span, aopexpr, ThinVec::new())
3639 AssocOp::As | AssocOp::Colon | AssocOp::DotDot | AssocOp::DotDotEq => {
3640 self.bug("AssocOp should have been handled by special case")
3644 if op.fixity() == Fixity::None { break }
3649 fn could_ascription_be_path(&self, node: &ast::ExprKind) -> bool {
3650 self.token.is_ident() &&
3651 if let ast::ExprKind::Path(..) = node { true } else { false } &&
3652 !self.token.is_reserved_ident() && // v `foo:bar(baz)`
3653 self.look_ahead(1, |t| t == &token::OpenDelim(token::Paren)) ||
3654 self.look_ahead(1, |t| t == &token::Lt) && // `foo:bar<baz`
3655 self.look_ahead(2, |t| t.is_ident()) ||
3656 self.look_ahead(1, |t| t == &token::Colon) && // `foo:bar:baz`
3657 self.look_ahead(2, |t| t.is_ident()) ||
3658 self.look_ahead(1, |t| t == &token::ModSep) && // `foo:bar::baz`
3659 self.look_ahead(2, |t| t.is_ident())
3662 fn bad_type_ascription(
3664 err: &mut DiagnosticBuilder<'a>,
3670 err.span_label(self.span, "expecting a type here because of type ascription");
3671 let cm = self.sess.source_map();
3672 let next_pos = cm.lookup_char_pos(next_sp.lo());
3673 let op_pos = cm.lookup_char_pos(cur_op_span.hi());
3674 if op_pos.line != next_pos.line {
3675 err.span_suggestion(
3677 "try using a semicolon",
3679 Applicability::MaybeIncorrect,
3683 err.span_suggestion(
3685 "maybe you meant to write a path separator here",
3687 Applicability::MaybeIncorrect,
3690 err.note("type ascription is a nightly-only feature that lets \
3691 you annotate an expression with a type: `<expr>: <type>`");
3694 "this expression expects an ascribed type after the colon",
3696 err.help("this might be indicative of a syntax error elsewhere");
3701 fn parse_assoc_op_cast(&mut self, lhs: P<Expr>, lhs_span: Span,
3702 expr_kind: fn(P<Expr>, P<Ty>) -> ExprKind)
3703 -> PResult<'a, P<Expr>> {
3704 let mk_expr = |this: &mut Self, rhs: P<Ty>| {
3705 this.mk_expr(lhs_span.to(rhs.span), expr_kind(lhs, rhs), ThinVec::new())
3708 // Save the state of the parser before parsing type normally, in case there is a
3709 // LessThan comparison after this cast.
3710 let parser_snapshot_before_type = self.clone();
3711 match self.parse_ty_no_plus() {
3713 Ok(mk_expr(self, rhs))
3715 Err(mut type_err) => {
3716 // Rewind to before attempting to parse the type with generics, to recover
3717 // from situations like `x as usize < y` in which we first tried to parse
3718 // `usize < y` as a type with generic arguments.
3719 let parser_snapshot_after_type = self.clone();
3720 mem::replace(self, parser_snapshot_before_type);
3722 match self.parse_path(PathStyle::Expr) {
3724 let (op_noun, op_verb) = match self.token {
3725 token::Lt => ("comparison", "comparing"),
3726 token::BinOp(token::Shl) => ("shift", "shifting"),
3728 // We can end up here even without `<` being the next token, for
3729 // example because `parse_ty_no_plus` returns `Err` on keywords,
3730 // but `parse_path` returns `Ok` on them due to error recovery.
3731 // Return original error and parser state.
3732 mem::replace(self, parser_snapshot_after_type);
3733 return Err(type_err);
3737 // Successfully parsed the type path leaving a `<` yet to parse.
3740 // Report non-fatal diagnostics, keep `x as usize` as an expression
3741 // in AST and continue parsing.
3742 let msg = format!("`<` is interpreted as a start of generic \
3743 arguments for `{}`, not a {}", path, op_noun);
3744 let mut err = self.sess.span_diagnostic.struct_span_err(self.span, &msg);
3745 err.span_label(self.look_ahead_span(1).to(parser_snapshot_after_type.span),
3746 "interpreted as generic arguments");
3747 err.span_label(self.span, format!("not interpreted as {}", op_noun));
3749 let expr = mk_expr(self, P(Ty {
3751 node: TyKind::Path(None, path),
3752 id: ast::DUMMY_NODE_ID
3755 let expr_str = self.sess.source_map().span_to_snippet(expr.span)
3756 .unwrap_or_else(|_| pprust::expr_to_string(&expr));
3757 err.span_suggestion(
3759 &format!("try {} the cast value", op_verb),
3760 format!("({})", expr_str),
3761 Applicability::MachineApplicable
3767 Err(mut path_err) => {
3768 // Couldn't parse as a path, return original error and parser state.
3770 mem::replace(self, parser_snapshot_after_type);
3778 /// Produce an error if comparison operators are chained (RFC #558).
3779 /// We only need to check lhs, not rhs, because all comparison ops
3780 /// have same precedence and are left-associative
3781 fn check_no_chained_comparison(&mut self, lhs: &Expr, outer_op: &AssocOp) {
3782 debug_assert!(outer_op.is_comparison(),
3783 "check_no_chained_comparison: {:?} is not comparison",
3786 ExprKind::Binary(op, _, _) if op.node.is_comparison() => {
3787 // respan to include both operators
3788 let op_span = op.span.to(self.span);
3789 let mut err = self.diagnostic().struct_span_err(op_span,
3790 "chained comparison operators require parentheses");
3791 if op.node == BinOpKind::Lt &&
3792 *outer_op == AssocOp::Less || // Include `<` to provide this recommendation
3793 *outer_op == AssocOp::Greater // even in a case like the following:
3794 { // Foo<Bar<Baz<Qux, ()>>>
3796 "use `::<...>` instead of `<...>` if you meant to specify type arguments");
3797 err.help("or use `(...)` if you meant to specify fn arguments");
3805 /// Parse prefix-forms of range notation: `..expr`, `..`, `..=expr`
3806 fn parse_prefix_range_expr(&mut self,
3807 already_parsed_attrs: Option<ThinVec<Attribute>>)
3808 -> PResult<'a, P<Expr>> {
3809 // Check for deprecated `...` syntax
3810 if self.token == token::DotDotDot {
3811 self.err_dotdotdot_syntax(self.span);
3814 debug_assert!([token::DotDot, token::DotDotDot, token::DotDotEq].contains(&self.token),
3815 "parse_prefix_range_expr: token {:?} is not DotDot/DotDotEq",
3817 let tok = self.token.clone();
3818 let attrs = self.parse_or_use_outer_attributes(already_parsed_attrs)?;
3820 let mut hi = self.span;
3822 let opt_end = if self.is_at_start_of_range_notation_rhs() {
3823 // RHS must be parsed with more associativity than the dots.
3824 let next_prec = AssocOp::from_token(&tok).unwrap().precedence() + 1;
3825 Some(self.parse_assoc_expr_with(next_prec,
3826 LhsExpr::NotYetParsed)
3834 let limits = if tok == token::DotDot {
3835 RangeLimits::HalfOpen
3840 let r = self.mk_range(None, opt_end, limits)?;
3841 Ok(self.mk_expr(lo.to(hi), r, attrs))
3844 fn is_at_start_of_range_notation_rhs(&self) -> bool {
3845 if self.token.can_begin_expr() {
3846 // parse `for i in 1.. { }` as infinite loop, not as `for i in (1..{})`.
3847 if self.token == token::OpenDelim(token::Brace) {
3848 return !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL);
3856 /// Parses an `if` or `if let` expression (`if` token already eaten).
3857 fn parse_if_expr(&mut self, attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
3858 if self.check_keyword(keywords::Let) {
3859 return self.parse_if_let_expr(attrs);
3861 let lo = self.prev_span;
3862 let cond = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
3864 // Verify that the parsed `if` condition makes sense as a condition. If it is a block, then
3865 // verify that the last statement is either an implicit return (no `;`) or an explicit
3866 // return. This won't catch blocks with an explicit `return`, but that would be caught by
3867 // the dead code lint.
3868 if self.eat_keyword(keywords::Else) || !cond.returns() {
3869 let sp = self.sess.source_map().next_point(lo);
3870 let mut err = self.diagnostic()
3871 .struct_span_err(sp, "missing condition for `if` statemement");
3872 err.span_label(sp, "expected if condition here");
3875 let not_block = self.token != token::OpenDelim(token::Brace);
3876 let thn = self.parse_block().map_err(|mut err| {
3878 err.span_label(lo, "this `if` statement has a condition, but no block");
3882 let mut els: Option<P<Expr>> = None;
3883 let mut hi = thn.span;
3884 if self.eat_keyword(keywords::Else) {
3885 let elexpr = self.parse_else_expr()?;
3889 Ok(self.mk_expr(lo.to(hi), ExprKind::If(cond, thn, els), attrs))
3892 /// Parses an `if let` expression (`if` token already eaten).
3893 fn parse_if_let_expr(&mut self, attrs: ThinVec<Attribute>)
3894 -> PResult<'a, P<Expr>> {
3895 let lo = self.prev_span;
3896 self.expect_keyword(keywords::Let)?;
3897 let pats = self.parse_pats()?;
3898 self.expect(&token::Eq)?;
3899 let expr = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
3900 let thn = self.parse_block()?;
3901 let (hi, els) = if self.eat_keyword(keywords::Else) {
3902 let expr = self.parse_else_expr()?;
3903 (expr.span, Some(expr))
3907 Ok(self.mk_expr(lo.to(hi), ExprKind::IfLet(pats, expr, thn, els), attrs))
3910 /// Parses `move |args| expr`.
3911 fn parse_lambda_expr(&mut self,
3912 attrs: ThinVec<Attribute>)
3913 -> PResult<'a, P<Expr>>
3916 let movability = if self.eat_keyword(keywords::Static) {
3921 let asyncness = if self.span.rust_2018() {
3922 self.parse_asyncness()
3926 let capture_clause = if self.eat_keyword(keywords::Move) {
3931 let decl = self.parse_fn_block_decl()?;
3932 let decl_hi = self.prev_span;
3933 let body = match decl.output {
3934 FunctionRetTy::Default(_) => {
3935 let restrictions = self.restrictions - Restrictions::STMT_EXPR;
3936 self.parse_expr_res(restrictions, None)?
3939 // If an explicit return type is given, require a
3940 // block to appear (RFC 968).
3941 let body_lo = self.span;
3942 self.parse_block_expr(None, body_lo, BlockCheckMode::Default, ThinVec::new())?
3948 ExprKind::Closure(capture_clause, asyncness, movability, decl, body, lo.to(decl_hi)),
3952 // `else` token already eaten
3953 fn parse_else_expr(&mut self) -> PResult<'a, P<Expr>> {
3954 if self.eat_keyword(keywords::If) {
3955 return self.parse_if_expr(ThinVec::new());
3957 let blk = self.parse_block()?;
3958 return Ok(self.mk_expr(blk.span, ExprKind::Block(blk, None), ThinVec::new()));
3962 /// Parse a 'for' .. 'in' expression ('for' token already eaten)
3963 fn parse_for_expr(&mut self, opt_label: Option<Label>,
3965 mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
3966 // Parse: `for <src_pat> in <src_expr> <src_loop_block>`
3968 let pat = self.parse_top_level_pat()?;
3969 if !self.eat_keyword(keywords::In) {
3970 let in_span = self.prev_span.between(self.span);
3971 let mut err = self.sess.span_diagnostic
3972 .struct_span_err(in_span, "missing `in` in `for` loop");
3973 err.span_suggestion_short(
3974 in_span, "try adding `in` here", " in ".into(),
3975 // has been misleading, at least in the past (closed Issue #48492)
3976 Applicability::MaybeIncorrect
3980 let in_span = self.prev_span;
3981 if self.eat_keyword(keywords::In) {
3982 // a common typo: `for _ in in bar {}`
3983 let mut err = self.sess.span_diagnostic.struct_span_err(
3985 "expected iterable, found keyword `in`",
3987 err.span_suggestion_short(
3988 in_span.until(self.prev_span),
3989 "remove the duplicated `in`",
3991 Applicability::MachineApplicable,
3993 err.note("if you meant to use emplacement syntax, it is obsolete (for now, anyway)");
3994 err.note("for more information on the status of emplacement syntax, see <\
3995 https://github.com/rust-lang/rust/issues/27779#issuecomment-378416911>");
3998 let expr = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
3999 let (iattrs, loop_block) = self.parse_inner_attrs_and_block()?;
4000 attrs.extend(iattrs);
4002 let hi = self.prev_span;
4003 Ok(self.mk_expr(span_lo.to(hi), ExprKind::ForLoop(pat, expr, loop_block, opt_label), attrs))
4006 /// Parses a `while` or `while let` expression (`while` token already eaten).
4007 fn parse_while_expr(&mut self, opt_label: Option<Label>,
4009 mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
4010 if self.token.is_keyword(keywords::Let) {
4011 return self.parse_while_let_expr(opt_label, span_lo, attrs);
4013 let cond = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
4014 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
4015 attrs.extend(iattrs);
4016 let span = span_lo.to(body.span);
4017 return Ok(self.mk_expr(span, ExprKind::While(cond, body, opt_label), attrs));
4020 /// Parses a `while let` expression (`while` token already eaten).
4021 fn parse_while_let_expr(&mut self, opt_label: Option<Label>,
4023 mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
4024 self.expect_keyword(keywords::Let)?;
4025 let pats = self.parse_pats()?;
4026 self.expect(&token::Eq)?;
4027 let expr = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
4028 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
4029 attrs.extend(iattrs);
4030 let span = span_lo.to(body.span);
4031 return Ok(self.mk_expr(span, ExprKind::WhileLet(pats, expr, body, opt_label), attrs));
4034 // parse `loop {...}`, `loop` token already eaten
4035 fn parse_loop_expr(&mut self, opt_label: Option<Label>,
4037 mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
4038 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
4039 attrs.extend(iattrs);
4040 let span = span_lo.to(body.span);
4041 Ok(self.mk_expr(span, ExprKind::Loop(body, opt_label), attrs))
4044 /// Parses an `async move {...}` expression.
4045 pub fn parse_async_block(&mut self, mut attrs: ThinVec<Attribute>)
4046 -> PResult<'a, P<Expr>>
4048 let span_lo = self.span;
4049 self.expect_keyword(keywords::Async)?;
4050 let capture_clause = if self.eat_keyword(keywords::Move) {
4055 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
4056 attrs.extend(iattrs);
4058 span_lo.to(body.span),
4059 ExprKind::Async(capture_clause, ast::DUMMY_NODE_ID, body), attrs))
4062 /// Parses a `try {...}` expression (`try` token already eaten).
4063 fn parse_try_block(&mut self, span_lo: Span, mut attrs: ThinVec<Attribute>)
4064 -> PResult<'a, P<Expr>>
4066 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
4067 attrs.extend(iattrs);
4068 if self.eat_keyword(keywords::Catch) {
4069 let mut error = self.struct_span_err(self.prev_span,
4070 "keyword `catch` cannot follow a `try` block");
4071 error.help("try using `match` on the result of the `try` block instead");
4075 Ok(self.mk_expr(span_lo.to(body.span), ExprKind::TryBlock(body), attrs))
4079 // `match` token already eaten
4080 fn parse_match_expr(&mut self, mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
4081 let match_span = self.prev_span;
4082 let lo = self.prev_span;
4083 let discriminant = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL,
4085 if let Err(mut e) = self.expect(&token::OpenDelim(token::Brace)) {
4086 if self.token == token::Token::Semi {
4087 e.span_suggestion_short(
4089 "try removing this `match`",
4091 Applicability::MaybeIncorrect // speculative
4096 attrs.extend(self.parse_inner_attributes()?);
4098 let mut arms: Vec<Arm> = Vec::new();
4099 while self.token != token::CloseDelim(token::Brace) {
4100 match self.parse_arm() {
4101 Ok(arm) => arms.push(arm),
4103 // Recover by skipping to the end of the block.
4105 self.recover_stmt();
4106 let span = lo.to(self.span);
4107 if self.token == token::CloseDelim(token::Brace) {
4110 return Ok(self.mk_expr(span, ExprKind::Match(discriminant, arms), attrs));
4116 return Ok(self.mk_expr(lo.to(hi), ExprKind::Match(discriminant, arms), attrs));
4119 crate fn parse_arm(&mut self) -> PResult<'a, Arm> {
4120 maybe_whole!(self, NtArm, |x| x);
4122 let attrs = self.parse_outer_attributes()?;
4123 let pats = self.parse_pats()?;
4124 let guard = if self.eat_keyword(keywords::If) {
4125 Some(Guard::If(self.parse_expr()?))
4129 let arrow_span = self.span;
4130 self.expect(&token::FatArrow)?;
4131 let arm_start_span = self.span;
4133 let expr = self.parse_expr_res(Restrictions::STMT_EXPR, None)
4134 .map_err(|mut err| {
4135 err.span_label(arrow_span, "while parsing the `match` arm starting here");
4139 let require_comma = classify::expr_requires_semi_to_be_stmt(&expr)
4140 && self.token != token::CloseDelim(token::Brace);
4143 let cm = self.sess.source_map();
4144 self.expect_one_of(&[token::Comma], &[token::CloseDelim(token::Brace)])
4145 .map_err(|mut err| {
4146 match (cm.span_to_lines(expr.span), cm.span_to_lines(arm_start_span)) {
4147 (Ok(ref expr_lines), Ok(ref arm_start_lines))
4148 if arm_start_lines.lines[0].end_col == expr_lines.lines[0].end_col
4149 && expr_lines.lines.len() == 2
4150 && self.token == token::FatArrow => {
4151 // We check whether there's any trailing code in the parse span,
4152 // if there isn't, we very likely have the following:
4155 // | -- - missing comma
4161 // | parsed until here as `"y" & X`
4162 err.span_suggestion_short(
4163 cm.next_point(arm_start_span),
4164 "missing a comma here to end this `match` arm",
4166 Applicability::MachineApplicable
4170 err.span_label(arrow_span,
4171 "while parsing the `match` arm starting here");
4177 self.eat(&token::Comma);
4188 /// Parses an expression.
4190 pub fn parse_expr(&mut self) -> PResult<'a, P<Expr>> {
4191 self.parse_expr_res(Restrictions::empty(), None)
4194 /// Evaluates the closure with restrictions in place.
4196 /// Afters the closure is evaluated, restrictions are reset.
4197 fn with_res<F, T>(&mut self, r: Restrictions, f: F) -> T
4198 where F: FnOnce(&mut Self) -> T
4200 let old = self.restrictions;
4201 self.restrictions = r;
4203 self.restrictions = old;
4208 /// Parses an expression, subject to the given restrictions.
4210 fn parse_expr_res(&mut self, r: Restrictions,
4211 already_parsed_attrs: Option<ThinVec<Attribute>>)
4212 -> PResult<'a, P<Expr>> {
4213 self.with_res(r, |this| this.parse_assoc_expr(already_parsed_attrs))
4216 /// Parses the RHS of a local variable declaration (e.g., '= 14;').
4217 fn parse_initializer(&mut self, skip_eq: bool) -> PResult<'a, Option<P<Expr>>> {
4218 if self.eat(&token::Eq) {
4219 Ok(Some(self.parse_expr()?))
4221 Ok(Some(self.parse_expr()?))
4227 /// Parses patterns, separated by '|' s.
4228 fn parse_pats(&mut self) -> PResult<'a, Vec<P<Pat>>> {
4229 // Allow a '|' before the pats (RFC 1925 + RFC 2530)
4230 self.eat(&token::BinOp(token::Or));
4232 let mut pats = Vec::new();
4234 pats.push(self.parse_top_level_pat()?);
4236 if self.token == token::OrOr {
4237 let mut err = self.struct_span_err(self.span,
4238 "unexpected token `||` after pattern");
4239 err.span_suggestion(
4241 "use a single `|` to specify multiple patterns",
4243 Applicability::MachineApplicable
4247 } else if self.eat(&token::BinOp(token::Or)) {
4248 // This is a No-op. Continue the loop to parse the next
4256 // Parses a parenthesized list of patterns like
4257 // `()`, `(p)`, `(p,)`, `(p, q)`, or `(p, .., q)`. Returns:
4258 // - a vector of the patterns that were parsed
4259 // - an option indicating the index of the `..` element
4260 // - a boolean indicating whether a trailing comma was present.
4261 // Trailing commas are significant because (p) and (p,) are different patterns.
4262 fn parse_parenthesized_pat_list(&mut self) -> PResult<'a, (Vec<P<Pat>>, Option<usize>, bool)> {
4263 self.expect(&token::OpenDelim(token::Paren))?;
4264 let result = match self.parse_pat_list() {
4265 Ok(result) => result,
4266 Err(mut err) => { // recover from parse error in tuple pattern list
4268 self.consume_block(token::Paren);
4269 return Ok((vec![], Some(0), false));
4272 self.expect(&token::CloseDelim(token::Paren))?;
4276 fn parse_pat_list(&mut self) -> PResult<'a, (Vec<P<Pat>>, Option<usize>, bool)> {
4277 let mut fields = Vec::new();
4278 let mut ddpos = None;
4279 let mut prev_dd_sp = None;
4280 let mut trailing_comma = false;
4282 if self.eat(&token::DotDot) {
4283 if ddpos.is_none() {
4284 ddpos = Some(fields.len());
4285 prev_dd_sp = Some(self.prev_span);
4287 // Emit a friendly error, ignore `..` and continue parsing
4288 let mut err = self.struct_span_err(
4290 "`..` can only be used once per tuple or tuple struct pattern",
4292 err.span_label(self.prev_span, "can only be used once per pattern");
4293 if let Some(sp) = prev_dd_sp {
4294 err.span_label(sp, "previously present here");
4298 } else if !self.check(&token::CloseDelim(token::Paren)) {
4299 fields.push(self.parse_pat(None)?);
4304 trailing_comma = self.eat(&token::Comma);
4305 if !trailing_comma {
4310 if ddpos == Some(fields.len()) && trailing_comma {
4311 // `..` needs to be followed by `)` or `, pat`, `..,)` is disallowed.
4312 let msg = "trailing comma is not permitted after `..`";
4313 self.struct_span_err(self.prev_span, msg)
4314 .span_label(self.prev_span, msg)
4318 Ok((fields, ddpos, trailing_comma))
4321 fn parse_pat_vec_elements(
4323 ) -> PResult<'a, (Vec<P<Pat>>, Option<P<Pat>>, Vec<P<Pat>>)> {
4324 let mut before = Vec::new();
4325 let mut slice = None;
4326 let mut after = Vec::new();
4327 let mut first = true;
4328 let mut before_slice = true;
4330 while self.token != token::CloseDelim(token::Bracket) {
4334 self.expect(&token::Comma)?;
4336 if self.token == token::CloseDelim(token::Bracket)
4337 && (before_slice || !after.is_empty()) {
4343 if self.eat(&token::DotDot) {
4345 if self.check(&token::Comma) ||
4346 self.check(&token::CloseDelim(token::Bracket)) {
4347 slice = Some(P(Pat {
4348 id: ast::DUMMY_NODE_ID,
4349 node: PatKind::Wild,
4350 span: self.prev_span,
4352 before_slice = false;
4358 let subpat = self.parse_pat(None)?;
4359 if before_slice && self.eat(&token::DotDot) {
4360 slice = Some(subpat);
4361 before_slice = false;
4362 } else if before_slice {
4363 before.push(subpat);
4369 Ok((before, slice, after))
4375 attrs: Vec<Attribute>
4376 ) -> PResult<'a, source_map::Spanned<ast::FieldPat>> {
4377 // Check if a colon exists one ahead. This means we're parsing a fieldname.
4379 let (subpat, fieldname, is_shorthand) = if self.look_ahead(1, |t| t == &token::Colon) {
4380 // Parsing a pattern of the form "fieldname: pat"
4381 let fieldname = self.parse_field_name()?;
4383 let pat = self.parse_pat(None)?;
4385 (pat, fieldname, false)
4387 // Parsing a pattern of the form "(box) (ref) (mut) fieldname"
4388 let is_box = self.eat_keyword(keywords::Box);
4389 let boxed_span = self.span;
4390 let is_ref = self.eat_keyword(keywords::Ref);
4391 let is_mut = self.eat_keyword(keywords::Mut);
4392 let fieldname = self.parse_ident()?;
4393 hi = self.prev_span;
4395 let bind_type = match (is_ref, is_mut) {
4396 (true, true) => BindingMode::ByRef(Mutability::Mutable),
4397 (true, false) => BindingMode::ByRef(Mutability::Immutable),
4398 (false, true) => BindingMode::ByValue(Mutability::Mutable),
4399 (false, false) => BindingMode::ByValue(Mutability::Immutable),
4401 let fieldpat = P(Pat {
4402 id: ast::DUMMY_NODE_ID,
4403 node: PatKind::Ident(bind_type, fieldname, None),
4404 span: boxed_span.to(hi),
4407 let subpat = if is_box {
4409 id: ast::DUMMY_NODE_ID,
4410 node: PatKind::Box(fieldpat),
4416 (subpat, fieldname, true)
4419 Ok(source_map::Spanned {
4421 node: ast::FieldPat {
4425 attrs: attrs.into(),
4430 /// Parses the fields of a struct-like pattern.
4431 fn parse_pat_fields(&mut self) -> PResult<'a, (Vec<source_map::Spanned<ast::FieldPat>>, bool)> {
4432 let mut fields = Vec::new();
4433 let mut etc = false;
4434 let mut ate_comma = true;
4435 let mut delayed_err: Option<DiagnosticBuilder<'a>> = None;
4436 let mut etc_span = None;
4438 while self.token != token::CloseDelim(token::Brace) {
4439 let attrs = self.parse_outer_attributes()?;
4442 // check that a comma comes after every field
4444 let err = self.struct_span_err(self.prev_span, "expected `,`");
4445 if let Some(mut delayed) = delayed_err {
4452 if self.check(&token::DotDot) || self.token == token::DotDotDot {
4454 let mut etc_sp = self.span;
4456 if self.token == token::DotDotDot { // Issue #46718
4457 // Accept `...` as if it were `..` to avoid further errors
4458 let mut err = self.struct_span_err(self.span,
4459 "expected field pattern, found `...`");
4460 err.span_suggestion(
4462 "to omit remaining fields, use one fewer `.`",
4464 Applicability::MachineApplicable
4468 self.bump(); // `..` || `...`
4470 if self.token == token::CloseDelim(token::Brace) {
4471 etc_span = Some(etc_sp);
4474 let token_str = self.this_token_descr();
4475 let mut err = self.fatal(&format!("expected `}}`, found {}", token_str));
4477 err.span_label(self.span, "expected `}`");
4478 let mut comma_sp = None;
4479 if self.token == token::Comma { // Issue #49257
4480 etc_sp = etc_sp.to(self.sess.source_map().span_until_non_whitespace(self.span));
4481 err.span_label(etc_sp,
4482 "`..` must be at the end and cannot have a trailing comma");
4483 comma_sp = Some(self.span);
4488 etc_span = Some(etc_sp.until(self.span));
4489 if self.token == token::CloseDelim(token::Brace) {
4490 // If the struct looks otherwise well formed, recover and continue.
4491 if let Some(sp) = comma_sp {
4492 err.span_suggestion_short(
4494 "remove this comma",
4496 Applicability::MachineApplicable,
4501 } else if self.token.is_ident() && ate_comma {
4502 // Accept fields coming after `..,`.
4503 // This way we avoid "pattern missing fields" errors afterwards.
4504 // We delay this error until the end in order to have a span for a
4506 if let Some(mut delayed_err) = delayed_err {
4510 delayed_err = Some(err);
4513 if let Some(mut err) = delayed_err {
4520 fields.push(match self.parse_pat_field(lo, attrs) {
4523 if let Some(mut delayed_err) = delayed_err {
4529 ate_comma = self.eat(&token::Comma);
4532 if let Some(mut err) = delayed_err {
4533 if let Some(etc_span) = etc_span {
4534 err.multipart_suggestion(
4535 "move the `..` to the end of the field list",
4537 (etc_span, String::new()),
4538 (self.span, format!("{}.. }}", if ate_comma { "" } else { ", " })),
4540 Applicability::MachineApplicable,
4545 return Ok((fields, etc));
4548 fn parse_pat_range_end(&mut self) -> PResult<'a, P<Expr>> {
4549 if self.token.is_path_start() {
4551 let (qself, path) = if self.eat_lt() {
4552 // Parse a qualified path
4553 let (qself, path) = self.parse_qpath(PathStyle::Expr)?;
4556 // Parse an unqualified path
4557 (None, self.parse_path(PathStyle::Expr)?)
4559 let hi = self.prev_span;
4560 Ok(self.mk_expr(lo.to(hi), ExprKind::Path(qself, path), ThinVec::new()))
4562 self.parse_literal_maybe_minus()
4566 // helper function to decide whether to parse as ident binding or to try to do
4567 // something more complex like range patterns
4568 fn parse_as_ident(&mut self) -> bool {
4569 self.look_ahead(1, |t| match *t {
4570 token::OpenDelim(token::Paren) | token::OpenDelim(token::Brace) |
4571 token::DotDotDot | token::DotDotEq | token::ModSep | token::Not => Some(false),
4572 // ensure slice patterns [a, b.., c] and [a, b, c..] don't go into the
4573 // range pattern branch
4574 token::DotDot => None,
4576 }).unwrap_or_else(|| self.look_ahead(2, |t| match *t {
4577 token::Comma | token::CloseDelim(token::Bracket) => true,
4582 /// A wrapper around `parse_pat` with some special error handling for the
4583 /// "top-level" patterns in a match arm, `for` loop, `let`, &c. (in contrast
4584 /// to subpatterns within such).
4585 fn parse_top_level_pat(&mut self) -> PResult<'a, P<Pat>> {
4586 let pat = self.parse_pat(None)?;
4587 if self.token == token::Comma {
4588 // An unexpected comma after a top-level pattern is a clue that the
4589 // user (perhaps more accustomed to some other language) forgot the
4590 // parentheses in what should have been a tuple pattern; return a
4591 // suggestion-enhanced error here rather than choking on the comma
4593 let comma_span = self.span;
4595 if let Err(mut err) = self.parse_pat_list() {
4596 // We didn't expect this to work anyway; we just wanted
4597 // to advance to the end of the comma-sequence so we know
4598 // the span to suggest parenthesizing
4601 let seq_span = pat.span.to(self.prev_span);
4602 let mut err = self.struct_span_err(comma_span,
4603 "unexpected `,` in pattern");
4604 if let Ok(seq_snippet) = self.sess.source_map().span_to_snippet(seq_span) {
4605 err.span_suggestion(
4607 "try adding parentheses to match on a tuple..",
4608 format!("({})", seq_snippet),
4609 Applicability::MachineApplicable
4612 "..or a vertical bar to match on multiple alternatives",
4613 format!("{}", seq_snippet.replace(",", " |")),
4614 Applicability::MachineApplicable
4622 /// Parses a pattern.
4623 pub fn parse_pat(&mut self, expected: Option<&'static str>) -> PResult<'a, P<Pat>> {
4624 self.parse_pat_with_range_pat(true, expected)
4627 /// Parses a pattern, with a setting whether modern range patterns (e.g., `a..=b`, `a..b` are
4629 fn parse_pat_with_range_pat(
4631 allow_range_pat: bool,
4632 expected: Option<&'static str>,
4633 ) -> PResult<'a, P<Pat>> {
4634 maybe_recover_from_interpolated_ty_qpath!(self, true);
4635 maybe_whole!(self, NtPat, |x| x);
4640 token::BinOp(token::And) | token::AndAnd => {
4641 // Parse &pat / &mut pat
4643 let mutbl = self.parse_mutability();
4644 if let token::Lifetime(ident) = self.token {
4645 let mut err = self.fatal(&format!("unexpected lifetime `{}` in pattern",
4647 err.span_label(self.span, "unexpected lifetime");
4650 let subpat = self.parse_pat_with_range_pat(false, expected)?;
4651 pat = PatKind::Ref(subpat, mutbl);
4653 token::OpenDelim(token::Paren) => {
4654 // Parse (pat,pat,pat,...) as tuple pattern
4655 let (fields, ddpos, trailing_comma) = self.parse_parenthesized_pat_list()?;
4656 pat = if fields.len() == 1 && ddpos.is_none() && !trailing_comma {
4657 PatKind::Paren(fields.into_iter().nth(0).unwrap())
4659 PatKind::Tuple(fields, ddpos)
4662 token::OpenDelim(token::Bracket) => {
4663 // Parse [pat,pat,...] as slice pattern
4665 let (before, slice, after) = self.parse_pat_vec_elements()?;
4666 self.expect(&token::CloseDelim(token::Bracket))?;
4667 pat = PatKind::Slice(before, slice, after);
4669 // At this point, token != &, &&, (, [
4670 _ => if self.eat_keyword(keywords::Underscore) {
4672 pat = PatKind::Wild;
4673 } else if self.eat_keyword(keywords::Mut) {
4674 // Parse mut ident @ pat / mut ref ident @ pat
4675 let mutref_span = self.prev_span.to(self.span);
4676 let binding_mode = if self.eat_keyword(keywords::Ref) {
4678 .struct_span_err(mutref_span, "the order of `mut` and `ref` is incorrect")
4681 "try switching the order",
4683 Applicability::MachineApplicable
4685 BindingMode::ByRef(Mutability::Mutable)
4687 BindingMode::ByValue(Mutability::Mutable)
4689 pat = self.parse_pat_ident(binding_mode)?;
4690 } else if self.eat_keyword(keywords::Ref) {
4691 // Parse ref ident @ pat / ref mut ident @ pat
4692 let mutbl = self.parse_mutability();
4693 pat = self.parse_pat_ident(BindingMode::ByRef(mutbl))?;
4694 } else if self.eat_keyword(keywords::Box) {
4696 let subpat = self.parse_pat_with_range_pat(false, None)?;
4697 pat = PatKind::Box(subpat);
4698 } else if self.token.is_ident() && !self.token.is_reserved_ident() &&
4699 self.parse_as_ident() {
4700 // Parse ident @ pat
4701 // This can give false positives and parse nullary enums,
4702 // they are dealt with later in resolve
4703 let binding_mode = BindingMode::ByValue(Mutability::Immutable);
4704 pat = self.parse_pat_ident(binding_mode)?;
4705 } else if self.token.is_path_start() {
4706 // Parse pattern starting with a path
4707 let (qself, path) = if self.eat_lt() {
4708 // Parse a qualified path
4709 let (qself, path) = self.parse_qpath(PathStyle::Expr)?;
4712 // Parse an unqualified path
4713 (None, self.parse_path(PathStyle::Expr)?)
4716 token::Not if qself.is_none() => {
4717 // Parse macro invocation
4719 let (delim, tts) = self.expect_delimited_token_tree()?;
4720 let mac = respan(lo.to(self.prev_span), Mac_ { path, tts, delim });
4721 pat = PatKind::Mac(mac);
4723 token::DotDotDot | token::DotDotEq | token::DotDot => {
4724 let end_kind = match self.token {
4725 token::DotDot => RangeEnd::Excluded,
4726 token::DotDotDot => RangeEnd::Included(RangeSyntax::DotDotDot),
4727 token::DotDotEq => RangeEnd::Included(RangeSyntax::DotDotEq),
4728 _ => panic!("can only parse `..`/`...`/`..=` for ranges \
4731 let op_span = self.span;
4733 let span = lo.to(self.prev_span);
4734 let begin = self.mk_expr(span, ExprKind::Path(qself, path), ThinVec::new());
4736 let end = self.parse_pat_range_end()?;
4737 let op = Spanned { span: op_span, node: end_kind };
4738 pat = PatKind::Range(begin, end, op);
4740 token::OpenDelim(token::Brace) => {
4741 if qself.is_some() {
4742 let msg = "unexpected `{` after qualified path";
4743 let mut err = self.fatal(msg);
4744 err.span_label(self.span, msg);
4747 // Parse struct pattern
4749 let (fields, etc) = self.parse_pat_fields().unwrap_or_else(|mut e| {
4751 self.recover_stmt();
4755 pat = PatKind::Struct(path, fields, etc);
4757 token::OpenDelim(token::Paren) => {
4758 if qself.is_some() {
4759 let msg = "unexpected `(` after qualified path";
4760 let mut err = self.fatal(msg);
4761 err.span_label(self.span, msg);
4764 // Parse tuple struct or enum pattern
4765 let (fields, ddpos, _) = self.parse_parenthesized_pat_list()?;
4766 pat = PatKind::TupleStruct(path, fields, ddpos)
4768 _ => pat = PatKind::Path(qself, path),
4771 // Try to parse everything else as literal with optional minus
4772 match self.parse_literal_maybe_minus() {
4774 let op_span = self.span;
4775 if self.check(&token::DotDot) || self.check(&token::DotDotEq) ||
4776 self.check(&token::DotDotDot) {
4777 let end_kind = if self.eat(&token::DotDotDot) {
4778 RangeEnd::Included(RangeSyntax::DotDotDot)
4779 } else if self.eat(&token::DotDotEq) {
4780 RangeEnd::Included(RangeSyntax::DotDotEq)
4781 } else if self.eat(&token::DotDot) {
4784 panic!("impossible case: we already matched \
4785 on a range-operator token")
4787 let end = self.parse_pat_range_end()?;
4788 let op = Spanned { span: op_span, node: end_kind };
4789 pat = PatKind::Range(begin, end, op);
4791 pat = PatKind::Lit(begin);
4795 self.cancel(&mut err);
4796 let expected = expected.unwrap_or("pattern");
4798 "expected {}, found {}",
4800 self.this_token_descr(),
4802 let mut err = self.fatal(&msg);
4803 err.span_label(self.span, format!("expected {}", expected));
4810 let pat = P(Pat { node: pat, span: lo.to(self.prev_span), id: ast::DUMMY_NODE_ID });
4811 let pat = self.maybe_recover_from_bad_qpath(pat, true)?;
4813 if !allow_range_pat {
4816 _, _, Spanned { node: RangeEnd::Included(RangeSyntax::DotDotDot), .. }
4818 PatKind::Range(..) => {
4819 let mut err = self.struct_span_err(
4821 "the range pattern here has ambiguous interpretation",
4823 err.span_suggestion(
4825 "add parentheses to clarify the precedence",
4826 format!("({})", pprust::pat_to_string(&pat)),
4827 // "ambiguous interpretation" implies that we have to be guessing
4828 Applicability::MaybeIncorrect
4839 /// Parses `ident` or `ident @ pat`.
4840 /// used by the copy foo and ref foo patterns to give a good
4841 /// error message when parsing mistakes like `ref foo(a, b)`.
4842 fn parse_pat_ident(&mut self,
4843 binding_mode: ast::BindingMode)
4844 -> PResult<'a, PatKind> {
4845 let ident = self.parse_ident()?;
4846 let sub = if self.eat(&token::At) {
4847 Some(self.parse_pat(Some("binding pattern"))?)
4852 // just to be friendly, if they write something like
4854 // we end up here with ( as the current token. This shortly
4855 // leads to a parse error. Note that if there is no explicit
4856 // binding mode then we do not end up here, because the lookahead
4857 // will direct us over to parse_enum_variant()
4858 if self.token == token::OpenDelim(token::Paren) {
4859 return Err(self.span_fatal(
4861 "expected identifier, found enum pattern"))
4864 Ok(PatKind::Ident(binding_mode, ident, sub))
4867 /// Parses a local variable declaration.
4868 fn parse_local(&mut self, attrs: ThinVec<Attribute>) -> PResult<'a, P<Local>> {
4869 let lo = self.prev_span;
4870 let pat = self.parse_top_level_pat()?;
4872 let (err, ty) = if self.eat(&token::Colon) {
4873 // Save the state of the parser before parsing type normally, in case there is a `:`
4874 // instead of an `=` typo.
4875 let parser_snapshot_before_type = self.clone();
4876 let colon_sp = self.prev_span;
4877 match self.parse_ty() {
4878 Ok(ty) => (None, Some(ty)),
4880 // Rewind to before attempting to parse the type and continue parsing
4881 let parser_snapshot_after_type = self.clone();
4882 mem::replace(self, parser_snapshot_before_type);
4884 let snippet = self.sess.source_map().span_to_snippet(pat.span).unwrap();
4885 err.span_label(pat.span, format!("while parsing the type for `{}`", snippet));
4886 (Some((parser_snapshot_after_type, colon_sp, err)), None)
4892 let init = match (self.parse_initializer(err.is_some()), err) {
4893 (Ok(init), None) => { // init parsed, ty parsed
4896 (Ok(init), Some((_, colon_sp, mut err))) => { // init parsed, ty error
4897 // Could parse the type as if it were the initializer, it is likely there was a
4898 // typo in the code: `:` instead of `=`. Add suggestion and emit the error.
4899 err.span_suggestion_short(
4901 "use `=` if you meant to assign",
4903 Applicability::MachineApplicable
4906 // As this was parsed successfully, continue as if the code has been fixed for the
4907 // rest of the file. It will still fail due to the emitted error, but we avoid
4911 (Err(mut init_err), Some((snapshot, _, ty_err))) => { // init error, ty error
4913 // Couldn't parse the type nor the initializer, only raise the type error and
4914 // return to the parser state before parsing the type as the initializer.
4915 // let x: <parse_error>;
4916 mem::replace(self, snapshot);
4919 (Err(err), None) => { // init error, ty parsed
4920 // Couldn't parse the initializer and we're not attempting to recover a failed
4921 // parse of the type, return the error.
4925 let hi = if self.token == token::Semi {
4934 id: ast::DUMMY_NODE_ID,
4937 source: LocalSource::Normal,
4941 /// Parses a structure field.
4942 fn parse_name_and_ty(&mut self,
4945 attrs: Vec<Attribute>)
4946 -> PResult<'a, StructField> {
4947 let name = self.parse_ident()?;
4948 self.expect(&token::Colon)?;
4949 let ty = self.parse_ty()?;
4951 span: lo.to(self.prev_span),
4954 id: ast::DUMMY_NODE_ID,
4960 /// Emits an expected-item-after-attributes error.
4961 fn expected_item_err(&mut self, attrs: &[Attribute]) -> PResult<'a, ()> {
4962 let message = match attrs.last() {
4963 Some(&Attribute { is_sugared_doc: true, .. }) => "expected item after doc comment",
4964 _ => "expected item after attributes",
4967 let mut err = self.diagnostic().struct_span_err(self.prev_span, message);
4968 if attrs.last().unwrap().is_sugared_doc {
4969 err.span_label(self.prev_span, "this doc comment doesn't document anything");
4974 /// Parse a statement. This stops just before trailing semicolons on everything but items.
4975 /// e.g., a `StmtKind::Semi` parses to a `StmtKind::Expr`, leaving the trailing `;` unconsumed.
4976 pub fn parse_stmt(&mut self) -> PResult<'a, Option<Stmt>> {
4977 Ok(self.parse_stmt_(true))
4980 // Eat tokens until we can be relatively sure we reached the end of the
4981 // statement. This is something of a best-effort heuristic.
4983 // We terminate when we find an unmatched `}` (without consuming it).
4984 fn recover_stmt(&mut self) {
4985 self.recover_stmt_(SemiColonMode::Ignore, BlockMode::Ignore)
4988 // If `break_on_semi` is `Break`, then we will stop consuming tokens after
4989 // finding (and consuming) a `;` outside of `{}` or `[]` (note that this is
4990 // approximate - it can mean we break too early due to macros, but that
4991 // should only lead to sub-optimal recovery, not inaccurate parsing).
4993 // If `break_on_block` is `Break`, then we will stop consuming tokens
4994 // after finding (and consuming) a brace-delimited block.
4995 fn recover_stmt_(&mut self, break_on_semi: SemiColonMode, break_on_block: BlockMode) {
4996 let mut brace_depth = 0;
4997 let mut bracket_depth = 0;
4998 let mut in_block = false;
4999 debug!("recover_stmt_ enter loop (semi={:?}, block={:?})",
5000 break_on_semi, break_on_block);
5002 debug!("recover_stmt_ loop {:?}", self.token);
5004 token::OpenDelim(token::DelimToken::Brace) => {
5007 if break_on_block == BlockMode::Break &&
5009 bracket_depth == 0 {
5013 token::OpenDelim(token::DelimToken::Bracket) => {
5017 token::CloseDelim(token::DelimToken::Brace) => {
5018 if brace_depth == 0 {
5019 debug!("recover_stmt_ return - close delim {:?}", self.token);
5024 if in_block && bracket_depth == 0 && brace_depth == 0 {
5025 debug!("recover_stmt_ return - block end {:?}", self.token);
5029 token::CloseDelim(token::DelimToken::Bracket) => {
5031 if bracket_depth < 0 {
5037 debug!("recover_stmt_ return - Eof");
5042 if break_on_semi == SemiColonMode::Break &&
5044 bracket_depth == 0 {
5045 debug!("recover_stmt_ return - Semi");
5050 if break_on_semi == SemiColonMode::Comma &&
5052 bracket_depth == 0 {
5053 debug!("recover_stmt_ return - Semi");
5066 fn parse_stmt_(&mut self, macro_legacy_warnings: bool) -> Option<Stmt> {
5067 self.parse_stmt_without_recovery(macro_legacy_warnings).unwrap_or_else(|mut e| {
5069 self.recover_stmt_(SemiColonMode::Break, BlockMode::Ignore);
5074 fn is_async_block(&mut self) -> bool {
5075 self.token.is_keyword(keywords::Async) &&
5078 self.look_ahead(1, |t| t.is_keyword(keywords::Move)) &&
5079 self.look_ahead(2, |t| *t == token::OpenDelim(token::Brace))
5081 self.look_ahead(1, |t| *t == token::OpenDelim(token::Brace))
5086 fn is_async_fn(&mut self) -> bool {
5087 self.token.is_keyword(keywords::Async) &&
5088 self.look_ahead(1, |t| t.is_keyword(keywords::Fn))
5091 fn is_do_catch_block(&mut self) -> bool {
5092 self.token.is_keyword(keywords::Do) &&
5093 self.look_ahead(1, |t| t.is_keyword(keywords::Catch)) &&
5094 self.look_ahead(2, |t| *t == token::OpenDelim(token::Brace)) &&
5095 !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL)
5098 fn is_try_block(&mut self) -> bool {
5099 self.token.is_keyword(keywords::Try) &&
5100 self.look_ahead(1, |t| *t == token::OpenDelim(token::Brace)) &&
5101 self.span.rust_2018() &&
5102 // prevent `while try {} {}`, `if try {} {} else {}`, etc.
5103 !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL)
5106 fn is_union_item(&self) -> bool {
5107 self.token.is_keyword(keywords::Union) &&
5108 self.look_ahead(1, |t| t.is_ident() && !t.is_reserved_ident())
5111 fn is_crate_vis(&self) -> bool {
5112 self.token.is_keyword(keywords::Crate) && self.look_ahead(1, |t| t != &token::ModSep)
5115 fn is_existential_type_decl(&self) -> bool {
5116 self.token.is_keyword(keywords::Existential) &&
5117 self.look_ahead(1, |t| t.is_keyword(keywords::Type))
5120 fn is_auto_trait_item(&mut self) -> bool {
5122 (self.token.is_keyword(keywords::Auto)
5123 && self.look_ahead(1, |t| t.is_keyword(keywords::Trait)))
5124 || // unsafe auto trait
5125 (self.token.is_keyword(keywords::Unsafe) &&
5126 self.look_ahead(1, |t| t.is_keyword(keywords::Auto)) &&
5127 self.look_ahead(2, |t| t.is_keyword(keywords::Trait)))
5130 fn eat_macro_def(&mut self, attrs: &[Attribute], vis: &Visibility, lo: Span)
5131 -> PResult<'a, Option<P<Item>>> {
5132 let token_lo = self.span;
5133 let (ident, def) = match self.token {
5134 token::Ident(ident, false) if ident.name == keywords::Macro.name() => {
5136 let ident = self.parse_ident()?;
5137 let tokens = if self.check(&token::OpenDelim(token::Brace)) {
5138 match self.parse_token_tree() {
5139 TokenTree::Delimited(_, _, tts) => tts,
5140 _ => unreachable!(),
5142 } else if self.check(&token::OpenDelim(token::Paren)) {
5143 let args = self.parse_token_tree();
5144 let body = if self.check(&token::OpenDelim(token::Brace)) {
5145 self.parse_token_tree()
5150 TokenStream::new(vec![
5152 TokenTree::Token(token_lo.to(self.prev_span), token::FatArrow).into(),
5160 (ident, ast::MacroDef { tokens: tokens.into(), legacy: false })
5162 token::Ident(ident, _) if ident.name == "macro_rules" &&
5163 self.look_ahead(1, |t| *t == token::Not) => {
5164 let prev_span = self.prev_span;
5165 self.complain_if_pub_macro(&vis.node, prev_span);
5169 let ident = self.parse_ident()?;
5170 let (delim, tokens) = self.expect_delimited_token_tree()?;
5171 if delim != MacDelimiter::Brace && !self.eat(&token::Semi) {
5172 self.report_invalid_macro_expansion_item();
5175 (ident, ast::MacroDef { tokens: tokens, legacy: true })
5177 _ => return Ok(None),
5180 let span = lo.to(self.prev_span);
5181 Ok(Some(self.mk_item(span, ident, ItemKind::MacroDef(def), vis.clone(), attrs.to_vec())))
5184 fn parse_stmt_without_recovery(&mut self,
5185 macro_legacy_warnings: bool)
5186 -> PResult<'a, Option<Stmt>> {
5187 maybe_whole!(self, NtStmt, |x| Some(x));
5189 let attrs = self.parse_outer_attributes()?;
5192 Ok(Some(if self.eat_keyword(keywords::Let) {
5194 id: ast::DUMMY_NODE_ID,
5195 node: StmtKind::Local(self.parse_local(attrs.into())?),
5196 span: lo.to(self.prev_span),
5198 } else if let Some(macro_def) = self.eat_macro_def(
5200 &source_map::respan(lo, VisibilityKind::Inherited),
5204 id: ast::DUMMY_NODE_ID,
5205 node: StmtKind::Item(macro_def),
5206 span: lo.to(self.prev_span),
5208 // Starts like a simple path, being careful to avoid contextual keywords
5209 // such as a union items, item with `crate` visibility or auto trait items.
5210 // Our goal here is to parse an arbitrary path `a::b::c` but not something that starts
5211 // like a path (1 token), but it fact not a path.
5212 // `union::b::c` - path, `union U { ... }` - not a path.
5213 // `crate::b::c` - path, `crate struct S;` - not a path.
5214 } else if self.token.is_path_start() &&
5215 !self.token.is_qpath_start() &&
5216 !self.is_union_item() &&
5217 !self.is_crate_vis() &&
5218 !self.is_existential_type_decl() &&
5219 !self.is_auto_trait_item() &&
5220 !self.is_async_fn() {
5221 let pth = self.parse_path(PathStyle::Expr)?;
5223 if !self.eat(&token::Not) {
5224 let expr = if self.check(&token::OpenDelim(token::Brace)) {
5225 self.parse_struct_expr(lo, pth, ThinVec::new())?
5227 let hi = self.prev_span;
5228 self.mk_expr(lo.to(hi), ExprKind::Path(None, pth), ThinVec::new())
5231 let expr = self.with_res(Restrictions::STMT_EXPR, |this| {
5232 let expr = this.parse_dot_or_call_expr_with(expr, lo, attrs.into())?;
5233 this.parse_assoc_expr_with(0, LhsExpr::AlreadyParsed(expr))
5236 return Ok(Some(Stmt {
5237 id: ast::DUMMY_NODE_ID,
5238 node: StmtKind::Expr(expr),
5239 span: lo.to(self.prev_span),
5243 // it's a macro invocation
5244 let id = match self.token {
5245 token::OpenDelim(_) => keywords::Invalid.ident(), // no special identifier
5246 _ => self.parse_ident()?,
5249 // check that we're pointing at delimiters (need to check
5250 // again after the `if`, because of `parse_ident`
5251 // consuming more tokens).
5253 token::OpenDelim(_) => {}
5255 // we only expect an ident if we didn't parse one
5257 let ident_str = if id.name == keywords::Invalid.name() {
5262 let tok_str = self.this_token_descr();
5263 let mut err = self.fatal(&format!("expected {}`(` or `{{`, found {}",
5266 err.span_label(self.span, format!("expected {}`(` or `{{`", ident_str));
5271 let (delim, tts) = self.expect_delimited_token_tree()?;
5272 let hi = self.prev_span;
5274 let style = if delim == MacDelimiter::Brace {
5275 MacStmtStyle::Braces
5277 MacStmtStyle::NoBraces
5280 if id.name == keywords::Invalid.name() {
5281 let mac = respan(lo.to(hi), Mac_ { path: pth, tts, delim });
5282 let node = if delim == MacDelimiter::Brace ||
5283 self.token == token::Semi || self.token == token::Eof {
5284 StmtKind::Mac(P((mac, style, attrs.into())))
5286 // We used to incorrectly stop parsing macro-expanded statements here.
5287 // If the next token will be an error anyway but could have parsed with the
5288 // earlier behavior, stop parsing here and emit a warning to avoid breakage.
5289 else if macro_legacy_warnings && self.token.can_begin_expr() && match self.token {
5290 // These can continue an expression, so we can't stop parsing and warn.
5291 token::OpenDelim(token::Paren) | token::OpenDelim(token::Bracket) |
5292 token::BinOp(token::Minus) | token::BinOp(token::Star) |
5293 token::BinOp(token::And) | token::BinOp(token::Or) |
5294 token::AndAnd | token::OrOr |
5295 token::DotDot | token::DotDotDot | token::DotDotEq => false,
5298 self.warn_missing_semicolon();
5299 StmtKind::Mac(P((mac, style, attrs.into())))
5301 let e = self.mk_expr(mac.span, ExprKind::Mac(mac), ThinVec::new());
5302 let e = self.maybe_recover_from_bad_qpath(e, true)?;
5303 let e = self.parse_dot_or_call_expr_with(e, lo, attrs.into())?;
5304 let e = self.parse_assoc_expr_with(0, LhsExpr::AlreadyParsed(e))?;
5308 id: ast::DUMMY_NODE_ID,
5313 // if it has a special ident, it's definitely an item
5315 // Require a semicolon or braces.
5316 if style != MacStmtStyle::Braces && !self.eat(&token::Semi) {
5317 self.report_invalid_macro_expansion_item();
5319 let span = lo.to(hi);
5321 id: ast::DUMMY_NODE_ID,
5323 node: StmtKind::Item({
5325 span, id /*id is good here*/,
5326 ItemKind::Mac(respan(span, Mac_ { path: pth, tts, delim })),
5327 respan(lo, VisibilityKind::Inherited),
5333 // FIXME: Bad copy of attrs
5334 let old_directory_ownership =
5335 mem::replace(&mut self.directory.ownership, DirectoryOwnership::UnownedViaBlock);
5336 let item = self.parse_item_(attrs.clone(), false, true)?;
5337 self.directory.ownership = old_directory_ownership;
5341 id: ast::DUMMY_NODE_ID,
5342 span: lo.to(i.span),
5343 node: StmtKind::Item(i),
5346 let unused_attrs = |attrs: &[Attribute], s: &mut Self| {
5347 if !attrs.is_empty() {
5348 if s.prev_token_kind == PrevTokenKind::DocComment {
5349 s.span_fatal_err(s.prev_span, Error::UselessDocComment).emit();
5350 } else if attrs.iter().any(|a| a.style == AttrStyle::Outer) {
5351 s.span_err(s.span, "expected statement after outer attribute");
5356 // Do not attempt to parse an expression if we're done here.
5357 if self.token == token::Semi {
5358 unused_attrs(&attrs, self);
5363 if self.token == token::CloseDelim(token::Brace) {
5364 unused_attrs(&attrs, self);
5368 // Remainder are line-expr stmts.
5369 let e = self.parse_expr_res(
5370 Restrictions::STMT_EXPR, Some(attrs.into()))?;
5372 id: ast::DUMMY_NODE_ID,
5373 span: lo.to(e.span),
5374 node: StmtKind::Expr(e),
5381 /// Checks if this expression is a successfully parsed statement.
5382 fn expr_is_complete(&mut self, e: &Expr) -> bool {
5383 self.restrictions.contains(Restrictions::STMT_EXPR) &&
5384 !classify::expr_requires_semi_to_be_stmt(e)
5387 /// Parses a block. No inner attributes are allowed.
5388 pub fn parse_block(&mut self) -> PResult<'a, P<Block>> {
5389 maybe_whole!(self, NtBlock, |x| x);
5393 if !self.eat(&token::OpenDelim(token::Brace)) {
5395 let tok = self.this_token_descr();
5396 let mut e = self.span_fatal(sp, &format!("expected `{{`, found {}", tok));
5397 let do_not_suggest_help =
5398 self.token.is_keyword(keywords::In) || self.token == token::Colon;
5400 if self.token.is_ident_named("and") {
5401 e.span_suggestion_short(
5403 "use `&&` instead of `and` for the boolean operator",
5405 Applicability::MaybeIncorrect,
5408 if self.token.is_ident_named("or") {
5409 e.span_suggestion_short(
5411 "use `||` instead of `or` for the boolean operator",
5413 Applicability::MaybeIncorrect,
5417 // Check to see if the user has written something like
5422 // Which is valid in other languages, but not Rust.
5423 match self.parse_stmt_without_recovery(false) {
5425 if self.look_ahead(1, |t| t == &token::OpenDelim(token::Brace))
5426 || do_not_suggest_help {
5427 // if the next token is an open brace (e.g., `if a b {`), the place-
5428 // inside-a-block suggestion would be more likely wrong than right
5429 e.span_label(sp, "expected `{`");
5432 let mut stmt_span = stmt.span;
5433 // expand the span to include the semicolon, if it exists
5434 if self.eat(&token::Semi) {
5435 stmt_span = stmt_span.with_hi(self.prev_span.hi());
5437 let sugg = pprust::to_string(|s| {
5438 use crate::print::pprust::{PrintState, INDENT_UNIT};
5439 s.ibox(INDENT_UNIT)?;
5441 s.print_stmt(&stmt)?;
5442 s.bclose_maybe_open(stmt.span, INDENT_UNIT, false)
5446 "try placing this code inside a block",
5448 // speculative, has been misleading in the past (closed Issue #46836)
5449 Applicability::MaybeIncorrect
5453 self.recover_stmt_(SemiColonMode::Break, BlockMode::Ignore);
5454 self.cancel(&mut e);
5458 e.span_label(sp, "expected `{`");
5462 self.parse_block_tail(lo, BlockCheckMode::Default)
5465 /// Parses a block. Inner attributes are allowed.
5466 fn parse_inner_attrs_and_block(&mut self) -> PResult<'a, (Vec<Attribute>, P<Block>)> {
5467 maybe_whole!(self, NtBlock, |x| (Vec::new(), x));
5470 self.expect(&token::OpenDelim(token::Brace))?;
5471 Ok((self.parse_inner_attributes()?,
5472 self.parse_block_tail(lo, BlockCheckMode::Default)?))
5475 /// Parses the rest of a block expression or function body.
5476 /// Precondition: already parsed the '{'.
5477 fn parse_block_tail(&mut self, lo: Span, s: BlockCheckMode) -> PResult<'a, P<Block>> {
5478 let mut stmts = vec![];
5479 while !self.eat(&token::CloseDelim(token::Brace)) {
5480 let stmt = match self.parse_full_stmt(false) {
5483 self.recover_stmt_(SemiColonMode::Ignore, BlockMode::Ignore);
5485 id: ast::DUMMY_NODE_ID,
5486 node: StmtKind::Expr(DummyResult::raw_expr(self.span, true)),
5492 if let Some(stmt) = stmt {
5494 } else if self.token == token::Eof {
5497 // Found only `;` or `}`.
5503 id: ast::DUMMY_NODE_ID,
5505 span: lo.to(self.prev_span),
5509 /// Parses a statement, including the trailing semicolon.
5510 crate fn parse_full_stmt(&mut self, macro_legacy_warnings: bool) -> PResult<'a, Option<Stmt>> {
5511 // skip looking for a trailing semicolon when we have an interpolated statement
5512 maybe_whole!(self, NtStmt, |x| Some(x));
5514 let mut stmt = match self.parse_stmt_without_recovery(macro_legacy_warnings)? {
5516 None => return Ok(None),
5520 StmtKind::Expr(ref expr) if self.token != token::Eof => {
5521 // expression without semicolon
5522 if classify::expr_requires_semi_to_be_stmt(expr) {
5523 // Just check for errors and recover; do not eat semicolon yet.
5525 self.expect_one_of(&[], &[token::Semi, token::CloseDelim(token::Brace)])
5528 self.recover_stmt();
5532 StmtKind::Local(..) => {
5533 // We used to incorrectly allow a macro-expanded let statement to lack a semicolon.
5534 if macro_legacy_warnings && self.token != token::Semi {
5535 self.warn_missing_semicolon();
5537 self.expect_one_of(&[], &[token::Semi])?;
5543 if self.eat(&token::Semi) {
5544 stmt = stmt.add_trailing_semicolon();
5547 stmt.span = stmt.span.with_hi(self.prev_span.hi());
5551 fn warn_missing_semicolon(&self) {
5552 self.diagnostic().struct_span_warn(self.span, {
5553 &format!("expected `;`, found {}", self.this_token_descr())
5555 "This was erroneously allowed and will become a hard error in a future release"
5559 fn err_dotdotdot_syntax(&self, span: Span) {
5560 self.diagnostic().struct_span_err(span, {
5561 "unexpected token: `...`"
5563 span, "use `..` for an exclusive range", "..".to_owned(),
5564 Applicability::MaybeIncorrect
5566 span, "or `..=` for an inclusive range", "..=".to_owned(),
5567 Applicability::MaybeIncorrect
5571 /// Parses bounds of a type parameter `BOUND + BOUND + ...`, possibly with trailing `+`.
5574 /// BOUND = TY_BOUND | LT_BOUND
5575 /// LT_BOUND = LIFETIME (e.g., `'a`)
5576 /// TY_BOUND = TY_BOUND_NOPAREN | (TY_BOUND_NOPAREN)
5577 /// TY_BOUND_NOPAREN = [?] [for<LT_PARAM_DEFS>] SIMPLE_PATH (e.g., `?for<'a: 'b> m::Trait<'a>`)
5579 fn parse_generic_bounds_common(&mut self,
5581 colon_span: Option<Span>) -> PResult<'a, GenericBounds> {
5582 let mut bounds = Vec::new();
5583 let mut negative_bounds = Vec::new();
5584 let mut last_plus_span = None;
5585 let mut was_negative = false;
5587 // This needs to be synchronized with `Token::can_begin_bound`.
5588 let is_bound_start = self.check_path() || self.check_lifetime() ||
5589 self.check(&token::Not) || // used for error reporting only
5590 self.check(&token::Question) ||
5591 self.check_keyword(keywords::For) ||
5592 self.check(&token::OpenDelim(token::Paren));
5595 let has_parens = self.eat(&token::OpenDelim(token::Paren));
5596 let inner_lo = self.span;
5597 let is_negative = self.eat(&token::Not);
5598 let question = if self.eat(&token::Question) { Some(self.prev_span) } else { None };
5599 if self.token.is_lifetime() {
5600 if let Some(question_span) = question {
5601 self.span_err(question_span,
5602 "`?` may only modify trait bounds, not lifetime bounds");
5604 bounds.push(GenericBound::Outlives(self.expect_lifetime()));
5606 let inner_span = inner_lo.to(self.prev_span);
5607 self.expect(&token::CloseDelim(token::Paren))?;
5608 let mut err = self.struct_span_err(
5609 lo.to(self.prev_span),
5610 "parenthesized lifetime bounds are not supported"
5612 if let Ok(snippet) = self.sess.source_map().span_to_snippet(inner_span) {
5613 err.span_suggestion_short(
5614 lo.to(self.prev_span),
5615 "remove the parentheses",
5617 Applicability::MachineApplicable
5623 let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
5624 let path = self.parse_path(PathStyle::Type)?;
5626 self.expect(&token::CloseDelim(token::Paren))?;
5628 let poly_span = lo.to(self.prev_span);
5630 was_negative = true;
5631 if let Some(sp) = last_plus_span.or(colon_span) {
5632 negative_bounds.push(sp.to(poly_span));
5635 let poly_trait = PolyTraitRef::new(lifetime_defs, path, poly_span);
5636 let modifier = if question.is_some() {
5637 TraitBoundModifier::Maybe
5639 TraitBoundModifier::None
5641 bounds.push(GenericBound::Trait(poly_trait, modifier));
5648 if !allow_plus || !self.eat_plus() {
5651 last_plus_span = Some(self.prev_span);
5655 if !negative_bounds.is_empty() || was_negative {
5656 let plural = negative_bounds.len() > 1;
5657 let last_span = negative_bounds.last().map(|sp| *sp);
5658 let mut err = self.struct_span_err(
5660 "negative trait bounds are not supported",
5662 if let Some(sp) = last_span {
5663 err.span_label(sp, "negative trait bounds are not supported");
5665 if let Some(bound_list) = colon_span {
5666 let bound_list = bound_list.to(self.prev_span);
5667 let mut new_bound_list = String::new();
5668 if !bounds.is_empty() {
5669 let mut snippets = bounds.iter().map(|bound| bound.span())
5670 .map(|span| self.sess.source_map().span_to_snippet(span));
5671 while let Some(Ok(snippet)) = snippets.next() {
5672 new_bound_list.push_str(" + ");
5673 new_bound_list.push_str(&snippet);
5675 new_bound_list = new_bound_list.replacen(" +", ":", 1);
5677 err.span_suggestion_hidden(
5679 &format!("remove the trait bound{}", if plural { "s" } else { "" }),
5681 Applicability::MachineApplicable,
5690 crate fn parse_generic_bounds(&mut self,
5691 colon_span: Option<Span>) -> PResult<'a, GenericBounds> {
5692 self.parse_generic_bounds_common(true, colon_span)
5695 /// Parses bounds of a lifetime parameter `BOUND + BOUND + BOUND`, possibly with trailing `+`.
5698 /// BOUND = LT_BOUND (e.g., `'a`)
5700 fn parse_lt_param_bounds(&mut self) -> GenericBounds {
5701 let mut lifetimes = Vec::new();
5702 while self.check_lifetime() {
5703 lifetimes.push(ast::GenericBound::Outlives(self.expect_lifetime()));
5705 if !self.eat_plus() {
5712 /// Matches `typaram = IDENT (`?` unbound)? optbounds ( EQ ty )?`.
5713 fn parse_ty_param(&mut self,
5714 preceding_attrs: Vec<Attribute>)
5715 -> PResult<'a, GenericParam> {
5716 let ident = self.parse_ident()?;
5718 // Parse optional colon and param bounds.
5719 let bounds = if self.eat(&token::Colon) {
5720 self.parse_generic_bounds(Some(self.prev_span))?
5725 let default = if self.eat(&token::Eq) {
5726 Some(self.parse_ty()?)
5733 id: ast::DUMMY_NODE_ID,
5734 attrs: preceding_attrs.into(),
5736 kind: GenericParamKind::Type {
5742 /// Parses the following grammar:
5744 /// TraitItemAssocTy = Ident ["<"...">"] [":" [GenericBounds]] ["where" ...] ["=" Ty]
5745 fn parse_trait_item_assoc_ty(&mut self)
5746 -> PResult<'a, (Ident, TraitItemKind, ast::Generics)> {
5747 let ident = self.parse_ident()?;
5748 let mut generics = self.parse_generics()?;
5750 // Parse optional colon and param bounds.
5751 let bounds = if self.eat(&token::Colon) {
5752 self.parse_generic_bounds(None)?
5756 generics.where_clause = self.parse_where_clause()?;
5758 let default = if self.eat(&token::Eq) {
5759 Some(self.parse_ty()?)
5763 self.expect(&token::Semi)?;
5765 Ok((ident, TraitItemKind::Type(bounds, default), generics))
5768 fn parse_const_param(&mut self, preceding_attrs: Vec<Attribute>) -> PResult<'a, GenericParam> {
5769 self.expect_keyword(keywords::Const)?;
5770 let ident = self.parse_ident()?;
5771 self.expect(&token::Colon)?;
5772 let ty = self.parse_ty()?;
5776 id: ast::DUMMY_NODE_ID,
5777 attrs: preceding_attrs.into(),
5779 kind: GenericParamKind::Const {
5785 /// Parses a (possibly empty) list of lifetime and type parameters, possibly including
5786 /// a trailing comma and erroneous trailing attributes.
5787 crate fn parse_generic_params(&mut self) -> PResult<'a, Vec<ast::GenericParam>> {
5788 let mut params = Vec::new();
5790 let attrs = self.parse_outer_attributes()?;
5791 if self.check_lifetime() {
5792 let lifetime = self.expect_lifetime();
5793 // Parse lifetime parameter.
5794 let bounds = if self.eat(&token::Colon) {
5795 self.parse_lt_param_bounds()
5799 params.push(ast::GenericParam {
5800 ident: lifetime.ident,
5802 attrs: attrs.into(),
5804 kind: ast::GenericParamKind::Lifetime,
5806 } else if self.check_keyword(keywords::Const) {
5807 // Parse const parameter.
5808 params.push(self.parse_const_param(attrs)?);
5809 } else if self.check_ident() {
5810 // Parse type parameter.
5811 params.push(self.parse_ty_param(attrs)?);
5813 // Check for trailing attributes and stop parsing.
5814 if !attrs.is_empty() {
5815 if !params.is_empty() {
5816 self.struct_span_err(
5818 &format!("trailing attribute after generic parameter"),
5820 .span_label(attrs[0].span, "attributes must go before parameters")
5823 self.struct_span_err(
5825 &format!("attribute without generic parameters"),
5829 "attributes are only permitted when preceding parameters",
5837 if !self.eat(&token::Comma) {
5844 /// Parses a set of optional generic type parameter declarations. Where
5845 /// clauses are not parsed here, and must be added later via
5846 /// `parse_where_clause()`.
5848 /// matches generics = ( ) | ( < > ) | ( < typaramseq ( , )? > ) | ( < lifetimes ( , )? > )
5849 /// | ( < lifetimes , typaramseq ( , )? > )
5850 /// where typaramseq = ( typaram ) | ( typaram , typaramseq )
5851 fn parse_generics(&mut self) -> PResult<'a, ast::Generics> {
5852 maybe_whole!(self, NtGenerics, |x| x);
5854 let span_lo = self.span;
5856 let params = self.parse_generic_params()?;
5860 where_clause: WhereClause {
5861 id: ast::DUMMY_NODE_ID,
5862 predicates: Vec::new(),
5863 span: syntax_pos::DUMMY_SP,
5865 span: span_lo.to(self.prev_span),
5868 Ok(ast::Generics::default())
5872 /// Parses generic args (within a path segment) with recovery for extra leading angle brackets.
5873 /// For the purposes of understanding the parsing logic of generic arguments, this function
5874 /// can be thought of being the same as just calling `self.parse_generic_args()` if the source
5875 /// had the correct amount of leading angle brackets.
5877 /// ```ignore (diagnostics)
5878 /// bar::<<<<T as Foo>::Output>();
5879 /// ^^ help: remove extra angle brackets
5881 fn parse_generic_args_with_leaning_angle_bracket_recovery(
5885 ) -> PResult<'a, (Vec<GenericArg>, Vec<TypeBinding>)> {
5886 // We need to detect whether there are extra leading left angle brackets and produce an
5887 // appropriate error and suggestion. This cannot be implemented by looking ahead at
5888 // upcoming tokens for a matching `>` character - if there are unmatched `<` tokens
5889 // then there won't be matching `>` tokens to find.
5891 // To explain how this detection works, consider the following example:
5893 // ```ignore (diagnostics)
5894 // bar::<<<<T as Foo>::Output>();
5895 // ^^ help: remove extra angle brackets
5898 // Parsing of the left angle brackets starts in this function. We start by parsing the
5899 // `<` token (incrementing the counter of unmatched angle brackets on `Parser` via
5902 // *Upcoming tokens:* `<<<<T as Foo>::Output>;`
5903 // *Unmatched count:* 1
5904 // *`parse_path_segment` calls deep:* 0
5906 // This has the effect of recursing as this function is called if a `<` character
5907 // is found within the expected generic arguments:
5909 // *Upcoming tokens:* `<<<T as Foo>::Output>;`
5910 // *Unmatched count:* 2
5911 // *`parse_path_segment` calls deep:* 1
5913 // Eventually we will have recursed until having consumed all of the `<` tokens and
5914 // this will be reflected in the count:
5916 // *Upcoming tokens:* `T as Foo>::Output>;`
5917 // *Unmatched count:* 4
5918 // `parse_path_segment` calls deep:* 3
5920 // The parser will continue until reaching the first `>` - this will decrement the
5921 // unmatched angle bracket count and return to the parent invocation of this function
5922 // having succeeded in parsing:
5924 // *Upcoming tokens:* `::Output>;`
5925 // *Unmatched count:* 3
5926 // *`parse_path_segment` calls deep:* 2
5928 // This will continue until the next `>` character which will also return successfully
5929 // to the parent invocation of this function and decrement the count:
5931 // *Upcoming tokens:* `;`
5932 // *Unmatched count:* 2
5933 // *`parse_path_segment` calls deep:* 1
5935 // At this point, this function will expect to find another matching `>` character but
5936 // won't be able to and will return an error. This will continue all the way up the
5937 // call stack until the first invocation:
5939 // *Upcoming tokens:* `;`
5940 // *Unmatched count:* 2
5941 // *`parse_path_segment` calls deep:* 0
5943 // In doing this, we have managed to work out how many unmatched leading left angle
5944 // brackets there are, but we cannot recover as the unmatched angle brackets have
5945 // already been consumed. To remedy this, we keep a snapshot of the parser state
5946 // before we do the above. We can then inspect whether we ended up with a parsing error
5947 // and unmatched left angle brackets and if so, restore the parser state before we
5948 // consumed any `<` characters to emit an error and consume the erroneous tokens to
5949 // recover by attempting to parse again.
5951 // In practice, the recursion of this function is indirect and there will be other
5952 // locations that consume some `<` characters - as long as we update the count when
5953 // this happens, it isn't an issue.
5955 let is_first_invocation = style == PathStyle::Expr;
5956 // Take a snapshot before attempting to parse - we can restore this later.
5957 let snapshot = if is_first_invocation {
5963 debug!("parse_generic_args_with_leading_angle_bracket_recovery: (snapshotting)");
5964 match self.parse_generic_args() {
5965 Ok(value) => Ok(value),
5966 Err(ref mut e) if is_first_invocation && self.unmatched_angle_bracket_count > 0 => {
5967 // Cancel error from being unable to find `>`. We know the error
5968 // must have been this due to a non-zero unmatched angle bracket
5972 // Swap `self` with our backup of the parser state before attempting to parse
5973 // generic arguments.
5974 let snapshot = mem::replace(self, snapshot.unwrap());
5977 "parse_generic_args_with_leading_angle_bracket_recovery: (snapshot failure) \
5978 snapshot.count={:?}",
5979 snapshot.unmatched_angle_bracket_count,
5982 // Eat the unmatched angle brackets.
5983 for _ in 0..snapshot.unmatched_angle_bracket_count {
5987 // Make a span over ${unmatched angle bracket count} characters.
5988 let span = lo.with_hi(
5989 lo.lo() + BytePos(snapshot.unmatched_angle_bracket_count)
5991 let plural = snapshot.unmatched_angle_bracket_count > 1;
5996 "unmatched angle bracket{}",
5997 if plural { "s" } else { "" }
6003 "remove extra angle bracket{}",
6004 if plural { "s" } else { "" }
6007 Applicability::MachineApplicable,
6011 // Try again without unmatched angle bracket characters.
6012 self.parse_generic_args()
6018 /// Parses (possibly empty) list of lifetime and type arguments and associated type bindings,
6019 /// possibly including trailing comma.
6020 fn parse_generic_args(&mut self) -> PResult<'a, (Vec<GenericArg>, Vec<TypeBinding>)> {
6021 let mut args = Vec::new();
6022 let mut bindings = Vec::new();
6023 let mut misplaced_assoc_ty_bindings: Vec<Span> = Vec::new();
6024 let mut assoc_ty_bindings: Vec<Span> = Vec::new();
6026 let args_lo = self.span;
6029 if self.check_lifetime() && self.look_ahead(1, |t| !t.is_like_plus()) {
6030 // Parse lifetime argument.
6031 args.push(GenericArg::Lifetime(self.expect_lifetime()));
6032 misplaced_assoc_ty_bindings.append(&mut assoc_ty_bindings);
6033 } else if self.check_ident() && self.look_ahead(1, |t| t == &token::Eq) {
6034 // Parse associated type binding.
6036 let ident = self.parse_ident()?;
6038 let ty = self.parse_ty()?;
6039 let span = lo.to(self.prev_span);
6040 bindings.push(TypeBinding {
6041 id: ast::DUMMY_NODE_ID,
6046 assoc_ty_bindings.push(span);
6047 } else if self.check_const_arg() {
6048 // Parse const argument.
6049 let expr = if let token::OpenDelim(token::Brace) = self.token {
6050 self.parse_block_expr(None, self.span, BlockCheckMode::Default, ThinVec::new())?
6051 } else if self.token.is_ident() {
6052 // FIXME(const_generics): to distinguish between idents for types and consts,
6053 // we should introduce a GenericArg::Ident in the AST and distinguish when
6054 // lowering to the HIR. For now, idents for const args are not permitted.
6056 self.fatal("identifiers may currently not be used for const generics")
6059 // FIXME(const_generics): this currently conflicts with emplacement syntax
6060 // with negative integer literals.
6061 self.parse_literal_maybe_minus()?
6063 let value = AnonConst {
6064 id: ast::DUMMY_NODE_ID,
6067 args.push(GenericArg::Const(value));
6068 misplaced_assoc_ty_bindings.append(&mut assoc_ty_bindings);
6069 } else if self.check_type() {
6070 // Parse type argument.
6071 args.push(GenericArg::Type(self.parse_ty()?));
6072 misplaced_assoc_ty_bindings.append(&mut assoc_ty_bindings);
6077 if !self.eat(&token::Comma) {
6082 // FIXME: we would like to report this in ast_validation instead, but we currently do not
6083 // preserve ordering of generic parameters with respect to associated type binding, so we
6084 // lose that information after parsing.
6085 if misplaced_assoc_ty_bindings.len() > 0 {
6086 let mut err = self.struct_span_err(
6087 args_lo.to(self.prev_span),
6088 "associated type bindings must be declared after generic parameters",
6090 for span in misplaced_assoc_ty_bindings {
6093 "this associated type binding should be moved after the generic parameters",
6099 Ok((args, bindings))
6102 /// Parses an optional where-clause and places it in `generics`.
6104 /// ```ignore (only-for-syntax-highlight)
6105 /// where T : Trait<U, V> + 'b, 'a : 'b
6107 fn parse_where_clause(&mut self) -> PResult<'a, WhereClause> {
6108 maybe_whole!(self, NtWhereClause, |x| x);
6110 let mut where_clause = WhereClause {
6111 id: ast::DUMMY_NODE_ID,
6112 predicates: Vec::new(),
6113 span: syntax_pos::DUMMY_SP,
6116 if !self.eat_keyword(keywords::Where) {
6117 return Ok(where_clause);
6119 let lo = self.prev_span;
6121 // We are considering adding generics to the `where` keyword as an alternative higher-rank
6122 // parameter syntax (as in `where<'a>` or `where<T>`. To avoid that being a breaking
6123 // change we parse those generics now, but report an error.
6124 if self.choose_generics_over_qpath() {
6125 let generics = self.parse_generics()?;
6126 self.struct_span_err(
6128 "generic parameters on `where` clauses are reserved for future use",
6130 .span_label(generics.span, "currently unsupported")
6136 if self.check_lifetime() && self.look_ahead(1, |t| !t.is_like_plus()) {
6137 let lifetime = self.expect_lifetime();
6138 // Bounds starting with a colon are mandatory, but possibly empty.
6139 self.expect(&token::Colon)?;
6140 let bounds = self.parse_lt_param_bounds();
6141 where_clause.predicates.push(ast::WherePredicate::RegionPredicate(
6142 ast::WhereRegionPredicate {
6143 span: lo.to(self.prev_span),
6148 } else if self.check_type() {
6149 // Parse optional `for<'a, 'b>`.
6150 // This `for` is parsed greedily and applies to the whole predicate,
6151 // the bounded type can have its own `for` applying only to it.
6152 // Example 1: for<'a> Trait1<'a>: Trait2<'a /*ok*/>
6153 // Example 2: (for<'a> Trait1<'a>): Trait2<'a /*not ok*/>
6154 // Example 3: for<'a> for<'b> Trait1<'a, 'b>: Trait2<'a /*ok*/, 'b /*not ok*/>
6155 let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
6157 // Parse type with mandatory colon and (possibly empty) bounds,
6158 // or with mandatory equality sign and the second type.
6159 let ty = self.parse_ty()?;
6160 if self.eat(&token::Colon) {
6161 let bounds = self.parse_generic_bounds(Some(self.prev_span))?;
6162 where_clause.predicates.push(ast::WherePredicate::BoundPredicate(
6163 ast::WhereBoundPredicate {
6164 span: lo.to(self.prev_span),
6165 bound_generic_params: lifetime_defs,
6170 // FIXME: Decide what should be used here, `=` or `==`.
6171 // FIXME: We are just dropping the binders in lifetime_defs on the floor here.
6172 } else if self.eat(&token::Eq) || self.eat(&token::EqEq) {
6173 let rhs_ty = self.parse_ty()?;
6174 where_clause.predicates.push(ast::WherePredicate::EqPredicate(
6175 ast::WhereEqPredicate {
6176 span: lo.to(self.prev_span),
6179 id: ast::DUMMY_NODE_ID,
6183 return self.unexpected();
6189 if !self.eat(&token::Comma) {
6194 where_clause.span = lo.to(self.prev_span);
6198 fn parse_fn_args(&mut self, named_args: bool, allow_c_variadic: bool)
6199 -> PResult<'a, (Vec<Arg> , bool)> {
6200 self.expect(&token::OpenDelim(token::Paren))?;
6203 let mut c_variadic = false;
6204 let (args, recovered): (Vec<Option<Arg>>, bool) =
6205 self.parse_seq_to_before_end(
6206 &token::CloseDelim(token::Paren),
6207 SeqSep::trailing_allowed(token::Comma),
6209 // If the argument is a C-variadic argument we should not
6210 // enforce named arguments.
6211 let enforce_named_args = if p.token == token::DotDotDot {
6216 match p.parse_arg_general(enforce_named_args, false,
6219 if let TyKind::CVarArgs = arg.ty.node {
6221 if p.token != token::CloseDelim(token::Paren) {
6224 "`...` must be the last argument of a C-variadic function");
6235 let lo = p.prev_span;
6236 // Skip every token until next possible arg or end.
6237 p.eat_to_tokens(&[&token::Comma, &token::CloseDelim(token::Paren)]);
6238 // Create a placeholder argument for proper arg count (issue #34264).
6239 let span = lo.to(p.prev_span);
6240 Ok(Some(dummy_arg(span)))
6247 self.eat(&token::CloseDelim(token::Paren));
6250 let args: Vec<_> = args.into_iter().filter_map(|x| x).collect();
6252 if c_variadic && args.is_empty() {
6254 "C-variadic function must be declared with at least one named argument");
6257 Ok((args, c_variadic))
6260 /// Parses the argument list and result type of a function declaration.
6261 fn parse_fn_decl(&mut self, allow_c_variadic: bool) -> PResult<'a, P<FnDecl>> {
6263 let (args, c_variadic) = self.parse_fn_args(true, allow_c_variadic)?;
6264 let ret_ty = self.parse_ret_ty(true)?;
6273 /// Returns the parsed optional self argument and whether a self shortcut was used.
6274 fn parse_self_arg(&mut self) -> PResult<'a, Option<Arg>> {
6275 let expect_ident = |this: &mut Self| match this.token {
6276 // Preserve hygienic context.
6277 token::Ident(ident, _) =>
6278 { let span = this.span; this.bump(); Ident::new(ident.name, span) }
6281 let isolated_self = |this: &mut Self, n| {
6282 this.look_ahead(n, |t| t.is_keyword(keywords::SelfLower)) &&
6283 this.look_ahead(n + 1, |t| t != &token::ModSep)
6286 // Parse optional self parameter of a method.
6287 // Only a limited set of initial token sequences is considered self parameters, anything
6288 // else is parsed as a normal function parameter list, so some lookahead is required.
6289 let eself_lo = self.span;
6290 let (eself, eself_ident, eself_hi) = match self.token {
6291 token::BinOp(token::And) => {
6297 (if isolated_self(self, 1) {
6299 SelfKind::Region(None, Mutability::Immutable)
6300 } else if self.look_ahead(1, |t| t.is_keyword(keywords::Mut)) &&
6301 isolated_self(self, 2) {
6304 SelfKind::Region(None, Mutability::Mutable)
6305 } else if self.look_ahead(1, |t| t.is_lifetime()) &&
6306 isolated_self(self, 2) {
6308 let lt = self.expect_lifetime();
6309 SelfKind::Region(Some(lt), Mutability::Immutable)
6310 } else if self.look_ahead(1, |t| t.is_lifetime()) &&
6311 self.look_ahead(2, |t| t.is_keyword(keywords::Mut)) &&
6312 isolated_self(self, 3) {
6314 let lt = self.expect_lifetime();
6316 SelfKind::Region(Some(lt), Mutability::Mutable)
6319 }, expect_ident(self), self.prev_span)
6321 token::BinOp(token::Star) => {
6326 // Emit special error for `self` cases.
6327 let msg = "cannot pass `self` by raw pointer";
6328 (if isolated_self(self, 1) {
6330 self.struct_span_err(self.span, msg)
6331 .span_label(self.span, msg)
6333 SelfKind::Value(Mutability::Immutable)
6334 } else if self.look_ahead(1, |t| t.is_mutability()) &&
6335 isolated_self(self, 2) {
6338 self.struct_span_err(self.span, msg)
6339 .span_label(self.span, msg)
6341 SelfKind::Value(Mutability::Immutable)
6344 }, expect_ident(self), self.prev_span)
6346 token::Ident(..) => {
6347 if isolated_self(self, 0) {
6350 let eself_ident = expect_ident(self);
6351 let eself_hi = self.prev_span;
6352 (if self.eat(&token::Colon) {
6353 let ty = self.parse_ty()?;
6354 SelfKind::Explicit(ty, Mutability::Immutable)
6356 SelfKind::Value(Mutability::Immutable)
6357 }, eself_ident, eself_hi)
6358 } else if self.token.is_keyword(keywords::Mut) &&
6359 isolated_self(self, 1) {
6363 let eself_ident = expect_ident(self);
6364 let eself_hi = self.prev_span;
6365 (if self.eat(&token::Colon) {
6366 let ty = self.parse_ty()?;
6367 SelfKind::Explicit(ty, Mutability::Mutable)
6369 SelfKind::Value(Mutability::Mutable)
6370 }, eself_ident, eself_hi)
6375 _ => return Ok(None),
6378 let eself = source_map::respan(eself_lo.to(eself_hi), eself);
6379 Ok(Some(Arg::from_self(eself, eself_ident)))
6382 /// Parses the parameter list and result type of a function that may have a `self` parameter.
6383 fn parse_fn_decl_with_self<F>(&mut self, parse_arg_fn: F) -> PResult<'a, P<FnDecl>>
6384 where F: FnMut(&mut Parser<'a>) -> PResult<'a, Arg>,
6386 self.expect(&token::OpenDelim(token::Paren))?;
6388 // Parse optional self argument
6389 let self_arg = self.parse_self_arg()?;
6391 // Parse the rest of the function parameter list.
6392 let sep = SeqSep::trailing_allowed(token::Comma);
6393 let (fn_inputs, recovered) = if let Some(self_arg) = self_arg {
6394 if self.check(&token::CloseDelim(token::Paren)) {
6395 (vec![self_arg], false)
6396 } else if self.eat(&token::Comma) {
6397 let mut fn_inputs = vec![self_arg];
6398 let (mut input, recovered) = self.parse_seq_to_before_end(
6399 &token::CloseDelim(token::Paren), sep, parse_arg_fn)?;
6400 fn_inputs.append(&mut input);
6401 (fn_inputs, recovered)
6403 match self.expect_one_of(&[], &[]) {
6404 Err(err) => return Err(err),
6405 Ok(recovered) => (vec![self_arg], recovered),
6409 self.parse_seq_to_before_end(&token::CloseDelim(token::Paren), sep, parse_arg_fn)?
6413 // Parse closing paren and return type.
6414 self.expect(&token::CloseDelim(token::Paren))?;
6418 output: self.parse_ret_ty(true)?,
6423 /// Parses the `|arg, arg|` header of a closure.
6424 fn parse_fn_block_decl(&mut self) -> PResult<'a, P<FnDecl>> {
6425 let inputs_captures = {
6426 if self.eat(&token::OrOr) {
6429 self.expect(&token::BinOp(token::Or))?;
6430 let args = self.parse_seq_to_before_tokens(
6431 &[&token::BinOp(token::Or), &token::OrOr],
6432 SeqSep::trailing_allowed(token::Comma),
6433 TokenExpectType::NoExpect,
6434 |p| p.parse_fn_block_arg()
6440 let output = self.parse_ret_ty(true)?;
6443 inputs: inputs_captures,
6449 /// Parses the name and optional generic types of a function header.
6450 fn parse_fn_header(&mut self) -> PResult<'a, (Ident, ast::Generics)> {
6451 let id = self.parse_ident()?;
6452 let generics = self.parse_generics()?;
6456 fn mk_item(&mut self, span: Span, ident: Ident, node: ItemKind, vis: Visibility,
6457 attrs: Vec<Attribute>) -> P<Item> {
6461 id: ast::DUMMY_NODE_ID,
6469 /// Parses an item-position function declaration.
6470 fn parse_item_fn(&mut self,
6472 mut asyncness: Spanned<IsAsync>,
6473 constness: Spanned<Constness>,
6475 -> PResult<'a, ItemInfo> {
6476 let (ident, mut generics) = self.parse_fn_header()?;
6477 let allow_c_variadic = abi == Abi::C && unsafety == Unsafety::Unsafe;
6478 let decl = self.parse_fn_decl(allow_c_variadic)?;
6479 generics.where_clause = self.parse_where_clause()?;
6480 let (inner_attrs, body) = self.parse_inner_attrs_and_block()?;
6481 self.construct_async_arguments(&mut asyncness, &decl);
6482 let header = FnHeader { unsafety, asyncness, constness, abi };
6483 Ok((ident, ItemKind::Fn(decl, header, generics, body), Some(inner_attrs)))
6486 /// Returns `true` if we are looking at `const ID`
6487 /// (returns `false` for things like `const fn`, etc.).
6488 fn is_const_item(&mut self) -> bool {
6489 self.token.is_keyword(keywords::Const) &&
6490 !self.look_ahead(1, |t| t.is_keyword(keywords::Fn)) &&
6491 !self.look_ahead(1, |t| t.is_keyword(keywords::Unsafe))
6494 /// Parses all the "front matter" for a `fn` declaration, up to
6495 /// and including the `fn` keyword:
6499 /// - `const unsafe fn`
6502 fn parse_fn_front_matter(&mut self)
6510 let is_const_fn = self.eat_keyword(keywords::Const);
6511 let const_span = self.prev_span;
6512 let unsafety = self.parse_unsafety();
6513 let asyncness = self.parse_asyncness();
6514 let asyncness = respan(self.prev_span, asyncness);
6515 let (constness, unsafety, abi) = if is_const_fn {
6516 (respan(const_span, Constness::Const), unsafety, Abi::Rust)
6518 let abi = if self.eat_keyword(keywords::Extern) {
6519 self.parse_opt_abi()?.unwrap_or(Abi::C)
6523 (respan(self.prev_span, Constness::NotConst), unsafety, abi)
6525 if !self.eat_keyword(keywords::Fn) {
6526 // It is possible for `expect_one_of` to recover given the contents of
6527 // `self.expected_tokens`, therefore, do not use `self.unexpected()` which doesn't
6528 // account for this.
6529 if !self.expect_one_of(&[], &[])? { unreachable!() }
6531 Ok((constness, unsafety, asyncness, abi))
6534 /// Parses an impl item.
6535 pub fn parse_impl_item(&mut self, at_end: &mut bool) -> PResult<'a, ImplItem> {
6536 maybe_whole!(self, NtImplItem, |x| x);
6537 let attrs = self.parse_outer_attributes()?;
6538 let mut unclosed_delims = vec![];
6539 let (mut item, tokens) = self.collect_tokens(|this| {
6540 let item = this.parse_impl_item_(at_end, attrs);
6541 unclosed_delims.append(&mut this.unclosed_delims);
6544 self.unclosed_delims.append(&mut unclosed_delims);
6546 // See `parse_item` for why this clause is here.
6547 if !item.attrs.iter().any(|attr| attr.style == AttrStyle::Inner) {
6548 item.tokens = Some(tokens);
6553 fn parse_impl_item_(&mut self,
6555 mut attrs: Vec<Attribute>) -> PResult<'a, ImplItem> {
6557 let vis = self.parse_visibility(false)?;
6558 let defaultness = self.parse_defaultness();
6559 let (name, node, generics) = if let Some(type_) = self.eat_type() {
6560 let (name, alias, generics) = type_?;
6561 let kind = match alias {
6562 AliasKind::Weak(typ) => ast::ImplItemKind::Type(typ),
6563 AliasKind::Existential(bounds) => ast::ImplItemKind::Existential(bounds),
6565 (name, kind, generics)
6566 } else if self.is_const_item() {
6567 // This parses the grammar:
6568 // ImplItemConst = "const" Ident ":" Ty "=" Expr ";"
6569 self.expect_keyword(keywords::Const)?;
6570 let name = self.parse_ident()?;
6571 self.expect(&token::Colon)?;
6572 let typ = self.parse_ty()?;
6573 self.expect(&token::Eq)?;
6574 let expr = self.parse_expr()?;
6575 self.expect(&token::Semi)?;
6576 (name, ast::ImplItemKind::Const(typ, expr), ast::Generics::default())
6578 let (name, inner_attrs, generics, node) = self.parse_impl_method(&vis, at_end)?;
6579 attrs.extend(inner_attrs);
6580 (name, node, generics)
6584 id: ast::DUMMY_NODE_ID,
6585 span: lo.to(self.prev_span),
6596 fn complain_if_pub_macro(&mut self, vis: &VisibilityKind, sp: Span) {
6598 VisibilityKind::Inherited => {}
6600 let is_macro_rules: bool = match self.token {
6601 token::Ident(sid, _) => sid.name == Symbol::intern("macro_rules"),
6604 let mut err = if is_macro_rules {
6605 let mut err = self.diagnostic()
6606 .struct_span_err(sp, "can't qualify macro_rules invocation with `pub`");
6607 err.span_suggestion(
6609 "try exporting the macro",
6610 "#[macro_export]".to_owned(),
6611 Applicability::MaybeIncorrect // speculative
6615 let mut err = self.diagnostic()
6616 .struct_span_err(sp, "can't qualify macro invocation with `pub`");
6617 err.help("try adjusting the macro to put `pub` inside the invocation");
6625 fn missing_assoc_item_kind_err(&mut self, item_type: &str, prev_span: Span)
6626 -> DiagnosticBuilder<'a>
6628 let expected_kinds = if item_type == "extern" {
6629 "missing `fn`, `type`, or `static`"
6631 "missing `fn`, `type`, or `const`"
6634 // Given this code `path(`, it seems like this is not
6635 // setting the visibility of a macro invocation, but rather
6636 // a mistyped method declaration.
6637 // Create a diagnostic pointing out that `fn` is missing.
6639 // x | pub path(&self) {
6640 // | ^ missing `fn`, `type`, or `const`
6642 // ^^ `sp` below will point to this
6643 let sp = prev_span.between(self.prev_span);
6644 let mut err = self.diagnostic().struct_span_err(
6646 &format!("{} for {}-item declaration",
6647 expected_kinds, item_type));
6648 err.span_label(sp, expected_kinds);
6652 /// Parse a method or a macro invocation in a trait impl.
6653 fn parse_impl_method(&mut self, vis: &Visibility, at_end: &mut bool)
6654 -> PResult<'a, (Ident, Vec<Attribute>, ast::Generics,
6655 ast::ImplItemKind)> {
6656 // code copied from parse_macro_use_or_failure... abstraction!
6657 if let Some(mac) = self.parse_assoc_macro_invoc("impl", Some(vis), at_end)? {
6659 Ok((keywords::Invalid.ident(), vec![], ast::Generics::default(),
6660 ast::ImplItemKind::Macro(mac)))
6662 let (constness, unsafety, mut asyncness, abi) = self.parse_fn_front_matter()?;
6663 let ident = self.parse_ident()?;
6664 let mut generics = self.parse_generics()?;
6665 let decl = self.parse_fn_decl_with_self(|p| p.parse_arg())?;
6666 generics.where_clause = self.parse_where_clause()?;
6667 self.construct_async_arguments(&mut asyncness, &decl);
6669 let (inner_attrs, body) = self.parse_inner_attrs_and_block()?;
6670 let header = ast::FnHeader { abi, unsafety, constness, asyncness };
6671 Ok((ident, inner_attrs, generics, ast::ImplItemKind::Method(
6672 ast::MethodSig { header, decl },
6678 /// Parses `trait Foo { ... }` or `trait Foo = Bar;`.
6679 fn parse_item_trait(&mut self, is_auto: IsAuto, unsafety: Unsafety) -> PResult<'a, ItemInfo> {
6680 let ident = self.parse_ident()?;
6681 let mut tps = self.parse_generics()?;
6683 // Parse optional colon and supertrait bounds.
6684 let bounds = if self.eat(&token::Colon) {
6685 self.parse_generic_bounds(Some(self.prev_span))?
6690 if self.eat(&token::Eq) {
6691 // it's a trait alias
6692 let bounds = self.parse_generic_bounds(None)?;
6693 tps.where_clause = self.parse_where_clause()?;
6694 self.expect(&token::Semi)?;
6695 if is_auto == IsAuto::Yes {
6696 let msg = "trait aliases cannot be `auto`";
6697 self.struct_span_err(self.prev_span, msg)
6698 .span_label(self.prev_span, msg)
6701 if unsafety != Unsafety::Normal {
6702 let msg = "trait aliases cannot be `unsafe`";
6703 self.struct_span_err(self.prev_span, msg)
6704 .span_label(self.prev_span, msg)
6707 Ok((ident, ItemKind::TraitAlias(tps, bounds), None))
6709 // it's a normal trait
6710 tps.where_clause = self.parse_where_clause()?;
6711 self.expect(&token::OpenDelim(token::Brace))?;
6712 let mut trait_items = vec![];
6713 while !self.eat(&token::CloseDelim(token::Brace)) {
6714 if let token::DocComment(_) = self.token {
6715 if self.look_ahead(1,
6716 |tok| tok == &token::Token::CloseDelim(token::Brace)) {
6717 let mut err = self.diagnostic().struct_span_err_with_code(
6719 "found a documentation comment that doesn't document anything",
6720 DiagnosticId::Error("E0584".into()),
6722 err.help("doc comments must come before what they document, maybe a \
6723 comment was intended with `//`?",
6730 let mut at_end = false;
6731 match self.parse_trait_item(&mut at_end) {
6732 Ok(item) => trait_items.push(item),
6736 self.recover_stmt_(SemiColonMode::Break, BlockMode::Break);
6741 Ok((ident, ItemKind::Trait(is_auto, unsafety, tps, bounds, trait_items), None))
6745 fn choose_generics_over_qpath(&self) -> bool {
6746 // There's an ambiguity between generic parameters and qualified paths in impls.
6747 // If we see `<` it may start both, so we have to inspect some following tokens.
6748 // The following combinations can only start generics,
6749 // but not qualified paths (with one exception):
6750 // `<` `>` - empty generic parameters
6751 // `<` `#` - generic parameters with attributes
6752 // `<` (LIFETIME|IDENT) `>` - single generic parameter
6753 // `<` (LIFETIME|IDENT) `,` - first generic parameter in a list
6754 // `<` (LIFETIME|IDENT) `:` - generic parameter with bounds
6755 // `<` (LIFETIME|IDENT) `=` - generic parameter with a default
6756 // `<` const - generic const parameter
6757 // The only truly ambiguous case is
6758 // `<` IDENT `>` `::` IDENT ...
6759 // we disambiguate it in favor of generics (`impl<T> ::absolute::Path<T> { ... }`)
6760 // because this is what almost always expected in practice, qualified paths in impls
6761 // (`impl <Type>::AssocTy { ... }`) aren't even allowed by type checker at the moment.
6762 self.token == token::Lt &&
6763 (self.look_ahead(1, |t| t == &token::Pound || t == &token::Gt) ||
6764 self.look_ahead(1, |t| t.is_lifetime() || t.is_ident()) &&
6765 self.look_ahead(2, |t| t == &token::Gt || t == &token::Comma ||
6766 t == &token::Colon || t == &token::Eq) ||
6767 self.look_ahead(1, |t| t.is_keyword(keywords::Const)))
6770 fn parse_impl_body(&mut self) -> PResult<'a, (Vec<ImplItem>, Vec<Attribute>)> {
6771 self.expect(&token::OpenDelim(token::Brace))?;
6772 let attrs = self.parse_inner_attributes()?;
6774 let mut impl_items = Vec::new();
6775 while !self.eat(&token::CloseDelim(token::Brace)) {
6776 let mut at_end = false;
6777 match self.parse_impl_item(&mut at_end) {
6778 Ok(impl_item) => impl_items.push(impl_item),
6782 self.recover_stmt_(SemiColonMode::Break, BlockMode::Break);
6787 Ok((impl_items, attrs))
6790 /// Parses an implementation item, `impl` keyword is already parsed.
6792 /// impl<'a, T> TYPE { /* impl items */ }
6793 /// impl<'a, T> TRAIT for TYPE { /* impl items */ }
6794 /// impl<'a, T> !TRAIT for TYPE { /* impl items */ }
6796 /// We actually parse slightly more relaxed grammar for better error reporting and recovery.
6797 /// `impl` GENERICS `!`? TYPE `for`? (TYPE | `..`) (`where` PREDICATES)? `{` BODY `}`
6798 /// `impl` GENERICS `!`? TYPE (`where` PREDICATES)? `{` BODY `}`
6799 fn parse_item_impl(&mut self, unsafety: Unsafety, defaultness: Defaultness)
6800 -> PResult<'a, ItemInfo> {
6801 // First, parse generic parameters if necessary.
6802 let mut generics = if self.choose_generics_over_qpath() {
6803 self.parse_generics()?
6805 ast::Generics::default()
6808 // Disambiguate `impl !Trait for Type { ... }` and `impl ! { ... }` for the never type.
6809 let polarity = if self.check(&token::Not) && self.look_ahead(1, |t| t.can_begin_type()) {
6811 ast::ImplPolarity::Negative
6813 ast::ImplPolarity::Positive
6816 // Parse both types and traits as a type, then reinterpret if necessary.
6817 let err_path = |span| ast::Path::from_ident(Ident::new(keywords::Invalid.name(), span));
6818 let ty_first = if self.token.is_keyword(keywords::For) &&
6819 self.look_ahead(1, |t| t != &token::Lt) {
6820 let span = self.prev_span.between(self.span);
6821 self.struct_span_err(span, "missing trait in a trait impl").emit();
6822 P(Ty { node: TyKind::Path(None, err_path(span)), span, id: ast::DUMMY_NODE_ID })
6827 // If `for` is missing we try to recover.
6828 let has_for = self.eat_keyword(keywords::For);
6829 let missing_for_span = self.prev_span.between(self.span);
6831 let ty_second = if self.token == token::DotDot {
6832 // We need to report this error after `cfg` expansion for compatibility reasons
6833 self.bump(); // `..`, do not add it to expected tokens
6834 Some(DummyResult::raw_ty(self.prev_span, true))
6835 } else if has_for || self.token.can_begin_type() {
6836 Some(self.parse_ty()?)
6841 generics.where_clause = self.parse_where_clause()?;
6843 let (impl_items, attrs) = self.parse_impl_body()?;
6845 let item_kind = match ty_second {
6846 Some(ty_second) => {
6847 // impl Trait for Type
6849 self.struct_span_err(missing_for_span, "missing `for` in a trait impl")
6850 .span_suggestion_short(
6853 " for ".to_string(),
6854 Applicability::MachineApplicable,
6858 let ty_first = ty_first.into_inner();
6859 let path = match ty_first.node {
6860 // This notably includes paths passed through `ty` macro fragments (#46438).
6861 TyKind::Path(None, path) => path,
6863 self.span_err(ty_first.span, "expected a trait, found type");
6864 err_path(ty_first.span)
6867 let trait_ref = TraitRef { path, ref_id: ty_first.id };
6869 ItemKind::Impl(unsafety, polarity, defaultness,
6870 generics, Some(trait_ref), ty_second, impl_items)
6874 ItemKind::Impl(unsafety, polarity, defaultness,
6875 generics, None, ty_first, impl_items)
6879 Ok((keywords::Invalid.ident(), item_kind, Some(attrs)))
6882 fn parse_late_bound_lifetime_defs(&mut self) -> PResult<'a, Vec<GenericParam>> {
6883 if self.eat_keyword(keywords::For) {
6885 let params = self.parse_generic_params()?;
6887 // We rely on AST validation to rule out invalid cases: There must not be type
6888 // parameters, and the lifetime parameters must not have bounds.
6895 /// Parses `struct Foo { ... }`.
6896 fn parse_item_struct(&mut self) -> PResult<'a, ItemInfo> {
6897 let class_name = self.parse_ident()?;
6899 let mut generics = self.parse_generics()?;
6901 // There is a special case worth noting here, as reported in issue #17904.
6902 // If we are parsing a tuple struct it is the case that the where clause
6903 // should follow the field list. Like so:
6905 // struct Foo<T>(T) where T: Copy;
6907 // If we are parsing a normal record-style struct it is the case
6908 // that the where clause comes before the body, and after the generics.
6909 // So if we look ahead and see a brace or a where-clause we begin
6910 // parsing a record style struct.
6912 // Otherwise if we look ahead and see a paren we parse a tuple-style
6915 let vdata = if self.token.is_keyword(keywords::Where) {
6916 generics.where_clause = self.parse_where_clause()?;
6917 if self.eat(&token::Semi) {
6918 // If we see a: `struct Foo<T> where T: Copy;` style decl.
6919 VariantData::Unit(ast::DUMMY_NODE_ID)
6921 // If we see: `struct Foo<T> where T: Copy { ... }`
6922 let (fields, recovered) = self.parse_record_struct_body()?;
6923 VariantData::Struct(fields, recovered)
6925 // No `where` so: `struct Foo<T>;`
6926 } else if self.eat(&token::Semi) {
6927 VariantData::Unit(ast::DUMMY_NODE_ID)
6928 // Record-style struct definition
6929 } else if self.token == token::OpenDelim(token::Brace) {
6930 let (fields, recovered) = self.parse_record_struct_body()?;
6931 VariantData::Struct(fields, recovered)
6932 // Tuple-style struct definition with optional where-clause.
6933 } else if self.token == token::OpenDelim(token::Paren) {
6934 let body = VariantData::Tuple(self.parse_tuple_struct_body()?, ast::DUMMY_NODE_ID);
6935 generics.where_clause = self.parse_where_clause()?;
6936 self.expect(&token::Semi)?;
6939 let token_str = self.this_token_descr();
6940 let mut err = self.fatal(&format!(
6941 "expected `where`, `{{`, `(`, or `;` after struct name, found {}",
6944 err.span_label(self.span, "expected `where`, `{`, `(`, or `;` after struct name");
6948 Ok((class_name, ItemKind::Struct(vdata, generics), None))
6951 /// Parses `union Foo { ... }`.
6952 fn parse_item_union(&mut self) -> PResult<'a, ItemInfo> {
6953 let class_name = self.parse_ident()?;
6955 let mut generics = self.parse_generics()?;
6957 let vdata = if self.token.is_keyword(keywords::Where) {
6958 generics.where_clause = self.parse_where_clause()?;
6959 let (fields, recovered) = self.parse_record_struct_body()?;
6960 VariantData::Struct(fields, recovered)
6961 } else if self.token == token::OpenDelim(token::Brace) {
6962 let (fields, recovered) = self.parse_record_struct_body()?;
6963 VariantData::Struct(fields, recovered)
6965 let token_str = self.this_token_descr();
6966 let mut err = self.fatal(&format!(
6967 "expected `where` or `{{` after union name, found {}", token_str));
6968 err.span_label(self.span, "expected `where` or `{` after union name");
6972 Ok((class_name, ItemKind::Union(vdata, generics), None))
6975 fn consume_block(&mut self, delim: token::DelimToken) {
6976 let mut brace_depth = 0;
6978 if self.eat(&token::OpenDelim(delim)) {
6980 } else if self.eat(&token::CloseDelim(delim)) {
6981 if brace_depth == 0 {
6987 } else if self.token == token::Eof || self.eat(&token::CloseDelim(token::NoDelim)) {
6995 fn parse_record_struct_body(
6997 ) -> PResult<'a, (Vec<StructField>, /* recovered */ bool)> {
6998 let mut fields = Vec::new();
6999 let mut recovered = false;
7000 if self.eat(&token::OpenDelim(token::Brace)) {
7001 while self.token != token::CloseDelim(token::Brace) {
7002 let field = self.parse_struct_decl_field().map_err(|e| {
7003 self.recover_stmt();
7008 Ok(field) => fields.push(field),
7014 self.eat(&token::CloseDelim(token::Brace));
7016 let token_str = self.this_token_descr();
7017 let mut err = self.fatal(&format!(
7018 "expected `where`, or `{{` after struct name, found {}", token_str));
7019 err.span_label(self.span, "expected `where`, or `{` after struct name");
7023 Ok((fields, recovered))
7026 fn parse_tuple_struct_body(&mut self) -> PResult<'a, Vec<StructField>> {
7027 // This is the case where we find `struct Foo<T>(T) where T: Copy;`
7028 // Unit like structs are handled in parse_item_struct function
7029 let fields = self.parse_unspanned_seq(
7030 &token::OpenDelim(token::Paren),
7031 &token::CloseDelim(token::Paren),
7032 SeqSep::trailing_allowed(token::Comma),
7034 let attrs = p.parse_outer_attributes()?;
7036 let vis = p.parse_visibility(true)?;
7037 let ty = p.parse_ty()?;
7039 span: lo.to(ty.span),
7042 id: ast::DUMMY_NODE_ID,
7051 /// Parses a structure field declaration.
7052 fn parse_single_struct_field(&mut self,
7055 attrs: Vec<Attribute> )
7056 -> PResult<'a, StructField> {
7057 let mut seen_comma: bool = false;
7058 let a_var = self.parse_name_and_ty(lo, vis, attrs)?;
7059 if self.token == token::Comma {
7066 token::CloseDelim(token::Brace) => {}
7067 token::DocComment(_) => {
7068 let previous_span = self.prev_span;
7069 let mut err = self.span_fatal_err(self.span, Error::UselessDocComment);
7070 self.bump(); // consume the doc comment
7071 let comma_after_doc_seen = self.eat(&token::Comma);
7072 // `seen_comma` is always false, because we are inside doc block
7073 // condition is here to make code more readable
7074 if seen_comma == false && comma_after_doc_seen == true {
7077 if comma_after_doc_seen || self.token == token::CloseDelim(token::Brace) {
7080 if seen_comma == false {
7081 let sp = self.sess.source_map().next_point(previous_span);
7082 err.span_suggestion(
7084 "missing comma here",
7086 Applicability::MachineApplicable
7093 let sp = self.sess.source_map().next_point(self.prev_span);
7094 let mut err = self.struct_span_err(sp, &format!("expected `,`, or `}}`, found {}",
7095 self.this_token_descr()));
7096 if self.token.is_ident() {
7097 // This is likely another field; emit the diagnostic and keep going
7098 err.span_suggestion(
7100 "try adding a comma",
7102 Applicability::MachineApplicable,
7113 /// Parses an element of a struct declaration.
7114 fn parse_struct_decl_field(&mut self) -> PResult<'a, StructField> {
7115 let attrs = self.parse_outer_attributes()?;
7117 let vis = self.parse_visibility(false)?;
7118 self.parse_single_struct_field(lo, vis, attrs)
7121 /// Parses `pub`, `pub(crate)` and `pub(in path)` plus shortcuts `crate` for `pub(crate)`,
7122 /// `pub(self)` for `pub(in self)` and `pub(super)` for `pub(in super)`.
7123 /// If the following element can't be a tuple (i.e., it's a function definition), then
7124 /// it's not a tuple struct field), and the contents within the parentheses isn't valid,
7125 /// so emit a proper diagnostic.
7126 pub fn parse_visibility(&mut self, can_take_tuple: bool) -> PResult<'a, Visibility> {
7127 maybe_whole!(self, NtVis, |x| x);
7129 self.expected_tokens.push(TokenType::Keyword(keywords::Crate));
7130 if self.is_crate_vis() {
7131 self.bump(); // `crate`
7132 return Ok(respan(self.prev_span, VisibilityKind::Crate(CrateSugar::JustCrate)));
7135 if !self.eat_keyword(keywords::Pub) {
7136 // We need a span for our `Spanned<VisibilityKind>`, but there's inherently no
7137 // keyword to grab a span from for inherited visibility; an empty span at the
7138 // beginning of the current token would seem to be the "Schelling span".
7139 return Ok(respan(self.span.shrink_to_lo(), VisibilityKind::Inherited))
7141 let lo = self.prev_span;
7143 if self.check(&token::OpenDelim(token::Paren)) {
7144 // We don't `self.bump()` the `(` yet because this might be a struct definition where
7145 // `()` or a tuple might be allowed. For example, `struct Struct(pub (), pub (usize));`.
7146 // Because of this, we only `bump` the `(` if we're assured it is appropriate to do so
7147 // by the following tokens.
7148 if self.look_ahead(1, |t| t.is_keyword(keywords::Crate)) &&
7149 self.look_ahead(2, |t| t != &token::ModSep) // account for `pub(crate::foo)`
7153 self.bump(); // `crate`
7154 self.expect(&token::CloseDelim(token::Paren))?; // `)`
7156 lo.to(self.prev_span),
7157 VisibilityKind::Crate(CrateSugar::PubCrate),
7160 } else if self.look_ahead(1, |t| t.is_keyword(keywords::In)) {
7163 self.bump(); // `in`
7164 let path = self.parse_path(PathStyle::Mod)?; // `path`
7165 self.expect(&token::CloseDelim(token::Paren))?; // `)`
7166 let vis = respan(lo.to(self.prev_span), VisibilityKind::Restricted {
7168 id: ast::DUMMY_NODE_ID,
7171 } else if self.look_ahead(2, |t| t == &token::CloseDelim(token::Paren)) &&
7172 self.look_ahead(1, |t| t.is_keyword(keywords::Super) ||
7173 t.is_keyword(keywords::SelfLower))
7175 // `pub(self)` or `pub(super)`
7177 let path = self.parse_path(PathStyle::Mod)?; // `super`/`self`
7178 self.expect(&token::CloseDelim(token::Paren))?; // `)`
7179 let vis = respan(lo.to(self.prev_span), VisibilityKind::Restricted {
7181 id: ast::DUMMY_NODE_ID,
7184 } else if !can_take_tuple { // Provide this diagnostic if this is not a tuple struct
7185 // `pub(something) fn ...` or `struct X { pub(something) y: Z }`
7187 let msg = "incorrect visibility restriction";
7188 let suggestion = r##"some possible visibility restrictions are:
7189 `pub(crate)`: visible only on the current crate
7190 `pub(super)`: visible only in the current module's parent
7191 `pub(in path::to::module)`: visible only on the specified path"##;
7192 let path = self.parse_path(PathStyle::Mod)?;
7194 let help_msg = format!("make this visible only to module `{}` with `in`", path);
7195 self.expect(&token::CloseDelim(token::Paren))?; // `)`
7196 let mut err = struct_span_err!(self.sess.span_diagnostic, sp, E0704, "{}", msg);
7197 err.help(suggestion);
7198 err.span_suggestion(
7199 sp, &help_msg, format!("in {}", path), Applicability::MachineApplicable
7201 err.emit(); // emit diagnostic, but continue with public visibility
7205 Ok(respan(lo, VisibilityKind::Public))
7208 /// Parses defaultness (i.e., `default` or nothing).
7209 fn parse_defaultness(&mut self) -> Defaultness {
7210 // `pub` is included for better error messages
7211 if self.check_keyword(keywords::Default) &&
7212 self.look_ahead(1, |t| t.is_keyword(keywords::Impl) ||
7213 t.is_keyword(keywords::Const) ||
7214 t.is_keyword(keywords::Fn) ||
7215 t.is_keyword(keywords::Unsafe) ||
7216 t.is_keyword(keywords::Extern) ||
7217 t.is_keyword(keywords::Type) ||
7218 t.is_keyword(keywords::Pub)) {
7219 self.bump(); // `default`
7220 Defaultness::Default
7226 /// Given a termination token, parses all of the items in a module.
7227 fn parse_mod_items(&mut self, term: &token::Token, inner_lo: Span) -> PResult<'a, Mod> {
7228 let mut items = vec![];
7229 while let Some(item) = self.parse_item()? {
7231 self.maybe_consume_incorrect_semicolon(&items);
7234 if !self.eat(term) {
7235 let token_str = self.this_token_descr();
7236 if !self.maybe_consume_incorrect_semicolon(&items) {
7237 let mut err = self.fatal(&format!("expected item, found {}", token_str));
7238 err.span_label(self.span, "expected item");
7243 let hi = if self.span.is_dummy() {
7250 inner: inner_lo.to(hi),
7256 fn parse_item_const(&mut self, m: Option<Mutability>) -> PResult<'a, ItemInfo> {
7257 let id = if m.is_none() { self.parse_ident_or_underscore() } else { self.parse_ident() }?;
7258 self.expect(&token::Colon)?;
7259 let ty = self.parse_ty()?;
7260 self.expect(&token::Eq)?;
7261 let e = self.parse_expr()?;
7262 self.expect(&token::Semi)?;
7263 let item = match m {
7264 Some(m) => ItemKind::Static(ty, m, e),
7265 None => ItemKind::Const(ty, e),
7267 Ok((id, item, None))
7270 /// Parse a `mod <foo> { ... }` or `mod <foo>;` item
7271 fn parse_item_mod(&mut self, outer_attrs: &[Attribute]) -> PResult<'a, ItemInfo> {
7272 let (in_cfg, outer_attrs) = {
7273 let mut strip_unconfigured = crate::config::StripUnconfigured {
7275 features: None, // don't perform gated feature checking
7277 let mut outer_attrs = outer_attrs.to_owned();
7278 strip_unconfigured.process_cfg_attrs(&mut outer_attrs);
7279 (!self.cfg_mods || strip_unconfigured.in_cfg(&outer_attrs), outer_attrs)
7282 let id_span = self.span;
7283 let id = self.parse_ident()?;
7284 if self.eat(&token::Semi) {
7285 if in_cfg && self.recurse_into_file_modules {
7286 // This mod is in an external file. Let's go get it!
7287 let ModulePathSuccess { path, directory_ownership, warn } =
7288 self.submod_path(id, &outer_attrs, id_span)?;
7289 let (module, mut attrs) =
7290 self.eval_src_mod(path, directory_ownership, id.to_string(), id_span)?;
7291 // Record that we fetched the mod from an external file
7293 let attr = Attribute {
7294 id: attr::mk_attr_id(),
7295 style: ast::AttrStyle::Outer,
7296 path: ast::Path::from_ident(Ident::from_str("warn_directory_ownership")),
7297 tokens: TokenStream::empty(),
7298 is_sugared_doc: false,
7299 span: syntax_pos::DUMMY_SP,
7301 attr::mark_known(&attr);
7304 Ok((id, ItemKind::Mod(module), Some(attrs)))
7306 let placeholder = ast::Mod {
7307 inner: syntax_pos::DUMMY_SP,
7311 Ok((id, ItemKind::Mod(placeholder), None))
7314 let old_directory = self.directory.clone();
7315 self.push_directory(id, &outer_attrs);
7317 self.expect(&token::OpenDelim(token::Brace))?;
7318 let mod_inner_lo = self.span;
7319 let attrs = self.parse_inner_attributes()?;
7320 let module = self.parse_mod_items(&token::CloseDelim(token::Brace), mod_inner_lo)?;
7322 self.directory = old_directory;
7323 Ok((id, ItemKind::Mod(module), Some(attrs)))
7327 fn push_directory(&mut self, id: Ident, attrs: &[Attribute]) {
7328 if let Some(path) = attr::first_attr_value_str_by_name(attrs, "path") {
7329 self.directory.path.to_mut().push(&path.as_str());
7330 self.directory.ownership = DirectoryOwnership::Owned { relative: None };
7332 // We have to push on the current module name in the case of relative
7333 // paths in order to ensure that any additional module paths from inline
7334 // `mod x { ... }` come after the relative extension.
7336 // For example, a `mod z { ... }` inside `x/y.rs` should set the current
7337 // directory path to `/x/y/z`, not `/x/z` with a relative offset of `y`.
7338 if let DirectoryOwnership::Owned { relative } = &mut self.directory.ownership {
7339 if let Some(ident) = relative.take() { // remove the relative offset
7340 self.directory.path.to_mut().push(ident.as_str());
7343 self.directory.path.to_mut().push(&id.as_str());
7347 pub fn submod_path_from_attr(attrs: &[Attribute], dir_path: &Path) -> Option<PathBuf> {
7348 if let Some(s) = attr::first_attr_value_str_by_name(attrs, "path") {
7351 // On windows, the base path might have the form
7352 // `\\?\foo\bar` in which case it does not tolerate
7353 // mixed `/` and `\` separators, so canonicalize
7356 let s = s.replace("/", "\\");
7357 Some(dir_path.join(s))
7363 /// Returns a path to a module.
7364 pub fn default_submod_path(
7366 relative: Option<ast::Ident>,
7368 source_map: &SourceMap) -> ModulePath
7370 // If we're in a foo.rs file instead of a mod.rs file,
7371 // we need to look for submodules in
7372 // `./foo/<id>.rs` and `./foo/<id>/mod.rs` rather than
7373 // `./<id>.rs` and `./<id>/mod.rs`.
7374 let relative_prefix_string;
7375 let relative_prefix = if let Some(ident) = relative {
7376 relative_prefix_string = format!("{}{}", ident.as_str(), path::MAIN_SEPARATOR);
7377 &relative_prefix_string
7382 let mod_name = id.to_string();
7383 let default_path_str = format!("{}{}.rs", relative_prefix, mod_name);
7384 let secondary_path_str = format!("{}{}{}mod.rs",
7385 relative_prefix, mod_name, path::MAIN_SEPARATOR);
7386 let default_path = dir_path.join(&default_path_str);
7387 let secondary_path = dir_path.join(&secondary_path_str);
7388 let default_exists = source_map.file_exists(&default_path);
7389 let secondary_exists = source_map.file_exists(&secondary_path);
7391 let result = match (default_exists, secondary_exists) {
7392 (true, false) => Ok(ModulePathSuccess {
7394 directory_ownership: DirectoryOwnership::Owned {
7399 (false, true) => Ok(ModulePathSuccess {
7400 path: secondary_path,
7401 directory_ownership: DirectoryOwnership::Owned {
7406 (false, false) => Err(Error::FileNotFoundForModule {
7407 mod_name: mod_name.clone(),
7408 default_path: default_path_str,
7409 secondary_path: secondary_path_str,
7410 dir_path: dir_path.display().to_string(),
7412 (true, true) => Err(Error::DuplicatePaths {
7413 mod_name: mod_name.clone(),
7414 default_path: default_path_str,
7415 secondary_path: secondary_path_str,
7421 path_exists: default_exists || secondary_exists,
7426 fn submod_path(&mut self,
7428 outer_attrs: &[Attribute],
7430 -> PResult<'a, ModulePathSuccess> {
7431 if let Some(path) = Parser::submod_path_from_attr(outer_attrs, &self.directory.path) {
7432 return Ok(ModulePathSuccess {
7433 directory_ownership: match path.file_name().and_then(|s| s.to_str()) {
7434 // All `#[path]` files are treated as though they are a `mod.rs` file.
7435 // This means that `mod foo;` declarations inside `#[path]`-included
7436 // files are siblings,
7438 // Note that this will produce weirdness when a file named `foo.rs` is
7439 // `#[path]` included and contains a `mod foo;` declaration.
7440 // If you encounter this, it's your own darn fault :P
7441 Some(_) => DirectoryOwnership::Owned { relative: None },
7442 _ => DirectoryOwnership::UnownedViaMod(true),
7449 let relative = match self.directory.ownership {
7450 DirectoryOwnership::Owned { relative } => relative,
7451 DirectoryOwnership::UnownedViaBlock |
7452 DirectoryOwnership::UnownedViaMod(_) => None,
7454 let paths = Parser::default_submod_path(
7455 id, relative, &self.directory.path, self.sess.source_map());
7457 match self.directory.ownership {
7458 DirectoryOwnership::Owned { .. } => {
7459 paths.result.map_err(|err| self.span_fatal_err(id_sp, err))
7461 DirectoryOwnership::UnownedViaBlock => {
7463 "Cannot declare a non-inline module inside a block \
7464 unless it has a path attribute";
7465 let mut err = self.diagnostic().struct_span_err(id_sp, msg);
7466 if paths.path_exists {
7467 let msg = format!("Maybe `use` the module `{}` instead of redeclaring it",
7469 err.span_note(id_sp, &msg);
7473 DirectoryOwnership::UnownedViaMod(warn) => {
7475 if let Ok(result) = paths.result {
7476 return Ok(ModulePathSuccess { warn: true, ..result });
7479 let mut err = self.diagnostic().struct_span_err(id_sp,
7480 "cannot declare a new module at this location");
7481 if !id_sp.is_dummy() {
7482 let src_path = self.sess.source_map().span_to_filename(id_sp);
7483 if let FileName::Real(src_path) = src_path {
7484 if let Some(stem) = src_path.file_stem() {
7485 let mut dest_path = src_path.clone();
7486 dest_path.set_file_name(stem);
7487 dest_path.push("mod.rs");
7488 err.span_note(id_sp,
7489 &format!("maybe move this module `{}` to its own \
7490 directory via `{}`", src_path.display(),
7491 dest_path.display()));
7495 if paths.path_exists {
7496 err.span_note(id_sp,
7497 &format!("... or maybe `use` the module `{}` instead \
7498 of possibly redeclaring it",
7506 /// Reads a module from a source file.
7507 fn eval_src_mod(&mut self,
7509 directory_ownership: DirectoryOwnership,
7512 -> PResult<'a, (ast::Mod, Vec<Attribute> )> {
7513 let mut included_mod_stack = self.sess.included_mod_stack.borrow_mut();
7514 if let Some(i) = included_mod_stack.iter().position(|p| *p == path) {
7515 let mut err = String::from("circular modules: ");
7516 let len = included_mod_stack.len();
7517 for p in &included_mod_stack[i.. len] {
7518 err.push_str(&p.to_string_lossy());
7519 err.push_str(" -> ");
7521 err.push_str(&path.to_string_lossy());
7522 return Err(self.span_fatal(id_sp, &err[..]));
7524 included_mod_stack.push(path.clone());
7525 drop(included_mod_stack);
7528 new_sub_parser_from_file(self.sess, &path, directory_ownership, Some(name), id_sp);
7529 p0.cfg_mods = self.cfg_mods;
7530 let mod_inner_lo = p0.span;
7531 let mod_attrs = p0.parse_inner_attributes()?;
7532 let mut m0 = p0.parse_mod_items(&token::Eof, mod_inner_lo)?;
7534 self.sess.included_mod_stack.borrow_mut().pop();
7538 /// Parses a function declaration from a foreign module.
7539 fn parse_item_foreign_fn(&mut self, vis: ast::Visibility, lo: Span, attrs: Vec<Attribute>)
7540 -> PResult<'a, ForeignItem> {
7541 self.expect_keyword(keywords::Fn)?;
7543 let (ident, mut generics) = self.parse_fn_header()?;
7544 let decl = self.parse_fn_decl(true)?;
7545 generics.where_clause = self.parse_where_clause()?;
7547 self.expect(&token::Semi)?;
7548 Ok(ast::ForeignItem {
7551 node: ForeignItemKind::Fn(decl, generics),
7552 id: ast::DUMMY_NODE_ID,
7558 /// Parses a static item from a foreign module.
7559 /// Assumes that the `static` keyword is already parsed.
7560 fn parse_item_foreign_static(&mut self, vis: ast::Visibility, lo: Span, attrs: Vec<Attribute>)
7561 -> PResult<'a, ForeignItem> {
7562 let mutbl = self.parse_mutability();
7563 let ident = self.parse_ident()?;
7564 self.expect(&token::Colon)?;
7565 let ty = self.parse_ty()?;
7567 self.expect(&token::Semi)?;
7571 node: ForeignItemKind::Static(ty, mutbl),
7572 id: ast::DUMMY_NODE_ID,
7578 /// Parses a type from a foreign module.
7579 fn parse_item_foreign_type(&mut self, vis: ast::Visibility, lo: Span, attrs: Vec<Attribute>)
7580 -> PResult<'a, ForeignItem> {
7581 self.expect_keyword(keywords::Type)?;
7583 let ident = self.parse_ident()?;
7585 self.expect(&token::Semi)?;
7586 Ok(ast::ForeignItem {
7589 node: ForeignItemKind::Ty,
7590 id: ast::DUMMY_NODE_ID,
7596 fn parse_crate_name_with_dashes(&mut self) -> PResult<'a, ast::Ident> {
7597 let error_msg = "crate name using dashes are not valid in `extern crate` statements";
7598 let suggestion_msg = "if the original crate name uses dashes you need to use underscores \
7600 let mut ident = if self.token.is_keyword(keywords::SelfLower) {
7601 self.parse_path_segment_ident()
7605 let mut idents = vec![];
7606 let mut replacement = vec![];
7607 let mut fixed_crate_name = false;
7608 // Accept `extern crate name-like-this` for better diagnostics
7609 let dash = token::Token::BinOp(token::BinOpToken::Minus);
7610 if self.token == dash { // Do not include `-` as part of the expected tokens list
7611 while self.eat(&dash) {
7612 fixed_crate_name = true;
7613 replacement.push((self.prev_span, "_".to_string()));
7614 idents.push(self.parse_ident()?);
7617 if fixed_crate_name {
7618 let fixed_name_sp = ident.span.to(idents.last().unwrap().span);
7619 let mut fixed_name = format!("{}", ident.name);
7620 for part in idents {
7621 fixed_name.push_str(&format!("_{}", part.name));
7623 ident = Ident::from_str(&fixed_name).with_span_pos(fixed_name_sp);
7625 let mut err = self.struct_span_err(fixed_name_sp, error_msg);
7626 err.span_label(fixed_name_sp, "dash-separated idents are not valid");
7627 err.multipart_suggestion(
7630 Applicability::MachineApplicable,
7637 /// Parses `extern crate` links.
7642 /// extern crate foo;
7643 /// extern crate bar as foo;
7645 fn parse_item_extern_crate(&mut self,
7647 visibility: Visibility,
7648 attrs: Vec<Attribute>)
7649 -> PResult<'a, P<Item>> {
7650 // Accept `extern crate name-like-this` for better diagnostics
7651 let orig_name = self.parse_crate_name_with_dashes()?;
7652 let (item_name, orig_name) = if let Some(rename) = self.parse_rename()? {
7653 (rename, Some(orig_name.name))
7657 self.expect(&token::Semi)?;
7659 let span = lo.to(self.prev_span);
7660 Ok(self.mk_item(span, item_name, ItemKind::ExternCrate(orig_name), visibility, attrs))
7663 /// Parses `extern` for foreign ABIs modules.
7665 /// `extern` is expected to have been
7666 /// consumed before calling this method.
7670 /// ```ignore (only-for-syntax-highlight)
7674 fn parse_item_foreign_mod(&mut self,
7676 opt_abi: Option<Abi>,
7677 visibility: Visibility,
7678 mut attrs: Vec<Attribute>)
7679 -> PResult<'a, P<Item>> {
7680 self.expect(&token::OpenDelim(token::Brace))?;
7682 let abi = opt_abi.unwrap_or(Abi::C);
7684 attrs.extend(self.parse_inner_attributes()?);
7686 let mut foreign_items = vec![];
7687 while !self.eat(&token::CloseDelim(token::Brace)) {
7688 foreign_items.push(self.parse_foreign_item()?);
7691 let prev_span = self.prev_span;
7692 let m = ast::ForeignMod {
7694 items: foreign_items
7696 let invalid = keywords::Invalid.ident();
7697 Ok(self.mk_item(lo.to(prev_span), invalid, ItemKind::ForeignMod(m), visibility, attrs))
7700 /// Parses `type Foo = Bar;`
7702 /// `existential type Foo: Bar;`
7705 /// without modifying the parser state.
7706 fn eat_type(&mut self) -> Option<PResult<'a, (Ident, AliasKind, ast::Generics)>> {
7707 // This parses the grammar:
7708 // Ident ["<"...">"] ["where" ...] ("=" | ":") Ty ";"
7709 if self.check_keyword(keywords::Type) ||
7710 self.check_keyword(keywords::Existential) &&
7711 self.look_ahead(1, |t| t.is_keyword(keywords::Type)) {
7712 let existential = self.eat_keyword(keywords::Existential);
7713 assert!(self.eat_keyword(keywords::Type));
7714 Some(self.parse_existential_or_alias(existential))
7720 /// Parses a type alias or existential type.
7721 fn parse_existential_or_alias(
7724 ) -> PResult<'a, (Ident, AliasKind, ast::Generics)> {
7725 let ident = self.parse_ident()?;
7726 let mut tps = self.parse_generics()?;
7727 tps.where_clause = self.parse_where_clause()?;
7728 let alias = if existential {
7729 self.expect(&token::Colon)?;
7730 let bounds = self.parse_generic_bounds(Some(self.prev_span))?;
7731 AliasKind::Existential(bounds)
7733 self.expect(&token::Eq)?;
7734 let ty = self.parse_ty()?;
7737 self.expect(&token::Semi)?;
7738 Ok((ident, alias, tps))
7741 /// Parses the part of an enum declaration following the `{`.
7742 fn parse_enum_def(&mut self, _generics: &ast::Generics) -> PResult<'a, EnumDef> {
7743 let mut variants = Vec::new();
7744 let mut all_nullary = true;
7745 let mut any_disr = vec![];
7746 while self.token != token::CloseDelim(token::Brace) {
7747 let variant_attrs = self.parse_outer_attributes()?;
7748 let vlo = self.span;
7751 let mut disr_expr = None;
7753 let ident = self.parse_ident()?;
7754 if self.check(&token::OpenDelim(token::Brace)) {
7755 // Parse a struct variant.
7756 all_nullary = false;
7757 let (fields, recovered) = self.parse_record_struct_body()?;
7758 struct_def = VariantData::Struct(fields, recovered);
7759 } else if self.check(&token::OpenDelim(token::Paren)) {
7760 all_nullary = false;
7761 struct_def = VariantData::Tuple(
7762 self.parse_tuple_struct_body()?,
7765 } else if self.eat(&token::Eq) {
7766 disr_expr = Some(AnonConst {
7767 id: ast::DUMMY_NODE_ID,
7768 value: self.parse_expr()?,
7770 if let Some(sp) = disr_expr.as_ref().map(|c| c.value.span) {
7773 struct_def = VariantData::Unit(ast::DUMMY_NODE_ID);
7775 struct_def = VariantData::Unit(ast::DUMMY_NODE_ID);
7778 let vr = ast::Variant_ {
7780 id: ast::DUMMY_NODE_ID,
7781 attrs: variant_attrs,
7785 variants.push(respan(vlo.to(self.prev_span), vr));
7787 if !self.eat(&token::Comma) {
7788 if self.token.is_ident() && !self.token.is_reserved_ident() {
7789 let sp = self.sess.source_map().next_point(self.prev_span);
7790 let mut err = self.struct_span_err(sp, "missing comma");
7791 err.span_suggestion_short(
7795 Applicability::MaybeIncorrect,
7803 self.expect(&token::CloseDelim(token::Brace))?;
7804 if !any_disr.is_empty() && !all_nullary {
7805 let mut err = self.struct_span_err(
7807 "discriminator values can only be used with a field-less enum",
7809 for sp in any_disr {
7810 err.span_label(sp, "only valid in field-less enums");
7815 Ok(ast::EnumDef { variants })
7818 /// Parses an enum declaration.
7819 fn parse_item_enum(&mut self) -> PResult<'a, ItemInfo> {
7820 let id = self.parse_ident()?;
7821 let mut generics = self.parse_generics()?;
7822 generics.where_clause = self.parse_where_clause()?;
7823 self.expect(&token::OpenDelim(token::Brace))?;
7825 let enum_definition = self.parse_enum_def(&generics).map_err(|e| {
7826 self.recover_stmt();
7827 self.eat(&token::CloseDelim(token::Brace));
7830 Ok((id, ItemKind::Enum(enum_definition, generics), None))
7833 /// Parses a string as an ABI spec on an extern type or module. Consumes
7834 /// the `extern` keyword, if one is found.
7835 fn parse_opt_abi(&mut self) -> PResult<'a, Option<Abi>> {
7837 token::Literal(token::Str_(s), suf) | token::Literal(token::StrRaw(s, _), suf) => {
7839 self.expect_no_suffix(sp, "an ABI spec", suf);
7841 match abi::lookup(&s.as_str()) {
7842 Some(abi) => Ok(Some(abi)),
7844 let prev_span = self.prev_span;
7845 let mut err = struct_span_err!(
7846 self.sess.span_diagnostic,
7849 "invalid ABI: found `{}`",
7851 err.span_label(prev_span, "invalid ABI");
7852 err.help(&format!("valid ABIs: {}", abi::all_names().join(", ")));
7863 fn is_static_global(&mut self) -> bool {
7864 if self.check_keyword(keywords::Static) {
7865 // Check if this could be a closure
7866 !self.look_ahead(1, |token| {
7867 if token.is_keyword(keywords::Move) {
7871 token::BinOp(token::Or) | token::OrOr => true,
7882 attrs: Vec<Attribute>,
7883 macros_allowed: bool,
7884 attributes_allowed: bool,
7885 ) -> PResult<'a, Option<P<Item>>> {
7886 let mut unclosed_delims = vec![];
7887 let (ret, tokens) = self.collect_tokens(|this| {
7888 let item = this.parse_item_implementation(attrs, macros_allowed, attributes_allowed);
7889 unclosed_delims.append(&mut this.unclosed_delims);
7892 self.unclosed_delims.append(&mut unclosed_delims);
7894 // Once we've parsed an item and recorded the tokens we got while
7895 // parsing we may want to store `tokens` into the item we're about to
7896 // return. Note, though, that we specifically didn't capture tokens
7897 // related to outer attributes. The `tokens` field here may later be
7898 // used with procedural macros to convert this item back into a token
7899 // stream, but during expansion we may be removing attributes as we go
7902 // If we've got inner attributes then the `tokens` we've got above holds
7903 // these inner attributes. If an inner attribute is expanded we won't
7904 // actually remove it from the token stream, so we'll just keep yielding
7905 // it (bad!). To work around this case for now we just avoid recording
7906 // `tokens` if we detect any inner attributes. This should help keep
7907 // expansion correct, but we should fix this bug one day!
7910 if !i.attrs.iter().any(|attr| attr.style == AttrStyle::Inner) {
7911 i.tokens = Some(tokens);
7918 /// Parses one of the items allowed by the flags.
7919 fn parse_item_implementation(
7921 attrs: Vec<Attribute>,
7922 macros_allowed: bool,
7923 attributes_allowed: bool,
7924 ) -> PResult<'a, Option<P<Item>>> {
7925 maybe_whole!(self, NtItem, |item| {
7926 let mut item = item.into_inner();
7927 let mut attrs = attrs;
7928 mem::swap(&mut item.attrs, &mut attrs);
7929 item.attrs.extend(attrs);
7935 let visibility = self.parse_visibility(false)?;
7937 if self.eat_keyword(keywords::Use) {
7939 let item_ = ItemKind::Use(P(self.parse_use_tree()?));
7940 self.expect(&token::Semi)?;
7942 let span = lo.to(self.prev_span);
7943 let item = self.mk_item(span, keywords::Invalid.ident(), item_, visibility, attrs);
7944 return Ok(Some(item));
7947 if self.eat_keyword(keywords::Extern) {
7948 if self.eat_keyword(keywords::Crate) {
7949 return Ok(Some(self.parse_item_extern_crate(lo, visibility, attrs)?));
7952 let opt_abi = self.parse_opt_abi()?;
7954 if self.eat_keyword(keywords::Fn) {
7955 // EXTERN FUNCTION ITEM
7956 let fn_span = self.prev_span;
7957 let abi = opt_abi.unwrap_or(Abi::C);
7958 let (ident, item_, extra_attrs) =
7959 self.parse_item_fn(Unsafety::Normal,
7960 respan(fn_span, IsAsync::NotAsync),
7961 respan(fn_span, Constness::NotConst),
7963 let prev_span = self.prev_span;
7964 let item = self.mk_item(lo.to(prev_span),
7968 maybe_append(attrs, extra_attrs));
7969 return Ok(Some(item));
7970 } else if self.check(&token::OpenDelim(token::Brace)) {
7971 return Ok(Some(self.parse_item_foreign_mod(lo, opt_abi, visibility, attrs)?));
7977 if self.is_static_global() {
7980 let m = if self.eat_keyword(keywords::Mut) {
7983 Mutability::Immutable
7985 let (ident, item_, extra_attrs) = self.parse_item_const(Some(m))?;
7986 let prev_span = self.prev_span;
7987 let item = self.mk_item(lo.to(prev_span),
7991 maybe_append(attrs, extra_attrs));
7992 return Ok(Some(item));
7994 if self.eat_keyword(keywords::Const) {
7995 let const_span = self.prev_span;
7996 if self.check_keyword(keywords::Fn)
7997 || (self.check_keyword(keywords::Unsafe)
7998 && self.look_ahead(1, |t| t.is_keyword(keywords::Fn))) {
7999 // CONST FUNCTION ITEM
8000 let unsafety = self.parse_unsafety();
8002 let (ident, item_, extra_attrs) =
8003 self.parse_item_fn(unsafety,
8004 respan(const_span, IsAsync::NotAsync),
8005 respan(const_span, Constness::Const),
8007 let prev_span = self.prev_span;
8008 let item = self.mk_item(lo.to(prev_span),
8012 maybe_append(attrs, extra_attrs));
8013 return Ok(Some(item));
8017 if self.eat_keyword(keywords::Mut) {
8018 let prev_span = self.prev_span;
8019 let mut err = self.diagnostic()
8020 .struct_span_err(prev_span, "const globals cannot be mutable");
8021 err.span_label(prev_span, "cannot be mutable");
8022 err.span_suggestion(
8024 "you might want to declare a static instead",
8025 "static".to_owned(),
8026 Applicability::MaybeIncorrect,
8030 let (ident, item_, extra_attrs) = self.parse_item_const(None)?;
8031 let prev_span = self.prev_span;
8032 let item = self.mk_item(lo.to(prev_span),
8036 maybe_append(attrs, extra_attrs));
8037 return Ok(Some(item));
8040 // `unsafe async fn` or `async fn`
8042 self.check_keyword(keywords::Unsafe) &&
8043 self.look_ahead(1, |t| t.is_keyword(keywords::Async))
8045 self.check_keyword(keywords::Async) &&
8046 self.look_ahead(1, |t| t.is_keyword(keywords::Fn))
8049 // ASYNC FUNCTION ITEM
8050 let unsafety = self.parse_unsafety();
8051 self.expect_keyword(keywords::Async)?;
8052 let async_span = self.prev_span;
8053 self.expect_keyword(keywords::Fn)?;
8054 let fn_span = self.prev_span;
8055 let (ident, item_, extra_attrs) =
8056 self.parse_item_fn(unsafety,
8057 respan(async_span, IsAsync::Async {
8058 closure_id: ast::DUMMY_NODE_ID,
8059 return_impl_trait_id: ast::DUMMY_NODE_ID,
8060 arguments: Vec::new(),
8062 respan(fn_span, Constness::NotConst),
8064 let prev_span = self.prev_span;
8065 let item = self.mk_item(lo.to(prev_span),
8069 maybe_append(attrs, extra_attrs));
8070 if self.span.rust_2015() {
8071 self.diagnostic().struct_span_err_with_code(
8073 "`async fn` is not permitted in the 2015 edition",
8074 DiagnosticId::Error("E0670".into())
8077 return Ok(Some(item));
8079 if self.check_keyword(keywords::Unsafe) &&
8080 (self.look_ahead(1, |t| t.is_keyword(keywords::Trait)) ||
8081 self.look_ahead(1, |t| t.is_keyword(keywords::Auto)))
8083 // UNSAFE TRAIT ITEM
8084 self.bump(); // `unsafe`
8085 let is_auto = if self.eat_keyword(keywords::Trait) {
8088 self.expect_keyword(keywords::Auto)?;
8089 self.expect_keyword(keywords::Trait)?;
8092 let (ident, item_, extra_attrs) =
8093 self.parse_item_trait(is_auto, Unsafety::Unsafe)?;
8094 let prev_span = self.prev_span;
8095 let item = self.mk_item(lo.to(prev_span),
8099 maybe_append(attrs, extra_attrs));
8100 return Ok(Some(item));
8102 if self.check_keyword(keywords::Impl) ||
8103 self.check_keyword(keywords::Unsafe) &&
8104 self.look_ahead(1, |t| t.is_keyword(keywords::Impl)) ||
8105 self.check_keyword(keywords::Default) &&
8106 self.look_ahead(1, |t| t.is_keyword(keywords::Impl)) ||
8107 self.check_keyword(keywords::Default) &&
8108 self.look_ahead(1, |t| t.is_keyword(keywords::Unsafe)) {
8110 let defaultness = self.parse_defaultness();
8111 let unsafety = self.parse_unsafety();
8112 self.expect_keyword(keywords::Impl)?;
8113 let (ident, item, extra_attrs) = self.parse_item_impl(unsafety, defaultness)?;
8114 let span = lo.to(self.prev_span);
8115 return Ok(Some(self.mk_item(span, ident, item, visibility,
8116 maybe_append(attrs, extra_attrs))));
8118 if self.check_keyword(keywords::Fn) {
8121 let fn_span = self.prev_span;
8122 let (ident, item_, extra_attrs) =
8123 self.parse_item_fn(Unsafety::Normal,
8124 respan(fn_span, IsAsync::NotAsync),
8125 respan(fn_span, Constness::NotConst),
8127 let prev_span = self.prev_span;
8128 let item = self.mk_item(lo.to(prev_span),
8132 maybe_append(attrs, extra_attrs));
8133 return Ok(Some(item));
8135 if self.check_keyword(keywords::Unsafe)
8136 && self.look_ahead(1, |t| *t != token::OpenDelim(token::Brace)) {
8137 // UNSAFE FUNCTION ITEM
8138 self.bump(); // `unsafe`
8139 // `{` is also expected after `unsafe`, in case of error, include it in the diagnostic
8140 self.check(&token::OpenDelim(token::Brace));
8141 let abi = if self.eat_keyword(keywords::Extern) {
8142 self.parse_opt_abi()?.unwrap_or(Abi::C)
8146 self.expect_keyword(keywords::Fn)?;
8147 let fn_span = self.prev_span;
8148 let (ident, item_, extra_attrs) =
8149 self.parse_item_fn(Unsafety::Unsafe,
8150 respan(fn_span, IsAsync::NotAsync),
8151 respan(fn_span, Constness::NotConst),
8153 let prev_span = self.prev_span;
8154 let item = self.mk_item(lo.to(prev_span),
8158 maybe_append(attrs, extra_attrs));
8159 return Ok(Some(item));
8161 if self.eat_keyword(keywords::Mod) {
8163 let (ident, item_, extra_attrs) =
8164 self.parse_item_mod(&attrs[..])?;
8165 let prev_span = self.prev_span;
8166 let item = self.mk_item(lo.to(prev_span),
8170 maybe_append(attrs, extra_attrs));
8171 return Ok(Some(item));
8173 if let Some(type_) = self.eat_type() {
8174 let (ident, alias, generics) = type_?;
8176 let item_ = match alias {
8177 AliasKind::Weak(ty) => ItemKind::Ty(ty, generics),
8178 AliasKind::Existential(bounds) => ItemKind::Existential(bounds, generics),
8180 let prev_span = self.prev_span;
8181 let item = self.mk_item(lo.to(prev_span),
8186 return Ok(Some(item));
8188 if self.eat_keyword(keywords::Enum) {
8190 let (ident, item_, extra_attrs) = self.parse_item_enum()?;
8191 let prev_span = self.prev_span;
8192 let item = self.mk_item(lo.to(prev_span),
8196 maybe_append(attrs, extra_attrs));
8197 return Ok(Some(item));
8199 if self.check_keyword(keywords::Trait)
8200 || (self.check_keyword(keywords::Auto)
8201 && self.look_ahead(1, |t| t.is_keyword(keywords::Trait)))
8203 let is_auto = if self.eat_keyword(keywords::Trait) {
8206 self.expect_keyword(keywords::Auto)?;
8207 self.expect_keyword(keywords::Trait)?;
8211 let (ident, item_, extra_attrs) =
8212 self.parse_item_trait(is_auto, Unsafety::Normal)?;
8213 let prev_span = self.prev_span;
8214 let item = self.mk_item(lo.to(prev_span),
8218 maybe_append(attrs, extra_attrs));
8219 return Ok(Some(item));
8221 if self.eat_keyword(keywords::Struct) {
8223 let (ident, item_, extra_attrs) = self.parse_item_struct()?;
8224 let prev_span = self.prev_span;
8225 let item = self.mk_item(lo.to(prev_span),
8229 maybe_append(attrs, extra_attrs));
8230 return Ok(Some(item));
8232 if self.is_union_item() {
8235 let (ident, item_, extra_attrs) = self.parse_item_union()?;
8236 let prev_span = self.prev_span;
8237 let item = self.mk_item(lo.to(prev_span),
8241 maybe_append(attrs, extra_attrs));
8242 return Ok(Some(item));
8244 if let Some(macro_def) = self.eat_macro_def(&attrs, &visibility, lo)? {
8245 return Ok(Some(macro_def));
8248 // Verify whether we have encountered a struct or method definition where the user forgot to
8249 // add the `struct` or `fn` keyword after writing `pub`: `pub S {}`
8250 if visibility.node.is_pub() &&
8251 self.check_ident() &&
8252 self.look_ahead(1, |t| *t != token::Not)
8254 // Space between `pub` keyword and the identifier
8257 // ^^^ `sp` points here
8258 let sp = self.prev_span.between(self.span);
8259 let full_sp = self.prev_span.to(self.span);
8260 let ident_sp = self.span;
8261 if self.look_ahead(1, |t| *t == token::OpenDelim(token::Brace)) {
8262 // possible public struct definition where `struct` was forgotten
8263 let ident = self.parse_ident().unwrap();
8264 let msg = format!("add `struct` here to parse `{}` as a public struct",
8266 let mut err = self.diagnostic()
8267 .struct_span_err(sp, "missing `struct` for struct definition");
8268 err.span_suggestion_short(
8269 sp, &msg, " struct ".into(), Applicability::MaybeIncorrect // speculative
8272 } else if self.look_ahead(1, |t| *t == token::OpenDelim(token::Paren)) {
8273 let ident = self.parse_ident().unwrap();
8275 let kw_name = if let Ok(Some(_)) = self.parse_self_arg() {
8280 self.consume_block(token::Paren);
8281 let (kw, kw_name, ambiguous) = if self.check(&token::RArrow) {
8282 self.eat_to_tokens(&[&token::OpenDelim(token::Brace)]);
8284 ("fn", kw_name, false)
8285 } else if self.check(&token::OpenDelim(token::Brace)) {
8287 ("fn", kw_name, false)
8288 } else if self.check(&token::Colon) {
8292 ("fn` or `struct", "function or struct", true)
8295 let msg = format!("missing `{}` for {} definition", kw, kw_name);
8296 let mut err = self.diagnostic().struct_span_err(sp, &msg);
8298 self.consume_block(token::Brace);
8299 let suggestion = format!("add `{}` here to parse `{}` as a public {}",
8303 err.span_suggestion_short(
8304 sp, &suggestion, format!(" {} ", kw), Applicability::MachineApplicable
8307 if let Ok(snippet) = self.sess.source_map().span_to_snippet(ident_sp) {
8308 err.span_suggestion(
8310 "if you meant to call a macro, try",
8311 format!("{}!", snippet),
8312 // this is the `ambiguous` conditional branch
8313 Applicability::MaybeIncorrect
8316 err.help("if you meant to call a macro, remove the `pub` \
8317 and add a trailing `!` after the identifier");
8321 } else if self.look_ahead(1, |t| *t == token::Lt) {
8322 let ident = self.parse_ident().unwrap();
8323 self.eat_to_tokens(&[&token::Gt]);
8325 let (kw, kw_name, ambiguous) = if self.eat(&token::OpenDelim(token::Paren)) {
8326 if let Ok(Some(_)) = self.parse_self_arg() {
8327 ("fn", "method", false)
8329 ("fn", "function", false)
8331 } else if self.check(&token::OpenDelim(token::Brace)) {
8332 ("struct", "struct", false)
8334 ("fn` or `struct", "function or struct", true)
8336 let msg = format!("missing `{}` for {} definition", kw, kw_name);
8337 let mut err = self.diagnostic().struct_span_err(sp, &msg);
8339 err.span_suggestion_short(
8341 &format!("add `{}` here to parse `{}` as a public {}", kw, ident, kw_name),
8342 format!(" {} ", kw),
8343 Applicability::MachineApplicable,
8349 self.parse_macro_use_or_failure(attrs, macros_allowed, attributes_allowed, lo, visibility)
8352 /// Parses a foreign item.
8353 crate fn parse_foreign_item(&mut self) -> PResult<'a, ForeignItem> {
8354 maybe_whole!(self, NtForeignItem, |ni| ni);
8356 let attrs = self.parse_outer_attributes()?;
8358 let visibility = self.parse_visibility(false)?;
8360 // FOREIGN STATIC ITEM
8361 // Treat `const` as `static` for error recovery, but don't add it to expected tokens.
8362 if self.check_keyword(keywords::Static) || self.token.is_keyword(keywords::Const) {
8363 if self.token.is_keyword(keywords::Const) {
8365 .struct_span_err(self.span, "extern items cannot be `const`")
8368 "try using a static value",
8369 "static".to_owned(),
8370 Applicability::MachineApplicable
8373 self.bump(); // `static` or `const`
8374 return Ok(self.parse_item_foreign_static(visibility, lo, attrs)?);
8376 // FOREIGN FUNCTION ITEM
8377 if self.check_keyword(keywords::Fn) {
8378 return Ok(self.parse_item_foreign_fn(visibility, lo, attrs)?);
8380 // FOREIGN TYPE ITEM
8381 if self.check_keyword(keywords::Type) {
8382 return Ok(self.parse_item_foreign_type(visibility, lo, attrs)?);
8385 match self.parse_assoc_macro_invoc("extern", Some(&visibility), &mut false)? {
8389 ident: keywords::Invalid.ident(),
8390 span: lo.to(self.prev_span),
8391 id: ast::DUMMY_NODE_ID,
8394 node: ForeignItemKind::Macro(mac),
8399 if !attrs.is_empty() {
8400 self.expected_item_err(&attrs)?;
8408 /// This is the fall-through for parsing items.
8409 fn parse_macro_use_or_failure(
8411 attrs: Vec<Attribute> ,
8412 macros_allowed: bool,
8413 attributes_allowed: bool,
8415 visibility: Visibility
8416 ) -> PResult<'a, Option<P<Item>>> {
8417 if macros_allowed && self.token.is_path_start() &&
8418 !(self.is_async_fn() && self.span.rust_2015()) {
8419 // MACRO INVOCATION ITEM
8421 let prev_span = self.prev_span;
8422 self.complain_if_pub_macro(&visibility.node, prev_span);
8424 let mac_lo = self.span;
8427 let pth = self.parse_path(PathStyle::Mod)?;
8428 self.expect(&token::Not)?;
8430 // a 'special' identifier (like what `macro_rules!` uses)
8431 // is optional. We should eventually unify invoc syntax
8433 let id = if self.token.is_ident() {
8436 keywords::Invalid.ident() // no special identifier
8438 // eat a matched-delimiter token tree:
8439 let (delim, tts) = self.expect_delimited_token_tree()?;
8440 if delim != MacDelimiter::Brace && !self.eat(&token::Semi) {
8441 self.report_invalid_macro_expansion_item();
8444 let hi = self.prev_span;
8445 let mac = respan(mac_lo.to(hi), Mac_ { path: pth, tts, delim });
8446 let item = self.mk_item(lo.to(hi), id, ItemKind::Mac(mac), visibility, attrs);
8447 return Ok(Some(item));
8450 // FAILURE TO PARSE ITEM
8451 match visibility.node {
8452 VisibilityKind::Inherited => {}
8454 return Err(self.span_fatal(self.prev_span, "unmatched visibility `pub`"));
8458 if !attributes_allowed && !attrs.is_empty() {
8459 self.expected_item_err(&attrs)?;
8464 /// Parses a macro invocation inside a `trait`, `impl` or `extern` block.
8465 fn parse_assoc_macro_invoc(&mut self, item_kind: &str, vis: Option<&Visibility>,
8466 at_end: &mut bool) -> PResult<'a, Option<Mac>>
8468 if self.token.is_path_start() &&
8469 !(self.is_async_fn() && self.span.rust_2015()) {
8470 let prev_span = self.prev_span;
8472 let pth = self.parse_path(PathStyle::Mod)?;
8474 if pth.segments.len() == 1 {
8475 if !self.eat(&token::Not) {
8476 return Err(self.missing_assoc_item_kind_err(item_kind, prev_span));
8479 self.expect(&token::Not)?;
8482 if let Some(vis) = vis {
8483 self.complain_if_pub_macro(&vis.node, prev_span);
8488 // eat a matched-delimiter token tree:
8489 let (delim, tts) = self.expect_delimited_token_tree()?;
8490 if delim != MacDelimiter::Brace {
8491 self.expect(&token::Semi)?;
8494 Ok(Some(respan(lo.to(self.prev_span), Mac_ { path: pth, tts, delim })))
8500 fn collect_tokens<F, R>(&mut self, f: F) -> PResult<'a, (R, TokenStream)>
8501 where F: FnOnce(&mut Self) -> PResult<'a, R>
8503 // Record all tokens we parse when parsing this item.
8504 let mut tokens = Vec::new();
8505 let prev_collecting = match self.token_cursor.frame.last_token {
8506 LastToken::Collecting(ref mut list) => {
8507 Some(mem::replace(list, Vec::new()))
8509 LastToken::Was(ref mut last) => {
8510 tokens.extend(last.take());
8514 self.token_cursor.frame.last_token = LastToken::Collecting(tokens);
8515 let prev = self.token_cursor.stack.len();
8517 let last_token = if self.token_cursor.stack.len() == prev {
8518 &mut self.token_cursor.frame.last_token
8520 &mut self.token_cursor.stack[prev].last_token
8523 // Pull out the tokens that we've collected from the call to `f` above.
8524 let mut collected_tokens = match *last_token {
8525 LastToken::Collecting(ref mut v) => mem::replace(v, Vec::new()),
8526 LastToken::Was(_) => panic!("our vector went away?"),
8529 // If we're not at EOF our current token wasn't actually consumed by
8530 // `f`, but it'll still be in our list that we pulled out. In that case
8532 let extra_token = if self.token != token::Eof {
8533 collected_tokens.pop()
8538 // If we were previously collecting tokens, then this was a recursive
8539 // call. In that case we need to record all the tokens we collected in
8540 // our parent list as well. To do that we push a clone of our stream
8541 // onto the previous list.
8542 match prev_collecting {
8544 list.extend(collected_tokens.iter().cloned());
8545 list.extend(extra_token);
8546 *last_token = LastToken::Collecting(list);
8549 *last_token = LastToken::Was(extra_token);
8553 Ok((ret?, TokenStream::new(collected_tokens)))
8556 pub fn parse_item(&mut self) -> PResult<'a, Option<P<Item>>> {
8557 let attrs = self.parse_outer_attributes()?;
8558 self.parse_item_(attrs, true, false)
8562 fn is_import_coupler(&mut self) -> bool {
8563 self.check(&token::ModSep) &&
8564 self.look_ahead(1, |t| *t == token::OpenDelim(token::Brace) ||
8565 *t == token::BinOp(token::Star))
8568 /// Parses a `UseTree`.
8571 /// USE_TREE = [`::`] `*` |
8572 /// [`::`] `{` USE_TREE_LIST `}` |
8574 /// PATH `::` `{` USE_TREE_LIST `}` |
8575 /// PATH [`as` IDENT]
8577 fn parse_use_tree(&mut self) -> PResult<'a, UseTree> {
8580 let mut prefix = ast::Path { segments: Vec::new(), span: lo.shrink_to_lo() };
8581 let kind = if self.check(&token::OpenDelim(token::Brace)) ||
8582 self.check(&token::BinOp(token::Star)) ||
8583 self.is_import_coupler() {
8584 // `use *;` or `use ::*;` or `use {...};` or `use ::{...};`
8585 let mod_sep_ctxt = self.span.ctxt();
8586 if self.eat(&token::ModSep) {
8587 prefix.segments.push(
8588 PathSegment::path_root(lo.shrink_to_lo().with_ctxt(mod_sep_ctxt))
8592 if self.eat(&token::BinOp(token::Star)) {
8595 UseTreeKind::Nested(self.parse_use_tree_list()?)
8598 // `use path::*;` or `use path::{...};` or `use path;` or `use path as bar;`
8599 prefix = self.parse_path(PathStyle::Mod)?;
8601 if self.eat(&token::ModSep) {
8602 if self.eat(&token::BinOp(token::Star)) {
8605 UseTreeKind::Nested(self.parse_use_tree_list()?)
8608 UseTreeKind::Simple(self.parse_rename()?, ast::DUMMY_NODE_ID, ast::DUMMY_NODE_ID)
8612 Ok(UseTree { prefix, kind, span: lo.to(self.prev_span) })
8615 /// Parses a `UseTreeKind::Nested(list)`.
8618 /// USE_TREE_LIST = Ø | (USE_TREE `,`)* USE_TREE [`,`]
8620 fn parse_use_tree_list(&mut self) -> PResult<'a, Vec<(UseTree, ast::NodeId)>> {
8621 self.parse_unspanned_seq(&token::OpenDelim(token::Brace),
8622 &token::CloseDelim(token::Brace),
8623 SeqSep::trailing_allowed(token::Comma), |this| {
8624 Ok((this.parse_use_tree()?, ast::DUMMY_NODE_ID))
8628 fn parse_rename(&mut self) -> PResult<'a, Option<Ident>> {
8629 if self.eat_keyword(keywords::As) {
8630 self.parse_ident_or_underscore().map(Some)
8636 /// Parses a source module as a crate. This is the main entry point for the parser.
8637 pub fn parse_crate_mod(&mut self) -> PResult<'a, Crate> {
8639 let krate = Ok(ast::Crate {
8640 attrs: self.parse_inner_attributes()?,
8641 module: self.parse_mod_items(&token::Eof, lo)?,
8642 span: lo.to(self.span),
8647 pub fn parse_optional_str(&mut self) -> Option<(Symbol, ast::StrStyle, Option<ast::Name>)> {
8648 let ret = match self.token {
8649 token::Literal(token::Str_(s), suf) => (s, ast::StrStyle::Cooked, suf),
8650 token::Literal(token::StrRaw(s, n), suf) => (s, ast::StrStyle::Raw(n), suf),
8657 pub fn parse_str(&mut self) -> PResult<'a, (Symbol, StrStyle)> {
8658 match self.parse_optional_str() {
8659 Some((s, style, suf)) => {
8660 let sp = self.prev_span;
8661 self.expect_no_suffix(sp, "a string literal", suf);
8665 let msg = "expected string literal";
8666 let mut err = self.fatal(msg);
8667 err.span_label(self.span, msg);
8673 fn report_invalid_macro_expansion_item(&self) {
8674 self.struct_span_err(
8676 "macros that expand to items must be delimited with braces or followed by a semicolon",
8677 ).multipart_suggestion(
8678 "change the delimiters to curly braces",
8680 (self.prev_span.with_hi(self.prev_span.lo() + BytePos(1)), String::from(" {")),
8681 (self.prev_span.with_lo(self.prev_span.hi() - BytePos(1)), '}'.to_string()),
8683 Applicability::MaybeIncorrect,
8685 self.sess.source_map.next_point(self.prev_span),
8688 Applicability::MaybeIncorrect,
8692 /// Recover from `pub` keyword in places where it seems _reasonable_ but isn't valid.
8693 fn eat_bad_pub(&mut self) {
8694 if self.token.is_keyword(keywords::Pub) {
8695 match self.parse_visibility(false) {
8697 let mut err = self.diagnostic()
8698 .struct_span_err(vis.span, "unnecessary visibility qualifier");
8699 err.span_label(vis.span, "`pub` not permitted here");
8702 Err(mut err) => err.emit(),
8707 /// When lowering a `async fn` to the HIR, we need to move all of the arguments of the function
8708 /// into the generated closure so that they are dropped when the future is polled and not when
8711 /// The arguments of the function are replaced in HIR lowering with the arguments created by
8712 /// this function and the statements created here are inserted at the top of the closure body.
8713 fn construct_async_arguments(&mut self, asyncness: &mut Spanned<IsAsync>, decl: &FnDecl) {
8714 if let IsAsync::Async { ref mut arguments, .. } = asyncness.node {
8715 for (index, input) in decl.inputs.iter().enumerate() {
8716 let id = ast::DUMMY_NODE_ID;
8717 let span = input.pat.span;
8719 // Construct a name for our temporary argument.
8720 let name = format!("__arg{}", index);
8721 let ident = Ident::from_str(&name).gensym();
8723 // Check if this is a ident pattern, if so, we can optimize and avoid adding a
8724 // `let <pat> = __argN;` statement, instead just adding a `let <pat> = <pat>;`
8726 let (binding_mode, ident, is_simple_pattern) = match input.pat.node {
8727 PatKind::Ident(binding_mode, ident, _) => (binding_mode, ident, true),
8728 _ => (BindingMode::ByValue(Mutability::Immutable), ident, false),
8731 // Construct an argument representing `__argN: <ty>` to replace the argument of the
8732 // async function if it isn't a simple pattern.
8733 let arg = if is_simple_pattern {
8737 ty: input.ty.clone(),
8741 node: PatKind::Ident(
8742 BindingMode::ByValue(Mutability::Immutable), ident, None,
8746 source: ArgSource::AsyncFn(input.pat.clone()),
8750 // Construct a `let __argN = __argN;` statement to insert at the top of the
8751 // async closure. This makes sure that the argument is captured by the closure and
8752 // that the drop order is correct.
8753 let move_local = Local {
8756 node: PatKind::Ident(binding_mode, ident, None),
8759 // We explicitly do not specify the type for this statement. When the user's
8760 // argument type is `impl Trait` then this would require the
8761 // `impl_trait_in_bindings` feature to also be present for that same type to
8762 // be valid in this binding. At the time of writing (13 Mar 19),
8763 // `impl_trait_in_bindings` is not stable.
8767 node: ExprKind::Path(None, ast::Path {
8769 segments: vec![PathSegment { ident, id, args: None }],
8772 attrs: ThinVec::new(),
8776 attrs: ThinVec::new(),
8777 source: LocalSource::AsyncFn,
8780 // Construct a `let <pat> = __argN;` statement to insert at the top of the
8781 // async closure if this isn't a simple pattern.
8782 let pat_stmt = if is_simple_pattern {
8787 node: StmtKind::Local(P(Local {
8788 pat: input.pat.clone(),
8789 ..move_local.clone()
8795 let move_stmt = Stmt { id, node: StmtKind::Local(P(move_local)), span };
8796 arguments.push(AsyncArgument { ident, arg, pat_stmt, move_stmt });
8802 pub fn emit_unclosed_delims(unclosed_delims: &mut Vec<UnmatchedBrace>, handler: &errors::Handler) {
8803 for unmatched in unclosed_delims.iter() {
8804 let mut err = handler.struct_span_err(unmatched.found_span, &format!(
8805 "incorrect close delimiter: `{}`",
8806 pprust::token_to_string(&token::Token::CloseDelim(unmatched.found_delim)),
8808 err.span_label(unmatched.found_span, "incorrect close delimiter");
8809 if let Some(sp) = unmatched.candidate_span {
8810 err.span_label(sp, "close delimiter possibly meant for this");
8812 if let Some(sp) = unmatched.unclosed_span {
8813 err.span_label(sp, "un-closed delimiter");
8817 unclosed_delims.clear();