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 pub use self::PathParsingMode::*;
15 use ast::{RegionTyParamBound, TraitTyParamBound, TraitBoundModifier};
16 use ast::{Public, Unsafety};
17 use ast::{Mod, BiAdd, Arg, Arm, Attribute, BindByRef, BindByValue};
18 use ast::{BiBitAnd, BiBitOr, BiBitXor, BiRem, BiLt, Block};
19 use ast::{BlockCheckMode, CaptureByRef, CaptureByValue, CaptureClause};
20 use ast::{Constness, ConstTraitItem, Crate, CrateConfig};
21 use ast::{Decl, DeclItem, DeclLocal, DefaultBlock, DefaultReturn};
22 use ast::{UnDeref, BiDiv, EMPTY_CTXT, EnumDef, ExplicitSelf};
23 use ast::{Expr, Expr_, ExprAddrOf, ExprMatch, ExprAgain};
24 use ast::{ExprAssign, ExprAssignOp, ExprBinary, ExprBlock, ExprBox};
25 use ast::{ExprBreak, ExprCall, ExprCast, ExprInPlace};
26 use ast::{ExprField, ExprTupField, ExprClosure, ExprIf, ExprIfLet, ExprIndex};
27 use ast::{ExprLit, ExprLoop, ExprMac, ExprRange};
28 use ast::{ExprMethodCall, ExprParen, ExprPath};
29 use ast::{ExprRepeat, ExprRet, ExprStruct, ExprTup, ExprUnary};
30 use ast::{ExprVec, ExprWhile, ExprWhileLet, ExprForLoop, Field, FnDecl};
31 use ast::{ForeignItem, ForeignItemStatic, ForeignItemFn, FunctionRetTy};
32 use ast::{Ident, Inherited, ImplItem, Item, Item_, ItemStatic};
33 use ast::{ItemEnum, ItemFn, ItemForeignMod, ItemImpl, ItemConst};
34 use ast::{ItemMac, ItemMod, ItemStruct, ItemTrait, ItemTy, ItemDefaultImpl};
35 use ast::{ItemExternCrate, ItemUse};
37 use ast::{LitBool, LitChar, LitByte, LitByteStr};
38 use ast::{LitStr, LitInt, Local};
39 use ast::{MacStmtWithBraces, MacStmtWithSemicolon, MacStmtWithoutBraces};
40 use ast::{MutImmutable, MutMutable, Mac_};
41 use ast::{MutTy, BiMul, Mutability};
42 use ast::{NamedField, UnNeg, NoReturn, UnNot};
43 use ast::{Pat, PatBox, PatEnum, PatIdent, PatLit, PatQPath, PatMac, PatRange};
44 use ast::{PatRegion, PatStruct, PatTup, PatVec, PatWild};
45 use ast::{PolyTraitRef, QSelf};
46 use ast::{Return, BiShl, BiShr, Stmt, StmtDecl};
47 use ast::{StmtExpr, StmtSemi, StmtMac, VariantData, StructField};
48 use ast::{BiSub, StrStyle};
49 use ast::{SelfExplicit, SelfRegion, SelfStatic, SelfValue};
50 use ast::{Delimited, SequenceRepetition, TokenTree, TraitItem, TraitRef};
51 use ast::{Ty, Ty_, TypeBinding, TyMac};
52 use ast::{TyFixedLengthVec, TyBareFn, TyTypeof, TyInfer};
53 use ast::{TyParam, TyParamBound, TyParen, TyPath, TyPtr};
54 use ast::{TyRptr, TyTup, TyU32, TyVec};
55 use ast::TypeTraitItem;
56 use ast::{UnnamedField, UnsafeBlock};
57 use ast::{ViewPath, ViewPathGlob, ViewPathList, ViewPathSimple};
58 use ast::{Visibility, WhereClause};
59 use attr::{ThinAttributes, ThinAttributesExt, AttributesExt};
61 use ast_util::{self, ident_to_path};
62 use codemap::{self, Span, BytePos, Spanned, spanned, mk_sp, CodeMap};
63 use errors::{self, FatalError};
64 use ext::tt::macro_parser;
67 use parse::common::{SeqSep, seq_sep_none, seq_sep_trailing_allowed};
68 use parse::lexer::{Reader, TokenAndSpan};
69 use parse::obsolete::{ParserObsoleteMethods, ObsoleteSyntax};
70 use parse::token::{self, MatchNt, SubstNt, SpecialVarNt, InternedString};
71 use parse::token::{keywords, special_idents, SpecialMacroVar};
72 use parse::{new_sub_parser_from_file, ParseSess};
73 use util::parser::{AssocOp, Fixity};
76 use owned_slice::OwnedSlice;
79 use std::collections::HashSet;
80 use std::io::prelude::*;
82 use std::path::{Path, PathBuf};
87 flags Restrictions: u8 {
88 const RESTRICTION_STMT_EXPR = 1 << 0,
89 const RESTRICTION_NO_STRUCT_LITERAL = 1 << 1,
93 type ItemInfo = (Ident, Item_, Option<Vec<Attribute> >);
95 /// How to parse a path. There are four different kinds of paths, all of which
96 /// are parsed somewhat differently.
97 #[derive(Copy, Clone, PartialEq)]
98 pub enum PathParsingMode {
99 /// A path with no type parameters; e.g. `foo::bar::Baz`
101 /// A path with a lifetime and type parameters, with no double colons
102 /// before the type parameters; e.g. `foo::bar<'a>::Baz<T>`
103 LifetimeAndTypesWithoutColons,
104 /// A path with a lifetime and type parameters with double colons before
105 /// the type parameters; e.g. `foo::bar::<'a>::Baz::<T>`
106 LifetimeAndTypesWithColons,
109 /// How to parse a bound, whether to allow bound modifiers such as `?`.
110 #[derive(Copy, Clone, PartialEq)]
111 pub enum BoundParsingMode {
116 /// `pub` should be parsed in struct fields and not parsed in variant fields
117 #[derive(Clone, Copy, PartialEq)]
123 /// Possibly accept an `token::Interpolated` expression (a pre-parsed expression
124 /// dropped into the token stream, which happens while parsing the result of
125 /// macro expansion). Placement of these is not as complex as I feared it would
126 /// be. The important thing is to make sure that lookahead doesn't balk at
127 /// `token::Interpolated` tokens.
128 macro_rules! maybe_whole_expr {
131 let found = match $p.token {
132 token::Interpolated(token::NtExpr(ref e)) => {
135 token::Interpolated(token::NtPath(_)) => {
136 // FIXME: The following avoids an issue with lexical borrowck scopes,
137 // but the clone is unfortunate.
138 let pt = match $p.token {
139 token::Interpolated(token::NtPath(ref pt)) => (**pt).clone(),
143 Some($p.mk_expr(span.lo, span.hi, ExprPath(None, pt), None))
145 token::Interpolated(token::NtBlock(_)) => {
146 // FIXME: The following avoids an issue with lexical borrowck scopes,
147 // but the clone is unfortunate.
148 let b = match $p.token {
149 token::Interpolated(token::NtBlock(ref b)) => (*b).clone(),
153 Some($p.mk_expr(span.lo, span.hi, ExprBlock(b), None))
168 /// As maybe_whole_expr, but for things other than expressions
169 macro_rules! maybe_whole {
170 ($p:expr, $constructor:ident) => (
172 let found = match ($p).token {
173 token::Interpolated(token::$constructor(_)) => {
174 Some(try!(($p).bump_and_get()))
178 if let Some(token::Interpolated(token::$constructor(x))) = found {
179 return Ok(x.clone());
183 (no_clone $p:expr, $constructor:ident) => (
185 let found = match ($p).token {
186 token::Interpolated(token::$constructor(_)) => {
187 Some(try!(($p).bump_and_get()))
191 if let Some(token::Interpolated(token::$constructor(x))) = found {
196 (deref $p:expr, $constructor:ident) => (
198 let found = match ($p).token {
199 token::Interpolated(token::$constructor(_)) => {
200 Some(try!(($p).bump_and_get()))
204 if let Some(token::Interpolated(token::$constructor(x))) = found {
205 return Ok((*x).clone());
209 (Some deref $p:expr, $constructor:ident) => (
211 let found = match ($p).token {
212 token::Interpolated(token::$constructor(_)) => {
213 Some(try!(($p).bump_and_get()))
217 if let Some(token::Interpolated(token::$constructor(x))) = found {
218 return Ok(Some((*x).clone()));
222 (pair_empty $p:expr, $constructor:ident) => (
224 let found = match ($p).token {
225 token::Interpolated(token::$constructor(_)) => {
226 Some(try!(($p).bump_and_get()))
230 if let Some(token::Interpolated(token::$constructor(x))) = found {
231 return Ok((Vec::new(), x));
238 fn maybe_append(mut lhs: Vec<Attribute>, rhs: Option<Vec<Attribute>>)
240 if let Some(ref attrs) = rhs {
241 lhs.extend(attrs.iter().cloned())
246 /* ident is handled by common.rs */
248 pub struct Parser<'a> {
249 pub sess: &'a ParseSess,
250 /// the current token:
251 pub token: token::Token,
252 /// the span of the current token:
254 /// the span of the prior token:
256 pub cfg: CrateConfig,
257 /// the previous token or None (only stashed sometimes).
258 pub last_token: Option<Box<token::Token>>,
259 pub buffer: [TokenAndSpan; 4],
260 pub buffer_start: isize,
261 pub buffer_end: isize,
262 pub tokens_consumed: usize,
263 pub restrictions: Restrictions,
264 pub quote_depth: usize, // not (yet) related to the quasiquoter
265 pub reader: Box<Reader+'a>,
266 pub interner: Rc<token::IdentInterner>,
267 /// The set of seen errors about obsolete syntax. Used to suppress
268 /// extra detail when the same error is seen twice
269 pub obsolete_set: HashSet<ObsoleteSyntax>,
270 /// Used to determine the path to externally loaded source files
271 pub mod_path_stack: Vec<InternedString>,
272 /// Stack of spans of open delimiters. Used for error message.
273 pub open_braces: Vec<Span>,
274 /// Flag if this parser "owns" the directory that it is currently parsing
275 /// in. This will affect how nested files are looked up.
276 pub owns_directory: bool,
277 /// Name of the root module this parser originated from. If `None`, then the
278 /// name is not known. This does not change while the parser is descending
279 /// into modules, and sub-parsers have new values for this name.
280 pub root_module_name: Option<String>,
281 pub expected_tokens: Vec<TokenType>,
284 #[derive(PartialEq, Eq, Clone)]
287 Keyword(keywords::Keyword),
292 fn to_string(&self) -> String {
294 TokenType::Token(ref t) => format!("`{}`", Parser::token_to_string(t)),
295 TokenType::Operator => "an operator".to_string(),
296 TokenType::Keyword(kw) => format!("`{}`", kw.to_name()),
301 fn is_plain_ident_or_underscore(t: &token::Token) -> bool {
302 t.is_plain_ident() || *t == token::Underscore
305 /// Information about the path to a module.
306 pub struct ModulePath {
308 pub path_exists: bool,
309 pub result: Result<ModulePathSuccess, ModulePathError>,
312 pub struct ModulePathSuccess {
313 pub path: ::std::path::PathBuf,
314 pub owns_directory: bool,
317 pub struct ModulePathError {
319 pub help_msg: String,
324 AttributesParsed(ThinAttributes),
325 AlreadyParsed(P<Expr>),
328 impl From<Option<ThinAttributes>> for LhsExpr {
329 fn from(o: Option<ThinAttributes>) -> Self {
330 if let Some(attrs) = o {
331 LhsExpr::AttributesParsed(attrs)
333 LhsExpr::NotYetParsed
338 impl From<P<Expr>> for LhsExpr {
339 fn from(expr: P<Expr>) -> Self {
340 LhsExpr::AlreadyParsed(expr)
344 impl<'a> Parser<'a> {
345 pub fn new(sess: &'a ParseSess,
346 cfg: ast::CrateConfig,
347 mut rdr: Box<Reader+'a>)
350 let tok0 = rdr.real_token();
352 let placeholder = TokenAndSpan {
353 tok: token::Underscore,
359 interner: token::get_ident_interner(),
375 restrictions: Restrictions::empty(),
377 obsolete_set: HashSet::new(),
378 mod_path_stack: Vec::new(),
379 open_braces: Vec::new(),
380 owns_directory: true,
381 root_module_name: None,
382 expected_tokens: Vec::new(),
386 /// Convert a token to a string using self's reader
387 pub fn token_to_string(token: &token::Token) -> String {
388 pprust::token_to_string(token)
391 /// Convert the current token to a string using self's reader
392 pub fn this_token_to_string(&self) -> String {
393 Parser::token_to_string(&self.token)
396 pub fn unexpected_last(&self, t: &token::Token) -> FatalError {
397 let token_str = Parser::token_to_string(t);
398 let last_span = self.last_span;
399 self.span_fatal(last_span, &format!("unexpected token: `{}`",
403 pub fn unexpected(&mut self) -> FatalError {
404 match self.expect_one_of(&[], &[]) {
406 Ok(_) => unreachable!()
410 /// Expect and consume the token t. Signal an error if
411 /// the next token is not t.
412 pub fn expect(&mut self, t: &token::Token) -> PResult<()> {
413 if self.expected_tokens.is_empty() {
414 if self.token == *t {
417 let token_str = Parser::token_to_string(t);
418 let this_token_str = self.this_token_to_string();
419 Err(self.fatal(&format!("expected `{}`, found `{}`",
424 self.expect_one_of(unsafe { slice::from_raw_parts(t, 1) }, &[])
428 /// Expect next token to be edible or inedible token. If edible,
429 /// then consume it; if inedible, then return without consuming
430 /// anything. Signal a fatal error if next token is unexpected.
431 pub fn expect_one_of(&mut self,
432 edible: &[token::Token],
433 inedible: &[token::Token]) -> PResult<()>{
434 fn tokens_to_string(tokens: &[TokenType]) -> String {
435 let mut i = tokens.iter();
436 // This might be a sign we need a connect method on Iterator.
438 .map_or("".to_string(), |t| t.to_string());
439 i.enumerate().fold(b, |mut b, (i, ref a)| {
440 if tokens.len() > 2 && i == tokens.len() - 2 {
442 } else if tokens.len() == 2 && i == tokens.len() - 2 {
447 b.push_str(&*a.to_string());
451 if edible.contains(&self.token) {
453 } else if inedible.contains(&self.token) {
454 // leave it in the input
457 let mut expected = edible.iter()
458 .map(|x| TokenType::Token(x.clone()))
459 .chain(inedible.iter().map(|x| TokenType::Token(x.clone())))
460 .chain(self.expected_tokens.iter().cloned())
461 .collect::<Vec<_>>();
462 expected.sort_by(|a, b| a.to_string().cmp(&b.to_string()));
464 let expect = tokens_to_string(&expected[..]);
465 let actual = self.this_token_to_string();
467 &(if expected.len() > 1 {
468 (format!("expected one of {}, found `{}`",
471 } else if expected.is_empty() {
472 (format!("unexpected token: `{}`",
475 (format!("expected {}, found `{}`",
483 /// Check for erroneous `ident { }`; if matches, signal error and
484 /// recover (without consuming any expected input token). Returns
485 /// true if and only if input was consumed for recovery.
486 pub fn check_for_erroneous_unit_struct_expecting(&mut self,
487 expected: &[token::Token])
489 if self.token == token::OpenDelim(token::Brace)
490 && expected.iter().all(|t| *t != token::OpenDelim(token::Brace))
491 && self.look_ahead(1, |t| *t == token::CloseDelim(token::Brace)) {
492 // matched; signal non-fatal error and recover.
493 let span = self.span;
495 "unit-like struct construction is written with no trailing `{ }`");
496 try!(self.eat(&token::OpenDelim(token::Brace)));
497 try!(self.eat(&token::CloseDelim(token::Brace)));
504 /// Commit to parsing a complete expression `e` expected to be
505 /// followed by some token from the set edible + inedible. Recover
506 /// from anticipated input errors, discarding erroneous characters.
507 pub fn commit_expr(&mut self, e: &Expr, edible: &[token::Token],
508 inedible: &[token::Token]) -> PResult<()> {
509 debug!("commit_expr {:?}", e);
510 if let ExprPath(..) = e.node {
511 // might be unit-struct construction; check for recoverableinput error.
512 let expected = edible.iter()
514 .chain(inedible.iter().cloned())
515 .collect::<Vec<_>>();
516 try!(self.check_for_erroneous_unit_struct_expecting(&expected[..]));
518 self.expect_one_of(edible, inedible)
521 pub fn commit_expr_expecting(&mut self, e: &Expr, edible: token::Token) -> PResult<()> {
522 self.commit_expr(e, &[edible], &[])
525 /// Commit to parsing a complete statement `s`, which expects to be
526 /// followed by some token from the set edible + inedible. Check
527 /// for recoverable input errors, discarding erroneous characters.
528 pub fn commit_stmt(&mut self, edible: &[token::Token],
529 inedible: &[token::Token]) -> PResult<()> {
532 .map_or(false, |t| t.is_ident() || t.is_path()) {
533 let expected = edible.iter()
535 .chain(inedible.iter().cloned())
536 .collect::<Vec<_>>();
537 try!(self.check_for_erroneous_unit_struct_expecting(&expected));
539 self.expect_one_of(edible, inedible)
542 pub fn commit_stmt_expecting(&mut self, edible: token::Token) -> PResult<()> {
543 self.commit_stmt(&[edible], &[])
546 pub fn parse_ident(&mut self) -> PResult<ast::Ident> {
547 self.check_strict_keywords();
548 try!(self.check_reserved_keywords());
550 token::Ident(i, _) => {
554 token::Interpolated(token::NtIdent(..)) => {
555 self.bug("ident interpolation not converted to real token");
558 let token_str = self.this_token_to_string();
559 Err(self.fatal(&format!("expected ident, found `{}`",
565 pub fn parse_ident_or_self_type(&mut self) -> PResult<ast::Ident> {
566 if self.is_self_type_ident() {
567 self.expect_self_type_ident()
573 pub fn parse_path_list_item(&mut self) -> PResult<ast::PathListItem> {
574 let lo = self.span.lo;
575 let node = if try!(self.eat_keyword(keywords::SelfValue)) {
576 let rename = try!(self.parse_rename());
577 ast::PathListMod { id: ast::DUMMY_NODE_ID, rename: rename }
579 let ident = try!(self.parse_ident());
580 let rename = try!(self.parse_rename());
581 ast::PathListIdent { name: ident, rename: rename, id: ast::DUMMY_NODE_ID }
583 let hi = self.last_span.hi;
584 Ok(spanned(lo, hi, node))
587 /// Check if the next token is `tok`, and return `true` if so.
589 /// This method is will automatically add `tok` to `expected_tokens` if `tok` is not
591 pub fn check(&mut self, tok: &token::Token) -> bool {
592 let is_present = self.token == *tok;
593 if !is_present { self.expected_tokens.push(TokenType::Token(tok.clone())); }
597 /// Consume token 'tok' if it exists. Returns true if the given
598 /// token was present, false otherwise.
599 pub fn eat(&mut self, tok: &token::Token) -> PResult<bool> {
600 let is_present = self.check(tok);
601 if is_present { try!(self.bump())}
605 pub fn check_keyword(&mut self, kw: keywords::Keyword) -> bool {
606 self.expected_tokens.push(TokenType::Keyword(kw));
607 self.token.is_keyword(kw)
610 /// If the next token is the given keyword, eat it and return
611 /// true. Otherwise, return false.
612 pub fn eat_keyword(&mut self, kw: keywords::Keyword) -> PResult<bool> {
613 if self.check_keyword(kw) {
621 pub fn eat_keyword_noexpect(&mut self, kw: keywords::Keyword) -> PResult<bool> {
622 if self.token.is_keyword(kw) {
630 /// If the given word is not a keyword, signal an error.
631 /// If the next token is not the given word, signal an error.
632 /// Otherwise, eat it.
633 pub fn expect_keyword(&mut self, kw: keywords::Keyword) -> PResult<()> {
634 if !try!(self.eat_keyword(kw) ){
635 self.expect_one_of(&[], &[])
641 /// Signal an error if the given string is a strict keyword
642 pub fn check_strict_keywords(&mut self) {
643 if self.token.is_strict_keyword() {
644 let token_str = self.this_token_to_string();
645 let span = self.span;
647 &format!("expected identifier, found keyword `{}`",
652 /// Signal an error if the current token is a reserved keyword
653 pub fn check_reserved_keywords(&mut self) -> PResult<()>{
654 if self.token.is_reserved_keyword() {
655 let token_str = self.this_token_to_string();
656 Err(self.fatal(&format!("`{}` is a reserved keyword",
663 /// Expect and consume an `&`. If `&&` is seen, replace it with a single
664 /// `&` and continue. If an `&` is not seen, signal an error.
665 fn expect_and(&mut self) -> PResult<()> {
666 self.expected_tokens.push(TokenType::Token(token::BinOp(token::And)));
668 token::BinOp(token::And) => self.bump(),
670 let span = self.span;
671 let lo = span.lo + BytePos(1);
672 Ok(self.replace_token(token::BinOp(token::And), lo, span.hi))
674 _ => self.expect_one_of(&[], &[])
678 pub fn expect_no_suffix(&self, sp: Span, kind: &str, suffix: Option<ast::Name>) {
680 None => {/* everything ok */}
682 let text = suf.as_str();
684 self.span_bug(sp, "found empty literal suffix in Some")
686 self.span_err(sp, &*format!("{} with a suffix is invalid", kind));
692 /// Attempt to consume a `<`. If `<<` is seen, replace it with a single
693 /// `<` and continue. If a `<` is not seen, return false.
695 /// This is meant to be used when parsing generics on a path to get the
697 fn eat_lt(&mut self) -> PResult<bool> {
698 self.expected_tokens.push(TokenType::Token(token::Lt));
700 token::Lt => { try!(self.bump()); Ok(true)}
701 token::BinOp(token::Shl) => {
702 let span = self.span;
703 let lo = span.lo + BytePos(1);
704 self.replace_token(token::Lt, lo, span.hi);
711 fn expect_lt(&mut self) -> PResult<()> {
712 if !try!(self.eat_lt()) {
713 self.expect_one_of(&[], &[])
719 /// Expect and consume a GT. if a >> is seen, replace it
720 /// with a single > and continue. If a GT is not seen,
722 pub fn expect_gt(&mut self) -> PResult<()> {
723 self.expected_tokens.push(TokenType::Token(token::Gt));
725 token::Gt => self.bump(),
726 token::BinOp(token::Shr) => {
727 let span = self.span;
728 let lo = span.lo + BytePos(1);
729 Ok(self.replace_token(token::Gt, lo, span.hi))
731 token::BinOpEq(token::Shr) => {
732 let span = self.span;
733 let lo = span.lo + BytePos(1);
734 Ok(self.replace_token(token::Ge, lo, span.hi))
737 let span = self.span;
738 let lo = span.lo + BytePos(1);
739 Ok(self.replace_token(token::Eq, lo, span.hi))
742 let gt_str = Parser::token_to_string(&token::Gt);
743 let this_token_str = self.this_token_to_string();
744 Err(self.fatal(&format!("expected `{}`, found `{}`",
751 pub fn parse_seq_to_before_gt_or_return<T, F>(&mut self,
752 sep: Option<token::Token>,
754 -> PResult<(OwnedSlice<T>, bool)> where
755 F: FnMut(&mut Parser) -> PResult<Option<T>>,
757 let mut v = Vec::new();
758 // This loop works by alternating back and forth between parsing types
759 // and commas. For example, given a string `A, B,>`, the parser would
760 // first parse `A`, then a comma, then `B`, then a comma. After that it
761 // would encounter a `>` and stop. This lets the parser handle trailing
762 // commas in generic parameters, because it can stop either after
763 // parsing a type or after parsing a comma.
765 if self.check(&token::Gt)
766 || self.token == token::BinOp(token::Shr)
767 || self.token == token::Ge
768 || self.token == token::BinOpEq(token::Shr) {
773 match try!(f(self)) {
774 Some(result) => v.push(result),
775 None => return Ok((OwnedSlice::from_vec(v), true))
778 if let Some(t) = sep.as_ref() {
779 try!(self.expect(t));
784 return Ok((OwnedSlice::from_vec(v), false));
787 /// Parse a sequence bracketed by '<' and '>', stopping
789 pub fn parse_seq_to_before_gt<T, F>(&mut self,
790 sep: Option<token::Token>,
792 -> PResult<OwnedSlice<T>> where
793 F: FnMut(&mut Parser) -> PResult<T>,
795 let (result, returned) = try!(self.parse_seq_to_before_gt_or_return(sep,
796 |p| Ok(Some(try!(f(p))))));
801 pub fn parse_seq_to_gt<T, F>(&mut self,
802 sep: Option<token::Token>,
804 -> PResult<OwnedSlice<T>> where
805 F: FnMut(&mut Parser) -> PResult<T>,
807 let v = try!(self.parse_seq_to_before_gt(sep, f));
808 try!(self.expect_gt());
812 pub fn parse_seq_to_gt_or_return<T, F>(&mut self,
813 sep: Option<token::Token>,
815 -> PResult<(OwnedSlice<T>, bool)> where
816 F: FnMut(&mut Parser) -> PResult<Option<T>>,
818 let (v, returned) = try!(self.parse_seq_to_before_gt_or_return(sep, f));
820 try!(self.expect_gt());
822 return Ok((v, returned));
825 /// Parse a sequence, including the closing delimiter. The function
826 /// f must consume tokens until reaching the next separator or
828 pub fn parse_seq_to_end<T, F>(&mut self,
832 -> PResult<Vec<T>> where
833 F: FnMut(&mut Parser) -> PResult<T>,
835 let val = try!(self.parse_seq_to_before_end(ket, sep, f));
840 /// Parse a sequence, not including the closing delimiter. The function
841 /// f must consume tokens until reaching the next separator or
843 pub fn parse_seq_to_before_end<T, F>(&mut self,
847 -> PResult<Vec<T>> where
848 F: FnMut(&mut Parser) -> PResult<T>,
850 let mut first: bool = true;
852 while self.token != *ket {
855 if first { first = false; }
856 else { try!(self.expect(t)); }
860 if sep.trailing_sep_allowed && self.check(ket) { break; }
861 v.push(try!(f(self)));
866 /// Parse a sequence, including the closing delimiter. The function
867 /// f must consume tokens until reaching the next separator or
869 pub fn parse_unspanned_seq<T, F>(&mut self,
874 -> PResult<Vec<T>> where
875 F: FnMut(&mut Parser) -> PResult<T>,
877 try!(self.expect(bra));
878 let result = try!(self.parse_seq_to_before_end(ket, sep, f));
883 /// Parse a sequence parameter of enum variant. For consistency purposes,
884 /// these should not be empty.
885 pub fn parse_enum_variant_seq<T, F>(&mut self,
890 -> PResult<Vec<T>> where
891 F: FnMut(&mut Parser) -> PResult<T>,
893 let result = try!(self.parse_unspanned_seq(bra, ket, sep, f));
894 if result.is_empty() {
895 let last_span = self.last_span;
896 self.span_err(last_span,
897 "nullary enum variants are written with no trailing `( )`");
902 // NB: Do not use this function unless you actually plan to place the
903 // spanned list in the AST.
904 pub fn parse_seq<T, F>(&mut self,
909 -> PResult<Spanned<Vec<T>>> where
910 F: FnMut(&mut Parser) -> PResult<T>,
912 let lo = self.span.lo;
913 try!(self.expect(bra));
914 let result = try!(self.parse_seq_to_before_end(ket, sep, f));
915 let hi = self.span.hi;
917 Ok(spanned(lo, hi, result))
920 /// Advance the parser by one token
921 pub fn bump(&mut self) -> PResult<()> {
922 self.last_span = self.span;
923 // Stash token for error recovery (sometimes; clone is not necessarily cheap).
924 self.last_token = if self.token.is_ident() ||
925 self.token.is_path() ||
926 self.token == token::Comma {
927 Some(Box::new(self.token.clone()))
931 let next = if self.buffer_start == self.buffer_end {
932 self.reader.real_token()
934 // Avoid token copies with `replace`.
935 let buffer_start = self.buffer_start as usize;
936 let next_index = (buffer_start + 1) & 3;
937 self.buffer_start = next_index as isize;
939 let placeholder = TokenAndSpan {
940 tok: token::Underscore,
943 mem::replace(&mut self.buffer[buffer_start], placeholder)
946 self.token = next.tok;
947 self.tokens_consumed += 1;
948 self.expected_tokens.clear();
949 // check after each token
950 self.check_unknown_macro_variable()
953 /// Advance the parser by one token and return the bumped token.
954 pub fn bump_and_get(&mut self) -> PResult<token::Token> {
955 let old_token = mem::replace(&mut self.token, token::Underscore);
960 /// EFFECT: replace the current token and span with the given one
961 pub fn replace_token(&mut self,
965 self.last_span = mk_sp(self.span.lo, lo);
967 self.span = mk_sp(lo, hi);
969 pub fn buffer_length(&mut self) -> isize {
970 if self.buffer_start <= self.buffer_end {
971 return self.buffer_end - self.buffer_start;
973 return (4 - self.buffer_start) + self.buffer_end;
975 pub fn look_ahead<R, F>(&mut self, distance: usize, f: F) -> R where
976 F: FnOnce(&token::Token) -> R,
978 let dist = distance as isize;
979 while self.buffer_length() < dist {
980 self.buffer[self.buffer_end as usize] = self.reader.real_token();
981 self.buffer_end = (self.buffer_end + 1) & 3;
983 f(&self.buffer[((self.buffer_start + dist - 1) & 3) as usize].tok)
985 pub fn fatal(&self, m: &str) -> errors::FatalError {
986 self.sess.span_diagnostic.span_fatal(self.span, m)
988 pub fn span_fatal(&self, sp: Span, m: &str) -> errors::FatalError {
989 self.sess.span_diagnostic.span_fatal(sp, m)
991 pub fn span_fatal_help(&self, sp: Span, m: &str, help: &str) -> errors::FatalError {
992 self.span_err(sp, m);
993 self.fileline_help(sp, help);
996 pub fn span_note(&self, sp: Span, m: &str) {
997 self.sess.span_diagnostic.span_note(sp, m)
999 pub fn span_help(&self, sp: Span, m: &str) {
1000 self.sess.span_diagnostic.span_help(sp, m)
1002 pub fn span_suggestion(&self, sp: Span, m: &str, n: String) {
1003 self.sess.span_diagnostic.span_suggestion(sp, m, n)
1005 pub fn fileline_help(&self, sp: Span, m: &str) {
1006 self.sess.span_diagnostic.fileline_help(sp, m)
1008 pub fn bug(&self, m: &str) -> ! {
1009 self.sess.span_diagnostic.span_bug(self.span, m)
1011 pub fn warn(&self, m: &str) {
1012 self.sess.span_diagnostic.span_warn(self.span, m)
1014 pub fn span_warn(&self, sp: Span, m: &str) {
1015 self.sess.span_diagnostic.span_warn(sp, m)
1017 pub fn span_err(&self, sp: Span, m: &str) {
1018 self.sess.span_diagnostic.span_err(sp, m)
1020 pub fn span_bug(&self, sp: Span, m: &str) -> ! {
1021 self.sess.span_diagnostic.span_bug(sp, m)
1023 pub fn abort_if_errors(&self) {
1024 self.sess.span_diagnostic.abort_if_errors();
1027 pub fn id_to_interned_str(&mut self, id: Ident) -> InternedString {
1031 /// Is the current token one of the keywords that signals a bare function
1033 pub fn token_is_bare_fn_keyword(&mut self) -> bool {
1034 self.check_keyword(keywords::Fn) ||
1035 self.check_keyword(keywords::Unsafe) ||
1036 self.check_keyword(keywords::Extern)
1039 pub fn get_lifetime(&mut self) -> ast::Ident {
1041 token::Lifetime(ref ident) => *ident,
1042 _ => self.bug("not a lifetime"),
1046 pub fn parse_for_in_type(&mut self) -> PResult<Ty_> {
1048 Parses whatever can come after a `for` keyword in a type.
1049 The `for` has already been consumed.
1053 - for <'lt> |S| -> T
1057 - for <'lt> [unsafe] [extern "ABI"] fn (S) -> T
1058 - for <'lt> path::foo(a, b)
1063 let lo = self.span.lo;
1065 let lifetime_defs = try!(self.parse_late_bound_lifetime_defs());
1067 // examine next token to decide to do
1068 if self.token_is_bare_fn_keyword() {
1069 self.parse_ty_bare_fn(lifetime_defs)
1071 let hi = self.span.hi;
1072 let trait_ref = try!(self.parse_trait_ref());
1073 let poly_trait_ref = ast::PolyTraitRef { bound_lifetimes: lifetime_defs,
1074 trait_ref: trait_ref,
1075 span: mk_sp(lo, hi)};
1076 let other_bounds = if try!(self.eat(&token::BinOp(token::Plus)) ){
1077 try!(self.parse_ty_param_bounds(BoundParsingMode::Bare))
1082 Some(TraitTyParamBound(poly_trait_ref, TraitBoundModifier::None)).into_iter()
1083 .chain(other_bounds.into_vec())
1085 Ok(ast::TyPolyTraitRef(all_bounds))
1089 pub fn parse_ty_path(&mut self) -> PResult<Ty_> {
1090 Ok(TyPath(None, try!(self.parse_path(LifetimeAndTypesWithoutColons))))
1093 /// parse a TyBareFn type:
1094 pub fn parse_ty_bare_fn(&mut self, lifetime_defs: Vec<ast::LifetimeDef>) -> PResult<Ty_> {
1097 [unsafe] [extern "ABI"] fn <'lt> (S) -> T
1098 ^~~~^ ^~~~^ ^~~~^ ^~^ ^
1101 | | | Argument types
1107 let unsafety = try!(self.parse_unsafety());
1108 let abi = if try!(self.eat_keyword(keywords::Extern) ){
1109 try!(self.parse_opt_abi()).unwrap_or(abi::C)
1114 try!(self.expect_keyword(keywords::Fn));
1115 let (inputs, variadic) = try!(self.parse_fn_args(false, true));
1116 let ret_ty = try!(self.parse_ret_ty());
1117 let decl = P(FnDecl {
1122 Ok(TyBareFn(P(BareFnTy {
1125 lifetimes: lifetime_defs,
1130 /// Parses an obsolete closure kind (`&:`, `&mut:`, or `:`).
1131 pub fn parse_obsolete_closure_kind(&mut self) -> PResult<()> {
1132 let lo = self.span.lo;
1134 self.check(&token::BinOp(token::And)) &&
1135 self.look_ahead(1, |t| t.is_keyword(keywords::Mut)) &&
1136 self.look_ahead(2, |t| *t == token::Colon)
1142 self.token == token::BinOp(token::And) &&
1143 self.look_ahead(1, |t| *t == token::Colon)
1148 try!(self.eat(&token::Colon))
1155 let span = mk_sp(lo, self.span.hi);
1156 self.obsolete(span, ObsoleteSyntax::ClosureKind);
1160 pub fn parse_unsafety(&mut self) -> PResult<Unsafety> {
1161 if try!(self.eat_keyword(keywords::Unsafe)) {
1162 return Ok(Unsafety::Unsafe);
1164 return Ok(Unsafety::Normal);
1168 /// Parse the items in a trait declaration
1169 pub fn parse_trait_items(&mut self) -> PResult<Vec<P<TraitItem>>> {
1170 self.parse_unspanned_seq(
1171 &token::OpenDelim(token::Brace),
1172 &token::CloseDelim(token::Brace),
1174 |p| -> PResult<P<TraitItem>> {
1175 maybe_whole!(no_clone p, NtTraitItem);
1176 let mut attrs = try!(p.parse_outer_attributes());
1179 let (name, node) = if try!(p.eat_keyword(keywords::Type)) {
1180 let TyParam {ident, bounds, default, ..} = try!(p.parse_ty_param());
1181 try!(p.expect(&token::Semi));
1182 (ident, TypeTraitItem(bounds, default))
1183 } else if p.is_const_item() {
1184 try!(p.expect_keyword(keywords::Const));
1185 let ident = try!(p.parse_ident());
1186 try!(p.expect(&token::Colon));
1187 let ty = try!(p.parse_ty_sum());
1188 let default = if p.check(&token::Eq) {
1190 let expr = try!(p.parse_expr());
1191 try!(p.commit_expr_expecting(&expr, token::Semi));
1194 try!(p.expect(&token::Semi));
1197 (ident, ConstTraitItem(ty, default))
1199 let (constness, unsafety, abi) = try!(p.parse_fn_front_matter());
1201 let ident = try!(p.parse_ident());
1202 let mut generics = try!(p.parse_generics());
1204 let (explicit_self, d) = try!(p.parse_fn_decl_with_self(|p|{
1205 // This is somewhat dubious; We don't want to allow
1206 // argument names to be left off if there is a
1208 p.parse_arg_general(false)
1211 generics.where_clause = try!(p.parse_where_clause());
1212 let sig = ast::MethodSig {
1214 constness: constness,
1218 explicit_self: explicit_self,
1221 let body = match p.token {
1224 debug!("parse_trait_methods(): parsing required method");
1227 token::OpenDelim(token::Brace) => {
1228 debug!("parse_trait_methods(): parsing provided method");
1229 let (inner_attrs, body) =
1230 try!(p.parse_inner_attrs_and_block());
1231 attrs.extend(inner_attrs.iter().cloned());
1236 let token_str = p.this_token_to_string();
1237 return Err(p.fatal(&format!("expected `;` or `{{`, found `{}`",
1241 (ident, ast::MethodTraitItem(sig, body))
1245 id: ast::DUMMY_NODE_ID,
1249 span: mk_sp(lo, p.last_span.hi),
1254 /// Parse a possibly mutable type
1255 pub fn parse_mt(&mut self) -> PResult<MutTy> {
1256 let mutbl = try!(self.parse_mutability());
1257 let t = try!(self.parse_ty());
1258 Ok(MutTy { ty: t, mutbl: mutbl })
1261 /// Parse optional return type [ -> TY ] in function decl
1262 pub fn parse_ret_ty(&mut self) -> PResult<FunctionRetTy> {
1263 if try!(self.eat(&token::RArrow) ){
1264 if try!(self.eat(&token::Not) ){
1265 Ok(NoReturn(self.last_span))
1267 Ok(Return(try!(self.parse_ty())))
1270 let pos = self.span.lo;
1271 Ok(DefaultReturn(mk_sp(pos, pos)))
1275 /// Parse a type in a context where `T1+T2` is allowed.
1276 pub fn parse_ty_sum(&mut self) -> PResult<P<Ty>> {
1277 let lo = self.span.lo;
1278 let lhs = try!(self.parse_ty());
1280 if !try!(self.eat(&token::BinOp(token::Plus)) ){
1284 let bounds = try!(self.parse_ty_param_bounds(BoundParsingMode::Bare));
1286 // In type grammar, `+` is treated like a binary operator,
1287 // and hence both L and R side are required.
1288 if bounds.is_empty() {
1289 let last_span = self.last_span;
1290 self.span_err(last_span,
1291 "at least one type parameter bound \
1292 must be specified");
1295 let sp = mk_sp(lo, self.last_span.hi);
1296 let sum = ast::TyObjectSum(lhs, bounds);
1297 Ok(P(Ty {id: ast::DUMMY_NODE_ID, node: sum, span: sp}))
1301 pub fn parse_ty(&mut self) -> PResult<P<Ty>> {
1302 maybe_whole!(no_clone self, NtTy);
1304 let lo = self.span.lo;
1306 let t = if self.check(&token::OpenDelim(token::Paren)) {
1309 // (t) is a parenthesized ty
1310 // (t,) is the type of a tuple with only one field,
1312 let mut ts = vec![];
1313 let mut last_comma = false;
1314 while self.token != token::CloseDelim(token::Paren) {
1315 ts.push(try!(self.parse_ty_sum()));
1316 if self.check(&token::Comma) {
1325 try!(self.expect(&token::CloseDelim(token::Paren)));
1326 if ts.len() == 1 && !last_comma {
1327 TyParen(ts.into_iter().nth(0).unwrap())
1331 } else if self.check(&token::BinOp(token::Star)) {
1332 // STAR POINTER (bare pointer?)
1334 TyPtr(try!(self.parse_ptr()))
1335 } else if self.check(&token::OpenDelim(token::Bracket)) {
1337 try!(self.expect(&token::OpenDelim(token::Bracket)));
1338 let t = try!(self.parse_ty_sum());
1340 // Parse the `; e` in `[ i32; e ]`
1341 // where `e` is a const expression
1342 let t = match try!(self.maybe_parse_fixed_length_of_vec()) {
1344 Some(suffix) => TyFixedLengthVec(t, suffix)
1346 try!(self.expect(&token::CloseDelim(token::Bracket)));
1348 } else if self.check(&token::BinOp(token::And)) ||
1349 self.token == token::AndAnd {
1351 try!(self.expect_and());
1352 try!(self.parse_borrowed_pointee())
1353 } else if self.check_keyword(keywords::For) {
1354 try!(self.parse_for_in_type())
1355 } else if self.token_is_bare_fn_keyword() {
1357 try!(self.parse_ty_bare_fn(Vec::new()))
1358 } else if try!(self.eat_keyword_noexpect(keywords::Typeof)) {
1360 // In order to not be ambiguous, the type must be surrounded by parens.
1361 try!(self.expect(&token::OpenDelim(token::Paren)));
1362 let e = try!(self.parse_expr());
1363 try!(self.expect(&token::CloseDelim(token::Paren)));
1365 } else if try!(self.eat_lt()) {
1368 try!(self.parse_qualified_path(NoTypesAllowed));
1370 TyPath(Some(qself), path)
1371 } else if self.check(&token::ModSep) ||
1372 self.token.is_ident() ||
1373 self.token.is_path() {
1374 let path = try!(self.parse_path(LifetimeAndTypesWithoutColons));
1375 if self.check(&token::Not) {
1378 let delim = try!(self.expect_open_delim());
1379 let tts = try!(self.parse_seq_to_end(&token::CloseDelim(delim),
1381 |p| p.parse_token_tree()));
1382 let hi = self.span.hi;
1383 TyMac(spanned(lo, hi, Mac_ { path: path, tts: tts, ctxt: EMPTY_CTXT }))
1388 } else if try!(self.eat(&token::Underscore) ){
1389 // TYPE TO BE INFERRED
1392 let this_token_str = self.this_token_to_string();
1393 let msg = format!("expected type, found `{}`", this_token_str);
1394 return Err(self.fatal(&msg[..]));
1397 let sp = mk_sp(lo, self.last_span.hi);
1398 Ok(P(Ty {id: ast::DUMMY_NODE_ID, node: t, span: sp}))
1401 pub fn parse_borrowed_pointee(&mut self) -> PResult<Ty_> {
1402 // look for `&'lt` or `&'foo ` and interpret `foo` as the region name:
1403 let opt_lifetime = try!(self.parse_opt_lifetime());
1405 let mt = try!(self.parse_mt());
1406 return Ok(TyRptr(opt_lifetime, mt));
1409 pub fn parse_ptr(&mut self) -> PResult<MutTy> {
1410 let mutbl = if try!(self.eat_keyword(keywords::Mut) ){
1412 } else if try!(self.eat_keyword(keywords::Const) ){
1415 let span = self.last_span;
1417 "bare raw pointers are no longer allowed, you should \
1418 likely use `*mut T`, but otherwise `*T` is now \
1419 known as `*const T`");
1422 let t = try!(self.parse_ty());
1423 Ok(MutTy { ty: t, mutbl: mutbl })
1426 pub fn is_named_argument(&mut self) -> bool {
1427 let offset = match self.token {
1428 token::BinOp(token::And) => 1,
1430 _ if self.token.is_keyword(keywords::Mut) => 1,
1434 debug!("parser is_named_argument offset:{}", offset);
1437 is_plain_ident_or_underscore(&self.token)
1438 && self.look_ahead(1, |t| *t == token::Colon)
1440 self.look_ahead(offset, |t| is_plain_ident_or_underscore(t))
1441 && self.look_ahead(offset + 1, |t| *t == token::Colon)
1445 /// This version of parse arg doesn't necessarily require
1446 /// identifier names.
1447 pub fn parse_arg_general(&mut self, require_name: bool) -> PResult<Arg> {
1448 maybe_whole!(no_clone self, NtArg);
1450 let pat = if require_name || self.is_named_argument() {
1451 debug!("parse_arg_general parse_pat (require_name:{})",
1453 let pat = try!(self.parse_pat());
1455 try!(self.expect(&token::Colon));
1458 debug!("parse_arg_general ident_to_pat");
1459 ast_util::ident_to_pat(ast::DUMMY_NODE_ID,
1461 special_idents::invalid)
1464 let t = try!(self.parse_ty_sum());
1469 id: ast::DUMMY_NODE_ID,
1473 /// Parse a single function argument
1474 pub fn parse_arg(&mut self) -> PResult<Arg> {
1475 self.parse_arg_general(true)
1478 /// Parse an argument in a lambda header e.g. |arg, arg|
1479 pub fn parse_fn_block_arg(&mut self) -> PResult<Arg> {
1480 let pat = try!(self.parse_pat());
1481 let t = if try!(self.eat(&token::Colon) ){
1482 try!(self.parse_ty_sum())
1485 id: ast::DUMMY_NODE_ID,
1487 span: mk_sp(self.span.lo, self.span.hi),
1493 id: ast::DUMMY_NODE_ID
1497 pub fn maybe_parse_fixed_length_of_vec(&mut self) -> PResult<Option<P<ast::Expr>>> {
1498 if self.check(&token::Semi) {
1500 Ok(Some(try!(self.parse_expr())))
1506 /// Matches token_lit = LIT_INTEGER | ...
1507 pub fn lit_from_token(&self, tok: &token::Token) -> PResult<Lit_> {
1509 token::Interpolated(token::NtExpr(ref v)) => {
1511 ExprLit(ref lit) => { Ok(lit.node.clone()) }
1512 _ => { return Err(self.unexpected_last(tok)); }
1515 token::Literal(lit, suf) => {
1516 let (suffix_illegal, out) = match lit {
1517 token::Byte(i) => (true, LitByte(parse::byte_lit(&i.as_str()).0)),
1518 token::Char(i) => (true, LitChar(parse::char_lit(&i.as_str()).0)),
1520 // there are some valid suffixes for integer and
1521 // float literals, so all the handling is done
1523 token::Integer(s) => {
1524 (false, parse::integer_lit(&s.as_str(),
1525 suf.as_ref().map(|s| s.as_str()),
1526 &self.sess.span_diagnostic,
1529 token::Float(s) => {
1530 (false, parse::float_lit(&s.as_str(),
1531 suf.as_ref().map(|s| s.as_str()),
1532 &self.sess.span_diagnostic,
1538 LitStr(token::intern_and_get_ident(&parse::str_lit(&s.as_str())),
1541 token::StrRaw(s, n) => {
1544 token::intern_and_get_ident(&parse::raw_str_lit(&s.as_str())),
1547 token::ByteStr(i) =>
1548 (true, LitByteStr(parse::byte_str_lit(&i.as_str()))),
1549 token::ByteStrRaw(i, _) =>
1551 LitByteStr(Rc::new(i.to_string().into_bytes()))),
1555 let sp = self.last_span;
1556 self.expect_no_suffix(sp, &*format!("{} literal", lit.short_name()), suf)
1561 _ => { return Err(self.unexpected_last(tok)); }
1565 /// Matches lit = true | false | token_lit
1566 pub fn parse_lit(&mut self) -> PResult<Lit> {
1567 let lo = self.span.lo;
1568 let lit = if try!(self.eat_keyword(keywords::True) ){
1570 } else if try!(self.eat_keyword(keywords::False) ){
1573 let token = try!(self.bump_and_get());
1574 let lit = try!(self.lit_from_token(&token));
1577 Ok(codemap::Spanned { node: lit, span: mk_sp(lo, self.last_span.hi) })
1580 /// matches '-' lit | lit
1581 pub fn parse_pat_literal_maybe_minus(&mut self) -> PResult<P<Expr>> {
1582 let minus_lo = self.span.lo;
1583 let minus_present = try!(self.eat(&token::BinOp(token::Minus)));
1584 let lo = self.span.lo;
1585 let literal = P(try!(self.parse_lit()));
1586 let hi = self.last_span.hi;
1587 let expr = self.mk_expr(lo, hi, ExprLit(literal), None);
1590 let minus_hi = self.last_span.hi;
1591 let unary = self.mk_unary(UnNeg, expr);
1592 Ok(self.mk_expr(minus_lo, minus_hi, unary, None))
1598 /// Parses qualified path.
1600 /// Assumes that the leading `<` has been parsed already.
1602 /// Qualifed paths are a part of the universal function call
1605 /// `qualified_path = <type [as trait_ref]>::path`
1607 /// See `parse_path` for `mode` meaning.
1612 /// `<T as U>::F::a::<S>`
1613 pub fn parse_qualified_path(&mut self, mode: PathParsingMode)
1614 -> PResult<(QSelf, ast::Path)> {
1615 let span = self.last_span;
1616 let self_type = try!(self.parse_ty_sum());
1617 let mut path = if try!(self.eat_keyword(keywords::As)) {
1618 try!(self.parse_path(LifetimeAndTypesWithoutColons))
1629 position: path.segments.len()
1632 try!(self.expect(&token::Gt));
1633 try!(self.expect(&token::ModSep));
1635 let segments = match mode {
1636 LifetimeAndTypesWithoutColons => {
1637 try!(self.parse_path_segments_without_colons())
1639 LifetimeAndTypesWithColons => {
1640 try!(self.parse_path_segments_with_colons())
1643 try!(self.parse_path_segments_without_types())
1646 path.segments.extend(segments);
1648 path.span.hi = self.last_span.hi;
1653 /// Parses a path and optional type parameter bounds, depending on the
1654 /// mode. The `mode` parameter determines whether lifetimes, types, and/or
1655 /// bounds are permitted and whether `::` must precede type parameter
1657 pub fn parse_path(&mut self, mode: PathParsingMode) -> PResult<ast::Path> {
1658 // Check for a whole path...
1659 let found = match self.token {
1660 token::Interpolated(token::NtPath(_)) => Some(try!(self.bump_and_get())),
1663 if let Some(token::Interpolated(token::NtPath(path))) = found {
1667 let lo = self.span.lo;
1668 let is_global = try!(self.eat(&token::ModSep));
1670 // Parse any number of segments and bound sets. A segment is an
1671 // identifier followed by an optional lifetime and a set of types.
1672 // A bound set is a set of type parameter bounds.
1673 let segments = match mode {
1674 LifetimeAndTypesWithoutColons => {
1675 try!(self.parse_path_segments_without_colons())
1677 LifetimeAndTypesWithColons => {
1678 try!(self.parse_path_segments_with_colons())
1681 try!(self.parse_path_segments_without_types())
1685 // Assemble the span.
1686 let span = mk_sp(lo, self.last_span.hi);
1688 // Assemble the result.
1697 /// - `a::b<T,U>::c<V,W>`
1698 /// - `a::b<T,U>::c(V) -> W`
1699 /// - `a::b<T,U>::c(V)`
1700 pub fn parse_path_segments_without_colons(&mut self) -> PResult<Vec<ast::PathSegment>> {
1701 let mut segments = Vec::new();
1703 // First, parse an identifier.
1704 let identifier = try!(self.parse_ident_or_self_type());
1706 // Parse types, optionally.
1707 let parameters = if try!(self.eat_lt() ){
1708 let (lifetimes, types, bindings) = try!(self.parse_generic_values_after_lt());
1710 ast::AngleBracketedParameters(ast::AngleBracketedParameterData {
1711 lifetimes: lifetimes,
1712 types: OwnedSlice::from_vec(types),
1713 bindings: OwnedSlice::from_vec(bindings),
1715 } else if try!(self.eat(&token::OpenDelim(token::Paren)) ){
1716 let lo = self.last_span.lo;
1718 let inputs = try!(self.parse_seq_to_end(
1719 &token::CloseDelim(token::Paren),
1720 seq_sep_trailing_allowed(token::Comma),
1721 |p| p.parse_ty_sum()));
1723 let output_ty = if try!(self.eat(&token::RArrow) ){
1724 Some(try!(self.parse_ty()))
1729 let hi = self.last_span.hi;
1731 ast::ParenthesizedParameters(ast::ParenthesizedParameterData {
1732 span: mk_sp(lo, hi),
1737 ast::PathParameters::none()
1740 // Assemble and push the result.
1741 segments.push(ast::PathSegment { identifier: identifier,
1742 parameters: parameters });
1744 // Continue only if we see a `::`
1745 if !try!(self.eat(&token::ModSep) ){
1746 return Ok(segments);
1752 /// - `a::b::<T,U>::c`
1753 pub fn parse_path_segments_with_colons(&mut self) -> PResult<Vec<ast::PathSegment>> {
1754 let mut segments = Vec::new();
1756 // First, parse an identifier.
1757 let identifier = try!(self.parse_ident_or_self_type());
1759 // If we do not see a `::`, stop.
1760 if !try!(self.eat(&token::ModSep) ){
1761 segments.push(ast::PathSegment {
1762 identifier: identifier,
1763 parameters: ast::PathParameters::none()
1765 return Ok(segments);
1768 // Check for a type segment.
1769 if try!(self.eat_lt() ){
1770 // Consumed `a::b::<`, go look for types
1771 let (lifetimes, types, bindings) = try!(self.parse_generic_values_after_lt());
1772 segments.push(ast::PathSegment {
1773 identifier: identifier,
1774 parameters: ast::AngleBracketedParameters(ast::AngleBracketedParameterData {
1775 lifetimes: lifetimes,
1776 types: OwnedSlice::from_vec(types),
1777 bindings: OwnedSlice::from_vec(bindings),
1781 // Consumed `a::b::<T,U>`, check for `::` before proceeding
1782 if !try!(self.eat(&token::ModSep) ){
1783 return Ok(segments);
1786 // Consumed `a::`, go look for `b`
1787 segments.push(ast::PathSegment {
1788 identifier: identifier,
1789 parameters: ast::PathParameters::none(),
1798 pub fn parse_path_segments_without_types(&mut self) -> PResult<Vec<ast::PathSegment>> {
1799 let mut segments = Vec::new();
1801 // First, parse an identifier.
1802 let identifier = try!(self.parse_ident_or_self_type());
1804 // Assemble and push the result.
1805 segments.push(ast::PathSegment {
1806 identifier: identifier,
1807 parameters: ast::PathParameters::none()
1810 // If we do not see a `::`, stop.
1811 if !try!(self.eat(&token::ModSep) ){
1812 return Ok(segments);
1817 /// parses 0 or 1 lifetime
1818 pub fn parse_opt_lifetime(&mut self) -> PResult<Option<ast::Lifetime>> {
1820 token::Lifetime(..) => {
1821 Ok(Some(try!(self.parse_lifetime())))
1829 /// Parses a single lifetime
1830 /// Matches lifetime = LIFETIME
1831 pub fn parse_lifetime(&mut self) -> PResult<ast::Lifetime> {
1833 token::Lifetime(i) => {
1834 let span = self.span;
1836 return Ok(ast::Lifetime {
1837 id: ast::DUMMY_NODE_ID,
1843 return Err(self.fatal("expected a lifetime name"));
1848 /// Parses `lifetime_defs = [ lifetime_defs { ',' lifetime_defs } ]` where `lifetime_def =
1849 /// lifetime [':' lifetimes]`
1850 pub fn parse_lifetime_defs(&mut self) -> PResult<Vec<ast::LifetimeDef>> {
1852 let mut res = Vec::new();
1855 token::Lifetime(_) => {
1856 let lifetime = try!(self.parse_lifetime());
1858 if try!(self.eat(&token::Colon) ){
1859 try!(self.parse_lifetimes(token::BinOp(token::Plus)))
1863 res.push(ast::LifetimeDef { lifetime: lifetime,
1873 token::Comma => { try!(self.bump());}
1874 token::Gt => { return Ok(res); }
1875 token::BinOp(token::Shr) => { return Ok(res); }
1877 let this_token_str = self.this_token_to_string();
1878 let msg = format!("expected `,` or `>` after lifetime \
1881 return Err(self.fatal(&msg[..]));
1887 /// matches lifetimes = ( lifetime ) | ( lifetime , lifetimes ) actually, it matches the empty
1888 /// one too, but putting that in there messes up the grammar....
1890 /// Parses zero or more comma separated lifetimes. Expects each lifetime to be followed by
1891 /// either a comma or `>`. Used when parsing type parameter lists, where we expect something
1892 /// like `<'a, 'b, T>`.
1893 pub fn parse_lifetimes(&mut self, sep: token::Token) -> PResult<Vec<ast::Lifetime>> {
1895 let mut res = Vec::new();
1898 token::Lifetime(_) => {
1899 res.push(try!(self.parse_lifetime()));
1906 if self.token != sep {
1914 /// Parse mutability declaration (mut/const/imm)
1915 pub fn parse_mutability(&mut self) -> PResult<Mutability> {
1916 if try!(self.eat_keyword(keywords::Mut) ){
1923 /// Parse ident COLON expr
1924 pub fn parse_field(&mut self) -> PResult<Field> {
1925 let lo = self.span.lo;
1926 let i = try!(self.parse_ident());
1927 let hi = self.last_span.hi;
1928 try!(self.expect(&token::Colon));
1929 let e = try!(self.parse_expr());
1931 ident: spanned(lo, hi, i),
1932 span: mk_sp(lo, e.span.hi),
1937 pub fn mk_expr(&mut self, lo: BytePos, hi: BytePos,
1938 node: Expr_, attrs: ThinAttributes) -> P<Expr> {
1940 id: ast::DUMMY_NODE_ID,
1942 span: mk_sp(lo, hi),
1947 pub fn mk_unary(&mut self, unop: ast::UnOp, expr: P<Expr>) -> ast::Expr_ {
1948 ExprUnary(unop, expr)
1951 pub fn mk_binary(&mut self, binop: ast::BinOp, lhs: P<Expr>, rhs: P<Expr>) -> ast::Expr_ {
1952 ExprBinary(binop, lhs, rhs)
1955 pub fn mk_call(&mut self, f: P<Expr>, args: Vec<P<Expr>>) -> ast::Expr_ {
1959 fn mk_method_call(&mut self,
1960 ident: ast::SpannedIdent,
1964 ExprMethodCall(ident, tps, args)
1967 pub fn mk_index(&mut self, expr: P<Expr>, idx: P<Expr>) -> ast::Expr_ {
1968 ExprIndex(expr, idx)
1971 pub fn mk_range(&mut self,
1972 start: Option<P<Expr>>,
1973 end: Option<P<Expr>>)
1975 ExprRange(start, end)
1978 pub fn mk_field(&mut self, expr: P<Expr>, ident: ast::SpannedIdent) -> ast::Expr_ {
1979 ExprField(expr, ident)
1982 pub fn mk_tup_field(&mut self, expr: P<Expr>, idx: codemap::Spanned<usize>) -> ast::Expr_ {
1983 ExprTupField(expr, idx)
1986 pub fn mk_assign_op(&mut self, binop: ast::BinOp,
1987 lhs: P<Expr>, rhs: P<Expr>) -> ast::Expr_ {
1988 ExprAssignOp(binop, lhs, rhs)
1991 pub fn mk_mac_expr(&mut self, lo: BytePos, hi: BytePos,
1992 m: Mac_, attrs: ThinAttributes) -> P<Expr> {
1994 id: ast::DUMMY_NODE_ID,
1995 node: ExprMac(codemap::Spanned {node: m, span: mk_sp(lo, hi)}),
1996 span: mk_sp(lo, hi),
2001 pub fn mk_lit_u32(&mut self, i: u32, attrs: ThinAttributes) -> P<Expr> {
2002 let span = &self.span;
2003 let lv_lit = P(codemap::Spanned {
2004 node: LitInt(i as u64, ast::UnsignedIntLit(TyU32)),
2009 id: ast::DUMMY_NODE_ID,
2010 node: ExprLit(lv_lit),
2016 fn expect_open_delim(&mut self) -> PResult<token::DelimToken> {
2017 self.expected_tokens.push(TokenType::Token(token::Gt));
2019 token::OpenDelim(delim) => {
2023 _ => Err(self.fatal("expected open delimiter")),
2027 /// At the bottom (top?) of the precedence hierarchy,
2028 /// parse things like parenthesized exprs,
2029 /// macros, return, etc.
2031 /// NB: This does not parse outer attributes,
2032 /// and is private because it only works
2033 /// correctly if called from parse_dot_or_call_expr().
2034 fn parse_bottom_expr(&mut self) -> PResult<P<Expr>> {
2035 maybe_whole_expr!(self);
2037 // Outer attributes are already parsed and will be
2038 // added to the return value after the fact.
2040 // Therefore, prevent sub-parser from parsing
2041 // attributes by giving them a empty "already parsed" list.
2042 let mut attrs = None;
2044 let lo = self.span.lo;
2045 let mut hi = self.span.hi;
2049 // Note: when adding new syntax here, don't forget to adjust Token::can_begin_expr().
2051 token::OpenDelim(token::Paren) => {
2054 let attrs = try!(self.parse_inner_attributes())
2058 // (e) is parenthesized e
2059 // (e,) is a tuple with only one field, e
2060 let mut es = vec![];
2061 let mut trailing_comma = false;
2062 while self.token != token::CloseDelim(token::Paren) {
2063 es.push(try!(self.parse_expr()));
2064 try!(self.commit_expr(&**es.last().unwrap(), &[],
2065 &[token::Comma, token::CloseDelim(token::Paren)]));
2066 if self.check(&token::Comma) {
2067 trailing_comma = true;
2071 trailing_comma = false;
2077 hi = self.last_span.hi;
2078 return if es.len() == 1 && !trailing_comma {
2079 Ok(self.mk_expr(lo, hi, ExprParen(es.into_iter().nth(0).unwrap()), attrs))
2081 Ok(self.mk_expr(lo, hi, ExprTup(es), attrs))
2084 token::OpenDelim(token::Brace) => {
2085 return self.parse_block_expr(lo, DefaultBlock, attrs);
2087 token::BinOp(token::Or) | token::OrOr => {
2088 let lo = self.span.lo;
2089 return self.parse_lambda_expr(lo, CaptureByRef, attrs);
2091 token::Ident(id @ ast::Ident {
2092 name: token::SELF_KEYWORD_NAME,
2094 }, token::Plain) => {
2096 let path = ast_util::ident_to_path(mk_sp(lo, hi), id);
2097 ex = ExprPath(None, path);
2098 hi = self.last_span.hi;
2100 token::OpenDelim(token::Bracket) => {
2103 let inner_attrs = try!(self.parse_inner_attributes())
2105 attrs.update(|attrs| attrs.append(inner_attrs));
2107 if self.check(&token::CloseDelim(token::Bracket)) {
2110 ex = ExprVec(Vec::new());
2113 let first_expr = try!(self.parse_expr());
2114 if self.check(&token::Semi) {
2115 // Repeating array syntax: [ 0; 512 ]
2117 let count = try!(self.parse_expr());
2118 try!(self.expect(&token::CloseDelim(token::Bracket)));
2119 ex = ExprRepeat(first_expr, count);
2120 } else if self.check(&token::Comma) {
2121 // Vector with two or more elements.
2123 let remaining_exprs = try!(self.parse_seq_to_end(
2124 &token::CloseDelim(token::Bracket),
2125 seq_sep_trailing_allowed(token::Comma),
2126 |p| Ok(try!(p.parse_expr()))
2128 let mut exprs = vec!(first_expr);
2129 exprs.extend(remaining_exprs);
2130 ex = ExprVec(exprs);
2132 // Vector with one element.
2133 try!(self.expect(&token::CloseDelim(token::Bracket)));
2134 ex = ExprVec(vec!(first_expr));
2137 hi = self.last_span.hi;
2140 if try!(self.eat_lt()){
2142 try!(self.parse_qualified_path(LifetimeAndTypesWithColons));
2144 return Ok(self.mk_expr(lo, hi, ExprPath(Some(qself), path), attrs));
2146 if try!(self.eat_keyword(keywords::Move) ){
2147 let lo = self.last_span.lo;
2148 return self.parse_lambda_expr(lo, CaptureByValue, attrs);
2150 if try!(self.eat_keyword(keywords::If)) {
2151 return self.parse_if_expr(attrs);
2153 if try!(self.eat_keyword(keywords::For) ){
2154 let lo = self.last_span.lo;
2155 return self.parse_for_expr(None, lo, attrs);
2157 if try!(self.eat_keyword(keywords::While) ){
2158 let lo = self.last_span.lo;
2159 return self.parse_while_expr(None, lo, attrs);
2161 if self.token.is_lifetime() {
2162 let lifetime = self.get_lifetime();
2163 let lo = self.span.lo;
2165 try!(self.expect(&token::Colon));
2166 if try!(self.eat_keyword(keywords::While) ){
2167 return self.parse_while_expr(Some(lifetime), lo, attrs)
2169 if try!(self.eat_keyword(keywords::For) ){
2170 return self.parse_for_expr(Some(lifetime), lo, attrs)
2172 if try!(self.eat_keyword(keywords::Loop) ){
2173 return self.parse_loop_expr(Some(lifetime), lo, attrs)
2175 return Err(self.fatal("expected `while`, `for`, or `loop` after a label"))
2177 if try!(self.eat_keyword(keywords::Loop) ){
2178 let lo = self.last_span.lo;
2179 return self.parse_loop_expr(None, lo, attrs);
2181 if try!(self.eat_keyword(keywords::Continue) ){
2182 let ex = if self.token.is_lifetime() {
2183 let ex = ExprAgain(Some(Spanned{
2184 node: self.get_lifetime(),
2192 let hi = self.last_span.hi;
2193 return Ok(self.mk_expr(lo, hi, ex, attrs));
2195 if try!(self.eat_keyword(keywords::Match) ){
2196 return self.parse_match_expr(attrs);
2198 if try!(self.eat_keyword(keywords::Unsafe) ){
2199 return self.parse_block_expr(
2201 UnsafeBlock(ast::UserProvided),
2204 if try!(self.eat_keyword(keywords::Return) ){
2205 if self.token.can_begin_expr() {
2206 let e = try!(self.parse_expr());
2208 ex = ExprRet(Some(e));
2212 } else if try!(self.eat_keyword(keywords::Break) ){
2213 if self.token.is_lifetime() {
2214 ex = ExprBreak(Some(Spanned {
2215 node: self.get_lifetime(),
2220 ex = ExprBreak(None);
2222 hi = self.last_span.hi;
2223 } else if self.check(&token::ModSep) ||
2224 self.token.is_ident() &&
2225 !self.check_keyword(keywords::True) &&
2226 !self.check_keyword(keywords::False) {
2228 try!(self.parse_path(LifetimeAndTypesWithColons));
2230 // `!`, as an operator, is prefix, so we know this isn't that
2231 if self.check(&token::Not) {
2232 // MACRO INVOCATION expression
2235 let delim = try!(self.expect_open_delim());
2236 let tts = try!(self.parse_seq_to_end(
2237 &token::CloseDelim(delim),
2239 |p| p.parse_token_tree()));
2240 let hi = self.last_span.hi;
2242 return Ok(self.mk_mac_expr(lo,
2244 Mac_ { path: pth, tts: tts, ctxt: EMPTY_CTXT },
2247 if self.check(&token::OpenDelim(token::Brace)) {
2248 // This is a struct literal, unless we're prohibited
2249 // from parsing struct literals here.
2250 let prohibited = self.restrictions.contains(
2251 Restrictions::RESTRICTION_NO_STRUCT_LITERAL
2254 // It's a struct literal.
2256 let mut fields = Vec::new();
2257 let mut base = None;
2259 let attrs = attrs.append(
2260 try!(self.parse_inner_attributes())
2261 .into_thin_attrs());
2263 while self.token != token::CloseDelim(token::Brace) {
2264 if try!(self.eat(&token::DotDot) ){
2265 base = Some(try!(self.parse_expr()));
2269 fields.push(try!(self.parse_field()));
2270 try!(self.commit_expr(&*fields.last().unwrap().expr,
2272 &[token::CloseDelim(token::Brace)]));
2276 try!(self.expect(&token::CloseDelim(token::Brace)));
2277 ex = ExprStruct(pth, fields, base);
2278 return Ok(self.mk_expr(lo, hi, ex, attrs));
2283 ex = ExprPath(None, pth);
2285 // other literal expression
2286 let lit = try!(self.parse_lit());
2288 ex = ExprLit(P(lit));
2293 return Ok(self.mk_expr(lo, hi, ex, attrs));
2296 fn parse_or_use_outer_attributes(&mut self,
2297 already_parsed_attrs: Option<ThinAttributes>)
2298 -> PResult<ThinAttributes> {
2299 if let Some(attrs) = already_parsed_attrs {
2302 self.parse_outer_attributes().map(|a| a.into_thin_attrs())
2306 /// Parse a block or unsafe block
2307 pub fn parse_block_expr(&mut self, lo: BytePos, blk_mode: BlockCheckMode,
2308 attrs: ThinAttributes)
2309 -> PResult<P<Expr>> {
2311 let outer_attrs = attrs;
2312 try!(self.expect(&token::OpenDelim(token::Brace)));
2314 let inner_attrs = try!(self.parse_inner_attributes()).into_thin_attrs();
2315 let attrs = outer_attrs.append(inner_attrs);
2317 let blk = try!(self.parse_block_tail(lo, blk_mode));
2318 return Ok(self.mk_expr(blk.span.lo, blk.span.hi, ExprBlock(blk), attrs));
2321 /// parse a.b or a(13) or a[4] or just a
2322 pub fn parse_dot_or_call_expr(&mut self,
2323 already_parsed_attrs: Option<ThinAttributes>)
2324 -> PResult<P<Expr>> {
2325 let attrs = try!(self.parse_or_use_outer_attributes(already_parsed_attrs));
2327 let b = try!(self.parse_bottom_expr());
2328 self.parse_dot_or_call_expr_with(b, attrs)
2331 pub fn parse_dot_or_call_expr_with(&mut self,
2333 attrs: ThinAttributes)
2334 -> PResult<P<Expr>> {
2335 // Stitch the list of outer attributes onto the return value.
2336 // A little bit ugly, but the best way given the current code
2338 self.parse_dot_or_call_expr_with_(e0)
2340 expr.map(|mut expr| {
2341 expr.attrs.update(|a| a.prepend(attrs));
2343 ExprIf(..) | ExprIfLet(..) => {
2344 if !expr.attrs.as_attr_slice().is_empty() {
2345 // Just point to the first attribute in there...
2346 let span = expr.attrs.as_attr_slice()[0].span;
2349 "attributes are not yet allowed on `if` \
2360 fn parse_dot_or_call_expr_with_(&mut self, e0: P<Expr>) -> PResult<P<Expr>> {
2366 if try!(self.eat(&token::Dot) ){
2368 token::Ident(i, _) => {
2369 let dot = self.last_span.hi;
2372 let (_, tys, bindings) = if try!(self.eat(&token::ModSep) ){
2373 try!(self.expect_lt());
2374 try!(self.parse_generic_values_after_lt())
2376 (Vec::new(), Vec::new(), Vec::new())
2379 if !bindings.is_empty() {
2380 let last_span = self.last_span;
2381 self.span_err(last_span, "type bindings are only permitted on trait paths");
2384 // expr.f() method call
2386 token::OpenDelim(token::Paren) => {
2387 let mut es = try!(self.parse_unspanned_seq(
2388 &token::OpenDelim(token::Paren),
2389 &token::CloseDelim(token::Paren),
2390 seq_sep_trailing_allowed(token::Comma),
2391 |p| Ok(try!(p.parse_expr()))
2393 hi = self.last_span.hi;
2396 let id = spanned(dot, hi, i);
2397 let nd = self.mk_method_call(id, tys, es);
2398 e = self.mk_expr(lo, hi, nd, None);
2401 if !tys.is_empty() {
2402 let last_span = self.last_span;
2403 self.span_err(last_span,
2404 "field expressions may not \
2405 have type parameters");
2408 let id = spanned(dot, hi, i);
2409 let field = self.mk_field(e, id);
2410 e = self.mk_expr(lo, hi, field, None);
2414 token::Literal(token::Integer(n), suf) => {
2417 // A tuple index may not have a suffix
2418 self.expect_no_suffix(sp, "tuple index", suf);
2420 let dot = self.last_span.hi;
2424 let index = n.as_str().parse::<usize>().ok();
2427 let id = spanned(dot, hi, n);
2428 let field = self.mk_tup_field(e, id);
2429 e = self.mk_expr(lo, hi, field, None);
2432 let last_span = self.last_span;
2433 self.span_err(last_span, "invalid tuple or tuple struct index");
2437 token::Literal(token::Float(n), _suf) => {
2439 let last_span = self.last_span;
2440 let fstr = n.as_str();
2441 self.span_err(last_span,
2442 &format!("unexpected token: `{}`", n.as_str()));
2443 if fstr.chars().all(|x| "0123456789.".contains(x)) {
2444 let float = match fstr.parse::<f64>().ok() {
2448 self.fileline_help(last_span,
2449 &format!("try parenthesizing the first index; e.g., `(foo.{}){}`",
2450 float.trunc() as usize,
2451 format!(".{}", fstr.splitn(2, ".").last().unwrap())));
2453 self.abort_if_errors();
2456 _ => return Err(self.unexpected())
2460 if self.expr_is_complete(&*e) { break; }
2463 token::OpenDelim(token::Paren) => {
2464 let es = try!(self.parse_unspanned_seq(
2465 &token::OpenDelim(token::Paren),
2466 &token::CloseDelim(token::Paren),
2467 seq_sep_trailing_allowed(token::Comma),
2468 |p| Ok(try!(p.parse_expr()))
2470 hi = self.last_span.hi;
2472 let nd = self.mk_call(e, es);
2473 e = self.mk_expr(lo, hi, nd, None);
2477 // Could be either an index expression or a slicing expression.
2478 token::OpenDelim(token::Bracket) => {
2480 let ix = try!(self.parse_expr());
2482 try!(self.commit_expr_expecting(&*ix, token::CloseDelim(token::Bracket)));
2483 let index = self.mk_index(e, ix);
2484 e = self.mk_expr(lo, hi, index, None)
2492 // Parse unquoted tokens after a `$` in a token tree
2493 fn parse_unquoted(&mut self) -> PResult<TokenTree> {
2494 let mut sp = self.span;
2495 let (name, namep) = match self.token {
2499 if self.token == token::OpenDelim(token::Paren) {
2500 let Spanned { node: seq, span: seq_span } = try!(self.parse_seq(
2501 &token::OpenDelim(token::Paren),
2502 &token::CloseDelim(token::Paren),
2504 |p| p.parse_token_tree()
2506 let (sep, repeat) = try!(self.parse_sep_and_kleene_op());
2507 let name_num = macro_parser::count_names(&seq);
2508 return Ok(TokenTree::Sequence(mk_sp(sp.lo, seq_span.hi),
2509 Rc::new(SequenceRepetition {
2513 num_captures: name_num
2515 } else if self.token.is_keyword_allow_following_colon(keywords::Crate) {
2517 return Ok(TokenTree::Token(sp, SpecialVarNt(SpecialMacroVar::CrateMacroVar)));
2519 sp = mk_sp(sp.lo, self.span.hi);
2520 let namep = match self.token { token::Ident(_, p) => p, _ => token::Plain };
2521 let name = try!(self.parse_ident());
2525 token::SubstNt(name, namep) => {
2531 // continue by trying to parse the `:ident` after `$name`
2532 if self.token == token::Colon && self.look_ahead(1, |t| t.is_ident() &&
2533 !t.is_strict_keyword() &&
2534 !t.is_reserved_keyword()) {
2536 sp = mk_sp(sp.lo, self.span.hi);
2537 let kindp = match self.token { token::Ident(_, p) => p, _ => token::Plain };
2538 let nt_kind = try!(self.parse_ident());
2539 Ok(TokenTree::Token(sp, MatchNt(name, nt_kind, namep, kindp)))
2541 Ok(TokenTree::Token(sp, SubstNt(name, namep)))
2545 pub fn check_unknown_macro_variable(&mut self) -> PResult<()> {
2546 if self.quote_depth == 0 {
2548 token::SubstNt(name, _) =>
2549 return Err(self.fatal(&format!("unknown macro variable `{}`",
2557 /// Parse an optional separator followed by a Kleene-style
2558 /// repetition token (+ or *).
2559 pub fn parse_sep_and_kleene_op(&mut self) -> PResult<(Option<token::Token>, ast::KleeneOp)> {
2560 fn parse_kleene_op(parser: &mut Parser) -> PResult<Option<ast::KleeneOp>> {
2561 match parser.token {
2562 token::BinOp(token::Star) => {
2563 try!(parser.bump());
2564 Ok(Some(ast::ZeroOrMore))
2566 token::BinOp(token::Plus) => {
2567 try!(parser.bump());
2568 Ok(Some(ast::OneOrMore))
2574 match try!(parse_kleene_op(self)) {
2575 Some(kleene_op) => return Ok((None, kleene_op)),
2579 let separator = try!(self.bump_and_get());
2580 match try!(parse_kleene_op(self)) {
2581 Some(zerok) => Ok((Some(separator), zerok)),
2582 None => return Err(self.fatal("expected `*` or `+`"))
2586 /// parse a single token tree from the input.
2587 pub fn parse_token_tree(&mut self) -> PResult<TokenTree> {
2588 // FIXME #6994: currently, this is too eager. It
2589 // parses token trees but also identifies TokenType::Sequence's
2590 // and token::SubstNt's; it's too early to know yet
2591 // whether something will be a nonterminal or a seq
2593 maybe_whole!(deref self, NtTT);
2595 // this is the fall-through for the 'match' below.
2596 // invariants: the current token is not a left-delimiter,
2597 // not an EOF, and not the desired right-delimiter (if
2598 // it were, parse_seq_to_before_end would have prevented
2599 // reaching this point.
2600 fn parse_non_delim_tt_tok(p: &mut Parser) -> PResult<TokenTree> {
2601 maybe_whole!(deref p, NtTT);
2603 token::CloseDelim(_) => {
2604 // This is a conservative error: only report the last unclosed delimiter. The
2605 // previous unclosed delimiters could actually be closed! The parser just hasn't
2606 // gotten to them yet.
2607 match p.open_braces.last() {
2609 Some(&sp) => p.span_note(sp, "unclosed delimiter"),
2611 let token_str = p.this_token_to_string();
2612 Err(p.fatal(&format!("incorrect close delimiter: `{}`",
2615 /* we ought to allow different depths of unquotation */
2616 token::Dollar | token::SubstNt(..) if p.quote_depth > 0 => {
2620 Ok(TokenTree::Token(p.span, try!(p.bump_and_get())))
2627 let open_braces = self.open_braces.clone();
2628 for sp in &open_braces {
2629 self.span_help(*sp, "did you mean to close this delimiter?");
2631 // There shouldn't really be a span, but it's easier for the test runner
2632 // if we give it one
2633 return Err(self.fatal("this file contains an un-closed delimiter "));
2635 token::OpenDelim(delim) => {
2636 // The span for beginning of the delimited section
2637 let pre_span = self.span;
2639 // Parse the open delimiter.
2640 self.open_braces.push(self.span);
2641 let open_span = self.span;
2644 // Parse the token trees within the delimiters
2645 let tts = try!(self.parse_seq_to_before_end(
2646 &token::CloseDelim(delim),
2648 |p| p.parse_token_tree()
2651 // Parse the close delimiter.
2652 let close_span = self.span;
2654 self.open_braces.pop().unwrap();
2656 // Expand to cover the entire delimited token tree
2657 let span = Span { hi: close_span.hi, ..pre_span };
2659 Ok(TokenTree::Delimited(span, Rc::new(Delimited {
2661 open_span: open_span,
2663 close_span: close_span,
2666 _ => parse_non_delim_tt_tok(self),
2670 // parse a stream of tokens into a list of TokenTree's,
2672 pub fn parse_all_token_trees(&mut self) -> PResult<Vec<TokenTree>> {
2673 let mut tts = Vec::new();
2674 while self.token != token::Eof {
2675 tts.push(try!(self.parse_token_tree()));
2680 /// Parse a prefix-unary-operator expr
2681 pub fn parse_prefix_expr(&mut self,
2682 already_parsed_attrs: Option<ThinAttributes>)
2683 -> PResult<P<Expr>> {
2684 let attrs = try!(self.parse_or_use_outer_attributes(already_parsed_attrs));
2685 let lo = self.span.lo;
2687 // Note: when adding new unary operators, don't forget to adjust Token::can_begin_expr()
2688 let ex = match self.token {
2691 let e = try!(self.parse_prefix_expr(None));
2693 self.mk_unary(UnNot, e)
2695 token::BinOp(token::Minus) => {
2697 let e = try!(self.parse_prefix_expr(None));
2699 self.mk_unary(UnNeg, e)
2701 token::BinOp(token::Star) => {
2703 let e = try!(self.parse_prefix_expr(None));
2705 self.mk_unary(UnDeref, e)
2707 token::BinOp(token::And) | token::AndAnd => {
2708 try!(self.expect_and());
2709 let m = try!(self.parse_mutability());
2710 let e = try!(self.parse_prefix_expr(None));
2714 token::Ident(..) if self.token.is_keyword(keywords::In) => {
2716 let place = try!(self.parse_expr_res(
2717 Restrictions::RESTRICTION_NO_STRUCT_LITERAL,
2720 let blk = try!(self.parse_block());
2721 let span = blk.span;
2723 let blk_expr = self.mk_expr(span.lo, span.hi, ExprBlock(blk),
2725 ExprInPlace(place, blk_expr)
2727 token::Ident(..) if self.token.is_keyword(keywords::Box) => {
2729 let subexpression = try!(self.parse_prefix_expr(None));
2730 hi = subexpression.span.hi;
2731 ExprBox(subexpression)
2733 _ => return self.parse_dot_or_call_expr(Some(attrs))
2735 return Ok(self.mk_expr(lo, hi, ex, attrs));
2738 /// Parse an associative expression
2740 /// This parses an expression accounting for associativity and precedence of the operators in
2742 pub fn parse_assoc_expr(&mut self,
2743 already_parsed_attrs: Option<ThinAttributes>)
2744 -> PResult<P<Expr>> {
2745 self.parse_assoc_expr_with(0, already_parsed_attrs.into())
2748 /// Parse an associative expression with operators of at least `min_prec` precedence
2749 pub fn parse_assoc_expr_with(&mut self,
2752 -> PResult<P<Expr>> {
2753 let mut lhs = if let LhsExpr::AlreadyParsed(expr) = lhs {
2756 let attrs = match lhs {
2757 LhsExpr::AttributesParsed(attrs) => Some(attrs),
2760 if self.token == token::DotDot {
2761 return self.parse_prefix_range_expr(attrs);
2763 try!(self.parse_prefix_expr(attrs))
2766 if self.expr_is_complete(&*lhs) {
2767 // Semi-statement forms are odd. See https://github.com/rust-lang/rust/issues/29071
2770 self.expected_tokens.push(TokenType::Operator);
2771 while let Some(op) = AssocOp::from_token(&self.token) {
2772 let cur_op_span = self.span;
2773 let restrictions = if op.is_assign_like() {
2774 self.restrictions & Restrictions::RESTRICTION_NO_STRUCT_LITERAL
2778 if op.precedence() < min_prec {
2782 if op.is_comparison() {
2783 self.check_no_chained_comparison(&*lhs, &op);
2786 if op == AssocOp::As {
2787 let rhs = try!(self.parse_ty());
2788 lhs = self.mk_expr(lhs.span.lo, rhs.span.hi,
2789 ExprCast(lhs, rhs), None);
2791 } else if op == AssocOp::DotDot {
2792 // If we didn’t have to handle `x..`, it would be pretty easy to generalise
2793 // it to the Fixity::None code.
2795 // We have 2 alternatives here: `x..y` and `x..` The other two variants are
2796 // handled with `parse_prefix_range_expr` call above.
2797 let rhs = if self.is_at_start_of_range_notation_rhs() {
2798 self.parse_assoc_expr_with(op.precedence() + 1,
2799 LhsExpr::NotYetParsed).ok()
2803 let (lhs_span, rhs_span) = (lhs.span, if let Some(ref x) = rhs {
2808 let r = self.mk_range(Some(lhs), rhs);
2809 lhs = self.mk_expr(lhs_span.lo, rhs_span.hi, r, None);
2814 let rhs = try!(match op.fixity() {
2815 Fixity::Right => self.with_res(restrictions, |this|{
2816 this.parse_assoc_expr_with(op.precedence(), LhsExpr::NotYetParsed)
2818 Fixity::Left => self.with_res(restrictions, |this|{
2819 this.parse_assoc_expr_with(op.precedence() + 1, LhsExpr::NotYetParsed)
2821 // We currently have no non-associative operators that are not handled above by
2822 // the special cases. The code is here only for future convenience.
2823 Fixity::None => self.with_res(restrictions, |this|{
2824 this.parse_assoc_expr_with(op.precedence() + 1, LhsExpr::NotYetParsed)
2829 AssocOp::Add | AssocOp::Subtract | AssocOp::Multiply | AssocOp::Divide |
2830 AssocOp::Modulus | AssocOp::LAnd | AssocOp::LOr | AssocOp::BitXor |
2831 AssocOp::BitAnd | AssocOp::BitOr | AssocOp::ShiftLeft | AssocOp::ShiftRight |
2832 AssocOp::Equal | AssocOp::Less | AssocOp::LessEqual | AssocOp::NotEqual |
2833 AssocOp::Greater | AssocOp::GreaterEqual => {
2834 let ast_op = op.to_ast_binop().unwrap();
2835 let (lhs_span, rhs_span) = (lhs.span, rhs.span);
2836 let binary = self.mk_binary(codemap::respan(cur_op_span, ast_op), lhs, rhs);
2837 self.mk_expr(lhs_span.lo, rhs_span.hi, binary, None)
2840 self.mk_expr(lhs.span.lo, rhs.span.hi, ExprAssign(lhs, rhs), None),
2842 self.mk_expr(lhs.span.lo, rhs.span.hi, ExprInPlace(lhs, rhs), None),
2843 AssocOp::AssignOp(k) => {
2845 token::Plus => BiAdd,
2846 token::Minus => BiSub,
2847 token::Star => BiMul,
2848 token::Slash => BiDiv,
2849 token::Percent => BiRem,
2850 token::Caret => BiBitXor,
2851 token::And => BiBitAnd,
2852 token::Or => BiBitOr,
2853 token::Shl => BiShl,
2856 let (lhs_span, rhs_span) = (lhs.span, rhs.span);
2857 let aopexpr = self.mk_assign_op(codemap::respan(cur_op_span, aop), lhs, rhs);
2858 self.mk_expr(lhs_span.lo, rhs_span.hi, aopexpr, None)
2860 AssocOp::As | AssocOp::DotDot => self.bug("As or DotDot branch reached")
2863 if op.fixity() == Fixity::None { break }
2868 /// Produce an error if comparison operators are chained (RFC #558).
2869 /// We only need to check lhs, not rhs, because all comparison ops
2870 /// have same precedence and are left-associative
2871 fn check_no_chained_comparison(&mut self, lhs: &Expr, outer_op: &AssocOp) {
2872 debug_assert!(outer_op.is_comparison());
2874 ExprBinary(op, _, _) if op.node.is_comparison() => {
2875 // respan to include both operators
2876 let op_span = mk_sp(op.span.lo, self.span.hi);
2877 self.span_err(op_span,
2878 "chained comparison operators require parentheses");
2879 if op.node == BiLt && *outer_op == AssocOp::Greater {
2880 self.fileline_help(op_span,
2881 "use `::<...>` instead of `<...>` if you meant to specify type arguments");
2888 /// Parse prefix-forms of range notation: `..expr` and `..`
2889 fn parse_prefix_range_expr(&mut self,
2890 already_parsed_attrs: Option<ThinAttributes>)
2891 -> PResult<P<Expr>> {
2892 debug_assert!(self.token == token::DotDot);
2893 let attrs = try!(self.parse_or_use_outer_attributes(already_parsed_attrs));
2894 let lo = self.span.lo;
2895 let mut hi = self.span.hi;
2897 let opt_end = if self.is_at_start_of_range_notation_rhs() {
2898 // RHS must be parsed with more associativity than DotDot.
2899 let next_prec = AssocOp::from_token(&token::DotDot).unwrap().precedence() + 1;
2900 Some(try!(self.parse_assoc_expr_with(next_prec,
2901 LhsExpr::NotYetParsed)
2909 let r = self.mk_range(None, opt_end);
2910 Ok(self.mk_expr(lo, hi, r, attrs))
2913 fn is_at_start_of_range_notation_rhs(&self) -> bool {
2914 if self.token.can_begin_expr() {
2915 // parse `for i in 1.. { }` as infinite loop, not as `for i in (1..{})`.
2916 if self.token == token::OpenDelim(token::Brace) {
2917 return !self.restrictions.contains(Restrictions::RESTRICTION_NO_STRUCT_LITERAL);
2925 /// Parse an 'if' or 'if let' expression ('if' token already eaten)
2926 pub fn parse_if_expr(&mut self, attrs: ThinAttributes) -> PResult<P<Expr>> {
2927 if self.check_keyword(keywords::Let) {
2928 return self.parse_if_let_expr(attrs);
2930 let lo = self.last_span.lo;
2931 let cond = try!(self.parse_expr_res(Restrictions::RESTRICTION_NO_STRUCT_LITERAL, None));
2932 let thn = try!(self.parse_block());
2933 let mut els: Option<P<Expr>> = None;
2934 let mut hi = thn.span.hi;
2935 if try!(self.eat_keyword(keywords::Else) ){
2936 let elexpr = try!(self.parse_else_expr());
2937 hi = elexpr.span.hi;
2940 Ok(self.mk_expr(lo, hi, ExprIf(cond, thn, els), attrs))
2943 /// Parse an 'if let' expression ('if' token already eaten)
2944 pub fn parse_if_let_expr(&mut self, attrs: ThinAttributes)
2945 -> PResult<P<Expr>> {
2946 let lo = self.last_span.lo;
2947 try!(self.expect_keyword(keywords::Let));
2948 let pat = try!(self.parse_pat());
2949 try!(self.expect(&token::Eq));
2950 let expr = try!(self.parse_expr_res(Restrictions::RESTRICTION_NO_STRUCT_LITERAL, None));
2951 let thn = try!(self.parse_block());
2952 let (hi, els) = if try!(self.eat_keyword(keywords::Else) ){
2953 let expr = try!(self.parse_else_expr());
2954 (expr.span.hi, Some(expr))
2958 Ok(self.mk_expr(lo, hi, ExprIfLet(pat, expr, thn, els), attrs))
2962 pub fn parse_lambda_expr(&mut self, lo: BytePos,
2963 capture_clause: CaptureClause,
2964 attrs: ThinAttributes)
2967 let decl = try!(self.parse_fn_block_decl());
2968 let body = match decl.output {
2969 DefaultReturn(_) => {
2970 // If no explicit return type is given, parse any
2971 // expr and wrap it up in a dummy block:
2972 let body_expr = try!(self.parse_expr());
2974 id: ast::DUMMY_NODE_ID,
2976 span: body_expr.span,
2977 expr: Some(body_expr),
2978 rules: DefaultBlock,
2982 // If an explicit return type is given, require a
2983 // block to appear (RFC 968).
2984 try!(self.parse_block())
2991 ExprClosure(capture_clause, decl, body), attrs))
2994 // `else` token already eaten
2995 pub fn parse_else_expr(&mut self) -> PResult<P<Expr>> {
2996 if try!(self.eat_keyword(keywords::If) ){
2997 return self.parse_if_expr(None);
2999 let blk = try!(self.parse_block());
3000 return Ok(self.mk_expr(blk.span.lo, blk.span.hi, ExprBlock(blk), None));
3004 /// Parse a 'for' .. 'in' expression ('for' token already eaten)
3005 pub fn parse_for_expr(&mut self, opt_ident: Option<ast::Ident>,
3007 attrs: ThinAttributes) -> PResult<P<Expr>> {
3008 // Parse: `for <src_pat> in <src_expr> <src_loop_block>`
3010 let pat = try!(self.parse_pat());
3011 try!(self.expect_keyword(keywords::In));
3012 let expr = try!(self.parse_expr_res(Restrictions::RESTRICTION_NO_STRUCT_LITERAL, None));
3013 let (iattrs, loop_block) = try!(self.parse_inner_attrs_and_block());
3014 let attrs = attrs.append(iattrs.into_thin_attrs());
3016 let hi = self.last_span.hi;
3018 Ok(self.mk_expr(span_lo, hi,
3019 ExprForLoop(pat, expr, loop_block, opt_ident),
3023 /// Parse a 'while' or 'while let' expression ('while' token already eaten)
3024 pub fn parse_while_expr(&mut self, opt_ident: Option<ast::Ident>,
3026 attrs: ThinAttributes) -> PResult<P<Expr>> {
3027 if self.token.is_keyword(keywords::Let) {
3028 return self.parse_while_let_expr(opt_ident, span_lo, attrs);
3030 let cond = try!(self.parse_expr_res(Restrictions::RESTRICTION_NO_STRUCT_LITERAL, None));
3031 let (iattrs, body) = try!(self.parse_inner_attrs_and_block());
3032 let attrs = attrs.append(iattrs.into_thin_attrs());
3033 let hi = body.span.hi;
3034 return Ok(self.mk_expr(span_lo, hi, ExprWhile(cond, body, opt_ident),
3038 /// Parse a 'while let' expression ('while' token already eaten)
3039 pub fn parse_while_let_expr(&mut self, opt_ident: Option<ast::Ident>,
3041 attrs: ThinAttributes) -> PResult<P<Expr>> {
3042 try!(self.expect_keyword(keywords::Let));
3043 let pat = try!(self.parse_pat());
3044 try!(self.expect(&token::Eq));
3045 let expr = try!(self.parse_expr_res(Restrictions::RESTRICTION_NO_STRUCT_LITERAL, None));
3046 let (iattrs, body) = try!(self.parse_inner_attrs_and_block());
3047 let attrs = attrs.append(iattrs.into_thin_attrs());
3048 let hi = body.span.hi;
3049 return Ok(self.mk_expr(span_lo, hi, ExprWhileLet(pat, expr, body, opt_ident), attrs));
3052 // parse `loop {...}`, `loop` token already eaten
3053 pub fn parse_loop_expr(&mut self, opt_ident: Option<ast::Ident>,
3055 attrs: ThinAttributes) -> PResult<P<Expr>> {
3056 let (iattrs, body) = try!(self.parse_inner_attrs_and_block());
3057 let attrs = attrs.append(iattrs.into_thin_attrs());
3058 let hi = body.span.hi;
3059 Ok(self.mk_expr(span_lo, hi, ExprLoop(body, opt_ident), attrs))
3062 // `match` token already eaten
3063 fn parse_match_expr(&mut self, attrs: ThinAttributes) -> PResult<P<Expr>> {
3064 let match_span = self.last_span;
3065 let lo = self.last_span.lo;
3066 let discriminant = try!(self.parse_expr_res(
3067 Restrictions::RESTRICTION_NO_STRUCT_LITERAL, None));
3068 if let Err(e) = self.commit_expr_expecting(&*discriminant, token::OpenDelim(token::Brace)) {
3069 if self.token == token::Token::Semi {
3070 self.span_note(match_span, "did you mean to remove this `match` keyword?");
3074 let attrs = attrs.append(
3075 try!(self.parse_inner_attributes()).into_thin_attrs());
3076 let mut arms: Vec<Arm> = Vec::new();
3077 while self.token != token::CloseDelim(token::Brace) {
3078 arms.push(try!(self.parse_arm()));
3080 let hi = self.span.hi;
3082 return Ok(self.mk_expr(lo, hi, ExprMatch(discriminant, arms), attrs));
3085 pub fn parse_arm(&mut self) -> PResult<Arm> {
3086 maybe_whole!(no_clone self, NtArm);
3088 let attrs = try!(self.parse_outer_attributes());
3089 let pats = try!(self.parse_pats());
3090 let mut guard = None;
3091 if try!(self.eat_keyword(keywords::If) ){
3092 guard = Some(try!(self.parse_expr()));
3094 try!(self.expect(&token::FatArrow));
3095 let expr = try!(self.parse_expr_res(Restrictions::RESTRICTION_STMT_EXPR, None));
3098 !classify::expr_is_simple_block(&*expr)
3099 && self.token != token::CloseDelim(token::Brace);
3102 try!(self.commit_expr(&*expr, &[token::Comma], &[token::CloseDelim(token::Brace)]));
3104 try!(self.eat(&token::Comma));
3115 /// Parse an expression
3116 pub fn parse_expr(&mut self) -> PResult<P<Expr>> {
3117 self.parse_expr_res(Restrictions::empty(), None)
3120 /// Evaluate the closure with restrictions in place.
3122 /// After the closure is evaluated, restrictions are reset.
3123 pub fn with_res<F>(&mut self, r: Restrictions, f: F) -> PResult<P<Expr>>
3124 where F: FnOnce(&mut Self) -> PResult<P<Expr>> {
3125 let old = self.restrictions;
3126 self.restrictions = r;
3128 self.restrictions = old;
3133 /// Parse an expression, subject to the given restrictions
3134 pub fn parse_expr_res(&mut self, r: Restrictions,
3135 already_parsed_attrs: Option<ThinAttributes>)
3136 -> PResult<P<Expr>> {
3137 self.with_res(r, |this| this.parse_assoc_expr(already_parsed_attrs))
3140 /// Parse the RHS of a local variable declaration (e.g. '= 14;')
3141 fn parse_initializer(&mut self) -> PResult<Option<P<Expr>>> {
3142 if self.check(&token::Eq) {
3144 Ok(Some(try!(self.parse_expr())))
3150 /// Parse patterns, separated by '|' s
3151 fn parse_pats(&mut self) -> PResult<Vec<P<Pat>>> {
3152 let mut pats = Vec::new();
3154 pats.push(try!(self.parse_pat()));
3155 if self.check(&token::BinOp(token::Or)) { try!(self.bump());}
3156 else { return Ok(pats); }
3160 fn parse_pat_tuple_elements(&mut self) -> PResult<Vec<P<Pat>>> {
3161 let mut fields = vec![];
3162 if !self.check(&token::CloseDelim(token::Paren)) {
3163 fields.push(try!(self.parse_pat()));
3164 if self.look_ahead(1, |t| *t != token::CloseDelim(token::Paren)) {
3165 while try!(self.eat(&token::Comma)) &&
3166 !self.check(&token::CloseDelim(token::Paren)) {
3167 fields.push(try!(self.parse_pat()));
3170 if fields.len() == 1 {
3171 try!(self.expect(&token::Comma));
3177 fn parse_pat_vec_elements(
3179 ) -> PResult<(Vec<P<Pat>>, Option<P<Pat>>, Vec<P<Pat>>)> {
3180 let mut before = Vec::new();
3181 let mut slice = None;
3182 let mut after = Vec::new();
3183 let mut first = true;
3184 let mut before_slice = true;
3186 while self.token != token::CloseDelim(token::Bracket) {
3190 try!(self.expect(&token::Comma));
3192 if self.token == token::CloseDelim(token::Bracket)
3193 && (before_slice || !after.is_empty()) {
3199 if self.check(&token::DotDot) {
3202 if self.check(&token::Comma) ||
3203 self.check(&token::CloseDelim(token::Bracket)) {
3204 slice = Some(P(ast::Pat {
3205 id: ast::DUMMY_NODE_ID,
3209 before_slice = false;
3215 let subpat = try!(self.parse_pat());
3216 if before_slice && self.check(&token::DotDot) {
3218 slice = Some(subpat);
3219 before_slice = false;
3220 } else if before_slice {
3221 before.push(subpat);
3227 Ok((before, slice, after))
3230 /// Parse the fields of a struct-like pattern
3231 fn parse_pat_fields(&mut self) -> PResult<(Vec<codemap::Spanned<ast::FieldPat>> , bool)> {
3232 let mut fields = Vec::new();
3233 let mut etc = false;
3234 let mut first = true;
3235 while self.token != token::CloseDelim(token::Brace) {
3239 try!(self.expect(&token::Comma));
3240 // accept trailing commas
3241 if self.check(&token::CloseDelim(token::Brace)) { break }
3244 let lo = self.span.lo;
3247 if self.check(&token::DotDot) {
3249 if self.token != token::CloseDelim(token::Brace) {
3250 let token_str = self.this_token_to_string();
3251 return Err(self.fatal(&format!("expected `{}`, found `{}`", "}",
3258 // Check if a colon exists one ahead. This means we're parsing a fieldname.
3259 let (subpat, fieldname, is_shorthand) = if self.look_ahead(1, |t| t == &token::Colon) {
3260 // Parsing a pattern of the form "fieldname: pat"
3261 let fieldname = try!(self.parse_ident());
3263 let pat = try!(self.parse_pat());
3265 (pat, fieldname, false)
3267 // Parsing a pattern of the form "(box) (ref) (mut) fieldname"
3268 let is_box = try!(self.eat_keyword(keywords::Box));
3269 let boxed_span_lo = self.span.lo;
3270 let is_ref = try!(self.eat_keyword(keywords::Ref));
3271 let is_mut = try!(self.eat_keyword(keywords::Mut));
3272 let fieldname = try!(self.parse_ident());
3273 hi = self.last_span.hi;
3275 let bind_type = match (is_ref, is_mut) {
3276 (true, true) => BindByRef(MutMutable),
3277 (true, false) => BindByRef(MutImmutable),
3278 (false, true) => BindByValue(MutMutable),
3279 (false, false) => BindByValue(MutImmutable),
3281 let fieldpath = codemap::Spanned{span:self.last_span, node:fieldname};
3282 let fieldpat = P(ast::Pat{
3283 id: ast::DUMMY_NODE_ID,
3284 node: PatIdent(bind_type, fieldpath, None),
3285 span: mk_sp(boxed_span_lo, hi),
3288 let subpat = if is_box {
3290 id: ast::DUMMY_NODE_ID,
3291 node: PatBox(fieldpat),
3292 span: mk_sp(lo, hi),
3297 (subpat, fieldname, true)
3300 fields.push(codemap::Spanned { span: mk_sp(lo, hi),
3301 node: ast::FieldPat { ident: fieldname,
3303 is_shorthand: is_shorthand }});
3305 return Ok((fields, etc));
3308 fn parse_pat_range_end(&mut self) -> PResult<P<Expr>> {
3309 if self.is_path_start() {
3310 let lo = self.span.lo;
3311 let (qself, path) = if try!(self.eat_lt()) {
3312 // Parse a qualified path
3314 try!(self.parse_qualified_path(NoTypesAllowed));
3317 // Parse an unqualified path
3318 (None, try!(self.parse_path(LifetimeAndTypesWithColons)))
3320 let hi = self.last_span.hi;
3321 Ok(self.mk_expr(lo, hi, ExprPath(qself, path), None))
3323 self.parse_pat_literal_maybe_minus()
3327 fn is_path_start(&self) -> bool {
3328 (self.token == token::Lt || self.token == token::ModSep
3329 || self.token.is_ident() || self.token.is_path())
3330 && !self.token.is_keyword(keywords::True) && !self.token.is_keyword(keywords::False)
3333 /// Parse a pattern.
3334 pub fn parse_pat(&mut self) -> PResult<P<Pat>> {
3335 maybe_whole!(self, NtPat);
3337 let lo = self.span.lo;
3340 token::Underscore => {
3345 token::BinOp(token::And) | token::AndAnd => {
3346 // Parse &pat / &mut pat
3347 try!(self.expect_and());
3348 let mutbl = try!(self.parse_mutability());
3349 if let token::Lifetime(ident) = self.token {
3350 return Err(self.fatal(&format!("unexpected lifetime `{}` in pattern", ident)));
3353 let subpat = try!(self.parse_pat());
3354 pat = PatRegion(subpat, mutbl);
3356 token::OpenDelim(token::Paren) => {
3357 // Parse (pat,pat,pat,...) as tuple pattern
3359 let fields = try!(self.parse_pat_tuple_elements());
3360 try!(self.expect(&token::CloseDelim(token::Paren)));
3361 pat = PatTup(fields);
3363 token::OpenDelim(token::Bracket) => {
3364 // Parse [pat,pat,...] as slice pattern
3366 let (before, slice, after) = try!(self.parse_pat_vec_elements());
3367 try!(self.expect(&token::CloseDelim(token::Bracket)));
3368 pat = PatVec(before, slice, after);
3371 // At this point, token != _, &, &&, (, [
3372 if try!(self.eat_keyword(keywords::Mut)) {
3373 // Parse mut ident @ pat
3374 pat = try!(self.parse_pat_ident(BindByValue(MutMutable)));
3375 } else if try!(self.eat_keyword(keywords::Ref)) {
3376 // Parse ref ident @ pat / ref mut ident @ pat
3377 let mutbl = try!(self.parse_mutability());
3378 pat = try!(self.parse_pat_ident(BindByRef(mutbl)));
3379 } else if try!(self.eat_keyword(keywords::Box)) {
3381 let subpat = try!(self.parse_pat());
3382 pat = PatBox(subpat);
3383 } else if self.is_path_start() {
3384 // Parse pattern starting with a path
3385 if self.token.is_plain_ident() && self.look_ahead(1, |t| *t != token::DotDotDot &&
3386 *t != token::OpenDelim(token::Brace) &&
3387 *t != token::OpenDelim(token::Paren) &&
3388 // Contrary to its definition, a plain ident can be followed by :: in macros
3389 *t != token::ModSep) {
3390 // Plain idents have some extra abilities here compared to general paths
3391 if self.look_ahead(1, |t| *t == token::Not) {
3392 // Parse macro invocation
3393 let ident = try!(self.parse_ident());
3394 let ident_span = self.last_span;
3395 let path = ident_to_path(ident_span, ident);
3397 let delim = try!(self.expect_open_delim());
3398 let tts = try!(self.parse_seq_to_end(&token::CloseDelim(delim),
3399 seq_sep_none(), |p| p.parse_token_tree()));
3400 let mac = Mac_ { path: path, tts: tts, ctxt: EMPTY_CTXT };
3401 pat = PatMac(codemap::Spanned {node: mac,
3402 span: mk_sp(lo, self.last_span.hi)});
3404 // Parse ident @ pat
3405 // This can give false positives and parse nullary enums,
3406 // they are dealt with later in resolve
3407 pat = try!(self.parse_pat_ident(BindByValue(MutImmutable)));
3410 let (qself, path) = if try!(self.eat_lt()) {
3411 // Parse a qualified path
3413 try!(self.parse_qualified_path(NoTypesAllowed));
3416 // Parse an unqualified path
3417 (None, try!(self.parse_path(LifetimeAndTypesWithColons)))
3420 token::DotDotDot => {
3422 let hi = self.last_span.hi;
3423 let begin = self.mk_expr(lo, hi, ExprPath(qself, path), None);
3425 let end = try!(self.parse_pat_range_end());
3426 pat = PatRange(begin, end);
3428 token::OpenDelim(token::Brace) => {
3429 if qself.is_some() {
3430 return Err(self.fatal("unexpected `{` after qualified path"));
3432 // Parse struct pattern
3434 let (fields, etc) = try!(self.parse_pat_fields());
3436 pat = PatStruct(path, fields, etc);
3438 token::OpenDelim(token::Paren) => {
3439 if qself.is_some() {
3440 return Err(self.fatal("unexpected `(` after qualified path"));
3442 // Parse tuple struct or enum pattern
3443 if self.look_ahead(1, |t| *t == token::DotDot) {
3444 // This is a "top constructor only" pat
3447 try!(self.expect(&token::CloseDelim(token::Paren)));
3448 pat = PatEnum(path, None);
3450 let args = try!(self.parse_enum_variant_seq(
3451 &token::OpenDelim(token::Paren),
3452 &token::CloseDelim(token::Paren),
3453 seq_sep_trailing_allowed(token::Comma),
3454 |p| p.parse_pat()));
3455 pat = PatEnum(path, Some(args));
3460 // Parse qualified path
3461 Some(qself) => PatQPath(qself, path),
3462 // Parse nullary enum
3463 None => PatEnum(path, Some(vec![]))
3469 // Try to parse everything else as literal with optional minus
3470 let begin = try!(self.parse_pat_literal_maybe_minus());
3471 if try!(self.eat(&token::DotDotDot)) {
3472 let end = try!(self.parse_pat_range_end());
3473 pat = PatRange(begin, end);
3475 pat = PatLit(begin);
3481 let hi = self.last_span.hi;
3483 id: ast::DUMMY_NODE_ID,
3485 span: mk_sp(lo, hi),
3489 /// Parse ident or ident @ pat
3490 /// used by the copy foo and ref foo patterns to give a good
3491 /// error message when parsing mistakes like ref foo(a,b)
3492 fn parse_pat_ident(&mut self,
3493 binding_mode: ast::BindingMode)
3494 -> PResult<ast::Pat_> {
3495 if !self.token.is_plain_ident() {
3496 let span = self.span;
3497 let tok_str = self.this_token_to_string();
3498 return Err(self.span_fatal(span,
3499 &format!("expected identifier, found `{}`", tok_str)))
3501 let ident = try!(self.parse_ident());
3502 let last_span = self.last_span;
3503 let name = codemap::Spanned{span: last_span, node: ident};
3504 let sub = if try!(self.eat(&token::At) ){
3505 Some(try!(self.parse_pat()))
3510 // just to be friendly, if they write something like
3512 // we end up here with ( as the current token. This shortly
3513 // leads to a parse error. Note that if there is no explicit
3514 // binding mode then we do not end up here, because the lookahead
3515 // will direct us over to parse_enum_variant()
3516 if self.token == token::OpenDelim(token::Paren) {
3517 let last_span = self.last_span;
3518 return Err(self.span_fatal(
3520 "expected identifier, found enum pattern"))
3523 Ok(PatIdent(binding_mode, name, sub))
3526 /// Parse a local variable declaration
3527 fn parse_local(&mut self, attrs: ThinAttributes) -> PResult<P<Local>> {
3528 let lo = self.span.lo;
3529 let pat = try!(self.parse_pat());
3532 if try!(self.eat(&token::Colon) ){
3533 ty = Some(try!(self.parse_ty_sum()));
3535 let init = try!(self.parse_initializer());
3540 id: ast::DUMMY_NODE_ID,
3541 span: mk_sp(lo, self.last_span.hi),
3546 /// Parse a "let" stmt
3547 fn parse_let(&mut self, attrs: ThinAttributes) -> PResult<P<Decl>> {
3548 let lo = self.span.lo;
3549 let local = try!(self.parse_local(attrs));
3550 Ok(P(spanned(lo, self.last_span.hi, DeclLocal(local))))
3553 /// Parse a structure field
3554 fn parse_name_and_ty(&mut self, pr: Visibility,
3555 attrs: Vec<Attribute> ) -> PResult<StructField> {
3557 Inherited => self.span.lo,
3558 Public => self.last_span.lo,
3560 if !self.token.is_plain_ident() {
3561 return Err(self.fatal("expected ident"));
3563 let name = try!(self.parse_ident());
3564 try!(self.expect(&token::Colon));
3565 let ty = try!(self.parse_ty_sum());
3566 Ok(spanned(lo, self.last_span.hi, ast::StructField_ {
3567 kind: NamedField(name, pr),
3568 id: ast::DUMMY_NODE_ID,
3574 /// Emit an expected item after attributes error.
3575 fn expected_item_err(&self, attrs: &[Attribute]) {
3576 let message = match attrs.last() {
3577 Some(&Attribute { node: ast::Attribute_ { is_sugared_doc: true, .. }, .. }) => {
3578 "expected item after doc comment"
3580 _ => "expected item after attributes",
3583 self.span_err(self.last_span, message);
3586 /// Parse a statement. may include decl.
3587 pub fn parse_stmt(&mut self) -> PResult<Option<P<Stmt>>> {
3588 Ok(try!(self.parse_stmt_()).map(P))
3591 fn parse_stmt_(&mut self) -> PResult<Option<Stmt>> {
3592 maybe_whole!(Some deref self, NtStmt);
3594 let attrs = try!(self.parse_outer_attributes());
3595 let lo = self.span.lo;
3597 Ok(Some(if self.check_keyword(keywords::Let) {
3598 try!(self.expect_keyword(keywords::Let));
3599 let decl = try!(self.parse_let(attrs.into_thin_attrs()));
3600 let hi = decl.span.hi;
3601 let stmt = StmtDecl(decl, ast::DUMMY_NODE_ID);
3602 spanned(lo, hi, stmt)
3603 } else if self.token.is_ident()
3604 && !self.token.is_any_keyword()
3605 && self.look_ahead(1, |t| *t == token::Not) {
3606 // it's a macro invocation:
3608 // Potential trouble: if we allow macros with paths instead of
3609 // idents, we'd need to look ahead past the whole path here...
3610 let pth = try!(self.parse_path(NoTypesAllowed));
3613 let id = match self.token {
3614 token::OpenDelim(_) => token::special_idents::invalid, // no special identifier
3615 _ => try!(self.parse_ident()),
3618 // check that we're pointing at delimiters (need to check
3619 // again after the `if`, because of `parse_ident`
3620 // consuming more tokens).
3621 let delim = match self.token {
3622 token::OpenDelim(delim) => delim,
3624 // we only expect an ident if we didn't parse one
3626 let ident_str = if id.name == token::special_idents::invalid.name {
3631 let tok_str = self.this_token_to_string();
3632 return Err(self.fatal(&format!("expected {}`(` or `{{`, found `{}`",
3638 let tts = try!(self.parse_unspanned_seq(
3639 &token::OpenDelim(delim),
3640 &token::CloseDelim(delim),
3642 |p| p.parse_token_tree()
3644 let hi = self.last_span.hi;
3646 let style = if delim == token::Brace {
3649 MacStmtWithoutBraces
3652 if id.name == token::special_idents::invalid.name {
3653 let stmt = StmtMac(P(spanned(lo,
3655 Mac_ { path: pth, tts: tts, ctxt: EMPTY_CTXT })),
3657 attrs.into_thin_attrs());
3658 spanned(lo, hi, stmt)
3660 // if it has a special ident, it's definitely an item
3662 // Require a semicolon or braces.
3663 if style != MacStmtWithBraces {
3664 if !try!(self.eat(&token::Semi) ){
3665 let last_span = self.last_span;
3666 self.span_err(last_span,
3667 "macros that expand to items must \
3668 either be surrounded with braces or \
3669 followed by a semicolon");
3672 spanned(lo, hi, StmtDecl(
3673 P(spanned(lo, hi, DeclItem(
3675 lo, hi, id /*id is good here*/,
3676 ItemMac(spanned(lo, hi,
3677 Mac_ { path: pth, tts: tts, ctxt: EMPTY_CTXT })),
3678 Inherited, attrs)))),
3679 ast::DUMMY_NODE_ID))
3682 // FIXME: Bad copy of attrs
3683 match try!(self.parse_item_(attrs.clone(), false, true)) {
3686 let decl = P(spanned(lo, hi, DeclItem(i)));
3687 spanned(lo, hi, StmtDecl(decl, ast::DUMMY_NODE_ID))
3690 let unused_attrs = |attrs: &[_], s: &mut Self| {
3691 if attrs.len() > 0 {
3693 "expected statement after outer attribute");
3697 // Do not attempt to parse an expression if we're done here.
3698 if self.token == token::Semi {
3699 unused_attrs(&attrs, self);
3704 if self.token == token::CloseDelim(token::Brace) {
3705 unused_attrs(&attrs, self);
3709 // Remainder are line-expr stmts.
3710 let e = try!(self.parse_expr_res(
3711 Restrictions::RESTRICTION_STMT_EXPR, Some(attrs.into_thin_attrs())));
3713 let stmt = StmtExpr(e, ast::DUMMY_NODE_ID);
3714 spanned(lo, hi, stmt)
3720 /// Is this expression a successfully-parsed statement?
3721 fn expr_is_complete(&mut self, e: &Expr) -> bool {
3722 self.restrictions.contains(Restrictions::RESTRICTION_STMT_EXPR) &&
3723 !classify::expr_requires_semi_to_be_stmt(e)
3726 /// Parse a block. No inner attrs are allowed.
3727 pub fn parse_block(&mut self) -> PResult<P<Block>> {
3728 maybe_whole!(no_clone self, NtBlock);
3730 let lo = self.span.lo;
3732 if !try!(self.eat(&token::OpenDelim(token::Brace)) ){
3734 let tok = self.this_token_to_string();
3735 return Err(self.span_fatal_help(sp,
3736 &format!("expected `{{`, found `{}`", tok),
3737 "place this code inside a block"));
3740 self.parse_block_tail(lo, DefaultBlock)
3743 /// Parse a block. Inner attrs are allowed.
3744 fn parse_inner_attrs_and_block(&mut self) -> PResult<(Vec<Attribute>, P<Block>)> {
3745 maybe_whole!(pair_empty self, NtBlock);
3747 let lo = self.span.lo;
3748 try!(self.expect(&token::OpenDelim(token::Brace)));
3749 Ok((try!(self.parse_inner_attributes()),
3750 try!(self.parse_block_tail(lo, DefaultBlock))))
3753 /// Parse the rest of a block expression or function body
3754 /// Precondition: already parsed the '{'.
3755 fn parse_block_tail(&mut self, lo: BytePos, s: BlockCheckMode) -> PResult<P<Block>> {
3756 let mut stmts = vec![];
3757 let mut expr = None;
3759 while !try!(self.eat(&token::CloseDelim(token::Brace))) {
3760 let Spanned {node, span} = if let Some(s) = try!(self.parse_stmt_()) {
3763 // Found only `;` or `}`.
3768 try!(self.handle_expression_like_statement(e, span, &mut stmts, &mut expr));
3770 StmtMac(mac, MacStmtWithoutBraces, attrs) => {
3771 // statement macro without braces; might be an
3772 // expr depending on whether a semicolon follows
3775 stmts.push(P(Spanned {
3776 node: StmtMac(mac, MacStmtWithSemicolon, attrs),
3777 span: mk_sp(span.lo, self.span.hi),
3782 let e = self.mk_mac_expr(span.lo, span.hi,
3783 mac.and_then(|m| m.node),
3785 let e = try!(self.parse_dot_or_call_expr_with(e, attrs));
3786 let e = try!(self.parse_assoc_expr_with(0, LhsExpr::AlreadyParsed(e)));
3787 try!(self.handle_expression_like_statement(
3795 StmtMac(m, style, attrs) => {
3796 // statement macro; might be an expr
3799 stmts.push(P(Spanned {
3800 node: StmtMac(m, MacStmtWithSemicolon, attrs),
3801 span: mk_sp(span.lo, self.span.hi),
3805 token::CloseDelim(token::Brace) => {
3806 // if a block ends in `m!(arg)` without
3807 // a `;`, it must be an expr
3808 expr = Some(self.mk_mac_expr(span.lo, span.hi,
3809 m.and_then(|x| x.node),
3813 stmts.push(P(Spanned {
3814 node: StmtMac(m, style, attrs),
3820 _ => { // all other kinds of statements:
3821 let mut hi = span.hi;
3822 if classify::stmt_ends_with_semi(&node) {
3823 try!(self.commit_stmt_expecting(token::Semi));
3824 hi = self.last_span.hi;
3827 stmts.push(P(Spanned {
3829 span: mk_sp(span.lo, hi)
3838 id: ast::DUMMY_NODE_ID,
3840 span: mk_sp(lo, self.last_span.hi),
3844 fn handle_expression_like_statement(
3848 stmts: &mut Vec<P<Stmt>>,
3849 last_block_expr: &mut Option<P<Expr>>) -> PResult<()> {
3850 // expression without semicolon
3851 if classify::expr_requires_semi_to_be_stmt(&*e) {
3852 // Just check for errors and recover; do not eat semicolon yet.
3853 try!(self.commit_stmt(&[],
3854 &[token::Semi, token::CloseDelim(token::Brace)]));
3860 let span_with_semi = Span {
3862 hi: self.last_span.hi,
3863 expn_id: span.expn_id,
3865 stmts.push(P(Spanned {
3866 node: StmtSemi(e, ast::DUMMY_NODE_ID),
3867 span: span_with_semi,
3870 token::CloseDelim(token::Brace) => *last_block_expr = Some(e),
3872 stmts.push(P(Spanned {
3873 node: StmtExpr(e, ast::DUMMY_NODE_ID),
3881 // Parses a sequence of bounds if a `:` is found,
3882 // otherwise returns empty list.
3883 fn parse_colon_then_ty_param_bounds(&mut self,
3884 mode: BoundParsingMode)
3885 -> PResult<OwnedSlice<TyParamBound>>
3887 if !try!(self.eat(&token::Colon) ){
3888 Ok(OwnedSlice::empty())
3890 self.parse_ty_param_bounds(mode)
3894 // matches bounds = ( boundseq )?
3895 // where boundseq = ( polybound + boundseq ) | polybound
3896 // and polybound = ( 'for' '<' 'region '>' )? bound
3897 // and bound = 'region | trait_ref
3898 fn parse_ty_param_bounds(&mut self,
3899 mode: BoundParsingMode)
3900 -> PResult<OwnedSlice<TyParamBound>>
3902 let mut result = vec!();
3904 let question_span = self.span;
3905 let ate_question = try!(self.eat(&token::Question));
3907 token::Lifetime(lifetime) => {
3909 self.span_err(question_span,
3910 "`?` may only modify trait bounds, not lifetime bounds");
3912 result.push(RegionTyParamBound(ast::Lifetime {
3913 id: ast::DUMMY_NODE_ID,
3919 token::ModSep | token::Ident(..) => {
3920 let poly_trait_ref = try!(self.parse_poly_trait_ref());
3921 let modifier = if ate_question {
3922 if mode == BoundParsingMode::Modified {
3923 TraitBoundModifier::Maybe
3925 self.span_err(question_span,
3927 TraitBoundModifier::None
3930 TraitBoundModifier::None
3932 result.push(TraitTyParamBound(poly_trait_ref, modifier))
3937 if !try!(self.eat(&token::BinOp(token::Plus)) ){
3942 return Ok(OwnedSlice::from_vec(result));
3945 /// Matches typaram = IDENT (`?` unbound)? optbounds ( EQ ty )?
3946 fn parse_ty_param(&mut self) -> PResult<TyParam> {
3947 let span = self.span;
3948 let ident = try!(self.parse_ident());
3950 let bounds = try!(self.parse_colon_then_ty_param_bounds(BoundParsingMode::Modified));
3952 let default = if self.check(&token::Eq) {
3954 Some(try!(self.parse_ty_sum()))
3961 id: ast::DUMMY_NODE_ID,
3968 /// Parse a set of optional generic type parameter declarations. Where
3969 /// clauses are not parsed here, and must be added later via
3970 /// `parse_where_clause()`.
3972 /// matches generics = ( ) | ( < > ) | ( < typaramseq ( , )? > ) | ( < lifetimes ( , )? > )
3973 /// | ( < lifetimes , typaramseq ( , )? > )
3974 /// where typaramseq = ( typaram ) | ( typaram , typaramseq )
3975 pub fn parse_generics(&mut self) -> PResult<ast::Generics> {
3976 maybe_whole!(self, NtGenerics);
3978 if try!(self.eat(&token::Lt) ){
3979 let lifetime_defs = try!(self.parse_lifetime_defs());
3980 let mut seen_default = false;
3981 let ty_params = try!(self.parse_seq_to_gt(Some(token::Comma), |p| {
3982 try!(p.forbid_lifetime());
3983 let ty_param = try!(p.parse_ty_param());
3984 if ty_param.default.is_some() {
3985 seen_default = true;
3986 } else if seen_default {
3987 let last_span = p.last_span;
3988 p.span_err(last_span,
3989 "type parameters with a default must be trailing");
3994 lifetimes: lifetime_defs,
3995 ty_params: ty_params,
3996 where_clause: WhereClause {
3997 id: ast::DUMMY_NODE_ID,
3998 predicates: Vec::new(),
4002 Ok(ast::Generics::default())
4006 fn parse_generic_values_after_lt(&mut self) -> PResult<(Vec<ast::Lifetime>,
4008 Vec<P<TypeBinding>>)> {
4009 let span_lo = self.span.lo;
4010 let lifetimes = try!(self.parse_lifetimes(token::Comma));
4012 let missing_comma = !lifetimes.is_empty() &&
4013 !self.token.is_like_gt() &&
4015 .as_ref().map_or(true,
4016 |x| &**x != &token::Comma);
4020 let msg = format!("expected `,` or `>` after lifetime \
4022 self.this_token_to_string());
4023 self.span_err(self.span, &msg);
4025 let span_hi = self.span.hi;
4026 let span_hi = if self.parse_ty().is_ok() {
4032 let msg = format!("did you mean a single argument type &'a Type, \
4033 or did you mean the comma-separated arguments \
4035 self.span_note(mk_sp(span_lo, span_hi), &msg);
4037 self.abort_if_errors()
4040 // First parse types.
4041 let (types, returned) = try!(self.parse_seq_to_gt_or_return(
4044 try!(p.forbid_lifetime());
4045 if p.look_ahead(1, |t| t == &token::Eq) {
4048 Ok(Some(try!(p.parse_ty_sum())))
4053 // If we found the `>`, don't continue.
4055 return Ok((lifetimes, types.into_vec(), Vec::new()));
4058 // Then parse type bindings.
4059 let bindings = try!(self.parse_seq_to_gt(
4062 try!(p.forbid_lifetime());
4064 let ident = try!(p.parse_ident());
4065 let found_eq = try!(p.eat(&token::Eq));
4068 p.span_warn(span, "whoops, no =?");
4070 let ty = try!(p.parse_ty());
4071 let hi = ty.span.hi;
4072 let span = mk_sp(lo, hi);
4073 return Ok(P(TypeBinding{id: ast::DUMMY_NODE_ID,
4080 Ok((lifetimes, types.into_vec(), bindings.into_vec()))
4083 fn forbid_lifetime(&mut self) -> PResult<()> {
4084 if self.token.is_lifetime() {
4085 let span = self.span;
4086 return Err(self.span_fatal(span, "lifetime parameters must be declared \
4087 prior to type parameters"))
4092 /// Parses an optional `where` clause and places it in `generics`.
4095 /// where T : Trait<U, V> + 'b, 'a : 'b
4097 pub fn parse_where_clause(&mut self) -> PResult<ast::WhereClause> {
4098 maybe_whole!(self, NtWhereClause);
4100 let mut where_clause = WhereClause {
4101 id: ast::DUMMY_NODE_ID,
4102 predicates: Vec::new(),
4105 if !try!(self.eat_keyword(keywords::Where)) {
4106 return Ok(where_clause);
4109 let mut parsed_something = false;
4111 let lo = self.span.lo;
4113 token::OpenDelim(token::Brace) => {
4117 token::Lifetime(..) => {
4118 let bounded_lifetime =
4119 try!(self.parse_lifetime());
4121 try!(self.eat(&token::Colon));
4124 try!(self.parse_lifetimes(token::BinOp(token::Plus)));
4126 let hi = self.last_span.hi;
4127 let span = mk_sp(lo, hi);
4129 where_clause.predicates.push(ast::WherePredicate::RegionPredicate(
4130 ast::WhereRegionPredicate {
4132 lifetime: bounded_lifetime,
4137 parsed_something = true;
4141 let bound_lifetimes = if try!(self.eat_keyword(keywords::For) ){
4142 // Higher ranked constraint.
4143 try!(self.expect(&token::Lt));
4144 let lifetime_defs = try!(self.parse_lifetime_defs());
4145 try!(self.expect_gt());
4151 let bounded_ty = try!(self.parse_ty());
4153 if try!(self.eat(&token::Colon) ){
4154 let bounds = try!(self.parse_ty_param_bounds(BoundParsingMode::Bare));
4155 let hi = self.last_span.hi;
4156 let span = mk_sp(lo, hi);
4158 if bounds.is_empty() {
4160 "each predicate in a `where` clause must have \
4161 at least one bound in it");
4164 where_clause.predicates.push(ast::WherePredicate::BoundPredicate(
4165 ast::WhereBoundPredicate {
4167 bound_lifetimes: bound_lifetimes,
4168 bounded_ty: bounded_ty,
4172 parsed_something = true;
4173 } else if try!(self.eat(&token::Eq) ){
4174 // let ty = try!(self.parse_ty());
4175 let hi = self.last_span.hi;
4176 let span = mk_sp(lo, hi);
4177 // where_clause.predicates.push(
4178 // ast::WherePredicate::EqPredicate(ast::WhereEqPredicate {
4179 // id: ast::DUMMY_NODE_ID,
4181 // path: panic!("NYI"), //bounded_ty,
4184 // parsed_something = true;
4187 "equality constraints are not yet supported \
4188 in where clauses (#20041)");
4190 let last_span = self.last_span;
4191 self.span_err(last_span,
4192 "unexpected token in `where` clause");
4197 if !try!(self.eat(&token::Comma) ){
4202 if !parsed_something {
4203 let last_span = self.last_span;
4204 self.span_err(last_span,
4205 "a `where` clause must have at least one predicate \
4212 fn parse_fn_args(&mut self, named_args: bool, allow_variadic: bool)
4213 -> PResult<(Vec<Arg> , bool)> {
4215 let mut args: Vec<Option<Arg>> =
4216 try!(self.parse_unspanned_seq(
4217 &token::OpenDelim(token::Paren),
4218 &token::CloseDelim(token::Paren),
4219 seq_sep_trailing_allowed(token::Comma),
4221 if p.token == token::DotDotDot {
4224 if p.token != token::CloseDelim(token::Paren) {
4226 return Err(p.span_fatal(span,
4227 "`...` must be last in argument list for variadic function"))
4231 return Err(p.span_fatal(span,
4232 "only foreign functions are allowed to be variadic"))
4236 Ok(Some(try!(p.parse_arg_general(named_args))))
4241 let variadic = match args.pop() {
4244 // Need to put back that last arg
4251 if variadic && args.is_empty() {
4253 "variadic function must be declared with at least one named argument");
4256 let args = args.into_iter().map(|x| x.unwrap()).collect();
4258 Ok((args, variadic))
4261 /// Parse the argument list and result type of a function declaration
4262 pub fn parse_fn_decl(&mut self, allow_variadic: bool) -> PResult<P<FnDecl>> {
4264 let (args, variadic) = try!(self.parse_fn_args(true, allow_variadic));
4265 let ret_ty = try!(self.parse_ret_ty());
4274 fn is_self_ident(&mut self) -> bool {
4276 token::Ident(id, token::Plain) => id.name == special_idents::self_.name,
4281 fn expect_self_ident(&mut self) -> PResult<ast::Ident> {
4283 token::Ident(id, token::Plain) if id.name == special_idents::self_.name => {
4288 let token_str = self.this_token_to_string();
4289 return Err(self.fatal(&format!("expected `self`, found `{}`",
4295 fn is_self_type_ident(&mut self) -> bool {
4297 token::Ident(id, token::Plain) => id.name == special_idents::type_self.name,
4302 fn expect_self_type_ident(&mut self) -> PResult<ast::Ident> {
4304 token::Ident(id, token::Plain) if id.name == special_idents::type_self.name => {
4309 let token_str = self.this_token_to_string();
4310 Err(self.fatal(&format!("expected `Self`, found `{}`",
4316 /// Parse the argument list and result type of a function
4317 /// that may have a self type.
4318 fn parse_fn_decl_with_self<F>(&mut self,
4319 parse_arg_fn: F) -> PResult<(ExplicitSelf, P<FnDecl>)> where
4320 F: FnMut(&mut Parser) -> PResult<Arg>,
4322 fn maybe_parse_borrowed_explicit_self(this: &mut Parser)
4323 -> PResult<ast::ExplicitSelf_> {
4324 // The following things are possible to see here:
4329 // fn(&'lt mut self)
4331 // We already know that the current token is `&`.
4333 if this.look_ahead(1, |t| t.is_keyword(keywords::SelfValue)) {
4335 Ok(SelfRegion(None, MutImmutable, try!(this.expect_self_ident())))
4336 } else if this.look_ahead(1, |t| t.is_mutability()) &&
4337 this.look_ahead(2, |t| t.is_keyword(keywords::SelfValue)) {
4339 let mutability = try!(this.parse_mutability());
4340 Ok(SelfRegion(None, mutability, try!(this.expect_self_ident())))
4341 } else if this.look_ahead(1, |t| t.is_lifetime()) &&
4342 this.look_ahead(2, |t| t.is_keyword(keywords::SelfValue)) {
4344 let lifetime = try!(this.parse_lifetime());
4345 Ok(SelfRegion(Some(lifetime), MutImmutable, try!(this.expect_self_ident())))
4346 } else if this.look_ahead(1, |t| t.is_lifetime()) &&
4347 this.look_ahead(2, |t| t.is_mutability()) &&
4348 this.look_ahead(3, |t| t.is_keyword(keywords::SelfValue)) {
4350 let lifetime = try!(this.parse_lifetime());
4351 let mutability = try!(this.parse_mutability());
4352 Ok(SelfRegion(Some(lifetime), mutability, try!(this.expect_self_ident())))
4358 try!(self.expect(&token::OpenDelim(token::Paren)));
4360 // A bit of complexity and lookahead is needed here in order to be
4361 // backwards compatible.
4362 let lo = self.span.lo;
4363 let mut self_ident_lo = self.span.lo;
4364 let mut self_ident_hi = self.span.hi;
4366 let mut mutbl_self = MutImmutable;
4367 let explicit_self = match self.token {
4368 token::BinOp(token::And) => {
4369 let eself = try!(maybe_parse_borrowed_explicit_self(self));
4370 self_ident_lo = self.last_span.lo;
4371 self_ident_hi = self.last_span.hi;
4374 token::BinOp(token::Star) => {
4375 // Possibly "*self" or "*mut self" -- not supported. Try to avoid
4376 // emitting cryptic "unexpected token" errors.
4378 let _mutability = if self.token.is_mutability() {
4379 try!(self.parse_mutability())
4383 if self.is_self_ident() {
4384 let span = self.span;
4385 self.span_err(span, "cannot pass self by raw pointer");
4388 // error case, making bogus self ident:
4389 SelfValue(special_idents::self_)
4391 token::Ident(..) => {
4392 if self.is_self_ident() {
4393 let self_ident = try!(self.expect_self_ident());
4395 // Determine whether this is the fully explicit form, `self:
4397 if try!(self.eat(&token::Colon) ){
4398 SelfExplicit(try!(self.parse_ty_sum()), self_ident)
4400 SelfValue(self_ident)
4402 } else if self.token.is_mutability() &&
4403 self.look_ahead(1, |t| t.is_keyword(keywords::SelfValue)) {
4404 mutbl_self = try!(self.parse_mutability());
4405 let self_ident = try!(self.expect_self_ident());
4407 // Determine whether this is the fully explicit form,
4409 if try!(self.eat(&token::Colon) ){
4410 SelfExplicit(try!(self.parse_ty_sum()), self_ident)
4412 SelfValue(self_ident)
4421 let explicit_self_sp = mk_sp(self_ident_lo, self_ident_hi);
4423 // shared fall-through for the three cases below. borrowing prevents simply
4424 // writing this as a closure
4425 macro_rules! parse_remaining_arguments {
4428 // If we parsed a self type, expect a comma before the argument list.
4432 let sep = seq_sep_trailing_allowed(token::Comma);
4433 let mut fn_inputs = try!(self.parse_seq_to_before_end(
4434 &token::CloseDelim(token::Paren),
4438 fn_inputs.insert(0, Arg::new_self(explicit_self_sp, mutbl_self, $self_id));
4441 token::CloseDelim(token::Paren) => {
4442 vec!(Arg::new_self(explicit_self_sp, mutbl_self, $self_id))
4445 let token_str = self.this_token_to_string();
4446 return Err(self.fatal(&format!("expected `,` or `)`, found `{}`",
4453 let fn_inputs = match explicit_self {
4455 let sep = seq_sep_trailing_allowed(token::Comma);
4456 try!(self.parse_seq_to_before_end(&token::CloseDelim(token::Paren),
4459 SelfValue(id) => parse_remaining_arguments!(id),
4460 SelfRegion(_,_,id) => parse_remaining_arguments!(id),
4461 SelfExplicit(_,id) => parse_remaining_arguments!(id),
4465 try!(self.expect(&token::CloseDelim(token::Paren)));
4467 let hi = self.span.hi;
4469 let ret_ty = try!(self.parse_ret_ty());
4471 let fn_decl = P(FnDecl {
4477 Ok((spanned(lo, hi, explicit_self), fn_decl))
4480 // parse the |arg, arg| header on a lambda
4481 fn parse_fn_block_decl(&mut self) -> PResult<P<FnDecl>> {
4482 let inputs_captures = {
4483 if try!(self.eat(&token::OrOr) ){
4486 try!(self.expect(&token::BinOp(token::Or)));
4487 try!(self.parse_obsolete_closure_kind());
4488 let args = try!(self.parse_seq_to_before_end(
4489 &token::BinOp(token::Or),
4490 seq_sep_trailing_allowed(token::Comma),
4491 |p| p.parse_fn_block_arg()
4497 let output = try!(self.parse_ret_ty());
4500 inputs: inputs_captures,
4506 /// Parse the name and optional generic types of a function header.
4507 fn parse_fn_header(&mut self) -> PResult<(Ident, ast::Generics)> {
4508 let id = try!(self.parse_ident());
4509 let generics = try!(self.parse_generics());
4513 fn mk_item(&mut self, lo: BytePos, hi: BytePos, ident: Ident,
4514 node: Item_, vis: Visibility,
4515 attrs: Vec<Attribute>) -> P<Item> {
4519 id: ast::DUMMY_NODE_ID,
4526 /// Parse an item-position function declaration.
4527 fn parse_item_fn(&mut self,
4529 constness: Constness,
4531 -> PResult<ItemInfo> {
4532 let (ident, mut generics) = try!(self.parse_fn_header());
4533 let decl = try!(self.parse_fn_decl(false));
4534 generics.where_clause = try!(self.parse_where_clause());
4535 let (inner_attrs, body) = try!(self.parse_inner_attrs_and_block());
4536 Ok((ident, ItemFn(decl, unsafety, constness, abi, generics, body), Some(inner_attrs)))
4539 /// true if we are looking at `const ID`, false for things like `const fn` etc
4540 pub fn is_const_item(&mut self) -> bool {
4541 self.token.is_keyword(keywords::Const) &&
4542 !self.look_ahead(1, |t| t.is_keyword(keywords::Fn)) &&
4543 !self.look_ahead(1, |t| t.is_keyword(keywords::Unsafe))
4546 /// parses all the "front matter" for a `fn` declaration, up to
4547 /// and including the `fn` keyword:
4551 /// - `const unsafe fn`
4554 pub fn parse_fn_front_matter(&mut self) -> PResult<(ast::Constness, ast::Unsafety, abi::Abi)> {
4555 let is_const_fn = try!(self.eat_keyword(keywords::Const));
4556 let unsafety = try!(self.parse_unsafety());
4557 let (constness, unsafety, abi) = if is_const_fn {
4558 (Constness::Const, unsafety, abi::Rust)
4560 let abi = if try!(self.eat_keyword(keywords::Extern)) {
4561 try!(self.parse_opt_abi()).unwrap_or(abi::C)
4565 (Constness::NotConst, unsafety, abi)
4567 try!(self.expect_keyword(keywords::Fn));
4568 Ok((constness, unsafety, abi))
4571 /// Parse an impl item.
4572 pub fn parse_impl_item(&mut self) -> PResult<P<ImplItem>> {
4573 maybe_whole!(no_clone self, NtImplItem);
4575 let mut attrs = try!(self.parse_outer_attributes());
4576 let lo = self.span.lo;
4577 let vis = try!(self.parse_visibility());
4578 let (name, node) = if try!(self.eat_keyword(keywords::Type)) {
4579 let name = try!(self.parse_ident());
4580 try!(self.expect(&token::Eq));
4581 let typ = try!(self.parse_ty_sum());
4582 try!(self.expect(&token::Semi));
4583 (name, ast::ImplItemKind::Type(typ))
4584 } else if self.is_const_item() {
4585 try!(self.expect_keyword(keywords::Const));
4586 let name = try!(self.parse_ident());
4587 try!(self.expect(&token::Colon));
4588 let typ = try!(self.parse_ty_sum());
4589 try!(self.expect(&token::Eq));
4590 let expr = try!(self.parse_expr());
4591 try!(self.commit_expr_expecting(&expr, token::Semi));
4592 (name, ast::ImplItemKind::Const(typ, expr))
4594 let (name, inner_attrs, node) = try!(self.parse_impl_method(vis));
4595 attrs.extend(inner_attrs);
4600 id: ast::DUMMY_NODE_ID,
4601 span: mk_sp(lo, self.last_span.hi),
4609 fn complain_if_pub_macro(&mut self, visa: Visibility, span: Span) {
4612 self.span_err(span, "can't qualify macro invocation with `pub`");
4613 self.fileline_help(span, "try adjusting the macro to put `pub` inside \
4620 /// Parse a method or a macro invocation in a trait impl.
4621 fn parse_impl_method(&mut self, vis: Visibility)
4622 -> PResult<(Ident, Vec<ast::Attribute>, ast::ImplItemKind)> {
4623 // code copied from parse_macro_use_or_failure... abstraction!
4624 if !self.token.is_any_keyword()
4625 && self.look_ahead(1, |t| *t == token::Not)
4626 && (self.look_ahead(2, |t| *t == token::OpenDelim(token::Paren))
4627 || self.look_ahead(2, |t| *t == token::OpenDelim(token::Brace))) {
4630 let last_span = self.last_span;
4631 self.complain_if_pub_macro(vis, last_span);
4633 let lo = self.span.lo;
4634 let pth = try!(self.parse_path(NoTypesAllowed));
4635 try!(self.expect(&token::Not));
4637 // eat a matched-delimiter token tree:
4638 let delim = try!(self.expect_open_delim());
4639 let tts = try!(self.parse_seq_to_end(&token::CloseDelim(delim),
4641 |p| p.parse_token_tree()));
4642 let m_ = Mac_ { path: pth, tts: tts, ctxt: EMPTY_CTXT };
4643 let m: ast::Mac = codemap::Spanned { node: m_,
4645 self.last_span.hi) };
4646 if delim != token::Brace {
4647 try!(self.expect(&token::Semi))
4649 Ok((token::special_idents::invalid, vec![], ast::ImplItemKind::Macro(m)))
4651 let (constness, unsafety, abi) = try!(self.parse_fn_front_matter());
4652 let ident = try!(self.parse_ident());
4653 let mut generics = try!(self.parse_generics());
4654 let (explicit_self, decl) = try!(self.parse_fn_decl_with_self(|p| {
4657 generics.where_clause = try!(self.parse_where_clause());
4658 let (inner_attrs, body) = try!(self.parse_inner_attrs_and_block());
4659 Ok((ident, inner_attrs, ast::ImplItemKind::Method(ast::MethodSig {
4662 explicit_self: explicit_self,
4664 constness: constness,
4670 /// Parse trait Foo { ... }
4671 fn parse_item_trait(&mut self, unsafety: Unsafety) -> PResult<ItemInfo> {
4673 let ident = try!(self.parse_ident());
4674 let mut tps = try!(self.parse_generics());
4676 // Parse supertrait bounds.
4677 let bounds = try!(self.parse_colon_then_ty_param_bounds(BoundParsingMode::Bare));
4679 tps.where_clause = try!(self.parse_where_clause());
4681 let meths = try!(self.parse_trait_items());
4682 Ok((ident, ItemTrait(unsafety, tps, bounds, meths), None))
4685 /// Parses items implementations variants
4686 /// impl<T> Foo { ... }
4687 /// impl<T> ToString for &'static T { ... }
4688 /// impl Send for .. {}
4689 fn parse_item_impl(&mut self, unsafety: ast::Unsafety) -> PResult<ItemInfo> {
4690 let impl_span = self.span;
4692 // First, parse type parameters if necessary.
4693 let mut generics = try!(self.parse_generics());
4695 // Special case: if the next identifier that follows is '(', don't
4696 // allow this to be parsed as a trait.
4697 let could_be_trait = self.token != token::OpenDelim(token::Paren);
4699 let neg_span = self.span;
4700 let polarity = if try!(self.eat(&token::Not) ){
4701 ast::ImplPolarity::Negative
4703 ast::ImplPolarity::Positive
4707 let mut ty = try!(self.parse_ty_sum());
4709 // Parse traits, if necessary.
4710 let opt_trait = if could_be_trait && try!(self.eat_keyword(keywords::For) ){
4711 // New-style trait. Reinterpret the type as a trait.
4713 TyPath(None, ref path) => {
4715 path: (*path).clone(),
4720 self.span_err(ty.span, "not a trait");
4726 ast::ImplPolarity::Negative => {
4727 // This is a negated type implementation
4728 // `impl !MyType {}`, which is not allowed.
4729 self.span_err(neg_span, "inherent implementation can't be negated");
4736 if opt_trait.is_some() && try!(self.eat(&token::DotDot) ){
4737 if generics.is_parameterized() {
4738 self.span_err(impl_span, "default trait implementations are not \
4739 allowed to have generics");
4742 try!(self.expect(&token::OpenDelim(token::Brace)));
4743 try!(self.expect(&token::CloseDelim(token::Brace)));
4744 Ok((ast_util::impl_pretty_name(&opt_trait, None),
4745 ItemDefaultImpl(unsafety, opt_trait.unwrap()), None))
4747 if opt_trait.is_some() {
4748 ty = try!(self.parse_ty_sum());
4750 generics.where_clause = try!(self.parse_where_clause());
4752 try!(self.expect(&token::OpenDelim(token::Brace)));
4753 let attrs = try!(self.parse_inner_attributes());
4755 let mut impl_items = vec![];
4756 while !try!(self.eat(&token::CloseDelim(token::Brace))) {
4757 impl_items.push(try!(self.parse_impl_item()));
4760 Ok((ast_util::impl_pretty_name(&opt_trait, Some(&*ty)),
4761 ItemImpl(unsafety, polarity, generics, opt_trait, ty, impl_items),
4766 /// Parse a::B<String,i32>
4767 fn parse_trait_ref(&mut self) -> PResult<TraitRef> {
4769 path: try!(self.parse_path(LifetimeAndTypesWithoutColons)),
4770 ref_id: ast::DUMMY_NODE_ID,
4774 fn parse_late_bound_lifetime_defs(&mut self) -> PResult<Vec<ast::LifetimeDef>> {
4775 if try!(self.eat_keyword(keywords::For) ){
4776 try!(self.expect(&token::Lt));
4777 let lifetime_defs = try!(self.parse_lifetime_defs());
4778 try!(self.expect_gt());
4785 /// Parse for<'l> a::B<String,i32>
4786 fn parse_poly_trait_ref(&mut self) -> PResult<PolyTraitRef> {
4787 let lo = self.span.lo;
4788 let lifetime_defs = try!(self.parse_late_bound_lifetime_defs());
4790 Ok(ast::PolyTraitRef {
4791 bound_lifetimes: lifetime_defs,
4792 trait_ref: try!(self.parse_trait_ref()),
4793 span: mk_sp(lo, self.last_span.hi),
4797 /// Parse struct Foo { ... }
4798 fn parse_item_struct(&mut self) -> PResult<ItemInfo> {
4799 let class_name = try!(self.parse_ident());
4800 let mut generics = try!(self.parse_generics());
4802 // There is a special case worth noting here, as reported in issue #17904.
4803 // If we are parsing a tuple struct it is the case that the where clause
4804 // should follow the field list. Like so:
4806 // struct Foo<T>(T) where T: Copy;
4808 // If we are parsing a normal record-style struct it is the case
4809 // that the where clause comes before the body, and after the generics.
4810 // So if we look ahead and see a brace or a where-clause we begin
4811 // parsing a record style struct.
4813 // Otherwise if we look ahead and see a paren we parse a tuple-style
4816 let vdata = if self.token.is_keyword(keywords::Where) {
4817 generics.where_clause = try!(self.parse_where_clause());
4818 if try!(self.eat(&token::Semi)) {
4819 // If we see a: `struct Foo<T> where T: Copy;` style decl.
4820 VariantData::Unit(ast::DUMMY_NODE_ID)
4822 // If we see: `struct Foo<T> where T: Copy { ... }`
4823 VariantData::Struct(try!(self.parse_record_struct_body(ParsePub::Yes)),
4826 // No `where` so: `struct Foo<T>;`
4827 } else if try!(self.eat(&token::Semi) ){
4828 VariantData::Unit(ast::DUMMY_NODE_ID)
4829 // Record-style struct definition
4830 } else if self.token == token::OpenDelim(token::Brace) {
4831 VariantData::Struct(try!(self.parse_record_struct_body(ParsePub::Yes)),
4833 // Tuple-style struct definition with optional where-clause.
4834 } else if self.token == token::OpenDelim(token::Paren) {
4835 let body = VariantData::Tuple(try!(self.parse_tuple_struct_body(ParsePub::Yes)),
4836 ast::DUMMY_NODE_ID);
4837 generics.where_clause = try!(self.parse_where_clause());
4838 try!(self.expect(&token::Semi));
4841 let token_str = self.this_token_to_string();
4842 return Err(self.fatal(&format!("expected `where`, `{{`, `(`, or `;` after struct \
4843 name, found `{}`", token_str)))
4846 Ok((class_name, ItemStruct(vdata, generics), None))
4849 pub fn parse_record_struct_body(&mut self, parse_pub: ParsePub) -> PResult<Vec<StructField>> {
4850 let mut fields = Vec::new();
4851 if try!(self.eat(&token::OpenDelim(token::Brace)) ){
4852 while self.token != token::CloseDelim(token::Brace) {
4853 fields.push(try!(self.parse_struct_decl_field(parse_pub)));
4858 let token_str = self.this_token_to_string();
4859 return Err(self.fatal(&format!("expected `where`, or `{{` after struct \
4867 pub fn parse_tuple_struct_body(&mut self, parse_pub: ParsePub) -> PResult<Vec<StructField>> {
4868 // This is the case where we find `struct Foo<T>(T) where T: Copy;`
4869 // Unit like structs are handled in parse_item_struct function
4870 let fields = try!(self.parse_unspanned_seq(
4871 &token::OpenDelim(token::Paren),
4872 &token::CloseDelim(token::Paren),
4873 seq_sep_trailing_allowed(token::Comma),
4875 let attrs = try!(p.parse_outer_attributes());
4877 let struct_field_ = ast::StructField_ {
4878 kind: UnnamedField (
4879 if parse_pub == ParsePub::Yes {
4880 try!(p.parse_visibility())
4885 id: ast::DUMMY_NODE_ID,
4886 ty: try!(p.parse_ty_sum()),
4889 Ok(spanned(lo, p.span.hi, struct_field_))
4895 /// Parse a structure field declaration
4896 pub fn parse_single_struct_field(&mut self,
4898 attrs: Vec<Attribute> )
4899 -> PResult<StructField> {
4900 let a_var = try!(self.parse_name_and_ty(vis, attrs));
4905 token::CloseDelim(token::Brace) => {}
4907 let span = self.span;
4908 let token_str = self.this_token_to_string();
4909 return Err(self.span_fatal_help(span,
4910 &format!("expected `,`, or `}}`, found `{}`",
4912 "struct fields should be separated by commas"))
4918 /// Parse an element of a struct definition
4919 fn parse_struct_decl_field(&mut self, parse_pub: ParsePub) -> PResult<StructField> {
4921 let attrs = try!(self.parse_outer_attributes());
4923 if try!(self.eat_keyword(keywords::Pub) ){
4924 if parse_pub == ParsePub::No {
4925 let span = self.last_span;
4926 self.span_err(span, "`pub` is not allowed here");
4928 return self.parse_single_struct_field(Public, attrs);
4931 return self.parse_single_struct_field(Inherited, attrs);
4934 /// Parse visibility: PUB or nothing
4935 fn parse_visibility(&mut self) -> PResult<Visibility> {
4936 if try!(self.eat_keyword(keywords::Pub)) { Ok(Public) }
4937 else { Ok(Inherited) }
4940 /// Given a termination token, parse all of the items in a module
4941 fn parse_mod_items(&mut self, term: &token::Token, inner_lo: BytePos) -> PResult<Mod> {
4942 let mut items = vec![];
4943 while let Some(item) = try!(self.parse_item()) {
4947 if !try!(self.eat(term)) {
4948 let token_str = self.this_token_to_string();
4949 return Err(self.fatal(&format!("expected item, found `{}`", token_str)));
4952 let hi = if self.span == codemap::DUMMY_SP {
4959 inner: mk_sp(inner_lo, hi),
4964 fn parse_item_const(&mut self, m: Option<Mutability>) -> PResult<ItemInfo> {
4965 let id = try!(self.parse_ident());
4966 try!(self.expect(&token::Colon));
4967 let ty = try!(self.parse_ty_sum());
4968 try!(self.expect(&token::Eq));
4969 let e = try!(self.parse_expr());
4970 try!(self.commit_expr_expecting(&*e, token::Semi));
4971 let item = match m {
4972 Some(m) => ItemStatic(ty, m, e),
4973 None => ItemConst(ty, e),
4975 Ok((id, item, None))
4978 /// Parse a `mod <foo> { ... }` or `mod <foo>;` item
4979 fn parse_item_mod(&mut self, outer_attrs: &[Attribute]) -> PResult<ItemInfo> {
4980 let id_span = self.span;
4981 let id = try!(self.parse_ident());
4982 if self.check(&token::Semi) {
4984 // This mod is in an external file. Let's go get it!
4985 let (m, attrs) = try!(self.eval_src_mod(id, outer_attrs, id_span));
4986 Ok((id, m, Some(attrs)))
4988 self.push_mod_path(id, outer_attrs);
4989 try!(self.expect(&token::OpenDelim(token::Brace)));
4990 let mod_inner_lo = self.span.lo;
4991 let old_owns_directory = self.owns_directory;
4992 self.owns_directory = true;
4993 let attrs = try!(self.parse_inner_attributes());
4994 let m = try!(self.parse_mod_items(&token::CloseDelim(token::Brace), mod_inner_lo));
4995 self.owns_directory = old_owns_directory;
4996 self.pop_mod_path();
4997 Ok((id, ItemMod(m), Some(attrs)))
5001 fn push_mod_path(&mut self, id: Ident, attrs: &[Attribute]) {
5002 let default_path = self.id_to_interned_str(id);
5003 let file_path = match ::attr::first_attr_value_str_by_name(attrs, "path") {
5005 None => default_path,
5007 self.mod_path_stack.push(file_path)
5010 fn pop_mod_path(&mut self) {
5011 self.mod_path_stack.pop().unwrap();
5014 pub fn submod_path_from_attr(attrs: &[ast::Attribute], dir_path: &Path) -> Option<PathBuf> {
5015 ::attr::first_attr_value_str_by_name(attrs, "path").map(|d| dir_path.join(&*d))
5018 /// Returns either a path to a module, or .
5019 pub fn default_submod_path(id: ast::Ident, dir_path: &Path, codemap: &CodeMap) -> ModulePath
5021 let mod_name = id.to_string();
5022 let default_path_str = format!("{}.rs", mod_name);
5023 let secondary_path_str = format!("{}/mod.rs", mod_name);
5024 let default_path = dir_path.join(&default_path_str);
5025 let secondary_path = dir_path.join(&secondary_path_str);
5026 let default_exists = codemap.file_exists(&default_path);
5027 let secondary_exists = codemap.file_exists(&secondary_path);
5029 let result = match (default_exists, secondary_exists) {
5030 (true, false) => Ok(ModulePathSuccess { path: default_path, owns_directory: false }),
5031 (false, true) => Ok(ModulePathSuccess { path: secondary_path, owns_directory: true }),
5032 (false, false) => Err(ModulePathError {
5033 err_msg: format!("file not found for module `{}`", mod_name),
5034 help_msg: format!("name the file either {} or {} inside the directory {:?}",
5037 dir_path.display()),
5039 (true, true) => Err(ModulePathError {
5040 err_msg: format!("file for module `{}` found at both {} and {}",
5043 secondary_path_str),
5044 help_msg: "delete or rename one of them to remove the ambiguity".to_owned(),
5050 path_exists: default_exists || secondary_exists,
5055 fn submod_path(&mut self,
5057 outer_attrs: &[ast::Attribute],
5058 id_sp: Span) -> PResult<ModulePathSuccess> {
5059 let mut prefix = PathBuf::from(&self.sess.codemap().span_to_filename(self.span));
5061 let mut dir_path = prefix;
5062 for part in &self.mod_path_stack {
5063 dir_path.push(&**part);
5066 if let Some(p) = Parser::submod_path_from_attr(outer_attrs, &dir_path) {
5067 return Ok(ModulePathSuccess { path: p, owns_directory: true });
5070 let paths = Parser::default_submod_path(id, &dir_path, self.sess.codemap());
5072 if !self.owns_directory {
5073 self.span_err(id_sp, "cannot declare a new module at this location");
5074 let this_module = match self.mod_path_stack.last() {
5075 Some(name) => name.to_string(),
5076 None => self.root_module_name.as_ref().unwrap().clone(),
5078 self.span_note(id_sp,
5079 &format!("maybe move this module `{0}` to its own directory \
5082 if paths.path_exists {
5083 self.span_note(id_sp,
5084 &format!("... or maybe `use` the module `{}` instead \
5085 of possibly redeclaring it",
5088 self.abort_if_errors();
5091 match paths.result {
5092 Ok(succ) => Ok(succ),
5093 Err(err) => Err(self.span_fatal_help(id_sp, &err.err_msg, &err.help_msg)),
5097 /// Read a module from a source file.
5098 fn eval_src_mod(&mut self,
5100 outer_attrs: &[ast::Attribute],
5102 -> PResult<(ast::Item_, Vec<ast::Attribute> )> {
5103 let ModulePathSuccess { path, owns_directory } = try!(self.submod_path(id,
5107 self.eval_src_mod_from_path(path,
5113 fn eval_src_mod_from_path(&mut self,
5115 owns_directory: bool,
5117 id_sp: Span) -> PResult<(ast::Item_, Vec<ast::Attribute> )> {
5118 let mut included_mod_stack = self.sess.included_mod_stack.borrow_mut();
5119 match included_mod_stack.iter().position(|p| *p == path) {
5121 let mut err = String::from("circular modules: ");
5122 let len = included_mod_stack.len();
5123 for p in &included_mod_stack[i.. len] {
5124 err.push_str(&p.to_string_lossy());
5125 err.push_str(" -> ");
5127 err.push_str(&path.to_string_lossy());
5128 return Err(self.span_fatal(id_sp, &err[..]));
5132 included_mod_stack.push(path.clone());
5133 drop(included_mod_stack);
5135 let mut p0 = new_sub_parser_from_file(self.sess,
5141 let mod_inner_lo = p0.span.lo;
5142 let mod_attrs = try!(p0.parse_inner_attributes());
5143 let m0 = try!(p0.parse_mod_items(&token::Eof, mod_inner_lo));
5144 self.sess.included_mod_stack.borrow_mut().pop();
5145 Ok((ast::ItemMod(m0), mod_attrs))
5148 /// Parse a function declaration from a foreign module
5149 fn parse_item_foreign_fn(&mut self, vis: ast::Visibility, lo: BytePos,
5150 attrs: Vec<Attribute>) -> PResult<P<ForeignItem>> {
5151 try!(self.expect_keyword(keywords::Fn));
5153 let (ident, mut generics) = try!(self.parse_fn_header());
5154 let decl = try!(self.parse_fn_decl(true));
5155 generics.where_clause = try!(self.parse_where_clause());
5156 let hi = self.span.hi;
5157 try!(self.expect(&token::Semi));
5158 Ok(P(ast::ForeignItem {
5161 node: ForeignItemFn(decl, generics),
5162 id: ast::DUMMY_NODE_ID,
5163 span: mk_sp(lo, hi),
5168 /// Parse a static item from a foreign module
5169 fn parse_item_foreign_static(&mut self, vis: ast::Visibility, lo: BytePos,
5170 attrs: Vec<Attribute>) -> PResult<P<ForeignItem>> {
5171 try!(self.expect_keyword(keywords::Static));
5172 let mutbl = try!(self.eat_keyword(keywords::Mut));
5174 let ident = try!(self.parse_ident());
5175 try!(self.expect(&token::Colon));
5176 let ty = try!(self.parse_ty_sum());
5177 let hi = self.span.hi;
5178 try!(self.expect(&token::Semi));
5182 node: ForeignItemStatic(ty, mutbl),
5183 id: ast::DUMMY_NODE_ID,
5184 span: mk_sp(lo, hi),
5189 /// Parse extern crate links
5193 /// extern crate foo;
5194 /// extern crate bar as foo;
5195 fn parse_item_extern_crate(&mut self,
5197 visibility: Visibility,
5198 attrs: Vec<Attribute>)
5199 -> PResult<P<Item>> {
5201 let crate_name = try!(self.parse_ident());
5202 let (maybe_path, ident) = if let Some(ident) = try!(self.parse_rename()) {
5203 (Some(crate_name.name), ident)
5207 try!(self.expect(&token::Semi));
5209 let last_span = self.last_span;
5211 if visibility == ast::Public {
5212 self.span_warn(mk_sp(lo, last_span.hi),
5213 "`pub extern crate` does not work as expected and should not be used. \
5214 Likely to become an error. Prefer `extern crate` and `pub use`.");
5220 ItemExternCrate(maybe_path),
5225 /// Parse `extern` for foreign ABIs
5228 /// `extern` is expected to have been
5229 /// consumed before calling this method
5235 fn parse_item_foreign_mod(&mut self,
5237 opt_abi: Option<abi::Abi>,
5238 visibility: Visibility,
5239 mut attrs: Vec<Attribute>)
5240 -> PResult<P<Item>> {
5241 try!(self.expect(&token::OpenDelim(token::Brace)));
5243 let abi = opt_abi.unwrap_or(abi::C);
5245 attrs.extend(try!(self.parse_inner_attributes()));
5247 let mut foreign_items = vec![];
5248 while let Some(item) = try!(self.parse_foreign_item()) {
5249 foreign_items.push(item);
5251 try!(self.expect(&token::CloseDelim(token::Brace)));
5253 let last_span = self.last_span;
5254 let m = ast::ForeignMod {
5256 items: foreign_items
5260 special_idents::invalid,
5266 /// Parse type Foo = Bar;
5267 fn parse_item_type(&mut self) -> PResult<ItemInfo> {
5268 let ident = try!(self.parse_ident());
5269 let mut tps = try!(self.parse_generics());
5270 tps.where_clause = try!(self.parse_where_clause());
5271 try!(self.expect(&token::Eq));
5272 let ty = try!(self.parse_ty_sum());
5273 try!(self.expect(&token::Semi));
5274 Ok((ident, ItemTy(ty, tps), None))
5277 /// Parse the part of an "enum" decl following the '{'
5278 fn parse_enum_def(&mut self, _generics: &ast::Generics) -> PResult<EnumDef> {
5279 let mut variants = Vec::new();
5280 let mut all_nullary = true;
5281 let mut any_disr = None;
5282 while self.token != token::CloseDelim(token::Brace) {
5283 let variant_attrs = try!(self.parse_outer_attributes());
5284 let vlo = self.span.lo;
5287 let mut disr_expr = None;
5288 let ident = try!(self.parse_ident());
5289 if self.check(&token::OpenDelim(token::Brace)) {
5290 // Parse a struct variant.
5291 all_nullary = false;
5292 struct_def = VariantData::Struct(try!(self.parse_record_struct_body(ParsePub::No)),
5293 ast::DUMMY_NODE_ID);
5294 } else if self.check(&token::OpenDelim(token::Paren)) {
5295 all_nullary = false;
5296 struct_def = VariantData::Tuple(try!(self.parse_tuple_struct_body(ParsePub::No)),
5297 ast::DUMMY_NODE_ID);
5298 } else if try!(self.eat(&token::Eq) ){
5299 disr_expr = Some(try!(self.parse_expr()));
5300 any_disr = disr_expr.as_ref().map(|expr| expr.span);
5301 struct_def = VariantData::Unit(ast::DUMMY_NODE_ID);
5303 struct_def = VariantData::Unit(ast::DUMMY_NODE_ID);
5306 let vr = ast::Variant_ {
5308 attrs: variant_attrs,
5310 disr_expr: disr_expr,
5312 variants.push(P(spanned(vlo, self.last_span.hi, vr)));
5314 if !try!(self.eat(&token::Comma)) { break; }
5316 try!(self.expect(&token::CloseDelim(token::Brace)));
5318 Some(disr_span) if !all_nullary =>
5319 self.span_err(disr_span,
5320 "discriminator values can only be used with a c-like enum"),
5324 Ok(ast::EnumDef { variants: variants })
5327 /// Parse an "enum" declaration
5328 fn parse_item_enum(&mut self) -> PResult<ItemInfo> {
5329 let id = try!(self.parse_ident());
5330 let mut generics = try!(self.parse_generics());
5331 generics.where_clause = try!(self.parse_where_clause());
5332 try!(self.expect(&token::OpenDelim(token::Brace)));
5334 let enum_definition = try!(self.parse_enum_def(&generics));
5335 Ok((id, ItemEnum(enum_definition, generics), None))
5338 /// Parses a string as an ABI spec on an extern type or module. Consumes
5339 /// the `extern` keyword, if one is found.
5340 fn parse_opt_abi(&mut self) -> PResult<Option<abi::Abi>> {
5342 token::Literal(token::Str_(s), suf) | token::Literal(token::StrRaw(s, _), suf) => {
5344 self.expect_no_suffix(sp, "ABI spec", suf);
5346 match abi::lookup(&s.as_str()) {
5347 Some(abi) => Ok(Some(abi)),
5349 let last_span = self.last_span;
5352 &format!("invalid ABI: expected one of [{}], \
5354 abi::all_names().join(", "),
5365 /// Parse one of the items allowed by the flags.
5366 /// NB: this function no longer parses the items inside an
5368 fn parse_item_(&mut self, attrs: Vec<Attribute>,
5369 macros_allowed: bool, attributes_allowed: bool) -> PResult<Option<P<Item>>> {
5370 let nt_item = match self.token {
5371 token::Interpolated(token::NtItem(ref item)) => {
5372 Some((**item).clone())
5379 let mut attrs = attrs;
5380 mem::swap(&mut item.attrs, &mut attrs);
5381 item.attrs.extend(attrs);
5382 return Ok(Some(P(item)));
5387 let lo = self.span.lo;
5389 let visibility = try!(self.parse_visibility());
5391 if try!(self.eat_keyword(keywords::Use) ){
5393 let item_ = ItemUse(try!(self.parse_view_path()));
5394 try!(self.expect(&token::Semi));
5396 let last_span = self.last_span;
5397 let item = self.mk_item(lo,
5399 token::special_idents::invalid,
5403 return Ok(Some(item));
5406 if try!(self.eat_keyword(keywords::Extern)) {
5407 if try!(self.eat_keyword(keywords::Crate)) {
5408 return Ok(Some(try!(self.parse_item_extern_crate(lo, visibility, attrs))));
5411 let opt_abi = try!(self.parse_opt_abi());
5413 if try!(self.eat_keyword(keywords::Fn) ){
5414 // EXTERN FUNCTION ITEM
5415 let abi = opt_abi.unwrap_or(abi::C);
5416 let (ident, item_, extra_attrs) =
5417 try!(self.parse_item_fn(Unsafety::Normal, Constness::NotConst, abi));
5418 let last_span = self.last_span;
5419 let item = self.mk_item(lo,
5424 maybe_append(attrs, extra_attrs));
5425 return Ok(Some(item));
5426 } else if self.check(&token::OpenDelim(token::Brace)) {
5427 return Ok(Some(try!(self.parse_item_foreign_mod(lo, opt_abi, visibility, attrs))));
5430 try!(self.expect_one_of(&[], &[]));
5433 if try!(self.eat_keyword(keywords::Static) ){
5435 let m = if try!(self.eat_keyword(keywords::Mut)) {MutMutable} else {MutImmutable};
5436 let (ident, item_, extra_attrs) = try!(self.parse_item_const(Some(m)));
5437 let last_span = self.last_span;
5438 let item = self.mk_item(lo,
5443 maybe_append(attrs, extra_attrs));
5444 return Ok(Some(item));
5446 if try!(self.eat_keyword(keywords::Const) ){
5447 if self.check_keyword(keywords::Fn)
5448 || (self.check_keyword(keywords::Unsafe)
5449 && self.look_ahead(1, |t| t.is_keyword(keywords::Fn))) {
5450 // CONST FUNCTION ITEM
5451 let unsafety = if try!(self.eat_keyword(keywords::Unsafe) ){
5457 let (ident, item_, extra_attrs) =
5458 try!(self.parse_item_fn(unsafety, Constness::Const, abi::Rust));
5459 let last_span = self.last_span;
5460 let item = self.mk_item(lo,
5465 maybe_append(attrs, extra_attrs));
5466 return Ok(Some(item));
5470 if try!(self.eat_keyword(keywords::Mut) ){
5471 let last_span = self.last_span;
5472 self.span_err(last_span, "const globals cannot be mutable");
5473 self.fileline_help(last_span, "did you mean to declare a static?");
5475 let (ident, item_, extra_attrs) = try!(self.parse_item_const(None));
5476 let last_span = self.last_span;
5477 let item = self.mk_item(lo,
5482 maybe_append(attrs, extra_attrs));
5483 return Ok(Some(item));
5485 if self.check_keyword(keywords::Unsafe) &&
5486 self.look_ahead(1, |t| t.is_keyword(keywords::Trait))
5488 // UNSAFE TRAIT ITEM
5489 try!(self.expect_keyword(keywords::Unsafe));
5490 try!(self.expect_keyword(keywords::Trait));
5491 let (ident, item_, extra_attrs) =
5492 try!(self.parse_item_trait(ast::Unsafety::Unsafe));
5493 let last_span = self.last_span;
5494 let item = self.mk_item(lo,
5499 maybe_append(attrs, extra_attrs));
5500 return Ok(Some(item));
5502 if self.check_keyword(keywords::Unsafe) &&
5503 self.look_ahead(1, |t| t.is_keyword(keywords::Impl))
5506 try!(self.expect_keyword(keywords::Unsafe));
5507 try!(self.expect_keyword(keywords::Impl));
5508 let (ident, item_, extra_attrs) = try!(self.parse_item_impl(ast::Unsafety::Unsafe));
5509 let last_span = self.last_span;
5510 let item = self.mk_item(lo,
5515 maybe_append(attrs, extra_attrs));
5516 return Ok(Some(item));
5518 if self.check_keyword(keywords::Fn) {
5521 let (ident, item_, extra_attrs) =
5522 try!(self.parse_item_fn(Unsafety::Normal, Constness::NotConst, abi::Rust));
5523 let last_span = self.last_span;
5524 let item = self.mk_item(lo,
5529 maybe_append(attrs, extra_attrs));
5530 return Ok(Some(item));
5532 if self.check_keyword(keywords::Unsafe)
5533 && self.look_ahead(1, |t| *t != token::OpenDelim(token::Brace)) {
5534 // UNSAFE FUNCTION ITEM
5536 let abi = if try!(self.eat_keyword(keywords::Extern) ){
5537 try!(self.parse_opt_abi()).unwrap_or(abi::C)
5541 try!(self.expect_keyword(keywords::Fn));
5542 let (ident, item_, extra_attrs) =
5543 try!(self.parse_item_fn(Unsafety::Unsafe, Constness::NotConst, abi));
5544 let last_span = self.last_span;
5545 let item = self.mk_item(lo,
5550 maybe_append(attrs, extra_attrs));
5551 return Ok(Some(item));
5553 if try!(self.eat_keyword(keywords::Mod) ){
5555 let (ident, item_, extra_attrs) =
5556 try!(self.parse_item_mod(&attrs[..]));
5557 let last_span = self.last_span;
5558 let item = self.mk_item(lo,
5563 maybe_append(attrs, extra_attrs));
5564 return Ok(Some(item));
5566 if try!(self.eat_keyword(keywords::Type) ){
5568 let (ident, item_, extra_attrs) = try!(self.parse_item_type());
5569 let last_span = self.last_span;
5570 let item = self.mk_item(lo,
5575 maybe_append(attrs, extra_attrs));
5576 return Ok(Some(item));
5578 if try!(self.eat_keyword(keywords::Enum) ){
5580 let (ident, item_, extra_attrs) = try!(self.parse_item_enum());
5581 let last_span = self.last_span;
5582 let item = self.mk_item(lo,
5587 maybe_append(attrs, extra_attrs));
5588 return Ok(Some(item));
5590 if try!(self.eat_keyword(keywords::Trait) ){
5592 let (ident, item_, extra_attrs) =
5593 try!(self.parse_item_trait(ast::Unsafety::Normal));
5594 let last_span = self.last_span;
5595 let item = self.mk_item(lo,
5600 maybe_append(attrs, extra_attrs));
5601 return Ok(Some(item));
5603 if try!(self.eat_keyword(keywords::Impl) ){
5605 let (ident, item_, extra_attrs) = try!(self.parse_item_impl(ast::Unsafety::Normal));
5606 let last_span = self.last_span;
5607 let item = self.mk_item(lo,
5612 maybe_append(attrs, extra_attrs));
5613 return Ok(Some(item));
5615 if try!(self.eat_keyword(keywords::Struct) ){
5617 let (ident, item_, extra_attrs) = try!(self.parse_item_struct());
5618 let last_span = self.last_span;
5619 let item = self.mk_item(lo,
5624 maybe_append(attrs, extra_attrs));
5625 return Ok(Some(item));
5627 self.parse_macro_use_or_failure(attrs,macros_allowed,attributes_allowed,lo,visibility)
5630 /// Parse a foreign item.
5631 fn parse_foreign_item(&mut self) -> PResult<Option<P<ForeignItem>>> {
5632 let attrs = try!(self.parse_outer_attributes());
5633 let lo = self.span.lo;
5634 let visibility = try!(self.parse_visibility());
5636 if self.check_keyword(keywords::Static) {
5637 // FOREIGN STATIC ITEM
5638 return Ok(Some(try!(self.parse_item_foreign_static(visibility, lo, attrs))));
5640 if self.check_keyword(keywords::Fn) || self.check_keyword(keywords::Unsafe) {
5641 // FOREIGN FUNCTION ITEM
5642 return Ok(Some(try!(self.parse_item_foreign_fn(visibility, lo, attrs))));
5645 // FIXME #5668: this will occur for a macro invocation:
5646 match try!(self.parse_macro_use_or_failure(attrs, true, false, lo, visibility)) {
5648 return Err(self.span_fatal(item.span, "macros cannot expand to foreign items"));
5654 /// This is the fall-through for parsing items.
5655 fn parse_macro_use_or_failure(
5657 attrs: Vec<Attribute> ,
5658 macros_allowed: bool,
5659 attributes_allowed: bool,
5661 visibility: Visibility
5662 ) -> PResult<Option<P<Item>>> {
5663 if macros_allowed && !self.token.is_any_keyword()
5664 && self.look_ahead(1, |t| *t == token::Not)
5665 && (self.look_ahead(2, |t| t.is_plain_ident())
5666 || self.look_ahead(2, |t| *t == token::OpenDelim(token::Paren))
5667 || self.look_ahead(2, |t| *t == token::OpenDelim(token::Brace))) {
5668 // MACRO INVOCATION ITEM
5670 let last_span = self.last_span;
5671 self.complain_if_pub_macro(visibility, last_span);
5673 let mac_lo = self.span.lo;
5676 let pth = try!(self.parse_path(NoTypesAllowed));
5677 try!(self.expect(&token::Not));
5679 // a 'special' identifier (like what `macro_rules!` uses)
5680 // is optional. We should eventually unify invoc syntax
5682 let id = if self.token.is_plain_ident() {
5683 try!(self.parse_ident())
5685 token::special_idents::invalid // no special identifier
5687 // eat a matched-delimiter token tree:
5688 let delim = try!(self.expect_open_delim());
5689 let tts = try!(self.parse_seq_to_end(&token::CloseDelim(delim),
5691 |p| p.parse_token_tree()));
5692 // single-variant-enum... :
5693 let m = Mac_ { path: pth, tts: tts, ctxt: EMPTY_CTXT };
5694 let m: ast::Mac = codemap::Spanned { node: m,
5696 self.last_span.hi) };
5698 if delim != token::Brace {
5699 if !try!(self.eat(&token::Semi) ){
5700 let last_span = self.last_span;
5701 self.span_err(last_span,
5702 "macros that expand to items must either \
5703 be surrounded with braces or followed by \
5708 let item_ = ItemMac(m);
5709 let last_span = self.last_span;
5710 let item = self.mk_item(lo,
5716 return Ok(Some(item));
5719 // FAILURE TO PARSE ITEM
5723 let last_span = self.last_span;
5724 return Err(self.span_fatal(last_span, "unmatched visibility `pub`"));
5728 if !attributes_allowed && !attrs.is_empty() {
5729 self.expected_item_err(&attrs);
5734 pub fn parse_item(&mut self) -> PResult<Option<P<Item>>> {
5735 let attrs = try!(self.parse_outer_attributes());
5736 self.parse_item_(attrs, true, false)
5740 /// Matches view_path : MOD? non_global_path as IDENT
5741 /// | MOD? non_global_path MOD_SEP LBRACE RBRACE
5742 /// | MOD? non_global_path MOD_SEP LBRACE ident_seq RBRACE
5743 /// | MOD? non_global_path MOD_SEP STAR
5744 /// | MOD? non_global_path
5745 fn parse_view_path(&mut self) -> PResult<P<ViewPath>> {
5746 let lo = self.span.lo;
5748 // Allow a leading :: because the paths are absolute either way.
5749 // This occurs with "use $crate::..." in macros.
5750 try!(self.eat(&token::ModSep));
5752 if self.check(&token::OpenDelim(token::Brace)) {
5754 let idents = try!(self.parse_unspanned_seq(
5755 &token::OpenDelim(token::Brace),
5756 &token::CloseDelim(token::Brace),
5757 seq_sep_trailing_allowed(token::Comma),
5758 |p| p.parse_path_list_item()));
5759 let path = ast::Path {
5760 span: mk_sp(lo, self.span.hi),
5762 segments: Vec::new()
5764 return Ok(P(spanned(lo, self.span.hi, ViewPathList(path, idents))));
5767 let first_ident = try!(self.parse_ident());
5768 let mut path = vec!(first_ident);
5769 if let token::ModSep = self.token {
5770 // foo::bar or foo::{a,b,c} or foo::*
5771 while self.check(&token::ModSep) {
5775 token::Ident(..) => {
5776 let ident = try!(self.parse_ident());
5780 // foo::bar::{a,b,c}
5781 token::OpenDelim(token::Brace) => {
5782 let idents = try!(self.parse_unspanned_seq(
5783 &token::OpenDelim(token::Brace),
5784 &token::CloseDelim(token::Brace),
5785 seq_sep_trailing_allowed(token::Comma),
5786 |p| p.parse_path_list_item()
5788 let path = ast::Path {
5789 span: mk_sp(lo, self.span.hi),
5791 segments: path.into_iter().map(|identifier| {
5793 identifier: identifier,
5794 parameters: ast::PathParameters::none(),
5798 return Ok(P(spanned(lo, self.span.hi, ViewPathList(path, idents))));
5802 token::BinOp(token::Star) => {
5804 let path = ast::Path {
5805 span: mk_sp(lo, self.span.hi),
5807 segments: path.into_iter().map(|identifier| {
5809 identifier: identifier,
5810 parameters: ast::PathParameters::none(),
5814 return Ok(P(spanned(lo, self.span.hi, ViewPathGlob(path))));
5817 // fall-through for case foo::bar::;
5819 self.span_err(self.span, "expected identifier or `{` or `*`, found `;`");
5826 let mut rename_to = path[path.len() - 1];
5827 let path = ast::Path {
5828 span: mk_sp(lo, self.last_span.hi),
5830 segments: path.into_iter().map(|identifier| {
5832 identifier: identifier,
5833 parameters: ast::PathParameters::none(),
5837 rename_to = try!(self.parse_rename()).unwrap_or(rename_to);
5838 Ok(P(spanned(lo, self.last_span.hi, ViewPathSimple(rename_to, path))))
5841 fn parse_rename(&mut self) -> PResult<Option<Ident>> {
5842 if try!(self.eat_keyword(keywords::As)) {
5843 self.parse_ident().map(Some)
5849 /// Parses a source module as a crate. This is the main
5850 /// entry point for the parser.
5851 pub fn parse_crate_mod(&mut self) -> PResult<Crate> {
5852 let lo = self.span.lo;
5854 attrs: try!(self.parse_inner_attributes()),
5855 module: try!(self.parse_mod_items(&token::Eof, lo)),
5856 config: self.cfg.clone(),
5857 span: mk_sp(lo, self.span.lo),
5858 exported_macros: Vec::new(),
5862 pub fn parse_optional_str(&mut self)
5863 -> PResult<Option<(InternedString,
5865 Option<ast::Name>)>> {
5866 let ret = match self.token {
5867 token::Literal(token::Str_(s), suf) => {
5868 (self.id_to_interned_str(ast::Ident::with_empty_ctxt(s)), ast::CookedStr, suf)
5870 token::Literal(token::StrRaw(s, n), suf) => {
5871 (self.id_to_interned_str(ast::Ident::with_empty_ctxt(s)), ast::RawStr(n), suf)
5873 _ => return Ok(None)
5879 pub fn parse_str(&mut self) -> PResult<(InternedString, StrStyle)> {
5880 match try!(self.parse_optional_str()) {
5881 Some((s, style, suf)) => {
5882 let sp = self.last_span;
5883 self.expect_no_suffix(sp, "string literal", suf);
5886 _ => Err(self.fatal("expected string literal"))