1 // Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 use rustc_target::spec::abi::{self, Abi};
12 use ast::{AngleBracketedArgs, ParenthesisedArgs, AttrStyle, BareFnTy};
13 use ast::{GenericBound, TraitBoundModifier};
15 use ast::{Mod, AnonConst, Arg, Arm, Attribute, BindingMode, TraitItemKind};
17 use ast::{BlockCheckMode, CaptureBy, Movability};
18 use ast::{Constness, Crate};
21 use ast::{Expr, ExprKind, RangeLimits};
22 use ast::{Field, FnDecl, FnHeader};
23 use ast::{ForeignItem, ForeignItemKind, FunctionRetTy};
24 use ast::{GenericParam, GenericParamKind};
26 use ast::{Ident, ImplItem, IsAsync, IsAuto, Item, ItemKind};
27 use ast::{Label, Lifetime, Lit, LitKind};
29 use ast::MacStmtStyle;
30 use ast::{Mac, Mac_, MacDelimiter};
31 use ast::{MutTy, Mutability};
32 use ast::{Pat, PatKind, PathSegment};
33 use ast::{PolyTraitRef, QSelf};
34 use ast::{Stmt, StmtKind};
35 use ast::{VariantData, StructField};
38 use ast::{TraitItem, TraitRef, TraitObjectSyntax};
39 use ast::{Ty, TyKind, TypeBinding, GenericBounds};
40 use ast::{Visibility, VisibilityKind, WhereClause, CrateSugar};
41 use ast::{UseTree, UseTreeKind};
42 use ast::{BinOpKind, UnOp};
43 use ast::{RangeEnd, RangeSyntax};
45 use codemap::{self, CodeMap, Spanned, respan};
46 use syntax_pos::{self, Span, MultiSpan, BytePos, FileName, edition::Edition};
47 use errors::{self, Applicability, DiagnosticBuilder};
48 use parse::{self, SeqSep, classify, token};
49 use parse::lexer::TokenAndSpan;
50 use parse::lexer::comments::{doc_comment_style, strip_doc_comment_decoration};
51 use parse::{new_sub_parser_from_file, ParseSess, Directory, DirectoryOwnership};
52 use util::parser::{AssocOp, Fixity};
56 use tokenstream::{self, Delimited, ThinTokenStream, TokenTree, TokenStream};
57 use symbol::{Symbol, keywords};
63 use std::path::{self, Path, PathBuf};
67 /// Whether the type alias or associated type is a concrete type or an existential type
69 /// Just a new name for the same type
71 /// Only trait impls of the type will be usable, not the actual type itself
72 Existential(GenericBounds),
76 struct Restrictions: u8 {
77 const STMT_EXPR = 1 << 0;
78 const NO_STRUCT_LITERAL = 1 << 1;
82 type ItemInfo = (Ident, ItemKind, Option<Vec<Attribute>>);
84 /// How to parse a path.
85 #[derive(Copy, Clone, PartialEq)]
87 /// In some contexts, notably in expressions, paths with generic arguments are ambiguous
88 /// with something else. For example, in expressions `segment < ....` can be interpreted
89 /// as a comparison and `segment ( ....` can be interpreted as a function call.
90 /// In all such contexts the non-path interpretation is preferred by default for practical
91 /// reasons, but the path interpretation can be forced by the disambiguator `::`, e.g.
92 /// `x<y>` - comparisons, `x::<y>` - unambiguously a path.
94 /// In other contexts, notably in types, no ambiguity exists and paths can be written
95 /// without the disambiguator, e.g. `x<y>` - unambiguously a path.
96 /// Paths with disambiguators are still accepted, `x::<Y>` - unambiguously a path too.
98 /// A path with generic arguments disallowed, e.g. `foo::bar::Baz`, used in imports,
99 /// visibilities or attributes.
100 /// Technically, this variant is unnecessary and e.g. `Expr` can be used instead
101 /// (paths in "mod" contexts have to be checked later for absence of generic arguments
102 /// anyway, due to macros), but it is used to avoid weird suggestions about expected
103 /// tokens when something goes wrong.
107 #[derive(Clone, Copy, PartialEq, Debug)]
113 #[derive(Clone, Copy, PartialEq, Debug)]
119 /// Possibly accept an `token::Interpolated` expression (a pre-parsed expression
120 /// dropped into the token stream, which happens while parsing the result of
121 /// macro expansion). Placement of these is not as complex as I feared it would
122 /// be. The important thing is to make sure that lookahead doesn't balk at
123 /// `token::Interpolated` tokens.
124 macro_rules! maybe_whole_expr {
126 if let token::Interpolated(nt) = $p.token.clone() {
128 token::NtExpr(ref e) | token::NtLiteral(ref e) => {
130 return Ok((*e).clone());
132 token::NtPath(ref path) => {
135 let kind = ExprKind::Path(None, (*path).clone());
136 return Ok($p.mk_expr(span, kind, ThinVec::new()));
138 token::NtBlock(ref block) => {
141 let kind = ExprKind::Block((*block).clone(), None);
142 return Ok($p.mk_expr(span, kind, ThinVec::new()));
150 /// As maybe_whole_expr, but for things other than expressions
151 macro_rules! maybe_whole {
152 ($p:expr, $constructor:ident, |$x:ident| $e:expr) => {
153 if let token::Interpolated(nt) = $p.token.clone() {
154 if let token::$constructor($x) = nt.0.clone() {
162 fn maybe_append(mut lhs: Vec<Attribute>, mut rhs: Option<Vec<Attribute>>) -> Vec<Attribute> {
163 if let Some(ref mut rhs) = rhs {
169 #[derive(Debug, Clone, Copy, PartialEq)]
180 trait RecoverQPath: Sized {
181 const PATH_STYLE: PathStyle = PathStyle::Expr;
182 fn to_ty(&self) -> Option<P<Ty>>;
183 fn to_recovered(&self, qself: Option<QSelf>, path: ast::Path) -> Self;
184 fn to_string(&self) -> String;
187 impl RecoverQPath for Ty {
188 const PATH_STYLE: PathStyle = PathStyle::Type;
189 fn to_ty(&self) -> Option<P<Ty>> {
190 Some(P(self.clone()))
192 fn to_recovered(&self, qself: Option<QSelf>, path: ast::Path) -> Self {
193 Self { span: path.span, node: TyKind::Path(qself, path), id: self.id }
195 fn to_string(&self) -> String {
196 pprust::ty_to_string(self)
200 impl RecoverQPath for Pat {
201 fn to_ty(&self) -> Option<P<Ty>> {
204 fn to_recovered(&self, qself: Option<QSelf>, path: ast::Path) -> Self {
205 Self { span: path.span, node: PatKind::Path(qself, path), id: self.id }
207 fn to_string(&self) -> String {
208 pprust::pat_to_string(self)
212 impl RecoverQPath for Expr {
213 fn to_ty(&self) -> Option<P<Ty>> {
216 fn to_recovered(&self, qself: Option<QSelf>, path: ast::Path) -> Self {
217 Self { span: path.span, node: ExprKind::Path(qself, path),
218 id: self.id, attrs: self.attrs.clone() }
220 fn to_string(&self) -> String {
221 pprust::expr_to_string(self)
225 /* ident is handled by common.rs */
228 pub struct Parser<'a> {
229 pub sess: &'a ParseSess,
230 /// the current token:
231 pub token: token::Token,
232 /// the span of the current token:
234 /// the span of the previous token:
235 meta_var_span: Option<Span>,
237 /// the previous token kind
238 prev_token_kind: PrevTokenKind,
239 restrictions: Restrictions,
240 /// Used to determine the path to externally loaded source files
241 crate directory: Directory<'a>,
242 /// Whether to parse sub-modules in other files.
243 pub recurse_into_file_modules: bool,
244 /// Name of the root module this parser originated from. If `None`, then the
245 /// name is not known. This does not change while the parser is descending
246 /// into modules, and sub-parsers have new values for this name.
247 pub root_module_name: Option<String>,
248 crate expected_tokens: Vec<TokenType>,
249 token_cursor: TokenCursor,
250 desugar_doc_comments: bool,
251 /// Whether we should configure out of line modules as we parse.
258 frame: TokenCursorFrame,
259 stack: Vec<TokenCursorFrame>,
263 struct TokenCursorFrame {
264 delim: token::DelimToken,
267 tree_cursor: tokenstream::Cursor,
269 last_token: LastToken,
272 /// This is used in `TokenCursorFrame` above to track tokens that are consumed
273 /// by the parser, and then that's transitively used to record the tokens that
274 /// each parse AST item is created with.
276 /// Right now this has two states, either collecting tokens or not collecting
277 /// tokens. If we're collecting tokens we just save everything off into a local
278 /// `Vec`. This should eventually though likely save tokens from the original
279 /// token stream and just use slicing of token streams to avoid creation of a
280 /// whole new vector.
282 /// The second state is where we're passively not recording tokens, but the last
283 /// token is still tracked for when we want to start recording tokens. This
284 /// "last token" means that when we start recording tokens we'll want to ensure
285 /// that this, the first token, is included in the output.
287 /// You can find some more example usage of this in the `collect_tokens` method
291 Collecting(Vec<TokenStream>),
292 Was(Option<TokenStream>),
295 impl TokenCursorFrame {
296 fn new(sp: Span, delimited: &Delimited) -> Self {
298 delim: delimited.delim,
300 open_delim: delimited.delim == token::NoDelim,
301 tree_cursor: delimited.stream().into_trees(),
302 close_delim: delimited.delim == token::NoDelim,
303 last_token: LastToken::Was(None),
309 fn next(&mut self) -> TokenAndSpan {
311 let tree = if !self.frame.open_delim {
312 self.frame.open_delim = true;
313 Delimited { delim: self.frame.delim, tts: TokenStream::empty().into() }
314 .open_tt(self.frame.span)
315 } else if let Some(tree) = self.frame.tree_cursor.next() {
317 } else if !self.frame.close_delim {
318 self.frame.close_delim = true;
319 Delimited { delim: self.frame.delim, tts: TokenStream::empty().into() }
320 .close_tt(self.frame.span)
321 } else if let Some(frame) = self.stack.pop() {
325 return TokenAndSpan { tok: token::Eof, sp: syntax_pos::DUMMY_SP }
328 match self.frame.last_token {
329 LastToken::Collecting(ref mut v) => v.push(tree.clone().into()),
330 LastToken::Was(ref mut t) => *t = Some(tree.clone().into()),
334 TokenTree::Token(sp, tok) => return TokenAndSpan { tok: tok, sp: sp },
335 TokenTree::Delimited(sp, ref delimited) => {
336 let frame = TokenCursorFrame::new(sp, delimited);
337 self.stack.push(mem::replace(&mut self.frame, frame));
343 fn next_desugared(&mut self) -> TokenAndSpan {
344 let (sp, name) = match self.next() {
345 TokenAndSpan { sp, tok: token::DocComment(name) } => (sp, name),
349 let stripped = strip_doc_comment_decoration(&name.as_str());
351 // Searches for the occurrences of `"#*` and returns the minimum number of `#`s
352 // required to wrap the text.
353 let mut num_of_hashes = 0;
355 for ch in stripped.chars() {
358 '#' if count > 0 => count + 1,
361 num_of_hashes = cmp::max(num_of_hashes, count);
364 let body = TokenTree::Delimited(sp, Delimited {
365 delim: token::Bracket,
366 tts: [TokenTree::Token(sp, token::Ident(ast::Ident::from_str("doc"), false)),
367 TokenTree::Token(sp, token::Eq),
368 TokenTree::Token(sp, token::Literal(
369 token::StrRaw(Symbol::intern(&stripped), num_of_hashes), None))]
370 .iter().cloned().collect::<TokenStream>().into(),
373 self.stack.push(mem::replace(&mut self.frame, TokenCursorFrame::new(sp, &Delimited {
374 delim: token::NoDelim,
375 tts: if doc_comment_style(&name.as_str()) == AttrStyle::Inner {
376 [TokenTree::Token(sp, token::Pound), TokenTree::Token(sp, token::Not), body]
377 .iter().cloned().collect::<TokenStream>().into()
379 [TokenTree::Token(sp, token::Pound), body]
380 .iter().cloned().collect::<TokenStream>().into()
388 #[derive(Clone, PartialEq)]
389 crate enum TokenType {
391 Keyword(keywords::Keyword),
400 fn to_string(&self) -> String {
402 TokenType::Token(ref t) => format!("`{}`", pprust::token_to_string(t)),
403 TokenType::Keyword(kw) => format!("`{}`", kw.name()),
404 TokenType::Operator => "an operator".to_string(),
405 TokenType::Lifetime => "lifetime".to_string(),
406 TokenType::Ident => "identifier".to_string(),
407 TokenType::Path => "path".to_string(),
408 TokenType::Type => "type".to_string(),
413 /// Returns true if `IDENT t` can start a type - `IDENT::a::b`, `IDENT<u8, u8>`,
414 /// `IDENT<<u8 as Trait>::AssocTy>`.
416 /// Types can also be of the form `IDENT(u8, u8) -> u8`, however this assumes
417 /// that IDENT is not the ident of a fn trait
418 fn can_continue_type_after_non_fn_ident(t: &token::Token) -> bool {
419 t == &token::ModSep || t == &token::Lt ||
420 t == &token::BinOp(token::Shl)
423 /// Information about the path to a module.
424 pub struct ModulePath {
427 pub result: Result<ModulePathSuccess, Error>,
430 pub struct ModulePathSuccess {
432 pub directory_ownership: DirectoryOwnership,
437 FileNotFoundForModule {
439 default_path: String,
440 secondary_path: String,
445 default_path: String,
446 secondary_path: String,
449 InclusiveRangeWithNoEnd,
453 fn span_err<S: Into<MultiSpan>>(self,
455 handler: &errors::Handler) -> DiagnosticBuilder {
457 Error::FileNotFoundForModule { ref mod_name,
461 let mut err = struct_span_err!(handler, sp, E0583,
462 "file not found for module `{}`", mod_name);
463 err.help(&format!("name the file either {} or {} inside the directory \"{}\"",
469 Error::DuplicatePaths { ref mod_name, ref default_path, ref secondary_path } => {
470 let mut err = struct_span_err!(handler, sp, E0584,
471 "file for module `{}` found at both {} and {}",
475 err.help("delete or rename one of them to remove the ambiguity");
478 Error::UselessDocComment => {
479 let mut err = struct_span_err!(handler, sp, E0585,
480 "found a documentation comment that doesn't document anything");
481 err.help("doc comments must come before what they document, maybe a comment was \
482 intended with `//`?");
485 Error::InclusiveRangeWithNoEnd => {
486 let mut err = struct_span_err!(handler, sp, E0586,
487 "inclusive range with no end");
488 err.help("inclusive ranges must be bounded at the end (`..=b` or `a..=b`)");
498 AttributesParsed(ThinVec<Attribute>),
499 AlreadyParsed(P<Expr>),
502 impl From<Option<ThinVec<Attribute>>> for LhsExpr {
503 fn from(o: Option<ThinVec<Attribute>>) -> Self {
504 if let Some(attrs) = o {
505 LhsExpr::AttributesParsed(attrs)
507 LhsExpr::NotYetParsed
512 impl From<P<Expr>> for LhsExpr {
513 fn from(expr: P<Expr>) -> Self {
514 LhsExpr::AlreadyParsed(expr)
518 /// Create a placeholder argument.
519 fn dummy_arg(span: Span) -> Arg {
520 let ident = Ident::new(keywords::Invalid.name(), span);
522 id: ast::DUMMY_NODE_ID,
523 node: PatKind::Ident(BindingMode::ByValue(Mutability::Immutable), ident, None),
529 id: ast::DUMMY_NODE_ID
531 Arg { ty: P(ty), pat: pat, id: ast::DUMMY_NODE_ID }
534 #[derive(Copy, Clone, Debug)]
535 enum TokenExpectType {
540 impl<'a> Parser<'a> {
541 pub fn new(sess: &'a ParseSess,
543 directory: Option<Directory<'a>>,
544 recurse_into_file_modules: bool,
545 desugar_doc_comments: bool)
547 let mut parser = Parser {
549 token: token::Whitespace,
550 span: syntax_pos::DUMMY_SP,
551 prev_span: syntax_pos::DUMMY_SP,
553 prev_token_kind: PrevTokenKind::Other,
554 restrictions: Restrictions::empty(),
555 recurse_into_file_modules,
556 directory: Directory {
557 path: Cow::from(PathBuf::new()),
558 ownership: DirectoryOwnership::Owned { relative: None }
560 root_module_name: None,
561 expected_tokens: Vec::new(),
562 token_cursor: TokenCursor {
563 frame: TokenCursorFrame::new(syntax_pos::DUMMY_SP, &Delimited {
564 delim: token::NoDelim,
569 desugar_doc_comments,
573 let tok = parser.next_tok();
574 parser.token = tok.tok;
575 parser.span = tok.sp;
577 if let Some(directory) = directory {
578 parser.directory = directory;
579 } else if !parser.span.is_dummy() {
580 if let FileName::Real(mut path) = sess.codemap().span_to_unmapped_path(parser.span) {
582 parser.directory.path = Cow::from(path);
586 parser.process_potential_macro_variable();
590 fn next_tok(&mut self) -> TokenAndSpan {
591 let mut next = if self.desugar_doc_comments {
592 self.token_cursor.next_desugared()
594 self.token_cursor.next()
596 if next.sp.is_dummy() {
597 // Tweak the location for better diagnostics, but keep syntactic context intact.
598 next.sp = self.prev_span.with_ctxt(next.sp.ctxt());
603 /// Convert the current token to a string using self's reader
604 pub fn this_token_to_string(&self) -> String {
605 pprust::token_to_string(&self.token)
608 fn token_descr(&self) -> Option<&'static str> {
609 Some(match &self.token {
610 t if t.is_special_ident() => "reserved identifier",
611 t if t.is_used_keyword() => "keyword",
612 t if t.is_unused_keyword() => "reserved keyword",
617 fn this_token_descr(&self) -> String {
618 if let Some(prefix) = self.token_descr() {
619 format!("{} `{}`", prefix, self.this_token_to_string())
621 format!("`{}`", self.this_token_to_string())
625 fn unexpected_last<T>(&self, t: &token::Token) -> PResult<'a, T> {
626 let token_str = pprust::token_to_string(t);
627 Err(self.span_fatal(self.prev_span, &format!("unexpected token: `{}`", token_str)))
630 crate fn unexpected<T>(&mut self) -> PResult<'a, T> {
631 match self.expect_one_of(&[], &[]) {
633 Ok(_) => unreachable!(),
637 /// Expect and consume the token t. Signal an error if
638 /// the next token is not t.
639 pub fn expect(&mut self, t: &token::Token) -> PResult<'a, ()> {
640 if self.expected_tokens.is_empty() {
641 if self.token == *t {
645 let token_str = pprust::token_to_string(t);
646 let this_token_str = self.this_token_to_string();
647 let mut err = self.fatal(&format!("expected `{}`, found `{}`",
651 let sp = if self.token == token::Token::Eof {
652 // EOF, don't want to point at the following char, but rather the last token
655 self.sess.codemap().next_point(self.prev_span)
657 let label_exp = format!("expected `{}`", token_str);
658 let cm = self.sess.codemap();
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 /// Expect next token to be edible or inedible token. If edible,
678 /// then consume it; if inedible, then return without consuming
679 /// anything. Signal a fatal error if next token is unexpected.
680 fn expect_one_of(&mut self,
681 edible: &[token::Token],
682 inedible: &[token::Token]) -> PResult<'a, ()>{
683 fn tokens_to_string(tokens: &[TokenType]) -> String {
684 let mut i = tokens.iter();
685 // This might be a sign we need a connect method on Iterator.
687 .map_or("".to_string(), |t| t.to_string());
688 i.enumerate().fold(b, |mut b, (i, a)| {
689 if tokens.len() > 2 && i == tokens.len() - 2 {
691 } else if tokens.len() == 2 && i == tokens.len() - 2 {
696 b.push_str(&a.to_string());
700 if edible.contains(&self.token) {
703 } else if inedible.contains(&self.token) {
704 // leave it in the input
707 let mut expected = edible.iter()
708 .map(|x| TokenType::Token(x.clone()))
709 .chain(inedible.iter().map(|x| TokenType::Token(x.clone())))
710 .chain(self.expected_tokens.iter().cloned())
711 .collect::<Vec<_>>();
712 expected.sort_by_cached_key(|x| x.to_string());
714 let expect = tokens_to_string(&expected[..]);
715 let actual = self.this_token_to_string();
716 let (msg_exp, (label_sp, label_exp)) = if expected.len() > 1 {
717 let short_expect = if expected.len() > 6 {
718 format!("{} possible tokens", expected.len())
722 (format!("expected one of {}, found `{}`", expect, actual),
723 (self.sess.codemap().next_point(self.prev_span),
724 format!("expected one of {} here", short_expect)))
725 } else if expected.is_empty() {
726 (format!("unexpected token: `{}`", actual),
727 (self.prev_span, "unexpected token after this".to_string()))
729 (format!("expected {}, found `{}`", expect, actual),
730 (self.sess.codemap().next_point(self.prev_span),
731 format!("expected {} here", expect)))
733 let mut err = self.fatal(&msg_exp);
734 let sp = if self.token == token::Token::Eof {
735 // This is EOF, don't want to point at the following char, but rather the last token
741 let cm = self.sess.codemap();
742 match (cm.lookup_line(self.span.lo()), cm.lookup_line(sp.lo())) {
743 (Ok(ref a), Ok(ref b)) if a.line == b.line => {
744 // When the spans are in the same line, it means that the only content between
745 // them is whitespace, point at the found token in that case:
747 // X | () => { syntax error };
748 // | ^^^^^ expected one of 8 possible tokens here
750 // instead of having:
752 // X | () => { syntax error };
753 // | -^^^^^ unexpected token
755 // | expected one of 8 possible tokens here
756 err.span_label(self.span, label_exp);
759 err.span_label(sp, label_exp);
760 err.span_label(self.span, "unexpected token");
767 /// returns the span of expr, if it was not interpolated or the span of the interpolated token
768 fn interpolated_or_expr_span(&self,
769 expr: PResult<'a, P<Expr>>)
770 -> PResult<'a, (Span, P<Expr>)> {
772 if self.prev_token_kind == PrevTokenKind::Interpolated {
780 fn expected_ident_found(&self) -> DiagnosticBuilder<'a> {
781 let mut err = self.struct_span_err(self.span,
782 &format!("expected identifier, found {}",
783 self.this_token_descr()));
784 if let Some(token_descr) = self.token_descr() {
785 err.span_label(self.span, format!("expected identifier, found {}", token_descr));
787 err.span_label(self.span, "expected identifier");
788 if self.token == token::Comma && self.look_ahead(1, |t| t.is_ident()) {
789 err.span_suggestion(self.span, "remove this comma", "".into());
795 pub fn parse_ident(&mut self) -> PResult<'a, ast::Ident> {
796 self.parse_ident_common(true)
799 fn parse_ident_common(&mut self, recover: bool) -> PResult<'a, ast::Ident> {
801 token::Ident(ident, _) => {
802 if self.token.is_reserved_ident() {
803 let mut err = self.expected_ident_found();
810 let span = self.span;
812 Ok(Ident::new(ident.name, span))
815 Err(if self.prev_token_kind == PrevTokenKind::DocComment {
816 self.span_fatal_err(self.prev_span, Error::UselessDocComment)
818 self.expected_ident_found()
824 /// Check if the next token is `tok`, and return `true` if so.
826 /// This method will automatically add `tok` to `expected_tokens` if `tok` is not
828 fn check(&mut self, tok: &token::Token) -> bool {
829 let is_present = self.token == *tok;
830 if !is_present { self.expected_tokens.push(TokenType::Token(tok.clone())); }
834 /// Consume token 'tok' if it exists. Returns true if the given
835 /// token was present, false otherwise.
836 pub fn eat(&mut self, tok: &token::Token) -> bool {
837 let is_present = self.check(tok);
838 if is_present { self.bump() }
842 fn check_keyword(&mut self, kw: keywords::Keyword) -> bool {
843 self.expected_tokens.push(TokenType::Keyword(kw));
844 self.token.is_keyword(kw)
847 /// If the next token is the given keyword, eat it and return
848 /// true. Otherwise, return false.
849 pub fn eat_keyword(&mut self, kw: keywords::Keyword) -> bool {
850 if self.check_keyword(kw) {
858 fn eat_keyword_noexpect(&mut self, kw: keywords::Keyword) -> bool {
859 if self.token.is_keyword(kw) {
867 /// If the given word is not a keyword, signal an error.
868 /// If the next token is not the given word, signal an error.
869 /// Otherwise, eat it.
870 fn expect_keyword(&mut self, kw: keywords::Keyword) -> PResult<'a, ()> {
871 if !self.eat_keyword(kw) {
878 fn check_ident(&mut self) -> bool {
879 if self.token.is_ident() {
882 self.expected_tokens.push(TokenType::Ident);
887 fn check_path(&mut self) -> bool {
888 if self.token.is_path_start() {
891 self.expected_tokens.push(TokenType::Path);
896 fn check_type(&mut self) -> bool {
897 if self.token.can_begin_type() {
900 self.expected_tokens.push(TokenType::Type);
905 /// Expect and consume a `+`. if `+=` is seen, replace it with a `=`
906 /// and continue. If a `+` is not seen, return false.
908 /// This is using when token splitting += into +.
909 /// See issue 47856 for an example of when this may occur.
910 fn eat_plus(&mut self) -> bool {
911 self.expected_tokens.push(TokenType::Token(token::BinOp(token::Plus)));
913 token::BinOp(token::Plus) => {
917 token::BinOpEq(token::Plus) => {
918 let span = self.span.with_lo(self.span.lo() + BytePos(1));
919 self.bump_with(token::Eq, span);
927 /// Checks to see if the next token is either `+` or `+=`.
928 /// Otherwise returns false.
929 fn check_plus(&mut self) -> bool {
930 if self.token.is_like_plus() {
934 self.expected_tokens.push(TokenType::Token(token::BinOp(token::Plus)));
939 /// Expect and consume an `&`. If `&&` is seen, replace it with a single
940 /// `&` and continue. If an `&` is not seen, signal an error.
941 fn expect_and(&mut self) -> PResult<'a, ()> {
942 self.expected_tokens.push(TokenType::Token(token::BinOp(token::And)));
944 token::BinOp(token::And) => {
949 let span = self.span.with_lo(self.span.lo() + BytePos(1));
950 Ok(self.bump_with(token::BinOp(token::And), span))
952 _ => self.unexpected()
956 /// Expect and consume an `|`. If `||` is seen, replace it with a single
957 /// `|` and continue. If an `|` is not seen, signal an error.
958 fn expect_or(&mut self) -> PResult<'a, ()> {
959 self.expected_tokens.push(TokenType::Token(token::BinOp(token::Or)));
961 token::BinOp(token::Or) => {
966 let span = self.span.with_lo(self.span.lo() + BytePos(1));
967 Ok(self.bump_with(token::BinOp(token::Or), span))
969 _ => self.unexpected()
973 fn expect_no_suffix(&self, sp: Span, kind: &str, suffix: Option<ast::Name>) {
975 None => {/* everything ok */}
977 let text = suf.as_str();
979 self.span_bug(sp, "found empty literal suffix in Some")
981 self.span_err(sp, &format!("{} with a suffix is invalid", kind));
986 /// Attempt to consume a `<`. If `<<` is seen, replace it with a single
987 /// `<` and continue. If a `<` is not seen, return false.
989 /// This is meant to be used when parsing generics on a path to get the
991 fn eat_lt(&mut self) -> bool {
992 self.expected_tokens.push(TokenType::Token(token::Lt));
998 token::BinOp(token::Shl) => {
999 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1000 self.bump_with(token::Lt, span);
1007 fn expect_lt(&mut self) -> PResult<'a, ()> {
1015 /// Expect and consume a GT. if a >> is seen, replace it
1016 /// with a single > and continue. If a GT is not seen,
1017 /// signal an error.
1018 fn expect_gt(&mut self) -> PResult<'a, ()> {
1019 self.expected_tokens.push(TokenType::Token(token::Gt));
1025 token::BinOp(token::Shr) => {
1026 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1027 Ok(self.bump_with(token::Gt, span))
1029 token::BinOpEq(token::Shr) => {
1030 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1031 Ok(self.bump_with(token::Ge, span))
1034 let span = self.span.with_lo(self.span.lo() + BytePos(1));
1035 Ok(self.bump_with(token::Eq, span))
1037 _ => self.unexpected()
1041 /// Eat and discard tokens until one of `kets` is encountered. Respects token trees,
1042 /// passes through any errors encountered. Used for error recovery.
1043 fn eat_to_tokens(&mut self, kets: &[&token::Token]) {
1044 let handler = self.diagnostic();
1046 if let Err(ref mut err) = self.parse_seq_to_before_tokens(kets,
1048 TokenExpectType::Expect,
1049 |p| Ok(p.parse_token_tree())) {
1050 handler.cancel(err);
1054 /// Parse a sequence, including the closing delimiter. The function
1055 /// f must consume tokens until reaching the next separator or
1056 /// closing bracket.
1057 pub fn parse_seq_to_end<T, F>(&mut self,
1061 -> PResult<'a, Vec<T>> where
1062 F: FnMut(&mut Parser<'a>) -> PResult<'a, T>,
1064 let val = self.parse_seq_to_before_end(ket, sep, f)?;
1069 /// Parse a sequence, not including the closing delimiter. The function
1070 /// f must consume tokens until reaching the next separator or
1071 /// closing bracket.
1072 pub fn parse_seq_to_before_end<T, F>(&mut self,
1076 -> PResult<'a, Vec<T>>
1077 where F: FnMut(&mut Parser<'a>) -> PResult<'a, T>
1079 self.parse_seq_to_before_tokens(&[ket], sep, TokenExpectType::Expect, f)
1082 fn parse_seq_to_before_tokens<T, F>(&mut self,
1083 kets: &[&token::Token],
1085 expect: TokenExpectType,
1087 -> PResult<'a, Vec<T>>
1088 where F: FnMut(&mut Parser<'a>) -> PResult<'a, T>
1090 let mut first: bool = true;
1092 while !kets.iter().any(|k| {
1094 TokenExpectType::Expect => self.check(k),
1095 TokenExpectType::NoExpect => self.token == **k,
1099 token::CloseDelim(..) | token::Eof => break,
1102 if let Some(ref t) = sep.sep {
1106 if let Err(mut e) = self.expect(t) {
1107 // Attempt to keep parsing if it was a similar separator
1108 if let Some(ref tokens) = t.similar_tokens() {
1109 if tokens.contains(&self.token) {
1114 // Attempt to keep parsing if it was an omitted separator
1128 if sep.trailing_sep_allowed && kets.iter().any(|k| {
1130 TokenExpectType::Expect => self.check(k),
1131 TokenExpectType::NoExpect => self.token == **k,
1144 /// Parse a sequence, including the closing delimiter. The function
1145 /// f must consume tokens until reaching the next separator or
1146 /// closing bracket.
1147 fn parse_unspanned_seq<T, F>(&mut self,
1152 -> PResult<'a, Vec<T>> where
1153 F: FnMut(&mut Parser<'a>) -> PResult<'a, T>,
1156 let result = self.parse_seq_to_before_end(ket, sep, f)?;
1157 if self.token == *ket {
1163 /// Advance the parser by one token
1164 pub fn bump(&mut self) {
1165 if self.prev_token_kind == PrevTokenKind::Eof {
1166 // Bumping after EOF is a bad sign, usually an infinite loop.
1167 self.bug("attempted to bump the parser past EOF (may be stuck in a loop)");
1170 self.prev_span = self.meta_var_span.take().unwrap_or(self.span);
1172 // Record last token kind for possible error recovery.
1173 self.prev_token_kind = match self.token {
1174 token::DocComment(..) => PrevTokenKind::DocComment,
1175 token::Comma => PrevTokenKind::Comma,
1176 token::BinOp(token::Plus) => PrevTokenKind::Plus,
1177 token::Interpolated(..) => PrevTokenKind::Interpolated,
1178 token::Eof => PrevTokenKind::Eof,
1179 token::Ident(..) => PrevTokenKind::Ident,
1180 _ => PrevTokenKind::Other,
1183 let next = self.next_tok();
1184 self.span = next.sp;
1185 self.token = next.tok;
1186 self.expected_tokens.clear();
1187 // check after each token
1188 self.process_potential_macro_variable();
1191 /// Advance the parser using provided token as a next one. Use this when
1192 /// consuming a part of a token. For example a single `<` from `<<`.
1193 fn bump_with(&mut self, next: token::Token, span: Span) {
1194 self.prev_span = self.span.with_hi(span.lo());
1195 // It would be incorrect to record the kind of the current token, but
1196 // fortunately for tokens currently using `bump_with`, the
1197 // prev_token_kind will be of no use anyway.
1198 self.prev_token_kind = PrevTokenKind::Other;
1201 self.expected_tokens.clear();
1204 pub fn look_ahead<R, F>(&self, dist: usize, f: F) -> R where
1205 F: FnOnce(&token::Token) -> R,
1208 return f(&self.token)
1211 f(&match self.token_cursor.frame.tree_cursor.look_ahead(dist - 1) {
1212 Some(tree) => match tree {
1213 TokenTree::Token(_, tok) => tok,
1214 TokenTree::Delimited(_, delimited) => token::OpenDelim(delimited.delim),
1216 None => token::CloseDelim(self.token_cursor.frame.delim),
1220 fn look_ahead_span(&self, dist: usize) -> Span {
1225 match self.token_cursor.frame.tree_cursor.look_ahead(dist - 1) {
1226 Some(TokenTree::Token(span, _)) | Some(TokenTree::Delimited(span, _)) => span,
1227 None => self.look_ahead_span(dist - 1),
1230 pub fn fatal(&self, m: &str) -> DiagnosticBuilder<'a> {
1231 self.sess.span_diagnostic.struct_span_fatal(self.span, m)
1233 pub fn span_fatal<S: Into<MultiSpan>>(&self, sp: S, m: &str) -> DiagnosticBuilder<'a> {
1234 self.sess.span_diagnostic.struct_span_fatal(sp, m)
1236 fn span_fatal_err<S: Into<MultiSpan>>(&self, sp: S, err: Error) -> DiagnosticBuilder<'a> {
1237 err.span_err(sp, self.diagnostic())
1239 fn bug(&self, m: &str) -> ! {
1240 self.sess.span_diagnostic.span_bug(self.span, m)
1242 fn span_err<S: Into<MultiSpan>>(&self, sp: S, m: &str) {
1243 self.sess.span_diagnostic.span_err(sp, m)
1245 fn struct_span_err<S: Into<MultiSpan>>(&self, sp: S, m: &str) -> DiagnosticBuilder<'a> {
1246 self.sess.span_diagnostic.struct_span_err(sp, m)
1248 crate fn span_bug<S: Into<MultiSpan>>(&self, sp: S, m: &str) -> ! {
1249 self.sess.span_diagnostic.span_bug(sp, m)
1251 crate fn abort_if_errors(&self) {
1252 self.sess.span_diagnostic.abort_if_errors();
1255 fn cancel(&self, err: &mut DiagnosticBuilder) {
1256 self.sess.span_diagnostic.cancel(err)
1259 crate fn diagnostic(&self) -> &'a errors::Handler {
1260 &self.sess.span_diagnostic
1263 /// Is the current token one of the keywords that signals a bare function
1265 fn token_is_bare_fn_keyword(&mut self) -> bool {
1266 self.check_keyword(keywords::Fn) ||
1267 self.check_keyword(keywords::Unsafe) ||
1268 self.check_keyword(keywords::Extern) && self.is_extern_non_path()
1271 /// parse a TyKind::BareFn type:
1272 fn parse_ty_bare_fn(&mut self, generic_params: Vec<GenericParam>) -> PResult<'a, TyKind> {
1275 [unsafe] [extern "ABI"] fn (S) -> T
1285 let unsafety = self.parse_unsafety();
1286 let abi = if self.eat_keyword(keywords::Extern) {
1287 self.parse_opt_abi()?.unwrap_or(Abi::C)
1292 self.expect_keyword(keywords::Fn)?;
1293 let (inputs, variadic) = self.parse_fn_args(false, true)?;
1294 let ret_ty = self.parse_ret_ty(false)?;
1295 let decl = P(FnDecl {
1300 Ok(TyKind::BareFn(P(BareFnTy {
1308 /// Parse asyncness: `async` or nothing
1309 fn parse_asyncness(&mut self) -> IsAsync {
1310 if self.eat_keyword(keywords::Async) {
1312 closure_id: ast::DUMMY_NODE_ID,
1313 return_impl_trait_id: ast::DUMMY_NODE_ID,
1320 /// Parse unsafety: `unsafe` or nothing.
1321 fn parse_unsafety(&mut self) -> Unsafety {
1322 if self.eat_keyword(keywords::Unsafe) {
1329 /// Parse the items in a trait declaration
1330 pub fn parse_trait_item(&mut self, at_end: &mut bool) -> PResult<'a, TraitItem> {
1331 maybe_whole!(self, NtTraitItem, |x| x);
1332 let attrs = self.parse_outer_attributes()?;
1333 let (mut item, tokens) = self.collect_tokens(|this| {
1334 this.parse_trait_item_(at_end, attrs)
1336 // See `parse_item` for why this clause is here.
1337 if !item.attrs.iter().any(|attr| attr.style == AttrStyle::Inner) {
1338 item.tokens = Some(tokens);
1343 fn parse_trait_item_(&mut self,
1345 mut attrs: Vec<Attribute>) -> PResult<'a, TraitItem> {
1348 let (name, node, generics) = if self.eat_keyword(keywords::Type) {
1349 self.parse_trait_item_assoc_ty()?
1350 } else if self.is_const_item() {
1351 self.expect_keyword(keywords::Const)?;
1352 let ident = self.parse_ident()?;
1353 self.expect(&token::Colon)?;
1354 let ty = self.parse_ty()?;
1355 let default = if self.check(&token::Eq) {
1357 let expr = self.parse_expr()?;
1358 self.expect(&token::Semi)?;
1361 self.expect(&token::Semi)?;
1364 (ident, TraitItemKind::Const(ty, default), ast::Generics::default())
1365 } else if let Some(mac) = self.parse_assoc_macro_invoc("trait", None, &mut false)? {
1366 // trait item macro.
1367 (keywords::Invalid.ident(), ast::TraitItemKind::Macro(mac), ast::Generics::default())
1369 let (constness, unsafety, asyncness, abi) = self.parse_fn_front_matter()?;
1371 let ident = self.parse_ident()?;
1372 let mut generics = self.parse_generics()?;
1374 let d = self.parse_fn_decl_with_self(|p: &mut Parser<'a>| {
1375 // This is somewhat dubious; We don't want to allow
1376 // argument names to be left off if there is a
1378 p.parse_arg_general(false)
1380 generics.where_clause = self.parse_where_clause()?;
1382 let sig = ast::MethodSig {
1392 let body = match self.token {
1396 debug!("parse_trait_methods(): parsing required method");
1399 token::OpenDelim(token::Brace) => {
1400 debug!("parse_trait_methods(): parsing provided method");
1402 let (inner_attrs, body) = self.parse_inner_attrs_and_block()?;
1403 attrs.extend(inner_attrs.iter().cloned());
1407 let token_str = self.this_token_to_string();
1408 let mut err = self.fatal(&format!("expected `;` or `{{`, found `{}`",
1410 err.span_label(self.span, "expected `;` or `{`");
1414 (ident, ast::TraitItemKind::Method(sig, body), generics)
1418 id: ast::DUMMY_NODE_ID,
1423 span: lo.to(self.prev_span),
1428 /// Parse optional return type [ -> TY ] in function decl
1429 fn parse_ret_ty(&mut self, allow_plus: bool) -> PResult<'a, FunctionRetTy> {
1430 if self.eat(&token::RArrow) {
1431 Ok(FunctionRetTy::Ty(self.parse_ty_common(allow_plus, true)?))
1433 Ok(FunctionRetTy::Default(self.span.shrink_to_lo()))
1438 pub fn parse_ty(&mut self) -> PResult<'a, P<Ty>> {
1439 self.parse_ty_common(true, true)
1442 /// Parse a type in restricted contexts where `+` is not permitted.
1443 /// Example 1: `&'a TYPE`
1444 /// `+` is prohibited to maintain operator priority (P(+) < P(&)).
1445 /// Example 2: `value1 as TYPE + value2`
1446 /// `+` is prohibited to avoid interactions with expression grammar.
1447 fn parse_ty_no_plus(&mut self) -> PResult<'a, P<Ty>> {
1448 self.parse_ty_common(false, true)
1451 fn parse_ty_common(&mut self, allow_plus: bool, allow_qpath_recovery: bool)
1452 -> PResult<'a, P<Ty>> {
1453 maybe_whole!(self, NtTy, |x| x);
1456 let mut impl_dyn_multi = false;
1457 let node = if self.eat(&token::OpenDelim(token::Paren)) {
1458 // `(TYPE)` is a parenthesized type.
1459 // `(TYPE,)` is a tuple with a single field of type TYPE.
1460 let mut ts = vec![];
1461 let mut last_comma = false;
1462 while self.token != token::CloseDelim(token::Paren) {
1463 ts.push(self.parse_ty()?);
1464 if self.eat(&token::Comma) {
1471 let trailing_plus = self.prev_token_kind == PrevTokenKind::Plus;
1472 self.expect(&token::CloseDelim(token::Paren))?;
1474 if ts.len() == 1 && !last_comma {
1475 let ty = ts.into_iter().nth(0).unwrap().into_inner();
1476 let maybe_bounds = allow_plus && self.token.is_like_plus();
1478 // `(TY_BOUND_NOPAREN) + BOUND + ...`.
1479 TyKind::Path(None, ref path) if maybe_bounds => {
1480 self.parse_remaining_bounds(Vec::new(), path.clone(), lo, true)?
1482 TyKind::TraitObject(ref bounds, TraitObjectSyntax::None)
1483 if maybe_bounds && bounds.len() == 1 && !trailing_plus => {
1484 let path = match bounds[0] {
1485 GenericBound::Trait(ref pt, ..) => pt.trait_ref.path.clone(),
1486 _ => self.bug("unexpected lifetime bound"),
1488 self.parse_remaining_bounds(Vec::new(), path, lo, true)?
1491 _ => TyKind::Paren(P(ty))
1496 } else if self.eat(&token::Not) {
1499 } else if self.eat(&token::BinOp(token::Star)) {
1501 TyKind::Ptr(self.parse_ptr()?)
1502 } else if self.eat(&token::OpenDelim(token::Bracket)) {
1504 let t = self.parse_ty()?;
1505 // Parse optional `; EXPR` in `[TYPE; EXPR]`
1506 let t = match self.maybe_parse_fixed_length_of_vec()? {
1507 None => TyKind::Slice(t),
1508 Some(length) => TyKind::Array(t, AnonConst {
1509 id: ast::DUMMY_NODE_ID,
1513 self.expect(&token::CloseDelim(token::Bracket))?;
1515 } else if self.check(&token::BinOp(token::And)) || self.check(&token::AndAnd) {
1518 self.parse_borrowed_pointee()?
1519 } else if self.eat_keyword_noexpect(keywords::Typeof) {
1521 // In order to not be ambiguous, the type must be surrounded by parens.
1522 self.expect(&token::OpenDelim(token::Paren))?;
1524 id: ast::DUMMY_NODE_ID,
1525 value: self.parse_expr()?,
1527 self.expect(&token::CloseDelim(token::Paren))?;
1529 } else if self.eat_keyword(keywords::Underscore) {
1530 // A type to be inferred `_`
1532 } else if self.token_is_bare_fn_keyword() {
1533 // Function pointer type
1534 self.parse_ty_bare_fn(Vec::new())?
1535 } else if self.check_keyword(keywords::For) {
1536 // Function pointer type or bound list (trait object type) starting with a poly-trait.
1537 // `for<'lt> [unsafe] [extern "ABI"] fn (&'lt S) -> T`
1538 // `for<'lt> Trait1<'lt> + Trait2 + 'a`
1540 let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
1541 if self.token_is_bare_fn_keyword() {
1542 self.parse_ty_bare_fn(lifetime_defs)?
1544 let path = self.parse_path(PathStyle::Type)?;
1545 let parse_plus = allow_plus && self.check_plus();
1546 self.parse_remaining_bounds(lifetime_defs, path, lo, parse_plus)?
1548 } else if self.eat_keyword(keywords::Impl) {
1549 // Always parse bounds greedily for better error recovery.
1550 let bounds = self.parse_generic_bounds()?;
1551 impl_dyn_multi = bounds.len() > 1 || self.prev_token_kind == PrevTokenKind::Plus;
1552 TyKind::ImplTrait(ast::DUMMY_NODE_ID, bounds)
1553 } else if self.check_keyword(keywords::Dyn) &&
1554 self.look_ahead(1, |t| t.can_begin_bound() &&
1555 !can_continue_type_after_non_fn_ident(t)) {
1556 self.bump(); // `dyn`
1557 // Always parse bounds greedily for better error recovery.
1558 let bounds = self.parse_generic_bounds()?;
1559 impl_dyn_multi = bounds.len() > 1 || self.prev_token_kind == PrevTokenKind::Plus;
1560 TyKind::TraitObject(bounds, TraitObjectSyntax::Dyn)
1561 } else if self.check(&token::Question) ||
1562 self.check_lifetime() && self.look_ahead(1, |t| t.is_like_plus()) {
1563 // Bound list (trait object type)
1564 TyKind::TraitObject(self.parse_generic_bounds_common(allow_plus)?,
1565 TraitObjectSyntax::None)
1566 } else if self.eat_lt() {
1568 let (qself, path) = self.parse_qpath(PathStyle::Type)?;
1569 TyKind::Path(Some(qself), path)
1570 } else if self.token.is_path_start() {
1572 let path = self.parse_path(PathStyle::Type)?;
1573 if self.eat(&token::Not) {
1574 // Macro invocation in type position
1575 let (delim, tts) = self.expect_delimited_token_tree()?;
1576 let node = Mac_ { path, tts, delim };
1577 TyKind::Mac(respan(lo.to(self.prev_span), node))
1579 // Just a type path or bound list (trait object type) starting with a trait.
1581 // `Trait1 + Trait2 + 'a`
1582 if allow_plus && self.check_plus() {
1583 self.parse_remaining_bounds(Vec::new(), path, lo, true)?
1585 TyKind::Path(None, path)
1589 let msg = format!("expected type, found {}", self.this_token_descr());
1590 return Err(self.fatal(&msg));
1593 let span = lo.to(self.prev_span);
1594 let ty = Ty { node, span, id: ast::DUMMY_NODE_ID };
1596 // Try to recover from use of `+` with incorrect priority.
1597 self.maybe_report_ambiguous_plus(allow_plus, impl_dyn_multi, &ty);
1598 self.maybe_recover_from_bad_type_plus(allow_plus, &ty)?;
1599 let ty = self.maybe_recover_from_bad_qpath(ty, allow_qpath_recovery)?;
1604 fn parse_remaining_bounds(&mut self, generic_params: Vec<GenericParam>, path: ast::Path,
1605 lo: Span, parse_plus: bool) -> PResult<'a, TyKind> {
1606 let poly_trait_ref = PolyTraitRef::new(generic_params, path, lo.to(self.prev_span));
1607 let mut bounds = vec![GenericBound::Trait(poly_trait_ref, TraitBoundModifier::None)];
1609 self.eat_plus(); // `+`, or `+=` gets split and `+` is discarded
1610 bounds.append(&mut self.parse_generic_bounds()?);
1612 Ok(TyKind::TraitObject(bounds, TraitObjectSyntax::None))
1615 fn maybe_report_ambiguous_plus(&mut self, allow_plus: bool, impl_dyn_multi: bool, ty: &Ty) {
1616 if !allow_plus && impl_dyn_multi {
1617 let sum_with_parens = format!("({})", pprust::ty_to_string(&ty));
1618 self.struct_span_err(ty.span, "ambiguous `+` in a type")
1619 .span_suggestion_with_applicability(
1621 "use parentheses to disambiguate",
1623 Applicability::MachineApplicable
1628 fn maybe_recover_from_bad_type_plus(&mut self, allow_plus: bool, ty: &Ty) -> PResult<'a, ()> {
1629 // Do not add `+` to expected tokens.
1630 if !allow_plus || !self.token.is_like_plus() {
1635 let bounds = self.parse_generic_bounds()?;
1636 let sum_span = ty.span.to(self.prev_span);
1638 let mut err = struct_span_err!(self.sess.span_diagnostic, sum_span, E0178,
1639 "expected a path on the left-hand side of `+`, not `{}`", pprust::ty_to_string(ty));
1642 TyKind::Rptr(ref lifetime, ref mut_ty) => {
1643 let sum_with_parens = pprust::to_string(|s| {
1644 use print::pprust::PrintState;
1647 s.print_opt_lifetime(lifetime)?;
1648 s.print_mutability(mut_ty.mutbl)?;
1650 s.print_type(&mut_ty.ty)?;
1651 s.print_type_bounds(" +", &bounds)?;
1654 err.span_suggestion_with_applicability(
1656 "try adding parentheses",
1658 Applicability::MachineApplicable
1661 TyKind::Ptr(..) | TyKind::BareFn(..) => {
1662 err.span_label(sum_span, "perhaps you forgot parentheses?");
1665 err.span_label(sum_span, "expected a path");
1672 // Try to recover from associated item paths like `[T]::AssocItem`/`(T, U)::AssocItem`.
1673 fn maybe_recover_from_bad_qpath<T: RecoverQPath>(&mut self, base: T, allow_recovery: bool)
1675 // Do not add `::` to expected tokens.
1676 if !allow_recovery || self.token != token::ModSep {
1679 let ty = match base.to_ty() {
1681 None => return Ok(base),
1684 self.bump(); // `::`
1685 let mut segments = Vec::new();
1686 self.parse_path_segments(&mut segments, T::PATH_STYLE, true)?;
1688 let span = ty.span.to(self.prev_span);
1689 let path_span = span.to(span); // use an empty path since `position` == 0
1690 let recovered = base.to_recovered(
1691 Some(QSelf { ty, path_span, position: 0 }),
1692 ast::Path { segments, span },
1696 .struct_span_err(span, "missing angle brackets in associated item path")
1697 .span_suggestion_with_applicability( // this is a best-effort recovery
1698 span, "try", recovered.to_string(), Applicability::MaybeIncorrect
1704 fn parse_borrowed_pointee(&mut self) -> PResult<'a, TyKind> {
1705 let opt_lifetime = if self.check_lifetime() { Some(self.expect_lifetime()) } else { None };
1706 let mutbl = self.parse_mutability();
1707 let ty = self.parse_ty_no_plus()?;
1708 return Ok(TyKind::Rptr(opt_lifetime, MutTy { ty: ty, mutbl: mutbl }));
1711 fn parse_ptr(&mut self) -> PResult<'a, MutTy> {
1712 let mutbl = if self.eat_keyword(keywords::Mut) {
1714 } else if self.eat_keyword(keywords::Const) {
1715 Mutability::Immutable
1717 let span = self.prev_span;
1719 "expected mut or const in raw pointer type (use \
1720 `*mut T` or `*const T` as appropriate)");
1721 Mutability::Immutable
1723 let t = self.parse_ty_no_plus()?;
1724 Ok(MutTy { ty: t, mutbl: mutbl })
1727 fn is_named_argument(&mut self) -> bool {
1728 let offset = match self.token {
1729 token::Interpolated(ref nt) => match nt.0 {
1730 token::NtPat(..) => return self.look_ahead(1, |t| t == &token::Colon),
1733 token::BinOp(token::And) | token::AndAnd => 1,
1734 _ if self.token.is_keyword(keywords::Mut) => 1,
1738 self.look_ahead(offset, |t| t.is_ident()) &&
1739 self.look_ahead(offset + 1, |t| t == &token::Colon)
1742 /// This version of parse arg doesn't necessarily require
1743 /// identifier names.
1744 fn parse_arg_general(&mut self, require_name: bool) -> PResult<'a, Arg> {
1745 maybe_whole!(self, NtArg, |x| x);
1747 let (pat, ty) = if require_name || self.is_named_argument() {
1748 debug!("parse_arg_general parse_pat (require_name:{})",
1750 let pat = self.parse_pat()?;
1752 self.expect(&token::Colon)?;
1753 (pat, self.parse_ty()?)
1755 debug!("parse_arg_general ident_to_pat");
1757 // If we see `ident :`, then we know that the argument is not just of the
1758 // form `type`, which means we won't need to recover from parsing a
1759 // pattern and so we don't need to store a parser snapshot.
1760 let parser_snapshot_before_pat = if
1761 self.look_ahead(1, |t| t.is_ident()) &&
1762 self.look_ahead(2, |t| t == &token::Colon) {
1768 // We're going to try parsing the argument as a pattern (even though it's not
1769 // allowed). This way we can provide better errors to the user.
1770 let pat_arg: PResult<'a, _> = do catch {
1771 let pat = self.parse_pat()?;
1772 self.expect(&token::Colon)?;
1773 (pat, self.parse_ty()?)
1778 let mut err = self.diagnostic()
1779 .struct_span_err(pat.span, "patterns aren't allowed in trait methods");
1780 err.span_suggestion_short_with_applicability(
1782 "give this argument a name or use an underscore to ignore it",
1784 Applicability::MachineApplicable,
1787 // Pretend the pattern is `_`, to avoid duplicate errors from AST validation.
1789 node: PatKind::Wild,
1791 id: ast::DUMMY_NODE_ID
1797 // Recover from attempting to parse the argument as a pattern. This means
1798 // the type is alone, with no name, e.g. `fn foo(u32)`.
1799 mem::replace(self, parser_snapshot_before_pat.unwrap());
1800 debug!("parse_arg_general ident_to_pat");
1801 let ident = Ident::new(keywords::Invalid.name(), self.prev_span);
1802 let ty = self.parse_ty()?;
1804 id: ast::DUMMY_NODE_ID,
1805 node: PatKind::Ident(
1806 BindingMode::ByValue(Mutability::Immutable), ident, None),
1814 Ok(Arg { ty, pat, id: ast::DUMMY_NODE_ID })
1817 /// Parse a single function argument
1818 crate fn parse_arg(&mut self) -> PResult<'a, Arg> {
1819 self.parse_arg_general(true)
1822 /// Parse an argument in a lambda header e.g. |arg, arg|
1823 fn parse_fn_block_arg(&mut self) -> PResult<'a, Arg> {
1824 let pat = self.parse_pat()?;
1825 let t = if self.eat(&token::Colon) {
1829 id: ast::DUMMY_NODE_ID,
1830 node: TyKind::Infer,
1837 id: ast::DUMMY_NODE_ID
1841 fn maybe_parse_fixed_length_of_vec(&mut self) -> PResult<'a, Option<P<ast::Expr>>> {
1842 if self.eat(&token::Semi) {
1843 Ok(Some(self.parse_expr()?))
1849 /// Matches token_lit = LIT_INTEGER | ...
1850 fn parse_lit_token(&mut self) -> PResult<'a, LitKind> {
1851 let out = match self.token {
1852 token::Interpolated(ref nt) => match nt.0 {
1853 token::NtExpr(ref v) | token::NtLiteral(ref v) => match v.node {
1854 ExprKind::Lit(ref lit) => { lit.node.clone() }
1855 _ => { return self.unexpected_last(&self.token); }
1857 _ => { return self.unexpected_last(&self.token); }
1859 token::Literal(lit, suf) => {
1860 let diag = Some((self.span, &self.sess.span_diagnostic));
1861 let (suffix_illegal, result) = parse::lit_token(lit, suf, diag);
1865 self.expect_no_suffix(sp, &format!("{} literal", lit.short_name()), suf)
1870 _ => { return self.unexpected_last(&self.token); }
1877 /// Matches lit = true | false | token_lit
1878 crate fn parse_lit(&mut self) -> PResult<'a, Lit> {
1880 let lit = if self.eat_keyword(keywords::True) {
1882 } else if self.eat_keyword(keywords::False) {
1883 LitKind::Bool(false)
1885 let lit = self.parse_lit_token()?;
1888 Ok(codemap::Spanned { node: lit, span: lo.to(self.prev_span) })
1891 /// matches '-' lit | lit (cf. ast_validation::AstValidator::check_expr_within_pat)
1892 crate fn parse_literal_maybe_minus(&mut self) -> PResult<'a, P<Expr>> {
1893 maybe_whole_expr!(self);
1895 let minus_lo = self.span;
1896 let minus_present = self.eat(&token::BinOp(token::Minus));
1898 let literal = P(self.parse_lit()?);
1899 let hi = self.prev_span;
1900 let expr = self.mk_expr(lo.to(hi), ExprKind::Lit(literal), ThinVec::new());
1903 let minus_hi = self.prev_span;
1904 let unary = self.mk_unary(UnOp::Neg, expr);
1905 Ok(self.mk_expr(minus_lo.to(minus_hi), unary, ThinVec::new()))
1911 fn parse_path_segment_ident(&mut self) -> PResult<'a, ast::Ident> {
1913 token::Ident(ident, _) if self.token.is_path_segment_keyword() => {
1914 let span = self.span;
1916 Ok(Ident::new(ident.name, span))
1918 _ => self.parse_ident(),
1922 /// Parses qualified path.
1923 /// Assumes that the leading `<` has been parsed already.
1925 /// `qualified_path = <type [as trait_ref]>::path`
1930 /// `<T as U>::F::a<S>` (without disambiguator)
1931 /// `<T as U>::F::a::<S>` (with disambiguator)
1932 fn parse_qpath(&mut self, style: PathStyle) -> PResult<'a, (QSelf, ast::Path)> {
1933 let lo = self.prev_span;
1934 let ty = self.parse_ty()?;
1936 // `path` will contain the prefix of the path up to the `>`,
1937 // if any (e.g., `U` in the `<T as U>::*` examples
1938 // above). `path_span` has the span of that path, or an empty
1939 // span in the case of something like `<T>::Bar`.
1940 let (mut path, path_span);
1941 if self.eat_keyword(keywords::As) {
1942 let path_lo = self.span;
1943 path = self.parse_path(PathStyle::Type)?;
1944 path_span = path_lo.to(self.prev_span);
1946 path = ast::Path { segments: Vec::new(), span: syntax_pos::DUMMY_SP };
1947 path_span = self.span.to(self.span);
1950 self.expect(&token::Gt)?;
1951 self.expect(&token::ModSep)?;
1953 let qself = QSelf { ty, path_span, position: path.segments.len() };
1954 self.parse_path_segments(&mut path.segments, style, true)?;
1956 Ok((qself, ast::Path { segments: path.segments, span: lo.to(self.prev_span) }))
1959 /// Parses simple paths.
1961 /// `path = [::] segment+`
1962 /// `segment = ident | ident[::]<args> | ident[::](args) [-> type]`
1965 /// `a::b::C<D>` (without disambiguator)
1966 /// `a::b::C::<D>` (with disambiguator)
1967 /// `Fn(Args)` (without disambiguator)
1968 /// `Fn::(Args)` (with disambiguator)
1969 pub fn parse_path(&mut self, style: PathStyle) -> PResult<'a, ast::Path> {
1970 self.parse_path_common(style, true)
1973 crate fn parse_path_common(&mut self, style: PathStyle, enable_warning: bool)
1974 -> PResult<'a, ast::Path> {
1975 maybe_whole!(self, NtPath, |path| {
1976 if style == PathStyle::Mod &&
1977 path.segments.iter().any(|segment| segment.args.is_some()) {
1978 self.diagnostic().span_err(path.span, "unexpected generic arguments in path");
1983 let lo = self.meta_var_span.unwrap_or(self.span);
1984 let mut segments = Vec::new();
1985 if self.eat(&token::ModSep) {
1986 segments.push(PathSegment::crate_root(lo.shrink_to_lo()));
1988 self.parse_path_segments(&mut segments, style, enable_warning)?;
1990 Ok(ast::Path { segments, span: lo.to(self.prev_span) })
1993 /// Like `parse_path`, but also supports parsing `Word` meta items into paths for back-compat.
1994 /// This is used when parsing derive macro paths in `#[derive]` attributes.
1995 pub fn parse_path_allowing_meta(&mut self, style: PathStyle) -> PResult<'a, ast::Path> {
1996 let meta_ident = match self.token {
1997 token::Interpolated(ref nt) => match nt.0 {
1998 token::NtMeta(ref meta) => match meta.node {
1999 ast::MetaItemKind::Word => Some(meta.ident.clone()),
2006 if let Some(path) = meta_ident {
2010 self.parse_path(style)
2013 fn parse_path_segments(&mut self,
2014 segments: &mut Vec<PathSegment>,
2016 enable_warning: bool)
2017 -> PResult<'a, ()> {
2019 segments.push(self.parse_path_segment(style, enable_warning)?);
2021 if self.is_import_coupler() || !self.eat(&token::ModSep) {
2027 fn parse_path_segment(&mut self, style: PathStyle, enable_warning: bool)
2028 -> PResult<'a, PathSegment> {
2029 let ident = self.parse_path_segment_ident()?;
2031 let is_args_start = |token: &token::Token| match *token {
2032 token::Lt | token::BinOp(token::Shl) | token::OpenDelim(token::Paren) => true,
2035 let check_args_start = |this: &mut Self| {
2036 this.expected_tokens.extend_from_slice(
2037 &[TokenType::Token(token::Lt), TokenType::Token(token::OpenDelim(token::Paren))]
2039 is_args_start(&this.token)
2042 Ok(if style == PathStyle::Type && check_args_start(self) ||
2043 style != PathStyle::Mod && self.check(&token::ModSep)
2044 && self.look_ahead(1, |t| is_args_start(t)) {
2045 // Generic arguments are found - `<`, `(`, `::<` or `::(`.
2047 if self.eat(&token::ModSep) && style == PathStyle::Type && enable_warning {
2048 self.diagnostic().struct_span_warn(self.prev_span, "unnecessary path disambiguator")
2049 .span_label(self.prev_span, "try removing `::`").emit();
2052 let args = if self.eat_lt() {
2054 let (args, bindings) = self.parse_generic_args()?;
2056 let span = lo.to(self.prev_span);
2057 AngleBracketedArgs { args, bindings, span }.into()
2061 let inputs = self.parse_seq_to_before_tokens(
2062 &[&token::CloseDelim(token::Paren)],
2063 SeqSep::trailing_allowed(token::Comma),
2064 TokenExpectType::Expect,
2067 let output = if self.eat(&token::RArrow) {
2068 Some(self.parse_ty_common(false, false)?)
2072 let span = lo.to(self.prev_span);
2073 ParenthesisedArgs { inputs, output, span }.into()
2076 PathSegment { ident, args }
2078 // Generic arguments are not found.
2079 PathSegment::from_ident(ident)
2083 crate fn check_lifetime(&mut self) -> bool {
2084 self.expected_tokens.push(TokenType::Lifetime);
2085 self.token.is_lifetime()
2088 /// Parse single lifetime 'a or panic.
2089 crate fn expect_lifetime(&mut self) -> Lifetime {
2090 if let Some(ident) = self.token.lifetime() {
2091 let span = self.span;
2093 Lifetime { ident: Ident::new(ident.name, span), id: ast::DUMMY_NODE_ID }
2095 self.span_bug(self.span, "not a lifetime")
2099 fn eat_label(&mut self) -> Option<Label> {
2100 if let Some(ident) = self.token.lifetime() {
2101 let span = self.span;
2103 Some(Label { ident: Ident::new(ident.name, span) })
2109 /// Parse mutability (`mut` or nothing).
2110 fn parse_mutability(&mut self) -> Mutability {
2111 if self.eat_keyword(keywords::Mut) {
2114 Mutability::Immutable
2118 fn parse_field_name(&mut self) -> PResult<'a, Ident> {
2119 if let token::Literal(token::Integer(name), None) = self.token {
2121 Ok(Ident::new(name, self.prev_span))
2123 self.parse_ident_common(false)
2127 /// Parse ident (COLON expr)?
2128 fn parse_field(&mut self) -> PResult<'a, Field> {
2129 let attrs = self.parse_outer_attributes()?;
2132 // Check if a colon exists one ahead. This means we're parsing a fieldname.
2133 let (fieldname, expr, is_shorthand) = if self.look_ahead(1, |t| t == &token::Colon) {
2134 let fieldname = self.parse_field_name()?;
2136 (fieldname, self.parse_expr()?, false)
2138 let fieldname = self.parse_ident_common(false)?;
2140 // Mimic `x: x` for the `x` field shorthand.
2141 let path = ast::Path::from_ident(fieldname);
2142 let expr = self.mk_expr(fieldname.span, ExprKind::Path(None, path), ThinVec::new());
2143 (fieldname, expr, true)
2147 span: lo.to(expr.span),
2150 attrs: attrs.into(),
2154 fn mk_expr(&mut self, span: Span, node: ExprKind, attrs: ThinVec<Attribute>) -> P<Expr> {
2155 P(Expr { node, span, attrs, id: ast::DUMMY_NODE_ID })
2158 fn mk_unary(&mut self, unop: ast::UnOp, expr: P<Expr>) -> ast::ExprKind {
2159 ExprKind::Unary(unop, expr)
2162 fn mk_binary(&mut self, binop: ast::BinOp, lhs: P<Expr>, rhs: P<Expr>) -> ast::ExprKind {
2163 ExprKind::Binary(binop, lhs, rhs)
2166 fn mk_call(&mut self, f: P<Expr>, args: Vec<P<Expr>>) -> ast::ExprKind {
2167 ExprKind::Call(f, args)
2170 fn mk_index(&mut self, expr: P<Expr>, idx: P<Expr>) -> ast::ExprKind {
2171 ExprKind::Index(expr, idx)
2174 fn mk_range(&mut self,
2175 start: Option<P<Expr>>,
2176 end: Option<P<Expr>>,
2177 limits: RangeLimits)
2178 -> PResult<'a, ast::ExprKind> {
2179 if end.is_none() && limits == RangeLimits::Closed {
2180 Err(self.span_fatal_err(self.span, Error::InclusiveRangeWithNoEnd))
2182 Ok(ExprKind::Range(start, end, limits))
2186 fn mk_assign_op(&mut self, binop: ast::BinOp,
2187 lhs: P<Expr>, rhs: P<Expr>) -> ast::ExprKind {
2188 ExprKind::AssignOp(binop, lhs, rhs)
2191 pub fn mk_mac_expr(&mut self, span: Span, m: Mac_, attrs: ThinVec<Attribute>) -> P<Expr> {
2193 id: ast::DUMMY_NODE_ID,
2194 node: ExprKind::Mac(codemap::Spanned {node: m, span: span}),
2200 fn expect_delimited_token_tree(&mut self) -> PResult<'a, (MacDelimiter, ThinTokenStream)> {
2201 let delim = match self.token {
2202 token::OpenDelim(delim) => delim,
2204 let msg = "expected open delimiter";
2205 let mut err = self.fatal(msg);
2206 err.span_label(self.span, msg);
2210 let delimited = match self.parse_token_tree() {
2211 TokenTree::Delimited(_, delimited) => delimited,
2212 _ => unreachable!(),
2214 let delim = match delim {
2215 token::Paren => MacDelimiter::Parenthesis,
2216 token::Bracket => MacDelimiter::Bracket,
2217 token::Brace => MacDelimiter::Brace,
2218 token::NoDelim => self.bug("unexpected no delimiter"),
2220 Ok((delim, delimited.stream().into()))
2223 /// At the bottom (top?) of the precedence hierarchy,
2224 /// parse things like parenthesized exprs,
2225 /// macros, return, etc.
2227 /// NB: This does not parse outer attributes,
2228 /// and is private because it only works
2229 /// correctly if called from parse_dot_or_call_expr().
2230 fn parse_bottom_expr(&mut self) -> PResult<'a, P<Expr>> {
2231 maybe_whole_expr!(self);
2233 // Outer attributes are already parsed and will be
2234 // added to the return value after the fact.
2236 // Therefore, prevent sub-parser from parsing
2237 // attributes by giving them a empty "already parsed" list.
2238 let mut attrs = ThinVec::new();
2241 let mut hi = self.span;
2245 // Note: when adding new syntax here, don't forget to adjust Token::can_begin_expr().
2247 token::OpenDelim(token::Paren) => {
2250 attrs.extend(self.parse_inner_attributes()?);
2252 // (e) is parenthesized e
2253 // (e,) is a tuple with only one field, e
2254 let mut es = vec![];
2255 let mut trailing_comma = false;
2256 while self.token != token::CloseDelim(token::Paren) {
2257 es.push(self.parse_expr()?);
2258 self.expect_one_of(&[], &[token::Comma, token::CloseDelim(token::Paren)])?;
2259 if self.check(&token::Comma) {
2260 trailing_comma = true;
2264 trailing_comma = false;
2270 hi = self.prev_span;
2271 ex = if es.len() == 1 && !trailing_comma {
2272 ExprKind::Paren(es.into_iter().nth(0).unwrap())
2277 token::OpenDelim(token::Brace) => {
2278 return self.parse_block_expr(None, lo, BlockCheckMode::Default, attrs);
2280 token::BinOp(token::Or) | token::OrOr => {
2281 return self.parse_lambda_expr(attrs);
2283 token::OpenDelim(token::Bracket) => {
2286 attrs.extend(self.parse_inner_attributes()?);
2288 if self.check(&token::CloseDelim(token::Bracket)) {
2291 ex = ExprKind::Array(Vec::new());
2294 let first_expr = self.parse_expr()?;
2295 if self.check(&token::Semi) {
2296 // Repeating array syntax: [ 0; 512 ]
2298 let count = AnonConst {
2299 id: ast::DUMMY_NODE_ID,
2300 value: self.parse_expr()?,
2302 self.expect(&token::CloseDelim(token::Bracket))?;
2303 ex = ExprKind::Repeat(first_expr, count);
2304 } else if self.check(&token::Comma) {
2305 // Vector with two or more elements.
2307 let remaining_exprs = self.parse_seq_to_end(
2308 &token::CloseDelim(token::Bracket),
2309 SeqSep::trailing_allowed(token::Comma),
2310 |p| Ok(p.parse_expr()?)
2312 let mut exprs = vec![first_expr];
2313 exprs.extend(remaining_exprs);
2314 ex = ExprKind::Array(exprs);
2316 // Vector with one element.
2317 self.expect(&token::CloseDelim(token::Bracket))?;
2318 ex = ExprKind::Array(vec![first_expr]);
2321 hi = self.prev_span;
2325 let (qself, path) = self.parse_qpath(PathStyle::Expr)?;
2327 return Ok(self.mk_expr(lo.to(hi), ExprKind::Path(Some(qself), path), attrs));
2329 if self.span.edition() >= Edition::Edition2018 &&
2330 self.check_keyword(keywords::Async)
2332 if self.is_async_block() { // check for `async {` and `async move {`
2333 return self.parse_async_block(attrs);
2335 return self.parse_lambda_expr(attrs);
2338 if self.check_keyword(keywords::Move) || self.check_keyword(keywords::Static) {
2339 return self.parse_lambda_expr(attrs);
2341 if self.eat_keyword(keywords::If) {
2342 return self.parse_if_expr(attrs);
2344 if self.eat_keyword(keywords::For) {
2345 let lo = self.prev_span;
2346 return self.parse_for_expr(None, lo, attrs);
2348 if self.eat_keyword(keywords::While) {
2349 let lo = self.prev_span;
2350 return self.parse_while_expr(None, lo, attrs);
2352 if let Some(label) = self.eat_label() {
2353 let lo = label.ident.span;
2354 self.expect(&token::Colon)?;
2355 if self.eat_keyword(keywords::While) {
2356 return self.parse_while_expr(Some(label), lo, attrs)
2358 if self.eat_keyword(keywords::For) {
2359 return self.parse_for_expr(Some(label), lo, attrs)
2361 if self.eat_keyword(keywords::Loop) {
2362 return self.parse_loop_expr(Some(label), lo, attrs)
2364 if self.token == token::OpenDelim(token::Brace) {
2365 return self.parse_block_expr(Some(label),
2367 BlockCheckMode::Default,
2370 let msg = "expected `while`, `for`, `loop` or `{` after a label";
2371 let mut err = self.fatal(msg);
2372 err.span_label(self.span, msg);
2375 if self.eat_keyword(keywords::Loop) {
2376 let lo = self.prev_span;
2377 return self.parse_loop_expr(None, lo, attrs);
2379 if self.eat_keyword(keywords::Continue) {
2380 let label = self.eat_label();
2381 let ex = ExprKind::Continue(label);
2382 let hi = self.prev_span;
2383 return Ok(self.mk_expr(lo.to(hi), ex, attrs));
2385 if self.eat_keyword(keywords::Match) {
2386 return self.parse_match_expr(attrs);
2388 if self.eat_keyword(keywords::Unsafe) {
2389 return self.parse_block_expr(
2392 BlockCheckMode::Unsafe(ast::UserProvided),
2395 if self.is_catch_expr() {
2397 assert!(self.eat_keyword(keywords::Do));
2398 assert!(self.eat_keyword(keywords::Catch));
2399 return self.parse_catch_expr(lo, attrs);
2401 if self.eat_keyword(keywords::Return) {
2402 if self.token.can_begin_expr() {
2403 let e = self.parse_expr()?;
2405 ex = ExprKind::Ret(Some(e));
2407 ex = ExprKind::Ret(None);
2409 } else if self.eat_keyword(keywords::Break) {
2410 let label = self.eat_label();
2411 let e = if self.token.can_begin_expr()
2412 && !(self.token == token::OpenDelim(token::Brace)
2413 && self.restrictions.contains(
2414 Restrictions::NO_STRUCT_LITERAL)) {
2415 Some(self.parse_expr()?)
2419 ex = ExprKind::Break(label, e);
2420 hi = self.prev_span;
2421 } else if self.eat_keyword(keywords::Yield) {
2422 if self.token.can_begin_expr() {
2423 let e = self.parse_expr()?;
2425 ex = ExprKind::Yield(Some(e));
2427 ex = ExprKind::Yield(None);
2429 } else if self.token.is_keyword(keywords::Let) {
2430 // Catch this syntax error here, instead of in `parse_ident`, so
2431 // that we can explicitly mention that let is not to be used as an expression
2432 let mut db = self.fatal("expected expression, found statement (`let`)");
2433 db.span_label(self.span, "expected expression");
2434 db.note("variable declaration using `let` is a statement");
2436 } else if self.token.is_path_start() {
2437 let pth = self.parse_path(PathStyle::Expr)?;
2439 // `!`, as an operator, is prefix, so we know this isn't that
2440 if self.eat(&token::Not) {
2441 // MACRO INVOCATION expression
2442 let (delim, tts) = self.expect_delimited_token_tree()?;
2443 let hi = self.prev_span;
2444 let node = Mac_ { path: pth, tts, delim };
2445 return Ok(self.mk_mac_expr(lo.to(hi), node, attrs))
2447 if self.check(&token::OpenDelim(token::Brace)) {
2448 // This is a struct literal, unless we're prohibited
2449 // from parsing struct literals here.
2450 let prohibited = self.restrictions.contains(
2451 Restrictions::NO_STRUCT_LITERAL
2454 return self.parse_struct_expr(lo, pth, attrs);
2459 ex = ExprKind::Path(None, pth);
2461 match self.parse_literal_maybe_minus() {
2464 ex = expr.node.clone();
2467 self.cancel(&mut err);
2468 let msg = format!("expected expression, found {}",
2469 self.this_token_descr());
2470 let mut err = self.fatal(&msg);
2471 err.span_label(self.span, "expected expression");
2479 let expr = Expr { node: ex, span: lo.to(hi), id: ast::DUMMY_NODE_ID, attrs };
2480 let expr = self.maybe_recover_from_bad_qpath(expr, true)?;
2485 fn parse_struct_expr(&mut self, lo: Span, pth: ast::Path, mut attrs: ThinVec<Attribute>)
2486 -> PResult<'a, P<Expr>> {
2487 let struct_sp = lo.to(self.prev_span);
2489 let mut fields = Vec::new();
2490 let mut base = None;
2492 attrs.extend(self.parse_inner_attributes()?);
2494 while self.token != token::CloseDelim(token::Brace) {
2495 if self.eat(&token::DotDot) {
2496 let exp_span = self.prev_span;
2497 match self.parse_expr() {
2503 self.recover_stmt();
2506 if self.token == token::Comma {
2507 let mut err = self.sess.span_diagnostic.mut_span_err(
2508 exp_span.to(self.prev_span),
2509 "cannot use a comma after the base struct",
2511 err.span_suggestion_short_with_applicability(
2513 "remove this comma",
2515 Applicability::MachineApplicable
2517 err.note("the base struct must always be the last field");
2519 self.recover_stmt();
2524 match self.parse_field() {
2525 Ok(f) => fields.push(f),
2527 e.span_label(struct_sp, "while parsing this struct");
2530 // If the next token is a comma, then try to parse
2531 // what comes next as additional fields, rather than
2532 // bailing out until next `}`.
2533 if self.token != token::Comma {
2534 self.recover_stmt();
2540 match self.expect_one_of(&[token::Comma],
2541 &[token::CloseDelim(token::Brace)]) {
2545 self.recover_stmt();
2551 let span = lo.to(self.span);
2552 self.expect(&token::CloseDelim(token::Brace))?;
2553 return Ok(self.mk_expr(span, ExprKind::Struct(pth, fields, base), attrs));
2556 fn parse_or_use_outer_attributes(&mut self,
2557 already_parsed_attrs: Option<ThinVec<Attribute>>)
2558 -> PResult<'a, ThinVec<Attribute>> {
2559 if let Some(attrs) = already_parsed_attrs {
2562 self.parse_outer_attributes().map(|a| a.into())
2566 /// Parse a block or unsafe block
2567 fn parse_block_expr(&mut self, opt_label: Option<Label>,
2568 lo: Span, blk_mode: BlockCheckMode,
2569 outer_attrs: ThinVec<Attribute>)
2570 -> PResult<'a, P<Expr>> {
2571 self.expect(&token::OpenDelim(token::Brace))?;
2573 let mut attrs = outer_attrs;
2574 attrs.extend(self.parse_inner_attributes()?);
2576 let blk = self.parse_block_tail(lo, blk_mode)?;
2577 return Ok(self.mk_expr(blk.span, ExprKind::Block(blk, opt_label), attrs));
2580 /// parse a.b or a(13) or a[4] or just a
2581 fn parse_dot_or_call_expr(&mut self,
2582 already_parsed_attrs: Option<ThinVec<Attribute>>)
2583 -> PResult<'a, P<Expr>> {
2584 let attrs = self.parse_or_use_outer_attributes(already_parsed_attrs)?;
2586 let b = self.parse_bottom_expr();
2587 let (span, b) = self.interpolated_or_expr_span(b)?;
2588 self.parse_dot_or_call_expr_with(b, span, attrs)
2591 fn parse_dot_or_call_expr_with(&mut self,
2594 mut attrs: ThinVec<Attribute>)
2595 -> PResult<'a, P<Expr>> {
2596 // Stitch the list of outer attributes onto the return value.
2597 // A little bit ugly, but the best way given the current code
2599 self.parse_dot_or_call_expr_with_(e0, lo)
2601 expr.map(|mut expr| {
2602 attrs.extend::<Vec<_>>(expr.attrs.into());
2605 ExprKind::If(..) | ExprKind::IfLet(..) => {
2606 if !expr.attrs.is_empty() {
2607 // Just point to the first attribute in there...
2608 let span = expr.attrs[0].span;
2611 "attributes are not yet allowed on `if` \
2622 // Assuming we have just parsed `.`, continue parsing into an expression.
2623 fn parse_dot_suffix(&mut self, self_arg: P<Expr>, lo: Span) -> PResult<'a, P<Expr>> {
2624 let segment = self.parse_path_segment(PathStyle::Expr, true)?;
2625 Ok(match self.token {
2626 token::OpenDelim(token::Paren) => {
2627 // Method call `expr.f()`
2628 let mut args = self.parse_unspanned_seq(
2629 &token::OpenDelim(token::Paren),
2630 &token::CloseDelim(token::Paren),
2631 SeqSep::trailing_allowed(token::Comma),
2632 |p| Ok(p.parse_expr()?)
2634 args.insert(0, self_arg);
2636 let span = lo.to(self.prev_span);
2637 self.mk_expr(span, ExprKind::MethodCall(segment, args), ThinVec::new())
2640 // Field access `expr.f`
2641 if let Some(args) = segment.args {
2642 self.span_err(args.span(),
2643 "field expressions may not have generic arguments");
2646 let span = lo.to(self.prev_span);
2647 self.mk_expr(span, ExprKind::Field(self_arg, segment.ident), ThinVec::new())
2652 fn parse_dot_or_call_expr_with_(&mut self, e0: P<Expr>, lo: Span) -> PResult<'a, P<Expr>> {
2657 while self.eat(&token::Question) {
2658 let hi = self.prev_span;
2659 e = self.mk_expr(lo.to(hi), ExprKind::Try(e), ThinVec::new());
2663 if self.eat(&token::Dot) {
2665 token::Ident(..) => {
2666 e = self.parse_dot_suffix(e, lo)?;
2668 token::Literal(token::Integer(name), _) => {
2669 let span = self.span;
2671 let field = ExprKind::Field(e, Ident::new(name, span));
2672 e = self.mk_expr(lo.to(span), field, ThinVec::new());
2674 token::Literal(token::Float(n), _suf) => {
2676 let fstr = n.as_str();
2677 let mut err = self.diagnostic().struct_span_err(self.prev_span,
2678 &format!("unexpected token: `{}`", n));
2679 err.span_label(self.prev_span, "unexpected token");
2680 if fstr.chars().all(|x| "0123456789.".contains(x)) {
2681 let float = match fstr.parse::<f64>().ok() {
2685 let sugg = pprust::to_string(|s| {
2686 use print::pprust::PrintState;
2690 s.print_usize(float.trunc() as usize)?;
2693 s.s.word(fstr.splitn(2, ".").last().unwrap())
2695 err.span_suggestion_with_applicability(
2696 lo.to(self.prev_span),
2697 "try parenthesizing the first index",
2699 Applicability::MachineApplicable
2706 // FIXME Could factor this out into non_fatal_unexpected or something.
2707 let actual = self.this_token_to_string();
2708 self.span_err(self.span, &format!("unexpected token: `{}`", actual));
2713 if self.expr_is_complete(&e) { break; }
2716 token::OpenDelim(token::Paren) => {
2717 let es = self.parse_unspanned_seq(
2718 &token::OpenDelim(token::Paren),
2719 &token::CloseDelim(token::Paren),
2720 SeqSep::trailing_allowed(token::Comma),
2721 |p| Ok(p.parse_expr()?)
2723 hi = self.prev_span;
2725 let nd = self.mk_call(e, es);
2726 e = self.mk_expr(lo.to(hi), nd, ThinVec::new());
2730 // Could be either an index expression or a slicing expression.
2731 token::OpenDelim(token::Bracket) => {
2733 let ix = self.parse_expr()?;
2735 self.expect(&token::CloseDelim(token::Bracket))?;
2736 let index = self.mk_index(e, ix);
2737 e = self.mk_expr(lo.to(hi), index, ThinVec::new())
2745 crate fn process_potential_macro_variable(&mut self) {
2746 let (token, span) = match self.token {
2747 token::Dollar if self.span.ctxt() != syntax_pos::hygiene::SyntaxContext::empty() &&
2748 self.look_ahead(1, |t| t.is_ident()) => {
2750 let name = match self.token {
2751 token::Ident(ident, _) => ident,
2754 let mut err = self.fatal(&format!("unknown macro variable `{}`", name));
2755 err.span_label(self.span, "unknown macro variable");
2759 token::Interpolated(ref nt) => {
2760 self.meta_var_span = Some(self.span);
2761 // Interpolated identifier and lifetime tokens are replaced with usual identifier
2762 // and lifetime tokens, so the former are never encountered during normal parsing.
2764 token::NtIdent(ident, is_raw) => (token::Ident(ident, is_raw), ident.span),
2765 token::NtLifetime(ident) => (token::Lifetime(ident), ident.span),
2775 /// parse a single token tree from the input.
2776 crate fn parse_token_tree(&mut self) -> TokenTree {
2778 token::OpenDelim(..) => {
2779 let frame = mem::replace(&mut self.token_cursor.frame,
2780 self.token_cursor.stack.pop().unwrap());
2781 self.span = frame.span;
2783 TokenTree::Delimited(frame.span, Delimited {
2785 tts: frame.tree_cursor.original_stream().into(),
2788 token::CloseDelim(_) | token::Eof => unreachable!(),
2790 let (token, span) = (mem::replace(&mut self.token, token::Whitespace), self.span);
2792 TokenTree::Token(span, token)
2797 // parse a stream of tokens into a list of TokenTree's,
2799 pub fn parse_all_token_trees(&mut self) -> PResult<'a, Vec<TokenTree>> {
2800 let mut tts = Vec::new();
2801 while self.token != token::Eof {
2802 tts.push(self.parse_token_tree());
2807 pub fn parse_tokens(&mut self) -> TokenStream {
2808 let mut result = Vec::new();
2811 token::Eof | token::CloseDelim(..) => break,
2812 _ => result.push(self.parse_token_tree().into()),
2815 TokenStream::concat(result)
2818 /// Parse a prefix-unary-operator expr
2819 fn parse_prefix_expr(&mut self,
2820 already_parsed_attrs: Option<ThinVec<Attribute>>)
2821 -> PResult<'a, P<Expr>> {
2822 let attrs = self.parse_or_use_outer_attributes(already_parsed_attrs)?;
2824 // Note: when adding new unary operators, don't forget to adjust Token::can_begin_expr()
2825 let (hi, ex) = match self.token {
2828 let e = self.parse_prefix_expr(None);
2829 let (span, e) = self.interpolated_or_expr_span(e)?;
2830 (lo.to(span), self.mk_unary(UnOp::Not, e))
2832 // Suggest `!` for bitwise negation when encountering a `~`
2835 let e = self.parse_prefix_expr(None);
2836 let (span, e) = self.interpolated_or_expr_span(e)?;
2837 let span_of_tilde = lo;
2838 let mut err = self.diagnostic().struct_span_err(span_of_tilde,
2839 "`~` cannot be used as a unary operator");
2840 err.span_suggestion_short_with_applicability(
2842 "use `!` to perform bitwise negation",
2844 Applicability::MachineApplicable
2847 (lo.to(span), self.mk_unary(UnOp::Not, e))
2849 token::BinOp(token::Minus) => {
2851 let e = self.parse_prefix_expr(None);
2852 let (span, e) = self.interpolated_or_expr_span(e)?;
2853 (lo.to(span), self.mk_unary(UnOp::Neg, e))
2855 token::BinOp(token::Star) => {
2857 let e = self.parse_prefix_expr(None);
2858 let (span, e) = self.interpolated_or_expr_span(e)?;
2859 (lo.to(span), self.mk_unary(UnOp::Deref, e))
2861 token::BinOp(token::And) | token::AndAnd => {
2863 let m = self.parse_mutability();
2864 let e = self.parse_prefix_expr(None);
2865 let (span, e) = self.interpolated_or_expr_span(e)?;
2866 (lo.to(span), ExprKind::AddrOf(m, e))
2868 token::Ident(..) if self.token.is_keyword(keywords::In) => {
2870 let place = self.parse_expr_res(
2871 Restrictions::NO_STRUCT_LITERAL,
2874 let blk = self.parse_block()?;
2875 let span = blk.span;
2876 let blk_expr = self.mk_expr(span, ExprKind::Block(blk, None), ThinVec::new());
2877 (lo.to(span), ExprKind::ObsoleteInPlace(place, blk_expr))
2879 token::Ident(..) if self.token.is_keyword(keywords::Box) => {
2881 let e = self.parse_prefix_expr(None);
2882 let (span, e) = self.interpolated_or_expr_span(e)?;
2883 (lo.to(span), ExprKind::Box(e))
2885 token::Ident(..) if self.token.is_ident_named("not") => {
2886 // `not` is just an ordinary identifier in Rust-the-language,
2887 // but as `rustc`-the-compiler, we can issue clever diagnostics
2888 // for confused users who really want to say `!`
2889 let token_cannot_continue_expr = |t: &token::Token| match *t {
2890 // These tokens can start an expression after `!`, but
2891 // can't continue an expression after an ident
2892 token::Ident(ident, is_raw) => token::ident_can_begin_expr(ident, is_raw),
2893 token::Literal(..) | token::Pound => true,
2894 token::Interpolated(ref nt) => match nt.0 {
2895 token::NtIdent(..) | token::NtExpr(..) |
2896 token::NtBlock(..) | token::NtPath(..) => true,
2901 let cannot_continue_expr = self.look_ahead(1, token_cannot_continue_expr);
2902 if cannot_continue_expr {
2904 // Emit the error ...
2905 let mut err = self.diagnostic()
2906 .struct_span_err(self.span,
2907 &format!("unexpected {} after identifier",
2908 self.this_token_descr()));
2909 // span the `not` plus trailing whitespace to avoid
2910 // trailing whitespace after the `!` in our suggestion
2911 let to_replace = self.sess.codemap()
2912 .span_until_non_whitespace(lo.to(self.span));
2913 err.span_suggestion_short_with_applicability(
2915 "use `!` to perform logical negation",
2917 Applicability::MachineApplicable
2920 // —and recover! (just as if we were in the block
2921 // for the `token::Not` arm)
2922 let e = self.parse_prefix_expr(None);
2923 let (span, e) = self.interpolated_or_expr_span(e)?;
2924 (lo.to(span), self.mk_unary(UnOp::Not, e))
2926 return self.parse_dot_or_call_expr(Some(attrs));
2929 _ => { return self.parse_dot_or_call_expr(Some(attrs)); }
2931 return Ok(self.mk_expr(lo.to(hi), ex, attrs));
2934 /// Parse an associative expression
2936 /// This parses an expression accounting for associativity and precedence of the operators in
2938 fn parse_assoc_expr(&mut self,
2939 already_parsed_attrs: Option<ThinVec<Attribute>>)
2940 -> PResult<'a, P<Expr>> {
2941 self.parse_assoc_expr_with(0, already_parsed_attrs.into())
2944 /// Parse an associative expression with operators of at least `min_prec` precedence
2945 fn parse_assoc_expr_with(&mut self,
2948 -> PResult<'a, P<Expr>> {
2949 let mut lhs = if let LhsExpr::AlreadyParsed(expr) = lhs {
2952 let attrs = match lhs {
2953 LhsExpr::AttributesParsed(attrs) => Some(attrs),
2956 if [token::DotDot, token::DotDotDot, token::DotDotEq].contains(&self.token) {
2957 return self.parse_prefix_range_expr(attrs);
2959 self.parse_prefix_expr(attrs)?
2963 if self.expr_is_complete(&lhs) {
2964 // Semi-statement forms are odd. See https://github.com/rust-lang/rust/issues/29071
2967 self.expected_tokens.push(TokenType::Operator);
2968 while let Some(op) = AssocOp::from_token(&self.token) {
2970 // Adjust the span for interpolated LHS to point to the `$lhs` token and not to what
2971 // it refers to. Interpolated identifiers are unwrapped early and never show up here
2972 // as `PrevTokenKind::Interpolated` so if LHS is a single identifier we always process
2973 // it as "interpolated", it doesn't change the answer for non-interpolated idents.
2974 let lhs_span = match (self.prev_token_kind, &lhs.node) {
2975 (PrevTokenKind::Interpolated, _) => self.prev_span,
2976 (PrevTokenKind::Ident, &ExprKind::Path(None, ref path))
2977 if path.segments.len() == 1 => self.prev_span,
2981 let cur_op_span = self.span;
2982 let restrictions = if op.is_assign_like() {
2983 self.restrictions & Restrictions::NO_STRUCT_LITERAL
2987 if op.precedence() < min_prec {
2990 // Check for deprecated `...` syntax
2991 if self.token == token::DotDotDot && op == AssocOp::DotDotEq {
2992 self.err_dotdotdot_syntax(self.span);
2996 if op.is_comparison() {
2997 self.check_no_chained_comparison(&lhs, &op);
3000 if op == AssocOp::As {
3001 lhs = self.parse_assoc_op_cast(lhs, lhs_span, ExprKind::Cast)?;
3003 } else if op == AssocOp::Colon {
3004 lhs = match self.parse_assoc_op_cast(lhs, lhs_span, ExprKind::Type) {
3007 err.span_label(self.span,
3008 "expecting a type here because of type ascription");
3009 let cm = self.sess.codemap();
3010 let cur_pos = cm.lookup_char_pos(self.span.lo());
3011 let op_pos = cm.lookup_char_pos(cur_op_span.hi());
3012 if cur_pos.line != op_pos.line {
3013 err.span_suggestion_with_applicability(
3015 "try using a semicolon",
3017 Applicability::MaybeIncorrect // speculative
3024 } else if op == AssocOp::DotDot || op == AssocOp::DotDotEq {
3025 // If we didn’t have to handle `x..`/`x..=`, it would be pretty easy to
3026 // generalise it to the Fixity::None code.
3028 // We have 2 alternatives here: `x..y`/`x..=y` and `x..`/`x..=` The other
3029 // two variants are handled with `parse_prefix_range_expr` call above.
3030 let rhs = if self.is_at_start_of_range_notation_rhs() {
3031 Some(self.parse_assoc_expr_with(op.precedence() + 1,
3032 LhsExpr::NotYetParsed)?)
3036 let (lhs_span, rhs_span) = (lhs.span, if let Some(ref x) = rhs {
3041 let limits = if op == AssocOp::DotDot {
3042 RangeLimits::HalfOpen
3047 let r = try!(self.mk_range(Some(lhs), rhs, limits));
3048 lhs = self.mk_expr(lhs_span.to(rhs_span), r, ThinVec::new());
3052 let rhs = match op.fixity() {
3053 Fixity::Right => self.with_res(
3054 restrictions - Restrictions::STMT_EXPR,
3056 this.parse_assoc_expr_with(op.precedence(),
3057 LhsExpr::NotYetParsed)
3059 Fixity::Left => self.with_res(
3060 restrictions - Restrictions::STMT_EXPR,
3062 this.parse_assoc_expr_with(op.precedence() + 1,
3063 LhsExpr::NotYetParsed)
3065 // We currently have no non-associative operators that are not handled above by
3066 // the special cases. The code is here only for future convenience.
3067 Fixity::None => self.with_res(
3068 restrictions - Restrictions::STMT_EXPR,
3070 this.parse_assoc_expr_with(op.precedence() + 1,
3071 LhsExpr::NotYetParsed)
3075 let span = lhs_span.to(rhs.span);
3077 AssocOp::Add | AssocOp::Subtract | AssocOp::Multiply | AssocOp::Divide |
3078 AssocOp::Modulus | AssocOp::LAnd | AssocOp::LOr | AssocOp::BitXor |
3079 AssocOp::BitAnd | AssocOp::BitOr | AssocOp::ShiftLeft | AssocOp::ShiftRight |
3080 AssocOp::Equal | AssocOp::Less | AssocOp::LessEqual | AssocOp::NotEqual |
3081 AssocOp::Greater | AssocOp::GreaterEqual => {
3082 let ast_op = op.to_ast_binop().unwrap();
3083 let binary = self.mk_binary(codemap::respan(cur_op_span, ast_op), lhs, rhs);
3084 self.mk_expr(span, binary, ThinVec::new())
3087 self.mk_expr(span, ExprKind::Assign(lhs, rhs), ThinVec::new()),
3088 AssocOp::ObsoleteInPlace =>
3089 self.mk_expr(span, ExprKind::ObsoleteInPlace(lhs, rhs), ThinVec::new()),
3090 AssocOp::AssignOp(k) => {
3092 token::Plus => BinOpKind::Add,
3093 token::Minus => BinOpKind::Sub,
3094 token::Star => BinOpKind::Mul,
3095 token::Slash => BinOpKind::Div,
3096 token::Percent => BinOpKind::Rem,
3097 token::Caret => BinOpKind::BitXor,
3098 token::And => BinOpKind::BitAnd,
3099 token::Or => BinOpKind::BitOr,
3100 token::Shl => BinOpKind::Shl,
3101 token::Shr => BinOpKind::Shr,
3103 let aopexpr = self.mk_assign_op(codemap::respan(cur_op_span, aop), lhs, rhs);
3104 self.mk_expr(span, aopexpr, ThinVec::new())
3106 AssocOp::As | AssocOp::Colon | AssocOp::DotDot | AssocOp::DotDotEq => {
3107 self.bug("AssocOp should have been handled by special case")
3111 if op.fixity() == Fixity::None { break }
3116 fn parse_assoc_op_cast(&mut self, lhs: P<Expr>, lhs_span: Span,
3117 expr_kind: fn(P<Expr>, P<Ty>) -> ExprKind)
3118 -> PResult<'a, P<Expr>> {
3119 let mk_expr = |this: &mut Self, rhs: P<Ty>| {
3120 this.mk_expr(lhs_span.to(rhs.span), expr_kind(lhs, rhs), ThinVec::new())
3123 // Save the state of the parser before parsing type normally, in case there is a
3124 // LessThan comparison after this cast.
3125 let parser_snapshot_before_type = self.clone();
3126 match self.parse_ty_no_plus() {
3128 Ok(mk_expr(self, rhs))
3130 Err(mut type_err) => {
3131 // Rewind to before attempting to parse the type with generics, to recover
3132 // from situations like `x as usize < y` in which we first tried to parse
3133 // `usize < y` as a type with generic arguments.
3134 let parser_snapshot_after_type = self.clone();
3135 mem::replace(self, parser_snapshot_before_type);
3137 match self.parse_path(PathStyle::Expr) {
3139 let (op_noun, op_verb) = match self.token {
3140 token::Lt => ("comparison", "comparing"),
3141 token::BinOp(token::Shl) => ("shift", "shifting"),
3143 // We can end up here even without `<` being the next token, for
3144 // example because `parse_ty_no_plus` returns `Err` on keywords,
3145 // but `parse_path` returns `Ok` on them due to error recovery.
3146 // Return original error and parser state.
3147 mem::replace(self, parser_snapshot_after_type);
3148 return Err(type_err);
3152 // Successfully parsed the type path leaving a `<` yet to parse.
3155 // Report non-fatal diagnostics, keep `x as usize` as an expression
3156 // in AST and continue parsing.
3157 let msg = format!("`<` is interpreted as a start of generic \
3158 arguments for `{}`, not a {}", path, op_noun);
3159 let mut err = self.sess.span_diagnostic.struct_span_err(self.span, &msg);
3160 err.span_label(self.look_ahead_span(1).to(parser_snapshot_after_type.span),
3161 "interpreted as generic arguments");
3162 err.span_label(self.span, format!("not interpreted as {}", op_noun));
3164 let expr = mk_expr(self, P(Ty {
3166 node: TyKind::Path(None, path),
3167 id: ast::DUMMY_NODE_ID
3170 let expr_str = self.sess.codemap().span_to_snippet(expr.span)
3171 .unwrap_or(pprust::expr_to_string(&expr));
3172 err.span_suggestion_with_applicability(
3174 &format!("try {} the cast value", op_verb),
3175 format!("({})", expr_str),
3176 Applicability::MachineApplicable
3182 Err(mut path_err) => {
3183 // Couldn't parse as a path, return original error and parser state.
3185 mem::replace(self, parser_snapshot_after_type);
3193 /// Produce an error if comparison operators are chained (RFC #558).
3194 /// We only need to check lhs, not rhs, because all comparison ops
3195 /// have same precedence and are left-associative
3196 fn check_no_chained_comparison(&mut self, lhs: &Expr, outer_op: &AssocOp) {
3197 debug_assert!(outer_op.is_comparison(),
3198 "check_no_chained_comparison: {:?} is not comparison",
3201 ExprKind::Binary(op, _, _) if op.node.is_comparison() => {
3202 // respan to include both operators
3203 let op_span = op.span.to(self.span);
3204 let mut err = self.diagnostic().struct_span_err(op_span,
3205 "chained comparison operators require parentheses");
3206 if op.node == BinOpKind::Lt &&
3207 *outer_op == AssocOp::Less || // Include `<` to provide this recommendation
3208 *outer_op == AssocOp::Greater // even in a case like the following:
3209 { // Foo<Bar<Baz<Qux, ()>>>
3211 "use `::<...>` instead of `<...>` if you meant to specify type arguments");
3212 err.help("or use `(...)` if you meant to specify fn arguments");
3220 /// Parse prefix-forms of range notation: `..expr`, `..`, `..=expr`
3221 fn parse_prefix_range_expr(&mut self,
3222 already_parsed_attrs: Option<ThinVec<Attribute>>)
3223 -> PResult<'a, P<Expr>> {
3224 // Check for deprecated `...` syntax
3225 if self.token == token::DotDotDot {
3226 self.err_dotdotdot_syntax(self.span);
3229 debug_assert!([token::DotDot, token::DotDotDot, token::DotDotEq].contains(&self.token),
3230 "parse_prefix_range_expr: token {:?} is not DotDot/DotDotEq",
3232 let tok = self.token.clone();
3233 let attrs = self.parse_or_use_outer_attributes(already_parsed_attrs)?;
3235 let mut hi = self.span;
3237 let opt_end = if self.is_at_start_of_range_notation_rhs() {
3238 // RHS must be parsed with more associativity than the dots.
3239 let next_prec = AssocOp::from_token(&tok).unwrap().precedence() + 1;
3240 Some(self.parse_assoc_expr_with(next_prec,
3241 LhsExpr::NotYetParsed)
3249 let limits = if tok == token::DotDot {
3250 RangeLimits::HalfOpen
3255 let r = try!(self.mk_range(None,
3258 Ok(self.mk_expr(lo.to(hi), r, attrs))
3261 fn is_at_start_of_range_notation_rhs(&self) -> bool {
3262 if self.token.can_begin_expr() {
3263 // parse `for i in 1.. { }` as infinite loop, not as `for i in (1..{})`.
3264 if self.token == token::OpenDelim(token::Brace) {
3265 return !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL);
3273 /// Parse an 'if' or 'if let' expression ('if' token already eaten)
3274 fn parse_if_expr(&mut self, attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
3275 if self.check_keyword(keywords::Let) {
3276 return self.parse_if_let_expr(attrs);
3278 let lo = self.prev_span;
3279 let cond = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
3281 // Verify that the parsed `if` condition makes sense as a condition. If it is a block, then
3282 // verify that the last statement is either an implicit return (no `;`) or an explicit
3283 // return. This won't catch blocks with an explicit `return`, but that would be caught by
3284 // the dead code lint.
3285 if self.eat_keyword(keywords::Else) || !cond.returns() {
3286 let sp = self.sess.codemap().next_point(lo);
3287 let mut err = self.diagnostic()
3288 .struct_span_err(sp, "missing condition for `if` statemement");
3289 err.span_label(sp, "expected if condition here");
3292 let not_block = self.token != token::OpenDelim(token::Brace);
3293 let thn = self.parse_block().map_err(|mut err| {
3295 err.span_label(lo, "this `if` statement has a condition, but no block");
3299 let mut els: Option<P<Expr>> = None;
3300 let mut hi = thn.span;
3301 if self.eat_keyword(keywords::Else) {
3302 let elexpr = self.parse_else_expr()?;
3306 Ok(self.mk_expr(lo.to(hi), ExprKind::If(cond, thn, els), attrs))
3309 /// Parse an 'if let' expression ('if' token already eaten)
3310 fn parse_if_let_expr(&mut self, attrs: ThinVec<Attribute>)
3311 -> PResult<'a, P<Expr>> {
3312 let lo = self.prev_span;
3313 self.expect_keyword(keywords::Let)?;
3314 let pats = self.parse_pats()?;
3315 self.expect(&token::Eq)?;
3316 let expr = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
3317 let thn = self.parse_block()?;
3318 let (hi, els) = if self.eat_keyword(keywords::Else) {
3319 let expr = self.parse_else_expr()?;
3320 (expr.span, Some(expr))
3324 Ok(self.mk_expr(lo.to(hi), ExprKind::IfLet(pats, expr, thn, els), attrs))
3327 // `move |args| expr`
3328 fn parse_lambda_expr(&mut self,
3329 attrs: ThinVec<Attribute>)
3330 -> PResult<'a, P<Expr>>
3333 let movability = if self.eat_keyword(keywords::Static) {
3338 let asyncness = if self.span.edition() >= Edition::Edition2018 {
3339 self.parse_asyncness()
3343 let capture_clause = if self.eat_keyword(keywords::Move) {
3348 let decl = self.parse_fn_block_decl()?;
3349 let decl_hi = self.prev_span;
3350 let body = match decl.output {
3351 FunctionRetTy::Default(_) => {
3352 let restrictions = self.restrictions - Restrictions::STMT_EXPR;
3353 self.parse_expr_res(restrictions, None)?
3356 // If an explicit return type is given, require a
3357 // block to appear (RFC 968).
3358 let body_lo = self.span;
3359 self.parse_block_expr(None, body_lo, BlockCheckMode::Default, ThinVec::new())?
3365 ExprKind::Closure(capture_clause, asyncness, movability, decl, body, lo.to(decl_hi)),
3369 // `else` token already eaten
3370 fn parse_else_expr(&mut self) -> PResult<'a, P<Expr>> {
3371 if self.eat_keyword(keywords::If) {
3372 return self.parse_if_expr(ThinVec::new());
3374 let blk = self.parse_block()?;
3375 return Ok(self.mk_expr(blk.span, ExprKind::Block(blk, None), ThinVec::new()));
3379 /// Parse a 'for' .. 'in' expression ('for' token already eaten)
3380 fn parse_for_expr(&mut self, opt_label: Option<Label>,
3382 mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
3383 // Parse: `for <src_pat> in <src_expr> <src_loop_block>`
3385 let pat = self.parse_top_level_pat()?;
3386 if !self.eat_keyword(keywords::In) {
3387 let in_span = self.prev_span.between(self.span);
3388 let mut err = self.sess.span_diagnostic
3389 .struct_span_err(in_span, "missing `in` in `for` loop");
3390 err.span_suggestion_short_with_applicability(
3391 in_span, "try adding `in` here", " in ".into(),
3392 // has been misleading, at least in the past (closed Issue #48492)
3393 Applicability::MaybeIncorrect
3397 let expr = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
3398 let (iattrs, loop_block) = self.parse_inner_attrs_and_block()?;
3399 attrs.extend(iattrs);
3401 let hi = self.prev_span;
3402 Ok(self.mk_expr(span_lo.to(hi), ExprKind::ForLoop(pat, expr, loop_block, opt_label), attrs))
3405 /// Parse a 'while' or 'while let' expression ('while' token already eaten)
3406 fn parse_while_expr(&mut self, opt_label: Option<Label>,
3408 mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
3409 if self.token.is_keyword(keywords::Let) {
3410 return self.parse_while_let_expr(opt_label, span_lo, attrs);
3412 let cond = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
3413 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
3414 attrs.extend(iattrs);
3415 let span = span_lo.to(body.span);
3416 return Ok(self.mk_expr(span, ExprKind::While(cond, body, opt_label), attrs));
3419 /// Parse a 'while let' expression ('while' token already eaten)
3420 fn parse_while_let_expr(&mut self, opt_label: Option<Label>,
3422 mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
3423 self.expect_keyword(keywords::Let)?;
3424 let pats = self.parse_pats()?;
3425 self.expect(&token::Eq)?;
3426 let expr = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL, None)?;
3427 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
3428 attrs.extend(iattrs);
3429 let span = span_lo.to(body.span);
3430 return Ok(self.mk_expr(span, ExprKind::WhileLet(pats, expr, body, opt_label), attrs));
3433 // parse `loop {...}`, `loop` token already eaten
3434 fn parse_loop_expr(&mut self, opt_label: Option<Label>,
3436 mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
3437 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
3438 attrs.extend(iattrs);
3439 let span = span_lo.to(body.span);
3440 Ok(self.mk_expr(span, ExprKind::Loop(body, opt_label), attrs))
3443 /// Parse an `async move {...}` expression
3444 pub fn parse_async_block(&mut self, mut attrs: ThinVec<Attribute>)
3445 -> PResult<'a, P<Expr>>
3447 let span_lo = self.span;
3448 self.expect_keyword(keywords::Async)?;
3449 let capture_clause = if self.eat_keyword(keywords::Move) {
3454 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
3455 attrs.extend(iattrs);
3457 span_lo.to(body.span),
3458 ExprKind::Async(capture_clause, ast::DUMMY_NODE_ID, body), attrs))
3461 /// Parse a `do catch {...}` expression (`do catch` token already eaten)
3462 fn parse_catch_expr(&mut self, span_lo: Span, mut attrs: ThinVec<Attribute>)
3463 -> PResult<'a, P<Expr>>
3465 let (iattrs, body) = self.parse_inner_attrs_and_block()?;
3466 attrs.extend(iattrs);
3467 Ok(self.mk_expr(span_lo.to(body.span), ExprKind::Catch(body), attrs))
3470 // `match` token already eaten
3471 fn parse_match_expr(&mut self, mut attrs: ThinVec<Attribute>) -> PResult<'a, P<Expr>> {
3472 let match_span = self.prev_span;
3473 let lo = self.prev_span;
3474 let discriminant = self.parse_expr_res(Restrictions::NO_STRUCT_LITERAL,
3476 if let Err(mut e) = self.expect(&token::OpenDelim(token::Brace)) {
3477 if self.token == token::Token::Semi {
3478 e.span_suggestion_short_with_applicability(
3480 "try removing this `match`",
3482 Applicability::MaybeIncorrect // speculative
3487 attrs.extend(self.parse_inner_attributes()?);
3489 let mut arms: Vec<Arm> = Vec::new();
3490 while self.token != token::CloseDelim(token::Brace) {
3491 match self.parse_arm() {
3492 Ok(arm) => arms.push(arm),
3494 // Recover by skipping to the end of the block.
3496 self.recover_stmt();
3497 let span = lo.to(self.span);
3498 if self.token == token::CloseDelim(token::Brace) {
3501 return Ok(self.mk_expr(span, ExprKind::Match(discriminant, arms), attrs));
3507 return Ok(self.mk_expr(lo.to(hi), ExprKind::Match(discriminant, arms), attrs));
3510 crate fn parse_arm(&mut self) -> PResult<'a, Arm> {
3511 maybe_whole!(self, NtArm, |x| x);
3513 let attrs = self.parse_outer_attributes()?;
3514 // Allow a '|' before the pats (RFC 1925)
3515 self.eat(&token::BinOp(token::Or));
3516 let pats = self.parse_pats()?;
3517 let guard = if self.eat_keyword(keywords::If) {
3518 Some(self.parse_expr()?)
3522 let arrow_span = self.span;
3523 self.expect(&token::FatArrow)?;
3524 let arm_start_span = self.span;
3526 let expr = self.parse_expr_res(Restrictions::STMT_EXPR, None)
3527 .map_err(|mut err| {
3528 err.span_label(arrow_span, "while parsing the `match` arm starting here");
3532 let require_comma = classify::expr_requires_semi_to_be_stmt(&expr)
3533 && self.token != token::CloseDelim(token::Brace);
3536 let cm = self.sess.codemap();
3537 self.expect_one_of(&[token::Comma], &[token::CloseDelim(token::Brace)])
3538 .map_err(|mut err| {
3539 match (cm.span_to_lines(expr.span), cm.span_to_lines(arm_start_span)) {
3540 (Ok(ref expr_lines), Ok(ref arm_start_lines))
3541 if arm_start_lines.lines[0].end_col == expr_lines.lines[0].end_col
3542 && expr_lines.lines.len() == 2
3543 && self.token == token::FatArrow => {
3544 // We check wether there's any trailing code in the parse span, if there
3545 // isn't, we very likely have the following:
3548 // | -- - missing comma
3554 // | parsed until here as `"y" & X`
3555 err.span_suggestion_short_with_applicability(
3556 cm.next_point(arm_start_span),
3557 "missing a comma here to end this `match` arm",
3559 Applicability::MachineApplicable
3563 err.span_label(arrow_span,
3564 "while parsing the `match` arm starting here");
3570 self.eat(&token::Comma);
3581 /// Parse an expression
3582 pub fn parse_expr(&mut self) -> PResult<'a, P<Expr>> {
3583 self.parse_expr_res(Restrictions::empty(), None)
3586 /// Evaluate the closure with restrictions in place.
3588 /// After the closure is evaluated, restrictions are reset.
3589 fn with_res<F, T>(&mut self, r: Restrictions, f: F) -> T
3590 where F: FnOnce(&mut Self) -> T
3592 let old = self.restrictions;
3593 self.restrictions = r;
3595 self.restrictions = old;
3600 /// Parse an expression, subject to the given restrictions
3601 fn parse_expr_res(&mut self, r: Restrictions,
3602 already_parsed_attrs: Option<ThinVec<Attribute>>)
3603 -> PResult<'a, P<Expr>> {
3604 self.with_res(r, |this| this.parse_assoc_expr(already_parsed_attrs))
3607 /// Parse the RHS of a local variable declaration (e.g. '= 14;')
3608 fn parse_initializer(&mut self, skip_eq: bool) -> PResult<'a, Option<P<Expr>>> {
3609 if self.check(&token::Eq) {
3611 Ok(Some(self.parse_expr()?))
3613 Ok(Some(self.parse_expr()?))
3619 /// Parse patterns, separated by '|' s
3620 fn parse_pats(&mut self) -> PResult<'a, Vec<P<Pat>>> {
3621 let mut pats = Vec::new();
3623 pats.push(self.parse_top_level_pat()?);
3625 if self.token == token::OrOr {
3626 let mut err = self.struct_span_err(self.span,
3627 "unexpected token `||` after pattern");
3628 err.span_suggestion_with_applicability(
3630 "use a single `|` to specify multiple patterns",
3632 Applicability::MachineApplicable
3636 } else if self.check(&token::BinOp(token::Or)) {
3644 // Parses a parenthesized list of patterns like
3645 // `()`, `(p)`, `(p,)`, `(p, q)`, or `(p, .., q)`. Returns:
3646 // - a vector of the patterns that were parsed
3647 // - an option indicating the index of the `..` element
3648 // - a boolean indicating whether a trailing comma was present.
3649 // Trailing commas are significant because (p) and (p,) are different patterns.
3650 fn parse_parenthesized_pat_list(&mut self) -> PResult<'a, (Vec<P<Pat>>, Option<usize>, bool)> {
3651 self.expect(&token::OpenDelim(token::Paren))?;
3652 let result = self.parse_pat_list()?;
3653 self.expect(&token::CloseDelim(token::Paren))?;
3657 fn parse_pat_list(&mut self) -> PResult<'a, (Vec<P<Pat>>, Option<usize>, bool)> {
3658 let mut fields = Vec::new();
3659 let mut ddpos = None;
3660 let mut trailing_comma = false;
3662 if self.eat(&token::DotDot) {
3663 if ddpos.is_none() {
3664 ddpos = Some(fields.len());
3666 // Emit a friendly error, ignore `..` and continue parsing
3667 self.span_err(self.prev_span,
3668 "`..` can only be used once per tuple or tuple struct pattern");
3670 } else if !self.check(&token::CloseDelim(token::Paren)) {
3671 fields.push(self.parse_pat()?);
3676 trailing_comma = self.eat(&token::Comma);
3677 if !trailing_comma {
3682 if ddpos == Some(fields.len()) && trailing_comma {
3683 // `..` needs to be followed by `)` or `, pat`, `..,)` is disallowed.
3684 self.span_err(self.prev_span, "trailing comma is not permitted after `..`");
3687 Ok((fields, ddpos, trailing_comma))
3690 fn parse_pat_vec_elements(
3692 ) -> PResult<'a, (Vec<P<Pat>>, Option<P<Pat>>, Vec<P<Pat>>)> {
3693 let mut before = Vec::new();
3694 let mut slice = None;
3695 let mut after = Vec::new();
3696 let mut first = true;
3697 let mut before_slice = true;
3699 while self.token != token::CloseDelim(token::Bracket) {
3703 self.expect(&token::Comma)?;
3705 if self.token == token::CloseDelim(token::Bracket)
3706 && (before_slice || !after.is_empty()) {
3712 if self.eat(&token::DotDot) {
3714 if self.check(&token::Comma) ||
3715 self.check(&token::CloseDelim(token::Bracket)) {
3716 slice = Some(P(Pat {
3717 id: ast::DUMMY_NODE_ID,
3718 node: PatKind::Wild,
3719 span: self.prev_span,
3721 before_slice = false;
3727 let subpat = self.parse_pat()?;
3728 if before_slice && self.eat(&token::DotDot) {
3729 slice = Some(subpat);
3730 before_slice = false;
3731 } else if before_slice {
3732 before.push(subpat);
3738 Ok((before, slice, after))
3744 attrs: Vec<Attribute>
3745 ) -> PResult<'a, codemap::Spanned<ast::FieldPat>> {
3746 // Check if a colon exists one ahead. This means we're parsing a fieldname.
3748 let (subpat, fieldname, is_shorthand) = if self.look_ahead(1, |t| t == &token::Colon) {
3749 // Parsing a pattern of the form "fieldname: pat"
3750 let fieldname = self.parse_field_name()?;
3752 let pat = self.parse_pat()?;
3754 (pat, fieldname, false)
3756 // Parsing a pattern of the form "(box) (ref) (mut) fieldname"
3757 let is_box = self.eat_keyword(keywords::Box);
3758 let boxed_span = self.span;
3759 let is_ref = self.eat_keyword(keywords::Ref);
3760 let is_mut = self.eat_keyword(keywords::Mut);
3761 let fieldname = self.parse_ident()?;
3762 hi = self.prev_span;
3764 let bind_type = match (is_ref, is_mut) {
3765 (true, true) => BindingMode::ByRef(Mutability::Mutable),
3766 (true, false) => BindingMode::ByRef(Mutability::Immutable),
3767 (false, true) => BindingMode::ByValue(Mutability::Mutable),
3768 (false, false) => BindingMode::ByValue(Mutability::Immutable),
3770 let fieldpat = P(Pat {
3771 id: ast::DUMMY_NODE_ID,
3772 node: PatKind::Ident(bind_type, fieldname, None),
3773 span: boxed_span.to(hi),
3776 let subpat = if is_box {
3778 id: ast::DUMMY_NODE_ID,
3779 node: PatKind::Box(fieldpat),
3785 (subpat, fieldname, true)
3788 Ok(codemap::Spanned {
3790 node: ast::FieldPat {
3794 attrs: attrs.into(),
3799 /// Parse the fields of a struct-like pattern
3800 fn parse_pat_fields(&mut self) -> PResult<'a, (Vec<codemap::Spanned<ast::FieldPat>>, bool)> {
3801 let mut fields = Vec::new();
3802 let mut etc = false;
3803 let mut ate_comma = true;
3804 let mut delayed_err: Option<DiagnosticBuilder<'a>> = None;
3805 let mut etc_span = None;
3807 while self.token != token::CloseDelim(token::Brace) {
3808 let attrs = self.parse_outer_attributes()?;
3811 // check that a comma comes after every field
3813 let err = self.struct_span_err(self.prev_span, "expected `,`");
3818 if self.check(&token::DotDot) || self.token == token::DotDotDot {
3820 let mut etc_sp = self.span;
3822 if self.token == token::DotDotDot { // Issue #46718
3823 // Accept `...` as if it were `..` to avoid further errors
3824 let mut err = self.struct_span_err(self.span,
3825 "expected field pattern, found `...`");
3826 err.span_suggestion_with_applicability(
3828 "to omit remaining fields, use one fewer `.`",
3830 Applicability::MachineApplicable
3834 self.bump(); // `..` || `...`:w
3836 if self.token == token::CloseDelim(token::Brace) {
3837 etc_span = Some(etc_sp);
3840 let token_str = self.this_token_to_string();
3841 let mut err = self.fatal(&format!("expected `}}`, found `{}`", token_str));
3843 err.span_label(self.span, "expected `}`");
3844 let mut comma_sp = None;
3845 if self.token == token::Comma { // Issue #49257
3846 etc_sp = etc_sp.to(self.sess.codemap().span_until_non_whitespace(self.span));
3847 err.span_label(etc_sp,
3848 "`..` must be at the end and cannot have a trailing comma");
3849 comma_sp = Some(self.span);
3854 etc_span = Some(etc_sp);
3855 if self.token == token::CloseDelim(token::Brace) {
3856 // If the struct looks otherwise well formed, recover and continue.
3857 if let Some(sp) = comma_sp {
3858 err.span_suggestion_short(sp, "remove this comma", "".into());
3862 } else if self.token.is_ident() && ate_comma {
3863 // Accept fields coming after `..,`.
3864 // This way we avoid "pattern missing fields" errors afterwards.
3865 // We delay this error until the end in order to have a span for a
3867 if let Some(mut delayed_err) = delayed_err {
3871 delayed_err = Some(err);
3874 if let Some(mut err) = delayed_err {
3881 fields.push(match self.parse_pat_field(lo, attrs) {
3884 if let Some(mut delayed_err) = delayed_err {
3890 ate_comma = self.eat(&token::Comma);
3893 if let Some(mut err) = delayed_err {
3894 if let Some(etc_span) = etc_span {
3895 err.multipart_suggestion(
3896 "move the `..` to the end of the field list",
3898 (etc_span, "".into()),
3899 (self.span, format!("{}.. }}", if ate_comma { "" } else { ", " })),
3905 return Ok((fields, etc));
3908 fn parse_pat_range_end(&mut self) -> PResult<'a, P<Expr>> {
3909 if self.token.is_path_start() {
3911 let (qself, path) = if self.eat_lt() {
3912 // Parse a qualified path
3913 let (qself, path) = self.parse_qpath(PathStyle::Expr)?;
3916 // Parse an unqualified path
3917 (None, self.parse_path(PathStyle::Expr)?)
3919 let hi = self.prev_span;
3920 Ok(self.mk_expr(lo.to(hi), ExprKind::Path(qself, path), ThinVec::new()))
3922 self.parse_literal_maybe_minus()
3926 // helper function to decide whether to parse as ident binding or to try to do
3927 // something more complex like range patterns
3928 fn parse_as_ident(&mut self) -> bool {
3929 self.look_ahead(1, |t| match *t {
3930 token::OpenDelim(token::Paren) | token::OpenDelim(token::Brace) |
3931 token::DotDotDot | token::DotDotEq | token::ModSep | token::Not => Some(false),
3932 // ensure slice patterns [a, b.., c] and [a, b, c..] don't go into the
3933 // range pattern branch
3934 token::DotDot => None,
3936 }).unwrap_or_else(|| self.look_ahead(2, |t| match *t {
3937 token::Comma | token::CloseDelim(token::Bracket) => true,
3942 /// A wrapper around `parse_pat` with some special error handling for the
3943 /// "top-level" patterns in a match arm, `for` loop, `let`, &c. (in contast
3944 /// to subpatterns within such).
3945 fn parse_top_level_pat(&mut self) -> PResult<'a, P<Pat>> {
3946 let pat = self.parse_pat()?;
3947 if self.token == token::Comma {
3948 // An unexpected comma after a top-level pattern is a clue that the
3949 // user (perhaps more accustomed to some other language) forgot the
3950 // parentheses in what should have been a tuple pattern; return a
3951 // suggestion-enhanced error here rather than choking on the comma
3953 let comma_span = self.span;
3955 if let Err(mut err) = self.parse_pat_list() {
3956 // We didn't expect this to work anyway; we just wanted
3957 // to advance to the end of the comma-sequence so we know
3958 // the span to suggest parenthesizing
3961 let seq_span = pat.span.to(self.prev_span);
3962 let mut err = self.struct_span_err(comma_span,
3963 "unexpected `,` in pattern");
3964 if let Ok(seq_snippet) = self.sess.codemap().span_to_snippet(seq_span) {
3965 err.span_suggestion_with_applicability(
3967 "try adding parentheses",
3968 format!("({})", seq_snippet),
3969 Applicability::MachineApplicable
3977 /// Parse a pattern.
3978 pub fn parse_pat(&mut self) -> PResult<'a, P<Pat>> {
3979 self.parse_pat_with_range_pat(true)
3982 /// Parse a pattern, with a setting whether modern range patterns e.g. `a..=b`, `a..b` are
3984 fn parse_pat_with_range_pat(&mut self, allow_range_pat: bool) -> PResult<'a, P<Pat>> {
3985 maybe_whole!(self, NtPat, |x| x);
3990 token::BinOp(token::And) | token::AndAnd => {
3991 // Parse &pat / &mut pat
3993 let mutbl = self.parse_mutability();
3994 if let token::Lifetime(ident) = self.token {
3995 let mut err = self.fatal(&format!("unexpected lifetime `{}` in pattern",
3997 err.span_label(self.span, "unexpected lifetime");
4000 let subpat = self.parse_pat_with_range_pat(false)?;
4001 pat = PatKind::Ref(subpat, mutbl);
4003 token::OpenDelim(token::Paren) => {
4004 // Parse (pat,pat,pat,...) as tuple pattern
4005 let (fields, ddpos, trailing_comma) = self.parse_parenthesized_pat_list()?;
4006 pat = if fields.len() == 1 && ddpos.is_none() && !trailing_comma {
4007 PatKind::Paren(fields.into_iter().nth(0).unwrap())
4009 PatKind::Tuple(fields, ddpos)
4012 token::OpenDelim(token::Bracket) => {
4013 // Parse [pat,pat,...] as slice pattern
4015 let (before, slice, after) = self.parse_pat_vec_elements()?;
4016 self.expect(&token::CloseDelim(token::Bracket))?;
4017 pat = PatKind::Slice(before, slice, after);
4019 // At this point, token != &, &&, (, [
4020 _ => if self.eat_keyword(keywords::Underscore) {
4022 pat = PatKind::Wild;
4023 } else if self.eat_keyword(keywords::Mut) {
4024 // Parse mut ident @ pat / mut ref ident @ pat
4025 let mutref_span = self.prev_span.to(self.span);
4026 let binding_mode = if self.eat_keyword(keywords::Ref) {
4028 .struct_span_err(mutref_span, "the order of `mut` and `ref` is incorrect")
4029 .span_suggestion_with_applicability(
4031 "try switching the order",
4033 Applicability::MachineApplicable
4035 BindingMode::ByRef(Mutability::Mutable)
4037 BindingMode::ByValue(Mutability::Mutable)
4039 pat = self.parse_pat_ident(binding_mode)?;
4040 } else if self.eat_keyword(keywords::Ref) {
4041 // Parse ref ident @ pat / ref mut ident @ pat
4042 let mutbl = self.parse_mutability();
4043 pat = self.parse_pat_ident(BindingMode::ByRef(mutbl))?;
4044 } else if self.eat_keyword(keywords::Box) {
4046 let subpat = self.parse_pat_with_range_pat(false)?;
4047 pat = PatKind::Box(subpat);
4048 } else if self.token.is_ident() && !self.token.is_reserved_ident() &&
4049 self.parse_as_ident() {
4050 // Parse ident @ pat
4051 // This can give false positives and parse nullary enums,
4052 // they are dealt with later in resolve
4053 let binding_mode = BindingMode::ByValue(Mutability::Immutable);
4054 pat = self.parse_pat_ident(binding_mode)?;
4055 } else if self.token.is_path_start() {
4056 // Parse pattern starting with a path
4057 let (qself, path) = if self.eat_lt() {
4058 // Parse a qualified path
4059 let (qself, path) = self.parse_qpath(PathStyle::Expr)?;
4062 // Parse an unqualified path
4063 (None, self.parse_path(PathStyle::Expr)?)
4066 token::Not if qself.is_none() => {
4067 // Parse macro invocation
4069 let (delim, tts) = self.expect_delimited_token_tree()?;
4070 let mac = respan(lo.to(self.prev_span), Mac_ { path, tts, delim });
4071 pat = PatKind::Mac(mac);
4073 token::DotDotDot | token::DotDotEq | token::DotDot => {
4074 let end_kind = match self.token {
4075 token::DotDot => RangeEnd::Excluded,
4076 token::DotDotDot => RangeEnd::Included(RangeSyntax::DotDotDot),
4077 token::DotDotEq => RangeEnd::Included(RangeSyntax::DotDotEq),
4078 _ => panic!("can only parse `..`/`...`/`..=` for ranges \
4081 let op_span = self.span;
4083 let span = lo.to(self.prev_span);
4084 let begin = self.mk_expr(span, ExprKind::Path(qself, path), ThinVec::new());
4086 let end = self.parse_pat_range_end()?;
4087 let op = Spanned { span: op_span, node: end_kind };
4088 pat = PatKind::Range(begin, end, op);
4090 token::OpenDelim(token::Brace) => {
4091 if qself.is_some() {
4092 let msg = "unexpected `{` after qualified path";
4093 let mut err = self.fatal(msg);
4094 err.span_label(self.span, msg);
4097 // Parse struct pattern
4099 let (fields, etc) = self.parse_pat_fields().unwrap_or_else(|mut e| {
4101 self.recover_stmt();
4105 pat = PatKind::Struct(path, fields, etc);
4107 token::OpenDelim(token::Paren) => {
4108 if qself.is_some() {
4109 let msg = "unexpected `(` after qualified path";
4110 let mut err = self.fatal(msg);
4111 err.span_label(self.span, msg);
4114 // Parse tuple struct or enum pattern
4115 let (fields, ddpos, _) = self.parse_parenthesized_pat_list()?;
4116 pat = PatKind::TupleStruct(path, fields, ddpos)
4118 _ => pat = PatKind::Path(qself, path),
4121 // Try to parse everything else as literal with optional minus
4122 match self.parse_literal_maybe_minus() {
4124 let op_span = self.span;
4125 if self.check(&token::DotDot) || self.check(&token::DotDotEq) ||
4126 self.check(&token::DotDotDot) {
4127 let end_kind = if self.eat(&token::DotDotDot) {
4128 RangeEnd::Included(RangeSyntax::DotDotDot)
4129 } else if self.eat(&token::DotDotEq) {
4130 RangeEnd::Included(RangeSyntax::DotDotEq)
4131 } else if self.eat(&token::DotDot) {
4134 panic!("impossible case: we already matched \
4135 on a range-operator token")
4137 let end = self.parse_pat_range_end()?;
4138 let op = Spanned { span: op_span, node: end_kind };
4139 pat = PatKind::Range(begin, end, op);
4141 pat = PatKind::Lit(begin);
4145 self.cancel(&mut err);
4146 let msg = format!("expected pattern, found {}", self.this_token_descr());
4147 let mut err = self.fatal(&msg);
4148 err.span_label(self.span, "expected pattern");
4155 let pat = Pat { node: pat, span: lo.to(self.prev_span), id: ast::DUMMY_NODE_ID };
4156 let pat = self.maybe_recover_from_bad_qpath(pat, true)?;
4158 if !allow_range_pat {
4161 _, _, Spanned { node: RangeEnd::Included(RangeSyntax::DotDotDot), .. }
4163 PatKind::Range(..) => {
4164 let mut err = self.struct_span_err(
4166 "the range pattern here has ambiguous interpretation",
4168 err.span_suggestion_with_applicability(
4170 "add parentheses to clarify the precedence",
4171 format!("({})", pprust::pat_to_string(&pat)),
4172 // "ambiguous interpretation" implies that we have to be guessing
4173 Applicability::MaybeIncorrect
4184 /// Parse ident or ident @ pat
4185 /// used by the copy foo and ref foo patterns to give a good
4186 /// error message when parsing mistakes like ref foo(a,b)
4187 fn parse_pat_ident(&mut self,
4188 binding_mode: ast::BindingMode)
4189 -> PResult<'a, PatKind> {
4190 let ident = self.parse_ident()?;
4191 let sub = if self.eat(&token::At) {
4192 Some(self.parse_pat()?)
4197 // just to be friendly, if they write something like
4199 // we end up here with ( as the current token. This shortly
4200 // leads to a parse error. Note that if there is no explicit
4201 // binding mode then we do not end up here, because the lookahead
4202 // will direct us over to parse_enum_variant()
4203 if self.token == token::OpenDelim(token::Paren) {
4204 return Err(self.span_fatal(
4206 "expected identifier, found enum pattern"))
4209 Ok(PatKind::Ident(binding_mode, ident, sub))
4212 /// Parse a local variable declaration
4213 fn parse_local(&mut self, attrs: ThinVec<Attribute>) -> PResult<'a, P<Local>> {
4214 let lo = self.prev_span;
4215 let pat = self.parse_top_level_pat()?;
4217 let (err, ty) = if self.eat(&token::Colon) {
4218 // Save the state of the parser before parsing type normally, in case there is a `:`
4219 // instead of an `=` typo.
4220 let parser_snapshot_before_type = self.clone();
4221 let colon_sp = self.prev_span;
4222 match self.parse_ty() {
4223 Ok(ty) => (None, Some(ty)),
4225 // Rewind to before attempting to parse the type and continue parsing
4226 let parser_snapshot_after_type = self.clone();
4227 mem::replace(self, parser_snapshot_before_type);
4229 let snippet = self.sess.codemap().span_to_snippet(pat.span).unwrap();
4230 err.span_label(pat.span, format!("while parsing the type for `{}`", snippet));
4231 (Some((parser_snapshot_after_type, colon_sp, err)), None)
4237 let init = match (self.parse_initializer(err.is_some()), err) {
4238 (Ok(init), None) => { // init parsed, ty parsed
4241 (Ok(init), Some((_, colon_sp, mut err))) => { // init parsed, ty error
4242 // Could parse the type as if it were the initializer, it is likely there was a
4243 // typo in the code: `:` instead of `=`. Add suggestion and emit the error.
4244 err.span_suggestion_short_with_applicability(
4246 "use `=` if you meant to assign",
4248 Applicability::MachineApplicable
4251 // As this was parsed successfully, continue as if the code has been fixed for the
4252 // rest of the file. It will still fail due to the emitted error, but we avoid
4256 (Err(mut init_err), Some((snapshot, _, ty_err))) => { // init error, ty error
4258 // Couldn't parse the type nor the initializer, only raise the type error and
4259 // return to the parser state before parsing the type as the initializer.
4260 // let x: <parse_error>;
4261 mem::replace(self, snapshot);
4264 (Err(err), None) => { // init error, ty parsed
4265 // Couldn't parse the initializer and we're not attempting to recover a failed
4266 // parse of the type, return the error.
4270 let hi = if self.token == token::Semi {
4279 id: ast::DUMMY_NODE_ID,
4285 /// Parse a structure field
4286 fn parse_name_and_ty(&mut self,
4289 attrs: Vec<Attribute>)
4290 -> PResult<'a, StructField> {
4291 let name = self.parse_ident()?;
4292 self.expect(&token::Colon)?;
4293 let ty = self.parse_ty()?;
4295 span: lo.to(self.prev_span),
4298 id: ast::DUMMY_NODE_ID,
4304 /// Emit an expected item after attributes error.
4305 fn expected_item_err(&self, attrs: &[Attribute]) {
4306 let message = match attrs.last() {
4307 Some(&Attribute { is_sugared_doc: true, .. }) => "expected item after doc comment",
4308 _ => "expected item after attributes",
4311 self.span_err(self.prev_span, message);
4314 /// Parse a statement. This stops just before trailing semicolons on everything but items.
4315 /// e.g. a `StmtKind::Semi` parses to a `StmtKind::Expr`, leaving the trailing `;` unconsumed.
4316 pub fn parse_stmt(&mut self) -> PResult<'a, Option<Stmt>> {
4317 Ok(self.parse_stmt_(true))
4320 // Eat tokens until we can be relatively sure we reached the end of the
4321 // statement. This is something of a best-effort heuristic.
4323 // We terminate when we find an unmatched `}` (without consuming it).
4324 fn recover_stmt(&mut self) {
4325 self.recover_stmt_(SemiColonMode::Ignore, BlockMode::Ignore)
4328 // If `break_on_semi` is `Break`, then we will stop consuming tokens after
4329 // finding (and consuming) a `;` outside of `{}` or `[]` (note that this is
4330 // approximate - it can mean we break too early due to macros, but that
4331 // shoud only lead to sub-optimal recovery, not inaccurate parsing).
4333 // If `break_on_block` is `Break`, then we will stop consuming tokens
4334 // after finding (and consuming) a brace-delimited block.
4335 fn recover_stmt_(&mut self, break_on_semi: SemiColonMode, break_on_block: BlockMode) {
4336 let mut brace_depth = 0;
4337 let mut bracket_depth = 0;
4338 let mut in_block = false;
4339 debug!("recover_stmt_ enter loop (semi={:?}, block={:?})",
4340 break_on_semi, break_on_block);
4342 debug!("recover_stmt_ loop {:?}", self.token);
4344 token::OpenDelim(token::DelimToken::Brace) => {
4347 if break_on_block == BlockMode::Break &&
4349 bracket_depth == 0 {
4353 token::OpenDelim(token::DelimToken::Bracket) => {
4357 token::CloseDelim(token::DelimToken::Brace) => {
4358 if brace_depth == 0 {
4359 debug!("recover_stmt_ return - close delim {:?}", self.token);
4364 if in_block && bracket_depth == 0 && brace_depth == 0 {
4365 debug!("recover_stmt_ return - block end {:?}", self.token);
4369 token::CloseDelim(token::DelimToken::Bracket) => {
4371 if bracket_depth < 0 {
4377 debug!("recover_stmt_ return - Eof");
4382 if break_on_semi == SemiColonMode::Break &&
4384 bracket_depth == 0 {
4385 debug!("recover_stmt_ return - Semi");
4396 fn parse_stmt_(&mut self, macro_legacy_warnings: bool) -> Option<Stmt> {
4397 self.parse_stmt_without_recovery(macro_legacy_warnings).unwrap_or_else(|mut e| {
4399 self.recover_stmt_(SemiColonMode::Break, BlockMode::Ignore);
4404 fn is_async_block(&mut self) -> bool {
4405 self.token.is_keyword(keywords::Async) &&
4408 self.look_ahead(1, |t| t.is_keyword(keywords::Move)) &&
4409 self.look_ahead(2, |t| *t == token::OpenDelim(token::Brace))
4411 self.look_ahead(1, |t| *t == token::OpenDelim(token::Brace))
4416 fn is_catch_expr(&mut self) -> bool {
4417 self.token.is_keyword(keywords::Do) &&
4418 self.look_ahead(1, |t| t.is_keyword(keywords::Catch)) &&
4419 self.look_ahead(2, |t| *t == token::OpenDelim(token::Brace)) &&
4421 // prevent `while catch {} {}`, `if catch {} {} else {}`, etc.
4422 !self.restrictions.contains(Restrictions::NO_STRUCT_LITERAL)
4425 fn is_union_item(&self) -> bool {
4426 self.token.is_keyword(keywords::Union) &&
4427 self.look_ahead(1, |t| t.is_ident() && !t.is_reserved_ident())
4430 fn is_crate_vis(&self) -> bool {
4431 self.token.is_keyword(keywords::Crate) && self.look_ahead(1, |t| t != &token::ModSep)
4434 fn is_extern_non_path(&self) -> bool {
4435 self.token.is_keyword(keywords::Extern) && self.look_ahead(1, |t| t != &token::ModSep)
4438 fn is_existential_type_decl(&self) -> bool {
4439 self.token.is_keyword(keywords::Existential) &&
4440 self.look_ahead(1, |t| t.is_keyword(keywords::Type))
4443 fn is_auto_trait_item(&mut self) -> bool {
4445 (self.token.is_keyword(keywords::Auto)
4446 && self.look_ahead(1, |t| t.is_keyword(keywords::Trait)))
4447 || // unsafe auto trait
4448 (self.token.is_keyword(keywords::Unsafe) &&
4449 self.look_ahead(1, |t| t.is_keyword(keywords::Auto)) &&
4450 self.look_ahead(2, |t| t.is_keyword(keywords::Trait)))
4453 fn eat_macro_def(&mut self, attrs: &[Attribute], vis: &Visibility, lo: Span)
4454 -> PResult<'a, Option<P<Item>>> {
4455 let token_lo = self.span;
4456 let (ident, def) = match self.token {
4457 token::Ident(ident, false) if ident.name == keywords::Macro.name() => {
4459 let ident = self.parse_ident()?;
4460 let tokens = if self.check(&token::OpenDelim(token::Brace)) {
4461 match self.parse_token_tree() {
4462 TokenTree::Delimited(_, ref delimited) => delimited.stream(),
4463 _ => unreachable!(),
4465 } else if self.check(&token::OpenDelim(token::Paren)) {
4466 let args = self.parse_token_tree();
4467 let body = if self.check(&token::OpenDelim(token::Brace)) {
4468 self.parse_token_tree()
4473 TokenStream::concat(vec![
4475 TokenTree::Token(token_lo.to(self.prev_span), token::FatArrow).into(),
4483 (ident, ast::MacroDef { tokens: tokens.into(), legacy: false })
4485 token::Ident(ident, _) if ident.name == "macro_rules" &&
4486 self.look_ahead(1, |t| *t == token::Not) => {
4487 let prev_span = self.prev_span;
4488 self.complain_if_pub_macro(&vis.node, prev_span);
4492 let ident = self.parse_ident()?;
4493 let (delim, tokens) = self.expect_delimited_token_tree()?;
4494 if delim != MacDelimiter::Brace {
4495 if !self.eat(&token::Semi) {
4496 let msg = "macros that expand to items must either \
4497 be surrounded with braces or followed by a semicolon";
4498 self.span_err(self.prev_span, msg);
4502 (ident, ast::MacroDef { tokens: tokens, legacy: true })
4504 _ => return Ok(None),
4507 let span = lo.to(self.prev_span);
4508 Ok(Some(self.mk_item(span, ident, ItemKind::MacroDef(def), vis.clone(), attrs.to_vec())))
4511 fn parse_stmt_without_recovery(&mut self,
4512 macro_legacy_warnings: bool)
4513 -> PResult<'a, Option<Stmt>> {
4514 maybe_whole!(self, NtStmt, |x| Some(x));
4516 let attrs = self.parse_outer_attributes()?;
4519 Ok(Some(if self.eat_keyword(keywords::Let) {
4521 id: ast::DUMMY_NODE_ID,
4522 node: StmtKind::Local(self.parse_local(attrs.into())?),
4523 span: lo.to(self.prev_span),
4525 } else if let Some(macro_def) = self.eat_macro_def(
4527 &codemap::respan(lo, VisibilityKind::Inherited),
4531 id: ast::DUMMY_NODE_ID,
4532 node: StmtKind::Item(macro_def),
4533 span: lo.to(self.prev_span),
4535 // Starts like a simple path, being careful to avoid contextual keywords
4536 // such as a union items, item with `crate` visibility or auto trait items.
4537 // Our goal here is to parse an arbitrary path `a::b::c` but not something that starts
4538 // like a path (1 token), but it fact not a path.
4539 // `union::b::c` - path, `union U { ... }` - not a path.
4540 // `crate::b::c` - path, `crate struct S;` - not a path.
4541 // `extern::b::c` - path, `extern crate c;` - not a path.
4542 } else if self.token.is_path_start() &&
4543 !self.token.is_qpath_start() &&
4544 !self.is_union_item() &&
4545 !self.is_crate_vis() &&
4546 !self.is_extern_non_path() &&
4547 !self.is_existential_type_decl() &&
4548 !self.is_auto_trait_item() {
4549 let pth = self.parse_path(PathStyle::Expr)?;
4551 if !self.eat(&token::Not) {
4552 let expr = if self.check(&token::OpenDelim(token::Brace)) {
4553 self.parse_struct_expr(lo, pth, ThinVec::new())?
4555 let hi = self.prev_span;
4556 self.mk_expr(lo.to(hi), ExprKind::Path(None, pth), ThinVec::new())
4559 let expr = self.with_res(Restrictions::STMT_EXPR, |this| {
4560 let expr = this.parse_dot_or_call_expr_with(expr, lo, attrs.into())?;
4561 this.parse_assoc_expr_with(0, LhsExpr::AlreadyParsed(expr))
4564 return Ok(Some(Stmt {
4565 id: ast::DUMMY_NODE_ID,
4566 node: StmtKind::Expr(expr),
4567 span: lo.to(self.prev_span),
4571 // it's a macro invocation
4572 let id = match self.token {
4573 token::OpenDelim(_) => keywords::Invalid.ident(), // no special identifier
4574 _ => self.parse_ident()?,
4577 // check that we're pointing at delimiters (need to check
4578 // again after the `if`, because of `parse_ident`
4579 // consuming more tokens).
4581 token::OpenDelim(_) => {}
4583 // we only expect an ident if we didn't parse one
4585 let ident_str = if id.name == keywords::Invalid.name() {
4590 let tok_str = self.this_token_to_string();
4591 let mut err = self.fatal(&format!("expected {}`(` or `{{`, found `{}`",
4594 err.span_label(self.span, format!("expected {}`(` or `{{`", ident_str));
4599 let (delim, tts) = self.expect_delimited_token_tree()?;
4600 let hi = self.prev_span;
4602 let style = if delim == MacDelimiter::Brace {
4603 MacStmtStyle::Braces
4605 MacStmtStyle::NoBraces
4608 if id.name == keywords::Invalid.name() {
4609 let mac = respan(lo.to(hi), Mac_ { path: pth, tts, delim });
4610 let node = if delim == MacDelimiter::Brace ||
4611 self.token == token::Semi || self.token == token::Eof {
4612 StmtKind::Mac(P((mac, style, attrs.into())))
4614 // We used to incorrectly stop parsing macro-expanded statements here.
4615 // If the next token will be an error anyway but could have parsed with the
4616 // earlier behavior, stop parsing here and emit a warning to avoid breakage.
4617 else if macro_legacy_warnings && self.token.can_begin_expr() && match self.token {
4618 // These can continue an expression, so we can't stop parsing and warn.
4619 token::OpenDelim(token::Paren) | token::OpenDelim(token::Bracket) |
4620 token::BinOp(token::Minus) | token::BinOp(token::Star) |
4621 token::BinOp(token::And) | token::BinOp(token::Or) |
4622 token::AndAnd | token::OrOr |
4623 token::DotDot | token::DotDotDot | token::DotDotEq => false,
4626 self.warn_missing_semicolon();
4627 StmtKind::Mac(P((mac, style, attrs.into())))
4629 let e = self.mk_mac_expr(lo.to(hi), mac.node, ThinVec::new());
4630 let e = self.parse_dot_or_call_expr_with(e, lo, attrs.into())?;
4631 let e = self.parse_assoc_expr_with(0, LhsExpr::AlreadyParsed(e))?;
4635 id: ast::DUMMY_NODE_ID,
4640 // if it has a special ident, it's definitely an item
4642 // Require a semicolon or braces.
4643 if style != MacStmtStyle::Braces {
4644 if !self.eat(&token::Semi) {
4645 self.span_err(self.prev_span,
4646 "macros that expand to items must \
4647 either be surrounded with braces or \
4648 followed by a semicolon");
4651 let span = lo.to(hi);
4653 id: ast::DUMMY_NODE_ID,
4655 node: StmtKind::Item({
4657 span, id /*id is good here*/,
4658 ItemKind::Mac(respan(span, Mac_ { path: pth, tts, delim })),
4659 respan(lo, VisibilityKind::Inherited),
4665 // FIXME: Bad copy of attrs
4666 let old_directory_ownership =
4667 mem::replace(&mut self.directory.ownership, DirectoryOwnership::UnownedViaBlock);
4668 let item = self.parse_item_(attrs.clone(), false, true)?;
4669 self.directory.ownership = old_directory_ownership;
4673 id: ast::DUMMY_NODE_ID,
4674 span: lo.to(i.span),
4675 node: StmtKind::Item(i),
4678 let unused_attrs = |attrs: &[Attribute], s: &mut Self| {
4679 if !attrs.is_empty() {
4680 if s.prev_token_kind == PrevTokenKind::DocComment {
4681 s.span_fatal_err(s.prev_span, Error::UselessDocComment).emit();
4682 } else if attrs.iter().any(|a| a.style == AttrStyle::Outer) {
4683 s.span_err(s.span, "expected statement after outer attribute");
4688 // Do not attempt to parse an expression if we're done here.
4689 if self.token == token::Semi {
4690 unused_attrs(&attrs, self);
4695 if self.token == token::CloseDelim(token::Brace) {
4696 unused_attrs(&attrs, self);
4700 // Remainder are line-expr stmts.
4701 let e = self.parse_expr_res(
4702 Restrictions::STMT_EXPR, Some(attrs.into()))?;
4704 id: ast::DUMMY_NODE_ID,
4705 span: lo.to(e.span),
4706 node: StmtKind::Expr(e),
4713 /// Is this expression a successfully-parsed statement?
4714 fn expr_is_complete(&mut self, e: &Expr) -> bool {
4715 self.restrictions.contains(Restrictions::STMT_EXPR) &&
4716 !classify::expr_requires_semi_to_be_stmt(e)
4719 /// Parse a block. No inner attrs are allowed.
4720 pub fn parse_block(&mut self) -> PResult<'a, P<Block>> {
4721 maybe_whole!(self, NtBlock, |x| x);
4725 if !self.eat(&token::OpenDelim(token::Brace)) {
4727 let tok = self.this_token_to_string();
4728 let mut e = self.span_fatal(sp, &format!("expected `{{`, found `{}`", tok));
4730 // Check to see if the user has written something like
4735 // Which is valid in other languages, but not Rust.
4736 match self.parse_stmt_without_recovery(false) {
4738 if self.look_ahead(1, |t| t == &token::OpenDelim(token::Brace)) {
4739 // if the next token is an open brace (e.g., `if a b {`), the place-
4740 // inside-a-block suggestion would be more likely wrong than right
4743 let mut stmt_span = stmt.span;
4744 // expand the span to include the semicolon, if it exists
4745 if self.eat(&token::Semi) {
4746 stmt_span = stmt_span.with_hi(self.prev_span.hi());
4748 let sugg = pprust::to_string(|s| {
4749 use print::pprust::{PrintState, INDENT_UNIT};
4750 s.ibox(INDENT_UNIT)?;
4752 s.print_stmt(&stmt)?;
4753 s.bclose_maybe_open(stmt.span, INDENT_UNIT, false)
4755 e.span_suggestion_with_applicability(
4757 "try placing this code inside a block",
4759 // speculative, has been misleading in the past (closed Issue #46836)
4760 Applicability::MaybeIncorrect
4764 self.recover_stmt_(SemiColonMode::Break, BlockMode::Ignore);
4765 self.cancel(&mut e);
4772 self.parse_block_tail(lo, BlockCheckMode::Default)
4775 /// Parse a block. Inner attrs are allowed.
4776 fn parse_inner_attrs_and_block(&mut self) -> PResult<'a, (Vec<Attribute>, P<Block>)> {
4777 maybe_whole!(self, NtBlock, |x| (Vec::new(), x));
4780 self.expect(&token::OpenDelim(token::Brace))?;
4781 Ok((self.parse_inner_attributes()?,
4782 self.parse_block_tail(lo, BlockCheckMode::Default)?))
4785 /// Parse the rest of a block expression or function body
4786 /// Precondition: already parsed the '{'.
4787 fn parse_block_tail(&mut self, lo: Span, s: BlockCheckMode) -> PResult<'a, P<Block>> {
4788 let mut stmts = vec![];
4789 let mut recovered = false;
4791 while !self.eat(&token::CloseDelim(token::Brace)) {
4792 let stmt = match self.parse_full_stmt(false) {
4795 self.recover_stmt_(SemiColonMode::Ignore, BlockMode::Ignore);
4796 self.eat(&token::CloseDelim(token::Brace));
4802 if let Some(stmt) = stmt {
4804 } else if self.token == token::Eof {
4807 // Found only `;` or `}`.
4813 id: ast::DUMMY_NODE_ID,
4815 span: lo.to(self.prev_span),
4820 /// Parse a statement, including the trailing semicolon.
4821 crate fn parse_full_stmt(&mut self, macro_legacy_warnings: bool) -> PResult<'a, Option<Stmt>> {
4822 // skip looking for a trailing semicolon when we have an interpolated statement
4823 maybe_whole!(self, NtStmt, |x| Some(x));
4825 let mut stmt = match self.parse_stmt_without_recovery(macro_legacy_warnings)? {
4827 None => return Ok(None),
4831 StmtKind::Expr(ref expr) if self.token != token::Eof => {
4832 // expression without semicolon
4833 if classify::expr_requires_semi_to_be_stmt(expr) {
4834 // Just check for errors and recover; do not eat semicolon yet.
4836 self.expect_one_of(&[], &[token::Semi, token::CloseDelim(token::Brace)])
4839 self.recover_stmt();
4843 StmtKind::Local(..) => {
4844 // We used to incorrectly allow a macro-expanded let statement to lack a semicolon.
4845 if macro_legacy_warnings && self.token != token::Semi {
4846 self.warn_missing_semicolon();
4848 self.expect_one_of(&[], &[token::Semi])?;
4854 if self.eat(&token::Semi) {
4855 stmt = stmt.add_trailing_semicolon();
4858 stmt.span = stmt.span.with_hi(self.prev_span.hi());
4862 fn warn_missing_semicolon(&self) {
4863 self.diagnostic().struct_span_warn(self.span, {
4864 &format!("expected `;`, found `{}`", self.this_token_to_string())
4866 "This was erroneously allowed and will become a hard error in a future release"
4870 fn err_dotdotdot_syntax(&self, span: Span) {
4871 self.diagnostic().struct_span_err(span, {
4872 "unexpected token: `...`"
4873 }).span_suggestion_with_applicability(
4874 span, "use `..` for an exclusive range", "..".to_owned(),
4875 Applicability::MaybeIncorrect
4876 ).span_suggestion_with_applicability(
4877 span, "or `..=` for an inclusive range", "..=".to_owned(),
4878 Applicability::MaybeIncorrect
4882 // Parse bounds of a type parameter `BOUND + BOUND + BOUND`, possibly with trailing `+`.
4883 // BOUND = TY_BOUND | LT_BOUND
4884 // LT_BOUND = LIFETIME (e.g. `'a`)
4885 // TY_BOUND = TY_BOUND_NOPAREN | (TY_BOUND_NOPAREN)
4886 // TY_BOUND_NOPAREN = [?] [for<LT_PARAM_DEFS>] SIMPLE_PATH (e.g. `?for<'a: 'b> m::Trait<'a>`)
4887 fn parse_generic_bounds_common(&mut self, allow_plus: bool) -> PResult<'a, GenericBounds> {
4888 let mut bounds = Vec::new();
4890 // This needs to be syncronized with `Token::can_begin_bound`.
4891 let is_bound_start = self.check_path() || self.check_lifetime() ||
4892 self.check(&token::Question) ||
4893 self.check_keyword(keywords::For) ||
4894 self.check(&token::OpenDelim(token::Paren));
4897 let has_parens = self.eat(&token::OpenDelim(token::Paren));
4898 let question = if self.eat(&token::Question) { Some(self.prev_span) } else { None };
4899 if self.token.is_lifetime() {
4900 if let Some(question_span) = question {
4901 self.span_err(question_span,
4902 "`?` may only modify trait bounds, not lifetime bounds");
4904 bounds.push(GenericBound::Outlives(self.expect_lifetime()));
4906 self.expect(&token::CloseDelim(token::Paren))?;
4907 self.span_err(self.prev_span,
4908 "parenthesized lifetime bounds are not supported");
4911 let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
4912 let path = self.parse_path(PathStyle::Type)?;
4914 self.expect(&token::CloseDelim(token::Paren))?;
4916 let poly_trait = PolyTraitRef::new(lifetime_defs, path, lo.to(self.prev_span));
4917 let modifier = if question.is_some() {
4918 TraitBoundModifier::Maybe
4920 TraitBoundModifier::None
4922 bounds.push(GenericBound::Trait(poly_trait, modifier));
4928 if !allow_plus || !self.eat_plus() {
4936 fn parse_generic_bounds(&mut self) -> PResult<'a, GenericBounds> {
4937 self.parse_generic_bounds_common(true)
4940 // Parse bounds of a lifetime parameter `BOUND + BOUND + BOUND`, possibly with trailing `+`.
4941 // BOUND = LT_BOUND (e.g. `'a`)
4942 fn parse_lt_param_bounds(&mut self) -> GenericBounds {
4943 let mut lifetimes = Vec::new();
4944 while self.check_lifetime() {
4945 lifetimes.push(ast::GenericBound::Outlives(self.expect_lifetime()));
4947 if !self.eat_plus() {
4954 /// Matches typaram = IDENT (`?` unbound)? optbounds ( EQ ty )?
4955 fn parse_ty_param(&mut self,
4956 preceding_attrs: Vec<Attribute>)
4957 -> PResult<'a, GenericParam> {
4958 let ident = self.parse_ident()?;
4960 // Parse optional colon and param bounds.
4961 let bounds = if self.eat(&token::Colon) {
4962 self.parse_generic_bounds()?
4967 let default = if self.eat(&token::Eq) {
4968 Some(self.parse_ty()?)
4975 id: ast::DUMMY_NODE_ID,
4976 attrs: preceding_attrs.into(),
4978 kind: GenericParamKind::Type {
4984 /// Parses the following grammar:
4985 /// TraitItemAssocTy = Ident ["<"...">"] [":" [GenericBounds]] ["where" ...] ["=" Ty]
4986 fn parse_trait_item_assoc_ty(&mut self)
4987 -> PResult<'a, (Ident, TraitItemKind, ast::Generics)> {
4988 let ident = self.parse_ident()?;
4989 let mut generics = self.parse_generics()?;
4991 // Parse optional colon and param bounds.
4992 let bounds = if self.eat(&token::Colon) {
4993 self.parse_generic_bounds()?
4997 generics.where_clause = self.parse_where_clause()?;
4999 let default = if self.eat(&token::Eq) {
5000 Some(self.parse_ty()?)
5004 self.expect(&token::Semi)?;
5006 Ok((ident, TraitItemKind::Type(bounds, default), generics))
5009 /// Parses (possibly empty) list of lifetime and type parameters, possibly including
5010 /// trailing comma and erroneous trailing attributes.
5011 crate fn parse_generic_params(&mut self) -> PResult<'a, Vec<ast::GenericParam>> {
5012 let mut params = Vec::new();
5013 let mut seen_ty_param = false;
5015 let attrs = self.parse_outer_attributes()?;
5016 if self.check_lifetime() {
5017 let lifetime = self.expect_lifetime();
5018 // Parse lifetime parameter.
5019 let bounds = if self.eat(&token::Colon) {
5020 self.parse_lt_param_bounds()
5024 params.push(ast::GenericParam {
5025 ident: lifetime.ident,
5027 attrs: attrs.into(),
5029 kind: ast::GenericParamKind::Lifetime,
5032 self.span_err(self.prev_span,
5033 "lifetime parameters must be declared prior to type parameters");
5035 } else if self.check_ident() {
5036 // Parse type parameter.
5037 params.push(self.parse_ty_param(attrs)?);
5038 seen_ty_param = true;
5040 // Check for trailing attributes and stop parsing.
5041 if !attrs.is_empty() {
5042 let param_kind = if seen_ty_param { "type" } else { "lifetime" };
5043 self.span_err(attrs[0].span,
5044 &format!("trailing attribute after {} parameters", param_kind));
5049 if !self.eat(&token::Comma) {
5056 /// Parse a set of optional generic type parameter declarations. Where
5057 /// clauses are not parsed here, and must be added later via
5058 /// `parse_where_clause()`.
5060 /// matches generics = ( ) | ( < > ) | ( < typaramseq ( , )? > ) | ( < lifetimes ( , )? > )
5061 /// | ( < lifetimes , typaramseq ( , )? > )
5062 /// where typaramseq = ( typaram ) | ( typaram , typaramseq )
5063 fn parse_generics(&mut self) -> PResult<'a, ast::Generics> {
5064 maybe_whole!(self, NtGenerics, |x| x);
5066 let span_lo = self.span;
5068 let params = self.parse_generic_params()?;
5072 where_clause: WhereClause {
5073 id: ast::DUMMY_NODE_ID,
5074 predicates: Vec::new(),
5075 span: syntax_pos::DUMMY_SP,
5077 span: span_lo.to(self.prev_span),
5080 Ok(ast::Generics::default())
5084 /// Parses (possibly empty) list of lifetime and type arguments and associated type bindings,
5085 /// possibly including trailing comma.
5086 fn parse_generic_args(&mut self)
5087 -> PResult<'a, (Vec<GenericArg>, Vec<TypeBinding>)> {
5088 let mut args = Vec::new();
5089 let mut bindings = Vec::new();
5090 let mut seen_type = false;
5091 let mut seen_binding = false;
5093 if self.check_lifetime() && self.look_ahead(1, |t| !t.is_like_plus()) {
5094 // Parse lifetime argument.
5095 args.push(GenericArg::Lifetime(self.expect_lifetime()));
5096 if seen_type || seen_binding {
5097 self.span_err(self.prev_span,
5098 "lifetime parameters must be declared prior to type parameters");
5100 } else if self.check_ident() && self.look_ahead(1, |t| t == &token::Eq) {
5101 // Parse associated type binding.
5103 let ident = self.parse_ident()?;
5105 let ty = self.parse_ty()?;
5106 bindings.push(TypeBinding {
5107 id: ast::DUMMY_NODE_ID,
5110 span: lo.to(self.prev_span),
5112 seen_binding = true;
5113 } else if self.check_type() {
5114 // Parse type argument.
5115 let ty_param = self.parse_ty()?;
5117 self.span_err(ty_param.span,
5118 "type parameters must be declared prior to associated type bindings");
5120 args.push(GenericArg::Type(ty_param));
5126 if !self.eat(&token::Comma) {
5130 Ok((args, bindings))
5133 /// Parses an optional `where` clause and places it in `generics`.
5135 /// ```ignore (only-for-syntax-highlight)
5136 /// where T : Trait<U, V> + 'b, 'a : 'b
5138 fn parse_where_clause(&mut self) -> PResult<'a, WhereClause> {
5139 maybe_whole!(self, NtWhereClause, |x| x);
5141 let mut where_clause = WhereClause {
5142 id: ast::DUMMY_NODE_ID,
5143 predicates: Vec::new(),
5144 span: syntax_pos::DUMMY_SP,
5147 if !self.eat_keyword(keywords::Where) {
5148 return Ok(where_clause);
5150 let lo = self.prev_span;
5152 // We are considering adding generics to the `where` keyword as an alternative higher-rank
5153 // parameter syntax (as in `where<'a>` or `where<T>`. To avoid that being a breaking
5154 // change we parse those generics now, but report an error.
5155 if self.choose_generics_over_qpath() {
5156 let generics = self.parse_generics()?;
5157 self.span_err(generics.span,
5158 "generic parameters on `where` clauses are reserved for future use");
5163 if self.check_lifetime() && self.look_ahead(1, |t| !t.is_like_plus()) {
5164 let lifetime = self.expect_lifetime();
5165 // Bounds starting with a colon are mandatory, but possibly empty.
5166 self.expect(&token::Colon)?;
5167 let bounds = self.parse_lt_param_bounds();
5168 where_clause.predicates.push(ast::WherePredicate::RegionPredicate(
5169 ast::WhereRegionPredicate {
5170 span: lo.to(self.prev_span),
5175 } else if self.check_type() {
5176 // Parse optional `for<'a, 'b>`.
5177 // This `for` is parsed greedily and applies to the whole predicate,
5178 // the bounded type can have its own `for` applying only to it.
5179 // Example 1: for<'a> Trait1<'a>: Trait2<'a /*ok*/>
5180 // Example 2: (for<'a> Trait1<'a>): Trait2<'a /*not ok*/>
5181 // Example 3: for<'a> for<'b> Trait1<'a, 'b>: Trait2<'a /*ok*/, 'b /*not ok*/>
5182 let lifetime_defs = self.parse_late_bound_lifetime_defs()?;
5184 // Parse type with mandatory colon and (possibly empty) bounds,
5185 // or with mandatory equality sign and the second type.
5186 let ty = self.parse_ty()?;
5187 if self.eat(&token::Colon) {
5188 let bounds = self.parse_generic_bounds()?;
5189 where_clause.predicates.push(ast::WherePredicate::BoundPredicate(
5190 ast::WhereBoundPredicate {
5191 span: lo.to(self.prev_span),
5192 bound_generic_params: lifetime_defs,
5197 // FIXME: Decide what should be used here, `=` or `==`.
5198 // FIXME: We are just dropping the binders in lifetime_defs on the floor here.
5199 } else if self.eat(&token::Eq) || self.eat(&token::EqEq) {
5200 let rhs_ty = self.parse_ty()?;
5201 where_clause.predicates.push(ast::WherePredicate::EqPredicate(
5202 ast::WhereEqPredicate {
5203 span: lo.to(self.prev_span),
5206 id: ast::DUMMY_NODE_ID,
5210 return self.unexpected();
5216 if !self.eat(&token::Comma) {
5221 where_clause.span = lo.to(self.prev_span);
5225 fn parse_fn_args(&mut self, named_args: bool, allow_variadic: bool)
5226 -> PResult<'a, (Vec<Arg> , bool)> {
5228 let mut variadic = false;
5229 let args: Vec<Option<Arg>> =
5230 self.parse_unspanned_seq(
5231 &token::OpenDelim(token::Paren),
5232 &token::CloseDelim(token::Paren),
5233 SeqSep::trailing_allowed(token::Comma),
5235 if p.token == token::DotDotDot {
5239 if p.token != token::CloseDelim(token::Paren) {
5242 "`...` must be last in argument list for variadic function");
5246 let span = p.prev_span;
5247 if p.token == token::CloseDelim(token::Paren) {
5248 // continue parsing to present any further errors
5251 "only foreign functions are allowed to be variadic"
5253 Ok(Some(dummy_arg(span)))
5255 // this function definition looks beyond recovery, stop parsing
5257 "only foreign functions are allowed to be variadic");
5262 match p.parse_arg_general(named_args) {
5263 Ok(arg) => Ok(Some(arg)),
5266 let lo = p.prev_span;
5267 // Skip every token until next possible arg or end.
5268 p.eat_to_tokens(&[&token::Comma, &token::CloseDelim(token::Paren)]);
5269 // Create a placeholder argument for proper arg count (#34264).
5270 let span = lo.to(p.prev_span);
5271 Ok(Some(dummy_arg(span)))
5278 let args: Vec<_> = args.into_iter().filter_map(|x| x).collect();
5280 if variadic && args.is_empty() {
5282 "variadic function must be declared with at least one named argument");
5285 Ok((args, variadic))
5288 /// Parse the argument list and result type of a function declaration
5289 fn parse_fn_decl(&mut self, allow_variadic: bool) -> PResult<'a, P<FnDecl>> {
5291 let (args, variadic) = self.parse_fn_args(true, allow_variadic)?;
5292 let ret_ty = self.parse_ret_ty(true)?;
5301 /// Returns the parsed optional self argument and whether a self shortcut was used.
5302 fn parse_self_arg(&mut self) -> PResult<'a, Option<Arg>> {
5303 let expect_ident = |this: &mut Self| match this.token {
5304 // Preserve hygienic context.
5305 token::Ident(ident, _) =>
5306 { let span = this.span; this.bump(); Ident::new(ident.name, span) }
5309 let isolated_self = |this: &mut Self, n| {
5310 this.look_ahead(n, |t| t.is_keyword(keywords::SelfValue)) &&
5311 this.look_ahead(n + 1, |t| t != &token::ModSep)
5314 // Parse optional self parameter of a method.
5315 // Only a limited set of initial token sequences is considered self parameters, anything
5316 // else is parsed as a normal function parameter list, so some lookahead is required.
5317 let eself_lo = self.span;
5318 let (eself, eself_ident, eself_hi) = match self.token {
5319 token::BinOp(token::And) => {
5325 (if isolated_self(self, 1) {
5327 SelfKind::Region(None, Mutability::Immutable)
5328 } else if self.look_ahead(1, |t| t.is_keyword(keywords::Mut)) &&
5329 isolated_self(self, 2) {
5332 SelfKind::Region(None, Mutability::Mutable)
5333 } else if self.look_ahead(1, |t| t.is_lifetime()) &&
5334 isolated_self(self, 2) {
5336 let lt = self.expect_lifetime();
5337 SelfKind::Region(Some(lt), Mutability::Immutable)
5338 } else if self.look_ahead(1, |t| t.is_lifetime()) &&
5339 self.look_ahead(2, |t| t.is_keyword(keywords::Mut)) &&
5340 isolated_self(self, 3) {
5342 let lt = self.expect_lifetime();
5344 SelfKind::Region(Some(lt), Mutability::Mutable)
5347 }, expect_ident(self), self.prev_span)
5349 token::BinOp(token::Star) => {
5354 // Emit special error for `self` cases.
5355 (if isolated_self(self, 1) {
5357 self.span_err(self.span, "cannot pass `self` by raw pointer");
5358 SelfKind::Value(Mutability::Immutable)
5359 } else if self.look_ahead(1, |t| t.is_mutability()) &&
5360 isolated_self(self, 2) {
5363 self.span_err(self.span, "cannot pass `self` by raw pointer");
5364 SelfKind::Value(Mutability::Immutable)
5367 }, expect_ident(self), self.prev_span)
5369 token::Ident(..) => {
5370 if isolated_self(self, 0) {
5373 let eself_ident = expect_ident(self);
5374 let eself_hi = self.prev_span;
5375 (if self.eat(&token::Colon) {
5376 let ty = self.parse_ty()?;
5377 SelfKind::Explicit(ty, Mutability::Immutable)
5379 SelfKind::Value(Mutability::Immutable)
5380 }, eself_ident, eself_hi)
5381 } else if self.token.is_keyword(keywords::Mut) &&
5382 isolated_self(self, 1) {
5386 let eself_ident = expect_ident(self);
5387 let eself_hi = self.prev_span;
5388 (if self.eat(&token::Colon) {
5389 let ty = self.parse_ty()?;
5390 SelfKind::Explicit(ty, Mutability::Mutable)
5392 SelfKind::Value(Mutability::Mutable)
5393 }, eself_ident, eself_hi)
5398 _ => return Ok(None),
5401 let eself = codemap::respan(eself_lo.to(eself_hi), eself);
5402 Ok(Some(Arg::from_self(eself, eself_ident)))
5405 /// Parse the parameter list and result type of a function that may have a `self` parameter.
5406 fn parse_fn_decl_with_self<F>(&mut self, parse_arg_fn: F) -> PResult<'a, P<FnDecl>>
5407 where F: FnMut(&mut Parser<'a>) -> PResult<'a, Arg>,
5409 self.expect(&token::OpenDelim(token::Paren))?;
5411 // Parse optional self argument
5412 let self_arg = self.parse_self_arg()?;
5414 // Parse the rest of the function parameter list.
5415 let sep = SeqSep::trailing_allowed(token::Comma);
5416 let fn_inputs = if let Some(self_arg) = self_arg {
5417 if self.check(&token::CloseDelim(token::Paren)) {
5419 } else if self.eat(&token::Comma) {
5420 let mut fn_inputs = vec![self_arg];
5421 fn_inputs.append(&mut self.parse_seq_to_before_end(
5422 &token::CloseDelim(token::Paren), sep, parse_arg_fn)?
5426 return self.unexpected();
5429 self.parse_seq_to_before_end(&token::CloseDelim(token::Paren), sep, parse_arg_fn)?
5432 // Parse closing paren and return type.
5433 self.expect(&token::CloseDelim(token::Paren))?;
5436 output: self.parse_ret_ty(true)?,
5441 // parse the |arg, arg| header on a lambda
5442 fn parse_fn_block_decl(&mut self) -> PResult<'a, P<FnDecl>> {
5443 let inputs_captures = {
5444 if self.eat(&token::OrOr) {
5447 self.expect(&token::BinOp(token::Or))?;
5448 let args = self.parse_seq_to_before_tokens(
5449 &[&token::BinOp(token::Or), &token::OrOr],
5450 SeqSep::trailing_allowed(token::Comma),
5451 TokenExpectType::NoExpect,
5452 |p| p.parse_fn_block_arg()
5458 let output = self.parse_ret_ty(true)?;
5461 inputs: inputs_captures,
5467 /// Parse the name and optional generic types of a function header.
5468 fn parse_fn_header(&mut self) -> PResult<'a, (Ident, ast::Generics)> {
5469 let id = self.parse_ident()?;
5470 let generics = self.parse_generics()?;
5474 fn mk_item(&mut self, span: Span, ident: Ident, node: ItemKind, vis: Visibility,
5475 attrs: Vec<Attribute>) -> P<Item> {
5479 id: ast::DUMMY_NODE_ID,
5487 /// Parse an item-position function declaration.
5488 fn parse_item_fn(&mut self,
5491 constness: Spanned<Constness>,
5493 -> PResult<'a, ItemInfo> {
5494 let (ident, mut generics) = self.parse_fn_header()?;
5495 let decl = self.parse_fn_decl(false)?;
5496 generics.where_clause = self.parse_where_clause()?;
5497 let (inner_attrs, body) = self.parse_inner_attrs_and_block()?;
5498 let header = FnHeader { unsafety, asyncness, constness, abi };
5499 Ok((ident, ItemKind::Fn(decl, header, generics, body), Some(inner_attrs)))
5502 /// true if we are looking at `const ID`, false for things like `const fn` etc
5503 fn is_const_item(&mut self) -> bool {
5504 self.token.is_keyword(keywords::Const) &&
5505 !self.look_ahead(1, |t| t.is_keyword(keywords::Fn)) &&
5506 !self.look_ahead(1, |t| t.is_keyword(keywords::Unsafe))
5509 /// parses all the "front matter" for a `fn` declaration, up to
5510 /// and including the `fn` keyword:
5514 /// - `const unsafe fn`
5517 fn parse_fn_front_matter(&mut self)
5525 let is_const_fn = self.eat_keyword(keywords::Const);
5526 let const_span = self.prev_span;
5527 let unsafety = self.parse_unsafety();
5528 let asyncness = self.parse_asyncness();
5529 let (constness, unsafety, abi) = if is_const_fn {
5530 (respan(const_span, Constness::Const), unsafety, Abi::Rust)
5532 let abi = if self.eat_keyword(keywords::Extern) {
5533 self.parse_opt_abi()?.unwrap_or(Abi::C)
5537 (respan(self.prev_span, Constness::NotConst), unsafety, abi)
5539 self.expect_keyword(keywords::Fn)?;
5540 Ok((constness, unsafety, asyncness, abi))
5543 /// Parse an impl item.
5544 pub fn parse_impl_item(&mut self, at_end: &mut bool) -> PResult<'a, ImplItem> {
5545 maybe_whole!(self, NtImplItem, |x| x);
5546 let attrs = self.parse_outer_attributes()?;
5547 let (mut item, tokens) = self.collect_tokens(|this| {
5548 this.parse_impl_item_(at_end, attrs)
5551 // See `parse_item` for why this clause is here.
5552 if !item.attrs.iter().any(|attr| attr.style == AttrStyle::Inner) {
5553 item.tokens = Some(tokens);
5558 fn parse_impl_item_(&mut self,
5560 mut attrs: Vec<Attribute>) -> PResult<'a, ImplItem> {
5562 let vis = self.parse_visibility(false)?;
5563 let defaultness = self.parse_defaultness();
5564 let (name, node, generics) = if let Some(type_) = self.eat_type() {
5565 let (name, alias, generics) = type_?;
5566 let kind = match alias {
5567 AliasKind::Weak(typ) => ast::ImplItemKind::Type(typ),
5568 AliasKind::Existential(bounds) => ast::ImplItemKind::Existential(bounds),
5570 (name, kind, generics)
5571 } else if self.is_const_item() {
5572 // This parses the grammar:
5573 // ImplItemConst = "const" Ident ":" Ty "=" Expr ";"
5574 self.expect_keyword(keywords::Const)?;
5575 let name = self.parse_ident()?;
5576 self.expect(&token::Colon)?;
5577 let typ = self.parse_ty()?;
5578 self.expect(&token::Eq)?;
5579 let expr = self.parse_expr()?;
5580 self.expect(&token::Semi)?;
5581 (name, ast::ImplItemKind::Const(typ, expr), ast::Generics::default())
5583 let (name, inner_attrs, generics, node) = self.parse_impl_method(&vis, at_end)?;
5584 attrs.extend(inner_attrs);
5585 (name, node, generics)
5589 id: ast::DUMMY_NODE_ID,
5590 span: lo.to(self.prev_span),
5601 fn complain_if_pub_macro(&mut self, vis: &VisibilityKind, sp: Span) {
5602 if let Err(mut err) = self.complain_if_pub_macro_diag(vis, sp) {
5607 fn complain_if_pub_macro_diag(&mut self, vis: &VisibilityKind, sp: Span) -> PResult<'a, ()> {
5609 VisibilityKind::Inherited => Ok(()),
5611 let is_macro_rules: bool = match self.token {
5612 token::Ident(sid, _) => sid.name == Symbol::intern("macro_rules"),
5616 let mut err = self.diagnostic()
5617 .struct_span_err(sp, "can't qualify macro_rules invocation with `pub`");
5618 err.span_suggestion_with_applicability(
5620 "try exporting the macro",
5621 "#[macro_export]".to_owned(),
5622 Applicability::MaybeIncorrect // speculative
5626 let mut err = self.diagnostic()
5627 .struct_span_err(sp, "can't qualify macro invocation with `pub`");
5628 err.help("try adjusting the macro to put `pub` inside the invocation");
5635 fn missing_assoc_item_kind_err(&mut self, item_type: &str, prev_span: Span)
5636 -> DiagnosticBuilder<'a>
5638 let expected_kinds = if item_type == "extern" {
5639 "missing `fn`, `type`, or `static`"
5641 "missing `fn`, `type`, or `const`"
5644 // Given this code `path(`, it seems like this is not
5645 // setting the visibility of a macro invocation, but rather
5646 // a mistyped method declaration.
5647 // Create a diagnostic pointing out that `fn` is missing.
5649 // x | pub path(&self) {
5650 // | ^ missing `fn`, `type`, or `const`
5652 // ^^ `sp` below will point to this
5653 let sp = prev_span.between(self.prev_span);
5654 let mut err = self.diagnostic().struct_span_err(
5656 &format!("{} for {}-item declaration",
5657 expected_kinds, item_type));
5658 err.span_label(sp, expected_kinds);
5662 /// Parse a method or a macro invocation in a trait impl.
5663 fn parse_impl_method(&mut self, vis: &Visibility, at_end: &mut bool)
5664 -> PResult<'a, (Ident, Vec<Attribute>, ast::Generics,
5665 ast::ImplItemKind)> {
5666 // code copied from parse_macro_use_or_failure... abstraction!
5667 if let Some(mac) = self.parse_assoc_macro_invoc("impl", Some(vis), at_end)? {
5669 Ok((keywords::Invalid.ident(), vec![], ast::Generics::default(),
5670 ast::ImplItemKind::Macro(mac)))
5672 let (constness, unsafety, asyncness, abi) = self.parse_fn_front_matter()?;
5673 let ident = self.parse_ident()?;
5674 let mut generics = self.parse_generics()?;
5675 let decl = self.parse_fn_decl_with_self(|p| p.parse_arg())?;
5676 generics.where_clause = self.parse_where_clause()?;
5678 let (inner_attrs, body) = self.parse_inner_attrs_and_block()?;
5679 let header = ast::FnHeader { abi, unsafety, constness, asyncness };
5680 Ok((ident, inner_attrs, generics, ast::ImplItemKind::Method(
5681 ast::MethodSig { header, decl },
5687 /// Parse `trait Foo { ... }` or `trait Foo = Bar;`
5688 fn parse_item_trait(&mut self, is_auto: IsAuto, unsafety: Unsafety) -> PResult<'a, ItemInfo> {
5689 let ident = self.parse_ident()?;
5690 let mut tps = self.parse_generics()?;
5692 // Parse optional colon and supertrait bounds.
5693 let bounds = if self.eat(&token::Colon) {
5694 self.parse_generic_bounds()?
5699 if self.eat(&token::Eq) {
5700 // it's a trait alias
5701 let bounds = self.parse_generic_bounds()?;
5702 tps.where_clause = self.parse_where_clause()?;
5703 self.expect(&token::Semi)?;
5704 if unsafety != Unsafety::Normal {
5705 self.span_err(self.prev_span, "trait aliases cannot be unsafe");
5707 Ok((ident, ItemKind::TraitAlias(tps, bounds), None))
5709 // it's a normal trait
5710 tps.where_clause = self.parse_where_clause()?;
5711 self.expect(&token::OpenDelim(token::Brace))?;
5712 let mut trait_items = vec![];
5713 while !self.eat(&token::CloseDelim(token::Brace)) {
5714 let mut at_end = false;
5715 match self.parse_trait_item(&mut at_end) {
5716 Ok(item) => trait_items.push(item),
5720 self.recover_stmt_(SemiColonMode::Break, BlockMode::Break);
5725 Ok((ident, ItemKind::Trait(is_auto, unsafety, tps, bounds, trait_items), None))
5729 fn choose_generics_over_qpath(&self) -> bool {
5730 // There's an ambiguity between generic parameters and qualified paths in impls.
5731 // If we see `<` it may start both, so we have to inspect some following tokens.
5732 // The following combinations can only start generics,
5733 // but not qualified paths (with one exception):
5734 // `<` `>` - empty generic parameters
5735 // `<` `#` - generic parameters with attributes
5736 // `<` (LIFETIME|IDENT) `>` - single generic parameter
5737 // `<` (LIFETIME|IDENT) `,` - first generic parameter in a list
5738 // `<` (LIFETIME|IDENT) `:` - generic parameter with bounds
5739 // `<` (LIFETIME|IDENT) `=` - generic parameter with a default
5740 // The only truly ambiguous case is
5741 // `<` IDENT `>` `::` IDENT ...
5742 // we disambiguate it in favor of generics (`impl<T> ::absolute::Path<T> { ... }`)
5743 // because this is what almost always expected in practice, qualified paths in impls
5744 // (`impl <Type>::AssocTy { ... }`) aren't even allowed by type checker at the moment.
5745 self.token == token::Lt &&
5746 (self.look_ahead(1, |t| t == &token::Pound || t == &token::Gt) ||
5747 self.look_ahead(1, |t| t.is_lifetime() || t.is_ident()) &&
5748 self.look_ahead(2, |t| t == &token::Gt || t == &token::Comma ||
5749 t == &token::Colon || t == &token::Eq))
5752 fn parse_impl_body(&mut self) -> PResult<'a, (Vec<ImplItem>, Vec<Attribute>)> {
5753 self.expect(&token::OpenDelim(token::Brace))?;
5754 let attrs = self.parse_inner_attributes()?;
5756 let mut impl_items = Vec::new();
5757 while !self.eat(&token::CloseDelim(token::Brace)) {
5758 let mut at_end = false;
5759 match self.parse_impl_item(&mut at_end) {
5760 Ok(impl_item) => impl_items.push(impl_item),
5764 self.recover_stmt_(SemiColonMode::Break, BlockMode::Break);
5769 Ok((impl_items, attrs))
5772 /// Parses an implementation item, `impl` keyword is already parsed.
5773 /// impl<'a, T> TYPE { /* impl items */ }
5774 /// impl<'a, T> TRAIT for TYPE { /* impl items */ }
5775 /// impl<'a, T> !TRAIT for TYPE { /* impl items */ }
5776 /// We actually parse slightly more relaxed grammar for better error reporting and recovery.
5777 /// `impl` GENERICS `!`? TYPE `for`? (TYPE | `..`) (`where` PREDICATES)? `{` BODY `}`
5778 /// `impl` GENERICS `!`? TYPE (`where` PREDICATES)? `{` BODY `}`
5779 fn parse_item_impl(&mut self, unsafety: Unsafety, defaultness: Defaultness)
5780 -> PResult<'a, ItemInfo> {
5781 // First, parse generic parameters if necessary.
5782 let mut generics = if self.choose_generics_over_qpath() {
5783 self.parse_generics()?
5785 ast::Generics::default()
5788 // Disambiguate `impl !Trait for Type { ... }` and `impl ! { ... }` for the never type.
5789 let polarity = if self.check(&token::Not) && self.look_ahead(1, |t| t.can_begin_type()) {
5791 ast::ImplPolarity::Negative
5793 ast::ImplPolarity::Positive
5796 // Parse both types and traits as a type, then reinterpret if necessary.
5797 let ty_first = self.parse_ty()?;
5799 // If `for` is missing we try to recover.
5800 let has_for = self.eat_keyword(keywords::For);
5801 let missing_for_span = self.prev_span.between(self.span);
5803 let ty_second = if self.token == token::DotDot {
5804 // We need to report this error after `cfg` expansion for compatibility reasons
5805 self.bump(); // `..`, do not add it to expected tokens
5806 Some(P(Ty { node: TyKind::Err, span: self.prev_span, id: ast::DUMMY_NODE_ID }))
5807 } else if has_for || self.token.can_begin_type() {
5808 Some(self.parse_ty()?)
5813 generics.where_clause = self.parse_where_clause()?;
5815 let (impl_items, attrs) = self.parse_impl_body()?;
5817 let item_kind = match ty_second {
5818 Some(ty_second) => {
5819 // impl Trait for Type
5821 self.span_err(missing_for_span, "missing `for` in a trait impl");
5824 let ty_first = ty_first.into_inner();
5825 let path = match ty_first.node {
5826 // This notably includes paths passed through `ty` macro fragments (#46438).
5827 TyKind::Path(None, path) => path,
5829 self.span_err(ty_first.span, "expected a trait, found type");
5830 ast::Path::from_ident(Ident::new(keywords::Invalid.name(), ty_first.span))
5833 let trait_ref = TraitRef { path, ref_id: ty_first.id };
5835 ItemKind::Impl(unsafety, polarity, defaultness,
5836 generics, Some(trait_ref), ty_second, impl_items)
5840 ItemKind::Impl(unsafety, polarity, defaultness,
5841 generics, None, ty_first, impl_items)
5845 Ok((keywords::Invalid.ident(), item_kind, Some(attrs)))
5848 fn parse_late_bound_lifetime_defs(&mut self) -> PResult<'a, Vec<GenericParam>> {
5849 if self.eat_keyword(keywords::For) {
5851 let params = self.parse_generic_params()?;
5853 // We rely on AST validation to rule out invalid cases: There must not be type
5854 // parameters, and the lifetime parameters must not have bounds.
5861 /// Parse struct Foo { ... }
5862 fn parse_item_struct(&mut self) -> PResult<'a, ItemInfo> {
5863 let class_name = self.parse_ident()?;
5865 let mut generics = self.parse_generics()?;
5867 // There is a special case worth noting here, as reported in issue #17904.
5868 // If we are parsing a tuple struct it is the case that the where clause
5869 // should follow the field list. Like so:
5871 // struct Foo<T>(T) where T: Copy;
5873 // If we are parsing a normal record-style struct it is the case
5874 // that the where clause comes before the body, and after the generics.
5875 // So if we look ahead and see a brace or a where-clause we begin
5876 // parsing a record style struct.
5878 // Otherwise if we look ahead and see a paren we parse a tuple-style
5881 let vdata = if self.token.is_keyword(keywords::Where) {
5882 generics.where_clause = self.parse_where_clause()?;
5883 if self.eat(&token::Semi) {
5884 // If we see a: `struct Foo<T> where T: Copy;` style decl.
5885 VariantData::Unit(ast::DUMMY_NODE_ID)
5887 // If we see: `struct Foo<T> where T: Copy { ... }`
5888 VariantData::Struct(self.parse_record_struct_body()?, ast::DUMMY_NODE_ID)
5890 // No `where` so: `struct Foo<T>;`
5891 } else if self.eat(&token::Semi) {
5892 VariantData::Unit(ast::DUMMY_NODE_ID)
5893 // Record-style struct definition
5894 } else if self.token == token::OpenDelim(token::Brace) {
5895 VariantData::Struct(self.parse_record_struct_body()?, ast::DUMMY_NODE_ID)
5896 // Tuple-style struct definition with optional where-clause.
5897 } else if self.token == token::OpenDelim(token::Paren) {
5898 let body = VariantData::Tuple(self.parse_tuple_struct_body()?, ast::DUMMY_NODE_ID);
5899 generics.where_clause = self.parse_where_clause()?;
5900 self.expect(&token::Semi)?;
5903 let token_str = self.this_token_to_string();
5904 let mut err = self.fatal(&format!(
5905 "expected `where`, `{{`, `(`, or `;` after struct name, found `{}`",
5908 err.span_label(self.span, "expected `where`, `{`, `(`, or `;` after struct name");
5912 Ok((class_name, ItemKind::Struct(vdata, generics), None))
5915 /// Parse union Foo { ... }
5916 fn parse_item_union(&mut self) -> PResult<'a, ItemInfo> {
5917 let class_name = self.parse_ident()?;
5919 let mut generics = self.parse_generics()?;
5921 let vdata = if self.token.is_keyword(keywords::Where) {
5922 generics.where_clause = self.parse_where_clause()?;
5923 VariantData::Struct(self.parse_record_struct_body()?, ast::DUMMY_NODE_ID)
5924 } else if self.token == token::OpenDelim(token::Brace) {
5925 VariantData::Struct(self.parse_record_struct_body()?, ast::DUMMY_NODE_ID)
5927 let token_str = self.this_token_to_string();
5928 let mut err = self.fatal(&format!(
5929 "expected `where` or `{{` after union name, found `{}`", token_str));
5930 err.span_label(self.span, "expected `where` or `{` after union name");
5934 Ok((class_name, ItemKind::Union(vdata, generics), None))
5937 fn consume_block(&mut self, delim: token::DelimToken) {
5938 let mut brace_depth = 0;
5939 if !self.eat(&token::OpenDelim(delim)) {
5943 if self.eat(&token::OpenDelim(delim)) {
5945 } else if self.eat(&token::CloseDelim(delim)) {
5946 if brace_depth == 0 {
5952 } else if self.eat(&token::Eof) || self.eat(&token::CloseDelim(token::NoDelim)) {
5960 fn parse_record_struct_body(&mut self) -> PResult<'a, Vec<StructField>> {
5961 let mut fields = Vec::new();
5962 if self.eat(&token::OpenDelim(token::Brace)) {
5963 while self.token != token::CloseDelim(token::Brace) {
5964 let field = self.parse_struct_decl_field().map_err(|e| {
5965 self.recover_stmt();
5969 Ok(field) => fields.push(field),
5975 self.eat(&token::CloseDelim(token::Brace));
5977 let token_str = self.this_token_to_string();
5978 let mut err = self.fatal(&format!(
5979 "expected `where`, or `{{` after struct name, found `{}`", token_str));
5980 err.span_label(self.span, "expected `where`, or `{` after struct name");
5987 fn parse_tuple_struct_body(&mut self) -> PResult<'a, Vec<StructField>> {
5988 // This is the case where we find `struct Foo<T>(T) where T: Copy;`
5989 // Unit like structs are handled in parse_item_struct function
5990 let fields = self.parse_unspanned_seq(
5991 &token::OpenDelim(token::Paren),
5992 &token::CloseDelim(token::Paren),
5993 SeqSep::trailing_allowed(token::Comma),
5995 let attrs = p.parse_outer_attributes()?;
5997 let vis = p.parse_visibility(true)?;
5998 let ty = p.parse_ty()?;
6000 span: lo.to(ty.span),
6003 id: ast::DUMMY_NODE_ID,
6012 /// Parse a structure field declaration
6013 fn parse_single_struct_field(&mut self,
6016 attrs: Vec<Attribute> )
6017 -> PResult<'a, StructField> {
6018 let mut seen_comma: bool = false;
6019 let a_var = self.parse_name_and_ty(lo, vis, attrs)?;
6020 if self.token == token::Comma {
6027 token::CloseDelim(token::Brace) => {}
6028 token::DocComment(_) => {
6029 let previous_span = self.prev_span;
6030 let mut err = self.span_fatal_err(self.span, Error::UselessDocComment);
6031 self.bump(); // consume the doc comment
6032 let comma_after_doc_seen = self.eat(&token::Comma);
6033 // `seen_comma` is always false, because we are inside doc block
6034 // condition is here to make code more readable
6035 if seen_comma == false && comma_after_doc_seen == true {
6038 if comma_after_doc_seen || self.token == token::CloseDelim(token::Brace) {
6041 if seen_comma == false {
6042 let sp = self.sess.codemap().next_point(previous_span);
6043 err.span_suggestion_with_applicability(
6045 "missing comma here",
6047 Applicability::MachineApplicable
6054 let sp = self.sess.codemap().next_point(self.prev_span);
6055 let mut err = self.struct_span_err(sp, &format!("expected `,`, or `}}`, found `{}`",
6056 self.this_token_to_string()));
6057 if self.token.is_ident() {
6058 // This is likely another field; emit the diagnostic and keep going
6059 err.span_suggestion(sp, "try adding a comma", ",".into());
6069 /// Parse an element of a struct definition
6070 fn parse_struct_decl_field(&mut self) -> PResult<'a, StructField> {
6071 let attrs = self.parse_outer_attributes()?;
6073 let vis = self.parse_visibility(false)?;
6074 self.parse_single_struct_field(lo, vis, attrs)
6077 /// Parse `pub`, `pub(crate)` and `pub(in path)` plus shortcuts `pub(self)` for `pub(in self)`
6078 /// and `pub(super)` for `pub(in super)`. If the following element can't be a tuple (i.e. it's
6079 /// a function definition, it's not a tuple struct field) and the contents within the parens
6080 /// isn't valid, emit a proper diagnostic.
6081 pub fn parse_visibility(&mut self, can_take_tuple: bool) -> PResult<'a, Visibility> {
6082 maybe_whole!(self, NtVis, |x| x);
6084 self.expected_tokens.push(TokenType::Keyword(keywords::Crate));
6085 if self.is_crate_vis() {
6086 self.bump(); // `crate`
6087 return Ok(respan(self.prev_span, VisibilityKind::Crate(CrateSugar::JustCrate)));
6090 if !self.eat_keyword(keywords::Pub) {
6091 // We need a span for our `Spanned<VisibilityKind>`, but there's inherently no
6092 // keyword to grab a span from for inherited visibility; an empty span at the
6093 // beginning of the current token would seem to be the "Schelling span".
6094 return Ok(respan(self.span.shrink_to_lo(), VisibilityKind::Inherited))
6096 let lo = self.prev_span;
6098 if self.check(&token::OpenDelim(token::Paren)) {
6099 // We don't `self.bump()` the `(` yet because this might be a struct definition where
6100 // `()` or a tuple might be allowed. For example, `struct Struct(pub (), pub (usize));`.
6101 // Because of this, we only `bump` the `(` if we're assured it is appropriate to do so
6102 // by the following tokens.
6103 if self.look_ahead(1, |t| t.is_keyword(keywords::Crate)) {
6106 self.bump(); // `crate`
6107 self.expect(&token::CloseDelim(token::Paren))?; // `)`
6109 lo.to(self.prev_span),
6110 VisibilityKind::Crate(CrateSugar::PubCrate),
6113 } else if self.look_ahead(1, |t| t.is_keyword(keywords::In)) {
6116 self.bump(); // `in`
6117 let path = self.parse_path(PathStyle::Mod)?; // `path`
6118 self.expect(&token::CloseDelim(token::Paren))?; // `)`
6119 let vis = respan(lo.to(self.prev_span), VisibilityKind::Restricted {
6121 id: ast::DUMMY_NODE_ID,
6124 } else if self.look_ahead(2, |t| t == &token::CloseDelim(token::Paren)) &&
6125 self.look_ahead(1, |t| t.is_keyword(keywords::Super) ||
6126 t.is_keyword(keywords::SelfValue))
6128 // `pub(self)` or `pub(super)`
6130 let path = self.parse_path(PathStyle::Mod)?; // `super`/`self`
6131 self.expect(&token::CloseDelim(token::Paren))?; // `)`
6132 let vis = respan(lo.to(self.prev_span), VisibilityKind::Restricted {
6134 id: ast::DUMMY_NODE_ID,
6137 } else if !can_take_tuple { // Provide this diagnostic if this is not a tuple struct
6138 // `pub(something) fn ...` or `struct X { pub(something) y: Z }`
6140 let msg = "incorrect visibility restriction";
6141 let suggestion = r##"some possible visibility restrictions are:
6142 `pub(crate)`: visible only on the current crate
6143 `pub(super)`: visible only in the current module's parent
6144 `pub(in path::to::module)`: visible only on the specified path"##;
6145 let path = self.parse_path(PathStyle::Mod)?;
6146 let sp = self.prev_span;
6147 let help_msg = format!("make this visible only to module `{}` with `in`", path);
6148 self.expect(&token::CloseDelim(token::Paren))?; // `)`
6149 let mut err = struct_span_err!(self.sess.span_diagnostic, sp, E0704, "{}", msg);
6150 err.help(suggestion);
6151 err.span_suggestion_with_applicability(
6152 sp, &help_msg, format!("in {}", path), Applicability::MachineApplicable
6154 err.emit(); // emit diagnostic, but continue with public visibility
6158 Ok(respan(lo, VisibilityKind::Public))
6161 /// Parse defaultness: `default` or nothing.
6162 fn parse_defaultness(&mut self) -> Defaultness {
6163 // `pub` is included for better error messages
6164 if self.check_keyword(keywords::Default) &&
6165 self.look_ahead(1, |t| t.is_keyword(keywords::Impl) ||
6166 t.is_keyword(keywords::Const) ||
6167 t.is_keyword(keywords::Fn) ||
6168 t.is_keyword(keywords::Unsafe) ||
6169 t.is_keyword(keywords::Extern) ||
6170 t.is_keyword(keywords::Type) ||
6171 t.is_keyword(keywords::Pub)) {
6172 self.bump(); // `default`
6173 Defaultness::Default
6179 /// Given a termination token, parse all of the items in a module
6180 fn parse_mod_items(&mut self, term: &token::Token, inner_lo: Span) -> PResult<'a, Mod> {
6181 let mut items = vec![];
6182 while let Some(item) = self.parse_item()? {
6186 if !self.eat(term) {
6187 let token_str = self.this_token_to_string();
6188 let mut err = self.fatal(&format!("expected item, found `{}`", token_str));
6189 if token_str == ";" {
6190 let msg = "consider removing this semicolon";
6191 err.span_suggestion_short_with_applicability(
6192 self.span, msg, "".to_string(), Applicability::MachineApplicable
6194 if !items.is_empty() { // Issue #51603
6195 let previous_item = &items[items.len()-1];
6196 let previous_item_kind_name = match previous_item.node {
6197 // say "braced struct" because tuple-structs and
6198 // braceless-empty-struct declarations do take a semicolon
6199 ItemKind::Struct(..) => Some("braced struct"),
6200 ItemKind::Enum(..) => Some("enum"),
6201 ItemKind::Trait(..) => Some("trait"),
6202 ItemKind::Union(..) => Some("union"),
6205 if let Some(name) = previous_item_kind_name {
6206 err.help(&format!("{} declarations are not followed by a semicolon",
6211 err.span_label(self.span, "expected item");
6216 let hi = if self.span.is_dummy() {
6223 inner: inner_lo.to(hi),
6228 fn parse_item_const(&mut self, m: Option<Mutability>) -> PResult<'a, ItemInfo> {
6229 let id = self.parse_ident()?;
6230 self.expect(&token::Colon)?;
6231 let ty = self.parse_ty()?;
6232 self.expect(&token::Eq)?;
6233 let e = self.parse_expr()?;
6234 self.expect(&token::Semi)?;
6235 let item = match m {
6236 Some(m) => ItemKind::Static(ty, m, e),
6237 None => ItemKind::Const(ty, e),
6239 Ok((id, item, None))
6242 /// Parse a `mod <foo> { ... }` or `mod <foo>;` item
6243 fn parse_item_mod(&mut self, outer_attrs: &[Attribute]) -> PResult<'a, ItemInfo> {
6244 let (in_cfg, outer_attrs) = {
6245 let mut strip_unconfigured = ::config::StripUnconfigured {
6247 should_test: false, // irrelevant
6248 features: None, // don't perform gated feature checking
6250 let outer_attrs = strip_unconfigured.process_cfg_attrs(outer_attrs.to_owned());
6251 (!self.cfg_mods || strip_unconfigured.in_cfg(&outer_attrs), outer_attrs)
6254 let id_span = self.span;
6255 let id = self.parse_ident()?;
6256 if self.check(&token::Semi) {
6258 if in_cfg && self.recurse_into_file_modules {
6259 // This mod is in an external file. Let's go get it!
6260 let ModulePathSuccess { path, directory_ownership, warn } =
6261 self.submod_path(id, &outer_attrs, id_span)?;
6262 let (module, mut attrs) =
6263 self.eval_src_mod(path, directory_ownership, id.to_string(), id_span)?;
6265 let attr = Attribute {
6266 id: attr::mk_attr_id(),
6267 style: ast::AttrStyle::Outer,
6268 path: ast::Path::from_ident(Ident::from_str("warn_directory_ownership")),
6269 tokens: TokenStream::empty(),
6270 is_sugared_doc: false,
6271 span: syntax_pos::DUMMY_SP,
6273 attr::mark_known(&attr);
6276 Ok((id, module, Some(attrs)))
6278 let placeholder = ast::Mod { inner: syntax_pos::DUMMY_SP, items: Vec::new() };
6279 Ok((id, ItemKind::Mod(placeholder), None))
6282 let old_directory = self.directory.clone();
6283 self.push_directory(id, &outer_attrs);
6285 self.expect(&token::OpenDelim(token::Brace))?;
6286 let mod_inner_lo = self.span;
6287 let attrs = self.parse_inner_attributes()?;
6288 let module = self.parse_mod_items(&token::CloseDelim(token::Brace), mod_inner_lo)?;
6290 self.directory = old_directory;
6291 Ok((id, ItemKind::Mod(module), Some(attrs)))
6295 fn push_directory(&mut self, id: Ident, attrs: &[Attribute]) {
6296 if let Some(path) = attr::first_attr_value_str_by_name(attrs, "path") {
6297 self.directory.path.to_mut().push(&path.as_str());
6298 self.directory.ownership = DirectoryOwnership::Owned { relative: None };
6300 self.directory.path.to_mut().push(&id.as_str());
6304 pub fn submod_path_from_attr(attrs: &[Attribute], dir_path: &Path) -> Option<PathBuf> {
6305 if let Some(s) = attr::first_attr_value_str_by_name(attrs, "path") {
6308 // On windows, the base path might have the form
6309 // `\\?\foo\bar` in which case it does not tolerate
6310 // mixed `/` and `\` separators, so canonicalize
6313 let s = s.replace("/", "\\");
6314 Some(dir_path.join(s))
6320 /// Returns either a path to a module, or .
6321 pub fn default_submod_path(
6323 relative: Option<ast::Ident>,
6325 codemap: &CodeMap) -> ModulePath
6327 // If we're in a foo.rs file instead of a mod.rs file,
6328 // we need to look for submodules in
6329 // `./foo/<id>.rs` and `./foo/<id>/mod.rs` rather than
6330 // `./<id>.rs` and `./<id>/mod.rs`.
6331 let relative_prefix_string;
6332 let relative_prefix = if let Some(ident) = relative {
6333 relative_prefix_string = format!("{}{}", ident.as_str(), path::MAIN_SEPARATOR);
6334 &relative_prefix_string
6339 let mod_name = id.to_string();
6340 let default_path_str = format!("{}{}.rs", relative_prefix, mod_name);
6341 let secondary_path_str = format!("{}{}{}mod.rs",
6342 relative_prefix, mod_name, path::MAIN_SEPARATOR);
6343 let default_path = dir_path.join(&default_path_str);
6344 let secondary_path = dir_path.join(&secondary_path_str);
6345 let default_exists = codemap.file_exists(&default_path);
6346 let secondary_exists = codemap.file_exists(&secondary_path);
6348 let result = match (default_exists, secondary_exists) {
6349 (true, false) => Ok(ModulePathSuccess {
6351 directory_ownership: DirectoryOwnership::Owned {
6356 (false, true) => Ok(ModulePathSuccess {
6357 path: secondary_path,
6358 directory_ownership: DirectoryOwnership::Owned {
6363 (false, false) => Err(Error::FileNotFoundForModule {
6364 mod_name: mod_name.clone(),
6365 default_path: default_path_str,
6366 secondary_path: secondary_path_str,
6367 dir_path: dir_path.display().to_string(),
6369 (true, true) => Err(Error::DuplicatePaths {
6370 mod_name: mod_name.clone(),
6371 default_path: default_path_str,
6372 secondary_path: secondary_path_str,
6378 path_exists: default_exists || secondary_exists,
6383 fn submod_path(&mut self,
6385 outer_attrs: &[Attribute],
6387 -> PResult<'a, ModulePathSuccess> {
6388 if let Some(path) = Parser::submod_path_from_attr(outer_attrs, &self.directory.path) {
6389 return Ok(ModulePathSuccess {
6390 directory_ownership: match path.file_name().and_then(|s| s.to_str()) {
6391 // All `#[path]` files are treated as though they are a `mod.rs` file.
6392 // This means that `mod foo;` declarations inside `#[path]`-included
6393 // files are siblings,
6395 // Note that this will produce weirdness when a file named `foo.rs` is
6396 // `#[path]` included and contains a `mod foo;` declaration.
6397 // If you encounter this, it's your own darn fault :P
6398 Some(_) => DirectoryOwnership::Owned { relative: None },
6399 _ => DirectoryOwnership::UnownedViaMod(true),
6406 let relative = match self.directory.ownership {
6407 DirectoryOwnership::Owned { relative } => {
6408 // Push the usage onto the list of non-mod.rs mod uses.
6409 // This is used later for feature-gate error reporting.
6410 if let Some(cur_file_ident) = relative {
6412 .non_modrs_mods.borrow_mut()
6413 .push((cur_file_ident, id_sp));
6417 DirectoryOwnership::UnownedViaBlock |
6418 DirectoryOwnership::UnownedViaMod(_) => None,
6420 let paths = Parser::default_submod_path(
6421 id, relative, &self.directory.path, self.sess.codemap());
6423 match self.directory.ownership {
6424 DirectoryOwnership::Owned { .. } => {
6425 paths.result.map_err(|err| self.span_fatal_err(id_sp, err))
6427 DirectoryOwnership::UnownedViaBlock => {
6429 "Cannot declare a non-inline module inside a block \
6430 unless it has a path attribute";
6431 let mut err = self.diagnostic().struct_span_err(id_sp, msg);
6432 if paths.path_exists {
6433 let msg = format!("Maybe `use` the module `{}` instead of redeclaring it",
6435 err.span_note(id_sp, &msg);
6439 DirectoryOwnership::UnownedViaMod(warn) => {
6441 if let Ok(result) = paths.result {
6442 return Ok(ModulePathSuccess { warn: true, ..result });
6445 let mut err = self.diagnostic().struct_span_err(id_sp,
6446 "cannot declare a new module at this location");
6447 if !id_sp.is_dummy() {
6448 let src_path = self.sess.codemap().span_to_filename(id_sp);
6449 if let FileName::Real(src_path) = src_path {
6450 if let Some(stem) = src_path.file_stem() {
6451 let mut dest_path = src_path.clone();
6452 dest_path.set_file_name(stem);
6453 dest_path.push("mod.rs");
6454 err.span_note(id_sp,
6455 &format!("maybe move this module `{}` to its own \
6456 directory via `{}`", src_path.display(),
6457 dest_path.display()));
6461 if paths.path_exists {
6462 err.span_note(id_sp,
6463 &format!("... or maybe `use` the module `{}` instead \
6464 of possibly redeclaring it",
6472 /// Read a module from a source file.
6473 fn eval_src_mod(&mut self,
6475 directory_ownership: DirectoryOwnership,
6478 -> PResult<'a, (ast::ItemKind, Vec<Attribute> )> {
6479 let mut included_mod_stack = self.sess.included_mod_stack.borrow_mut();
6480 if let Some(i) = included_mod_stack.iter().position(|p| *p == path) {
6481 let mut err = String::from("circular modules: ");
6482 let len = included_mod_stack.len();
6483 for p in &included_mod_stack[i.. len] {
6484 err.push_str(&p.to_string_lossy());
6485 err.push_str(" -> ");
6487 err.push_str(&path.to_string_lossy());
6488 return Err(self.span_fatal(id_sp, &err[..]));
6490 included_mod_stack.push(path.clone());
6491 drop(included_mod_stack);
6494 new_sub_parser_from_file(self.sess, &path, directory_ownership, Some(name), id_sp);
6495 p0.cfg_mods = self.cfg_mods;
6496 let mod_inner_lo = p0.span;
6497 let mod_attrs = p0.parse_inner_attributes()?;
6498 let m0 = p0.parse_mod_items(&token::Eof, mod_inner_lo)?;
6499 self.sess.included_mod_stack.borrow_mut().pop();
6500 Ok((ast::ItemKind::Mod(m0), mod_attrs))
6503 /// Parse a function declaration from a foreign module
6504 fn parse_item_foreign_fn(&mut self, vis: ast::Visibility, lo: Span, attrs: Vec<Attribute>)
6505 -> PResult<'a, ForeignItem> {
6506 self.expect_keyword(keywords::Fn)?;
6508 let (ident, mut generics) = self.parse_fn_header()?;
6509 let decl = self.parse_fn_decl(true)?;
6510 generics.where_clause = self.parse_where_clause()?;
6512 self.expect(&token::Semi)?;
6513 Ok(ast::ForeignItem {
6516 node: ForeignItemKind::Fn(decl, generics),
6517 id: ast::DUMMY_NODE_ID,
6523 /// Parse a static item from a foreign module.
6524 /// Assumes that the `static` keyword is already parsed.
6525 fn parse_item_foreign_static(&mut self, vis: ast::Visibility, lo: Span, attrs: Vec<Attribute>)
6526 -> PResult<'a, ForeignItem> {
6527 let mutbl = self.eat_keyword(keywords::Mut);
6528 let ident = self.parse_ident()?;
6529 self.expect(&token::Colon)?;
6530 let ty = self.parse_ty()?;
6532 self.expect(&token::Semi)?;
6536 node: ForeignItemKind::Static(ty, mutbl),
6537 id: ast::DUMMY_NODE_ID,
6543 /// Parse a type from a foreign module
6544 fn parse_item_foreign_type(&mut self, vis: ast::Visibility, lo: Span, attrs: Vec<Attribute>)
6545 -> PResult<'a, ForeignItem> {
6546 self.expect_keyword(keywords::Type)?;
6548 let ident = self.parse_ident()?;
6550 self.expect(&token::Semi)?;
6551 Ok(ast::ForeignItem {
6554 node: ForeignItemKind::Ty,
6555 id: ast::DUMMY_NODE_ID,
6561 fn parse_crate_name_with_dashes(&mut self) -> PResult<'a, ast::Ident> {
6562 let error_msg = "crate name using dashes are not valid in `extern crate` statements";
6563 let suggestion_msg = "if the original crate name uses dashes you need to use underscores \
6565 let mut ident = self.parse_ident()?;
6566 let mut idents = vec![];
6567 let mut replacement = vec![];
6568 let mut fixed_crate_name = false;
6569 // Accept `extern crate name-like-this` for better diagnostics
6570 let dash = token::Token::BinOp(token::BinOpToken::Minus);
6571 if self.token == dash { // Do not include `-` as part of the expected tokens list
6572 while self.eat(&dash) {
6573 fixed_crate_name = true;
6574 replacement.push((self.prev_span, "_".to_string()));
6575 idents.push(self.parse_ident()?);
6578 if fixed_crate_name {
6579 let fixed_name_sp = ident.span.to(idents.last().unwrap().span);
6580 let mut fixed_name = format!("{}", ident.name);
6581 for part in idents {
6582 fixed_name.push_str(&format!("_{}", part.name));
6584 ident = Ident::from_str(&fixed_name).with_span_pos(fixed_name_sp);
6586 let mut err = self.struct_span_err(fixed_name_sp, error_msg);
6587 err.span_label(fixed_name_sp, "dash-separated idents are not valid");
6588 err.multipart_suggestion(suggestion_msg, replacement);
6594 /// Parse extern crate links
6598 /// extern crate foo;
6599 /// extern crate bar as foo;
6600 fn parse_item_extern_crate(&mut self,
6602 visibility: Visibility,
6603 attrs: Vec<Attribute>)
6604 -> PResult<'a, P<Item>> {
6605 // Accept `extern crate name-like-this` for better diagnostics
6606 let orig_name = self.parse_crate_name_with_dashes()?;
6607 let (item_name, orig_name) = if let Some(rename) = self.parse_rename()? {
6608 (rename, Some(orig_name.name))
6612 self.expect(&token::Semi)?;
6614 let span = lo.to(self.prev_span);
6615 Ok(self.mk_item(span, item_name, ItemKind::ExternCrate(orig_name), visibility, attrs))
6618 /// Parse `extern` for foreign ABIs
6621 /// `extern` is expected to have been
6622 /// consumed before calling this method
6628 fn parse_item_foreign_mod(&mut self,
6630 opt_abi: Option<Abi>,
6631 visibility: Visibility,
6632 mut attrs: Vec<Attribute>)
6633 -> PResult<'a, P<Item>> {
6634 self.expect(&token::OpenDelim(token::Brace))?;
6636 let abi = opt_abi.unwrap_or(Abi::C);
6638 attrs.extend(self.parse_inner_attributes()?);
6640 let mut foreign_items = vec![];
6641 while let Some(item) = self.parse_foreign_item()? {
6642 foreign_items.push(item);
6644 self.expect(&token::CloseDelim(token::Brace))?;
6646 let prev_span = self.prev_span;
6647 let m = ast::ForeignMod {
6649 items: foreign_items
6651 let invalid = keywords::Invalid.ident();
6652 Ok(self.mk_item(lo.to(prev_span), invalid, ItemKind::ForeignMod(m), visibility, attrs))
6655 /// Parse type Foo = Bar;
6657 /// existential type Foo: Bar;
6659 /// return None without modifying the parser state
6660 fn eat_type(&mut self) -> Option<PResult<'a, (Ident, AliasKind, ast::Generics)>> {
6661 // This parses the grammar:
6662 // Ident ["<"...">"] ["where" ...] ("=" | ":") Ty ";"
6663 if self.check_keyword(keywords::Type) ||
6664 self.check_keyword(keywords::Existential) &&
6665 self.look_ahead(1, |t| t.is_keyword(keywords::Type)) {
6666 let existential = self.eat_keyword(keywords::Existential);
6667 assert!(self.eat_keyword(keywords::Type));
6668 Some(self.parse_existential_or_alias(existential))
6674 /// Parse type alias or existential type
6675 fn parse_existential_or_alias(
6678 ) -> PResult<'a, (Ident, AliasKind, ast::Generics)> {
6679 let ident = self.parse_ident()?;
6680 let mut tps = self.parse_generics()?;
6681 tps.where_clause = self.parse_where_clause()?;
6682 let alias = if existential {
6683 self.expect(&token::Colon)?;
6684 let bounds = self.parse_generic_bounds()?;
6685 AliasKind::Existential(bounds)
6687 self.expect(&token::Eq)?;
6688 let ty = self.parse_ty()?;
6691 self.expect(&token::Semi)?;
6692 Ok((ident, alias, tps))
6695 /// Parse the part of an "enum" decl following the '{'
6696 fn parse_enum_def(&mut self, _generics: &ast::Generics) -> PResult<'a, EnumDef> {
6697 let mut variants = Vec::new();
6698 let mut all_nullary = true;
6699 let mut any_disr = None;
6700 while self.token != token::CloseDelim(token::Brace) {
6701 let variant_attrs = self.parse_outer_attributes()?;
6702 let vlo = self.span;
6705 let mut disr_expr = None;
6706 let ident = self.parse_ident()?;
6707 if self.check(&token::OpenDelim(token::Brace)) {
6708 // Parse a struct variant.
6709 all_nullary = false;
6710 struct_def = VariantData::Struct(self.parse_record_struct_body()?,
6711 ast::DUMMY_NODE_ID);
6712 } else if self.check(&token::OpenDelim(token::Paren)) {
6713 all_nullary = false;
6714 struct_def = VariantData::Tuple(self.parse_tuple_struct_body()?,
6715 ast::DUMMY_NODE_ID);
6716 } else if self.eat(&token::Eq) {
6717 disr_expr = Some(AnonConst {
6718 id: ast::DUMMY_NODE_ID,
6719 value: self.parse_expr()?,
6721 any_disr = disr_expr.as_ref().map(|c| c.value.span);
6722 struct_def = VariantData::Unit(ast::DUMMY_NODE_ID);
6724 struct_def = VariantData::Unit(ast::DUMMY_NODE_ID);
6727 let vr = ast::Variant_ {
6729 attrs: variant_attrs,
6733 variants.push(respan(vlo.to(self.prev_span), vr));
6735 if !self.eat(&token::Comma) { break; }
6737 self.expect(&token::CloseDelim(token::Brace))?;
6739 Some(disr_span) if !all_nullary =>
6740 self.span_err(disr_span,
6741 "discriminator values can only be used with a field-less enum"),
6745 Ok(ast::EnumDef { variants: variants })
6748 /// Parse an "enum" declaration
6749 fn parse_item_enum(&mut self) -> PResult<'a, ItemInfo> {
6750 let id = self.parse_ident()?;
6751 let mut generics = self.parse_generics()?;
6752 generics.where_clause = self.parse_where_clause()?;
6753 self.expect(&token::OpenDelim(token::Brace))?;
6755 let enum_definition = self.parse_enum_def(&generics).map_err(|e| {
6756 self.recover_stmt();
6757 self.eat(&token::CloseDelim(token::Brace));
6760 Ok((id, ItemKind::Enum(enum_definition, generics), None))
6763 /// Parses a string as an ABI spec on an extern type or module. Consumes
6764 /// the `extern` keyword, if one is found.
6765 fn parse_opt_abi(&mut self) -> PResult<'a, Option<Abi>> {
6767 token::Literal(token::Str_(s), suf) | token::Literal(token::StrRaw(s, _), suf) => {
6769 self.expect_no_suffix(sp, "ABI spec", suf);
6771 match abi::lookup(&s.as_str()) {
6772 Some(abi) => Ok(Some(abi)),
6774 let prev_span = self.prev_span;
6775 let mut err = struct_span_err!(
6776 self.sess.span_diagnostic,
6779 "invalid ABI: found `{}`",
6781 err.span_label(prev_span, "invalid ABI");
6782 err.help(&format!("valid ABIs: {}", abi::all_names().join(", ")));
6793 fn is_static_global(&mut self) -> bool {
6794 if self.check_keyword(keywords::Static) {
6795 // Check if this could be a closure
6796 !self.look_ahead(1, |token| {
6797 if token.is_keyword(keywords::Move) {
6801 token::BinOp(token::Or) | token::OrOr => true,
6812 attrs: Vec<Attribute>,
6813 macros_allowed: bool,
6814 attributes_allowed: bool,
6815 ) -> PResult<'a, Option<P<Item>>> {
6816 let (ret, tokens) = self.collect_tokens(|this| {
6817 this.parse_item_implementation(attrs, macros_allowed, attributes_allowed)
6820 // Once we've parsed an item and recorded the tokens we got while
6821 // parsing we may want to store `tokens` into the item we're about to
6822 // return. Note, though, that we specifically didn't capture tokens
6823 // related to outer attributes. The `tokens` field here may later be
6824 // used with procedural macros to convert this item back into a token
6825 // stream, but during expansion we may be removing attributes as we go
6828 // If we've got inner attributes then the `tokens` we've got above holds
6829 // these inner attributes. If an inner attribute is expanded we won't
6830 // actually remove it from the token stream, so we'll just keep yielding
6831 // it (bad!). To work around this case for now we just avoid recording
6832 // `tokens` if we detect any inner attributes. This should help keep
6833 // expansion correct, but we should fix this bug one day!
6836 if !i.attrs.iter().any(|attr| attr.style == AttrStyle::Inner) {
6837 i.tokens = Some(tokens);
6844 /// Parse one of the items allowed by the flags.
6845 /// NB: this function no longer parses the items inside an
6847 fn parse_item_implementation(
6849 attrs: Vec<Attribute>,
6850 macros_allowed: bool,
6851 attributes_allowed: bool,
6852 ) -> PResult<'a, Option<P<Item>>> {
6853 maybe_whole!(self, NtItem, |item| {
6854 let mut item = item.into_inner();
6855 let mut attrs = attrs;
6856 mem::swap(&mut item.attrs, &mut attrs);
6857 item.attrs.extend(attrs);
6863 let visibility = self.parse_visibility(false)?;
6865 if self.eat_keyword(keywords::Use) {
6867 let item_ = ItemKind::Use(P(self.parse_use_tree()?));
6868 self.expect(&token::Semi)?;
6870 let span = lo.to(self.prev_span);
6871 let item = self.mk_item(span, keywords::Invalid.ident(), item_, visibility, attrs);
6872 return Ok(Some(item));
6875 if self.check_keyword(keywords::Extern) && self.is_extern_non_path() {
6876 self.bump(); // `extern`
6877 if self.eat_keyword(keywords::Crate) {
6878 return Ok(Some(self.parse_item_extern_crate(lo, visibility, attrs)?));
6881 let opt_abi = self.parse_opt_abi()?;
6883 if self.eat_keyword(keywords::Fn) {
6884 // EXTERN FUNCTION ITEM
6885 let fn_span = self.prev_span;
6886 let abi = opt_abi.unwrap_or(Abi::C);
6887 let (ident, item_, extra_attrs) =
6888 self.parse_item_fn(Unsafety::Normal,
6890 respan(fn_span, Constness::NotConst),
6892 let prev_span = self.prev_span;
6893 let item = self.mk_item(lo.to(prev_span),
6897 maybe_append(attrs, extra_attrs));
6898 return Ok(Some(item));
6899 } else if self.check(&token::OpenDelim(token::Brace)) {
6900 return Ok(Some(self.parse_item_foreign_mod(lo, opt_abi, visibility, attrs)?));
6906 if self.is_static_global() {
6909 let m = if self.eat_keyword(keywords::Mut) {
6912 Mutability::Immutable
6914 let (ident, item_, extra_attrs) = self.parse_item_const(Some(m))?;
6915 let prev_span = self.prev_span;
6916 let item = self.mk_item(lo.to(prev_span),
6920 maybe_append(attrs, extra_attrs));
6921 return Ok(Some(item));
6923 if self.eat_keyword(keywords::Const) {
6924 let const_span = self.prev_span;
6925 if self.check_keyword(keywords::Fn)
6926 || (self.check_keyword(keywords::Unsafe)
6927 && self.look_ahead(1, |t| t.is_keyword(keywords::Fn))) {
6928 // CONST FUNCTION ITEM
6929 let unsafety = self.parse_unsafety();
6931 let (ident, item_, extra_attrs) =
6932 self.parse_item_fn(unsafety,
6934 respan(const_span, Constness::Const),
6936 let prev_span = self.prev_span;
6937 let item = self.mk_item(lo.to(prev_span),
6941 maybe_append(attrs, extra_attrs));
6942 return Ok(Some(item));
6946 if self.eat_keyword(keywords::Mut) {
6947 let prev_span = self.prev_span;
6948 self.diagnostic().struct_span_err(prev_span, "const globals cannot be mutable")
6949 .help("did you mean to declare a static?")
6952 let (ident, item_, extra_attrs) = self.parse_item_const(None)?;
6953 let prev_span = self.prev_span;
6954 let item = self.mk_item(lo.to(prev_span),
6958 maybe_append(attrs, extra_attrs));
6959 return Ok(Some(item));
6962 // `unsafe async fn` or `async fn`
6964 self.check_keyword(keywords::Unsafe) &&
6965 self.look_ahead(1, |t| t.is_keyword(keywords::Async))
6967 self.check_keyword(keywords::Async) &&
6968 self.look_ahead(1, |t| t.is_keyword(keywords::Fn))
6971 // ASYNC FUNCTION ITEM
6972 let unsafety = self.parse_unsafety();
6973 self.expect_keyword(keywords::Async)?;
6974 self.expect_keyword(keywords::Fn)?;
6975 let fn_span = self.prev_span;
6976 let (ident, item_, extra_attrs) =
6977 self.parse_item_fn(unsafety,
6979 closure_id: ast::DUMMY_NODE_ID,
6980 return_impl_trait_id: ast::DUMMY_NODE_ID,
6982 respan(fn_span, Constness::NotConst),
6984 let prev_span = self.prev_span;
6985 let item = self.mk_item(lo.to(prev_span),
6989 maybe_append(attrs, extra_attrs));
6990 return Ok(Some(item));
6992 if self.check_keyword(keywords::Unsafe) &&
6993 (self.look_ahead(1, |t| t.is_keyword(keywords::Trait)) ||
6994 self.look_ahead(1, |t| t.is_keyword(keywords::Auto)))
6996 // UNSAFE TRAIT ITEM
6997 self.bump(); // `unsafe`
6998 let is_auto = if self.eat_keyword(keywords::Trait) {
7001 self.expect_keyword(keywords::Auto)?;
7002 self.expect_keyword(keywords::Trait)?;
7005 let (ident, item_, extra_attrs) =
7006 self.parse_item_trait(is_auto, Unsafety::Unsafe)?;
7007 let prev_span = self.prev_span;
7008 let item = self.mk_item(lo.to(prev_span),
7012 maybe_append(attrs, extra_attrs));
7013 return Ok(Some(item));
7015 if self.check_keyword(keywords::Impl) ||
7016 self.check_keyword(keywords::Unsafe) &&
7017 self.look_ahead(1, |t| t.is_keyword(keywords::Impl)) ||
7018 self.check_keyword(keywords::Default) &&
7019 self.look_ahead(1, |t| t.is_keyword(keywords::Impl)) ||
7020 self.check_keyword(keywords::Default) &&
7021 self.look_ahead(1, |t| t.is_keyword(keywords::Unsafe)) {
7023 let defaultness = self.parse_defaultness();
7024 let unsafety = self.parse_unsafety();
7025 self.expect_keyword(keywords::Impl)?;
7026 let (ident, item, extra_attrs) = self.parse_item_impl(unsafety, defaultness)?;
7027 let span = lo.to(self.prev_span);
7028 return Ok(Some(self.mk_item(span, ident, item, visibility,
7029 maybe_append(attrs, extra_attrs))));
7031 if self.check_keyword(keywords::Fn) {
7034 let fn_span = self.prev_span;
7035 let (ident, item_, extra_attrs) =
7036 self.parse_item_fn(Unsafety::Normal,
7038 respan(fn_span, Constness::NotConst),
7040 let prev_span = self.prev_span;
7041 let item = self.mk_item(lo.to(prev_span),
7045 maybe_append(attrs, extra_attrs));
7046 return Ok(Some(item));
7048 if self.check_keyword(keywords::Unsafe)
7049 && self.look_ahead(1, |t| *t != token::OpenDelim(token::Brace)) {
7050 // UNSAFE FUNCTION ITEM
7051 self.bump(); // `unsafe`
7052 // `{` is also expected after `unsafe`, in case of error, include it in the diagnostic
7053 self.check(&token::OpenDelim(token::Brace));
7054 let abi = if self.eat_keyword(keywords::Extern) {
7055 self.parse_opt_abi()?.unwrap_or(Abi::C)
7059 self.expect_keyword(keywords::Fn)?;
7060 let fn_span = self.prev_span;
7061 let (ident, item_, extra_attrs) =
7062 self.parse_item_fn(Unsafety::Unsafe,
7064 respan(fn_span, Constness::NotConst),
7066 let prev_span = self.prev_span;
7067 let item = self.mk_item(lo.to(prev_span),
7071 maybe_append(attrs, extra_attrs));
7072 return Ok(Some(item));
7074 if self.eat_keyword(keywords::Mod) {
7076 let (ident, item_, extra_attrs) =
7077 self.parse_item_mod(&attrs[..])?;
7078 let prev_span = self.prev_span;
7079 let item = self.mk_item(lo.to(prev_span),
7083 maybe_append(attrs, extra_attrs));
7084 return Ok(Some(item));
7086 if let Some(type_) = self.eat_type() {
7087 let (ident, alias, generics) = type_?;
7089 let item_ = match alias {
7090 AliasKind::Weak(ty) => ItemKind::Ty(ty, generics),
7091 AliasKind::Existential(bounds) => ItemKind::Existential(bounds, generics),
7093 let prev_span = self.prev_span;
7094 let item = self.mk_item(lo.to(prev_span),
7099 return Ok(Some(item));
7101 if self.eat_keyword(keywords::Enum) {
7103 let (ident, item_, extra_attrs) = self.parse_item_enum()?;
7104 let prev_span = self.prev_span;
7105 let item = self.mk_item(lo.to(prev_span),
7109 maybe_append(attrs, extra_attrs));
7110 return Ok(Some(item));
7112 if self.check_keyword(keywords::Trait)
7113 || (self.check_keyword(keywords::Auto)
7114 && self.look_ahead(1, |t| t.is_keyword(keywords::Trait)))
7116 let is_auto = if self.eat_keyword(keywords::Trait) {
7119 self.expect_keyword(keywords::Auto)?;
7120 self.expect_keyword(keywords::Trait)?;
7124 let (ident, item_, extra_attrs) =
7125 self.parse_item_trait(is_auto, Unsafety::Normal)?;
7126 let prev_span = self.prev_span;
7127 let item = self.mk_item(lo.to(prev_span),
7131 maybe_append(attrs, extra_attrs));
7132 return Ok(Some(item));
7134 if self.eat_keyword(keywords::Struct) {
7136 let (ident, item_, extra_attrs) = self.parse_item_struct()?;
7137 let prev_span = self.prev_span;
7138 let item = self.mk_item(lo.to(prev_span),
7142 maybe_append(attrs, extra_attrs));
7143 return Ok(Some(item));
7145 if self.is_union_item() {
7148 let (ident, item_, extra_attrs) = self.parse_item_union()?;
7149 let prev_span = self.prev_span;
7150 let item = self.mk_item(lo.to(prev_span),
7154 maybe_append(attrs, extra_attrs));
7155 return Ok(Some(item));
7157 if let Some(macro_def) = self.eat_macro_def(&attrs, &visibility, lo)? {
7158 return Ok(Some(macro_def));
7161 // Verify whether we have encountered a struct or method definition where the user forgot to
7162 // add the `struct` or `fn` keyword after writing `pub`: `pub S {}`
7163 if visibility.node.is_pub() &&
7164 self.check_ident() &&
7165 self.look_ahead(1, |t| *t != token::Not)
7167 // Space between `pub` keyword and the identifier
7170 // ^^^ `sp` points here
7171 let sp = self.prev_span.between(self.span);
7172 let full_sp = self.prev_span.to(self.span);
7173 let ident_sp = self.span;
7174 if self.look_ahead(1, |t| *t == token::OpenDelim(token::Brace)) {
7175 // possible public struct definition where `struct` was forgotten
7176 let ident = self.parse_ident().unwrap();
7177 let msg = format!("add `struct` here to parse `{}` as a public struct",
7179 let mut err = self.diagnostic()
7180 .struct_span_err(sp, "missing `struct` for struct definition");
7181 err.span_suggestion_short_with_applicability(
7182 sp, &msg, " struct ".into(), Applicability::MaybeIncorrect // speculative
7185 } else if self.look_ahead(1, |t| *t == token::OpenDelim(token::Paren)) {
7186 let ident = self.parse_ident().unwrap();
7187 self.consume_block(token::Paren);
7188 let (kw, kw_name, ambiguous) = if self.check(&token::RArrow) ||
7189 self.check(&token::OpenDelim(token::Brace))
7191 ("fn", "method", false)
7192 } else if self.check(&token::Colon) {
7196 ("fn` or `struct", "method or struct", true)
7199 let msg = format!("missing `{}` for {} definition", kw, kw_name);
7200 let mut err = self.diagnostic().struct_span_err(sp, &msg);
7202 let suggestion = format!("add `{}` here to parse `{}` as a public {}",
7206 err.span_suggestion_short_with_applicability(
7207 sp, &suggestion, format!(" {} ", kw), Applicability::MachineApplicable
7210 if let Ok(snippet) = self.sess.codemap().span_to_snippet(ident_sp) {
7211 err.span_suggestion_with_applicability(
7213 "if you meant to call a macro, try",
7214 format!("{}!", snippet),
7215 // this is the `ambiguous` conditional branch
7216 Applicability::MaybeIncorrect
7219 err.help("if you meant to call a macro, remove the `pub` \
7220 and add a trailing `!` after the identifier");
7226 self.parse_macro_use_or_failure(attrs, macros_allowed, attributes_allowed, lo, visibility)
7229 /// Parse a foreign item.
7230 crate fn parse_foreign_item(&mut self) -> PResult<'a, Option<ForeignItem>> {
7231 maybe_whole!(self, NtForeignItem, |ni| Some(ni));
7233 let attrs = self.parse_outer_attributes()?;
7235 let visibility = self.parse_visibility(false)?;
7237 // FOREIGN STATIC ITEM
7238 // Treat `const` as `static` for error recovery, but don't add it to expected tokens.
7239 if self.check_keyword(keywords::Static) || self.token.is_keyword(keywords::Const) {
7240 if self.token.is_keyword(keywords::Const) {
7242 .struct_span_err(self.span, "extern items cannot be `const`")
7243 .span_suggestion_with_applicability(
7245 "try using a static value",
7246 "static".to_owned(),
7247 Applicability::MachineApplicable
7250 self.bump(); // `static` or `const`
7251 return Ok(Some(self.parse_item_foreign_static(visibility, lo, attrs)?));
7253 // FOREIGN FUNCTION ITEM
7254 if self.check_keyword(keywords::Fn) {
7255 return Ok(Some(self.parse_item_foreign_fn(visibility, lo, attrs)?));
7257 // FOREIGN TYPE ITEM
7258 if self.check_keyword(keywords::Type) {
7259 return Ok(Some(self.parse_item_foreign_type(visibility, lo, attrs)?));
7262 match self.parse_assoc_macro_invoc("extern", Some(&visibility), &mut false)? {
7266 ident: keywords::Invalid.ident(),
7267 span: lo.to(self.prev_span),
7268 id: ast::DUMMY_NODE_ID,
7271 node: ForeignItemKind::Macro(mac),
7276 if !attrs.is_empty() {
7277 self.expected_item_err(&attrs);
7285 /// This is the fall-through for parsing items.
7286 fn parse_macro_use_or_failure(
7288 attrs: Vec<Attribute> ,
7289 macros_allowed: bool,
7290 attributes_allowed: bool,
7292 visibility: Visibility
7293 ) -> PResult<'a, Option<P<Item>>> {
7294 if macros_allowed && self.token.is_path_start() {
7295 // MACRO INVOCATION ITEM
7297 let prev_span = self.prev_span;
7298 self.complain_if_pub_macro(&visibility.node, prev_span);
7300 let mac_lo = self.span;
7303 let pth = self.parse_path(PathStyle::Mod)?;
7304 self.expect(&token::Not)?;
7306 // a 'special' identifier (like what `macro_rules!` uses)
7307 // is optional. We should eventually unify invoc syntax
7309 let id = if self.token.is_ident() {
7312 keywords::Invalid.ident() // no special identifier
7314 // eat a matched-delimiter token tree:
7315 let (delim, tts) = self.expect_delimited_token_tree()?;
7316 if delim != MacDelimiter::Brace {
7317 if !self.eat(&token::Semi) {
7318 self.span_err(self.prev_span,
7319 "macros that expand to items must either \
7320 be surrounded with braces or followed by \
7325 let hi = self.prev_span;
7326 let mac = respan(mac_lo.to(hi), Mac_ { path: pth, tts, delim });
7327 let item = self.mk_item(lo.to(hi), id, ItemKind::Mac(mac), visibility, attrs);
7328 return Ok(Some(item));
7331 // FAILURE TO PARSE ITEM
7332 match visibility.node {
7333 VisibilityKind::Inherited => {}
7335 return Err(self.span_fatal(self.prev_span, "unmatched visibility `pub`"));
7339 if !attributes_allowed && !attrs.is_empty() {
7340 self.expected_item_err(&attrs);
7345 /// Parse a macro invocation inside a `trait`, `impl` or `extern` block
7346 fn parse_assoc_macro_invoc(&mut self, item_kind: &str, vis: Option<&Visibility>,
7347 at_end: &mut bool) -> PResult<'a, Option<Mac>>
7349 if self.token.is_path_start() && !self.is_extern_non_path() {
7350 let prev_span = self.prev_span;
7352 let pth = self.parse_path(PathStyle::Mod)?;
7354 if pth.segments.len() == 1 {
7355 if !self.eat(&token::Not) {
7356 return Err(self.missing_assoc_item_kind_err(item_kind, prev_span));
7359 self.expect(&token::Not)?;
7362 if let Some(vis) = vis {
7363 self.complain_if_pub_macro(&vis.node, prev_span);
7368 // eat a matched-delimiter token tree:
7369 let (delim, tts) = self.expect_delimited_token_tree()?;
7370 if delim != MacDelimiter::Brace {
7371 self.expect(&token::Semi)?
7374 Ok(Some(respan(lo.to(self.prev_span), Mac_ { path: pth, tts, delim })))
7380 fn collect_tokens<F, R>(&mut self, f: F) -> PResult<'a, (R, TokenStream)>
7381 where F: FnOnce(&mut Self) -> PResult<'a, R>
7383 // Record all tokens we parse when parsing this item.
7384 let mut tokens = Vec::new();
7385 let prev_collecting = match self.token_cursor.frame.last_token {
7386 LastToken::Collecting(ref mut list) => {
7387 Some(mem::replace(list, Vec::new()))
7389 LastToken::Was(ref mut last) => {
7390 tokens.extend(last.take());
7394 self.token_cursor.frame.last_token = LastToken::Collecting(tokens);
7395 let prev = self.token_cursor.stack.len();
7397 let last_token = if self.token_cursor.stack.len() == prev {
7398 &mut self.token_cursor.frame.last_token
7400 &mut self.token_cursor.stack[prev].last_token
7403 // Pull our the toekns that we've collected from the call to `f` above
7404 let mut collected_tokens = match *last_token {
7405 LastToken::Collecting(ref mut v) => mem::replace(v, Vec::new()),
7406 LastToken::Was(_) => panic!("our vector went away?"),
7409 // If we're not at EOF our current token wasn't actually consumed by
7410 // `f`, but it'll still be in our list that we pulled out. In that case
7412 let extra_token = if self.token != token::Eof {
7413 collected_tokens.pop()
7418 // If we were previously collecting tokens, then this was a recursive
7419 // call. In that case we need to record all the tokens we collected in
7420 // our parent list as well. To do that we push a clone of our stream
7421 // onto the previous list.
7422 let stream = collected_tokens.into_iter().collect::<TokenStream>();
7423 match prev_collecting {
7425 list.push(stream.clone());
7426 list.extend(extra_token);
7427 *last_token = LastToken::Collecting(list);
7430 *last_token = LastToken::Was(extra_token);
7437 pub fn parse_item(&mut self) -> PResult<'a, Option<P<Item>>> {
7438 let attrs = self.parse_outer_attributes()?;
7439 self.parse_item_(attrs, true, false)
7443 fn is_import_coupler(&mut self) -> bool {
7444 self.check(&token::ModSep) &&
7445 self.look_ahead(1, |t| *t == token::OpenDelim(token::Brace) ||
7446 *t == token::BinOp(token::Star))
7451 /// USE_TREE = [`::`] `*` |
7452 /// [`::`] `{` USE_TREE_LIST `}` |
7454 /// PATH `::` `{` USE_TREE_LIST `}` |
7455 /// PATH [`as` IDENT]
7456 fn parse_use_tree(&mut self) -> PResult<'a, UseTree> {
7459 let mut prefix = ast::Path { segments: Vec::new(), span: lo.shrink_to_lo() };
7460 let kind = if self.check(&token::OpenDelim(token::Brace)) ||
7461 self.check(&token::BinOp(token::Star)) ||
7462 self.is_import_coupler() {
7463 // `use *;` or `use ::*;` or `use {...};` or `use ::{...};`
7464 if self.eat(&token::ModSep) {
7465 prefix.segments.push(PathSegment::crate_root(lo.shrink_to_lo()));
7468 if self.eat(&token::BinOp(token::Star)) {
7471 UseTreeKind::Nested(self.parse_use_tree_list()?)
7474 // `use path::*;` or `use path::{...};` or `use path;` or `use path as bar;`
7475 prefix = self.parse_path(PathStyle::Mod)?;
7477 if self.eat(&token::ModSep) {
7478 if self.eat(&token::BinOp(token::Star)) {
7481 UseTreeKind::Nested(self.parse_use_tree_list()?)
7484 UseTreeKind::Simple(self.parse_rename()?, ast::DUMMY_NODE_ID, ast::DUMMY_NODE_ID)
7488 Ok(UseTree { prefix, kind, span: lo.to(self.prev_span) })
7491 /// Parse UseTreeKind::Nested(list)
7493 /// USE_TREE_LIST = Ø | (USE_TREE `,`)* USE_TREE [`,`]
7494 fn parse_use_tree_list(&mut self) -> PResult<'a, Vec<(UseTree, ast::NodeId)>> {
7495 self.parse_unspanned_seq(&token::OpenDelim(token::Brace),
7496 &token::CloseDelim(token::Brace),
7497 SeqSep::trailing_allowed(token::Comma), |this| {
7498 Ok((this.parse_use_tree()?, ast::DUMMY_NODE_ID))
7502 fn parse_rename(&mut self) -> PResult<'a, Option<Ident>> {
7503 if self.eat_keyword(keywords::As) {
7505 token::Ident(ident, false) if ident.name == keywords::Underscore.name() => {
7507 Ok(Some(ident.gensym()))
7509 _ => self.parse_ident().map(Some),
7516 /// Parses a source module as a crate. This is the main
7517 /// entry point for the parser.
7518 pub fn parse_crate_mod(&mut self) -> PResult<'a, Crate> {
7521 attrs: self.parse_inner_attributes()?,
7522 module: self.parse_mod_items(&token::Eof, lo)?,
7523 span: lo.to(self.span),
7527 pub fn parse_optional_str(&mut self) -> Option<(Symbol, ast::StrStyle, Option<ast::Name>)> {
7528 let ret = match self.token {
7529 token::Literal(token::Str_(s), suf) => (s, ast::StrStyle::Cooked, suf),
7530 token::Literal(token::StrRaw(s, n), suf) => (s, ast::StrStyle::Raw(n), suf),
7537 pub fn parse_str(&mut self) -> PResult<'a, (Symbol, StrStyle)> {
7538 match self.parse_optional_str() {
7539 Some((s, style, suf)) => {
7540 let sp = self.prev_span;
7541 self.expect_no_suffix(sp, "string literal", suf);
7545 let msg = "expected string literal";
7546 let mut err = self.fatal(msg);
7547 err.span_label(self.span, msg);