Rollup merge of #127806 - nnethercote:parser-improvements, r=spastorino
Some parser improvements I was looking closely at attribute handling in the parser while debugging some issues relating to #124141, and found a few small improvements. ``@spastorino``
This commit is contained in:
commit
fa1303662a
@ -699,8 +699,7 @@ fn is_whole_path(&self) -> bool {
|
|||||||
false
|
false
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Would `maybe_whole_expr` in `parser.rs` return `Ok(..)`?
|
/// Is this a pre-parsed expression dropped into the token stream
|
||||||
/// That is, is this a pre-parsed expression dropped into the token stream
|
|
||||||
/// (which happens while parsing the result of macro expansion)?
|
/// (which happens while parsing the result of macro expansion)?
|
||||||
pub fn is_whole_expr(&self) -> bool {
|
pub fn is_whole_expr(&self) -> bool {
|
||||||
if let Interpolated(nt) = &self.kind
|
if let Interpolated(nt) = &self.kind
|
||||||
|
@ -785,23 +785,14 @@ fn parse_assoc_op_cast(
|
|||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
self.parse_and_disallow_postfix_after_cast(cast_expr)
|
// Try to parse a postfix operator such as `.`, `?`, or index (`[]`)
|
||||||
}
|
// after a cast. If one is present, emit an error then return a valid
|
||||||
|
// parse tree; For something like `&x as T[0]` will be as if it was
|
||||||
/// Parses a postfix operators such as `.`, `?`, or index (`[]`) after a cast,
|
// written `((&x) as T)[0]`.
|
||||||
/// then emits an error and returns the newly parsed tree.
|
|
||||||
/// The resulting parse tree for `&x as T[0]` has a precedence of `((&x) as T)[0]`.
|
|
||||||
fn parse_and_disallow_postfix_after_cast(
|
|
||||||
&mut self,
|
|
||||||
cast_expr: P<Expr>,
|
|
||||||
) -> PResult<'a, P<Expr>> {
|
|
||||||
if let ExprKind::Type(_, _) = cast_expr.kind {
|
|
||||||
panic!("ExprKind::Type must not be parsed");
|
|
||||||
}
|
|
||||||
|
|
||||||
let span = cast_expr.span;
|
let span = cast_expr.span;
|
||||||
|
|
||||||
let with_postfix = self.parse_expr_dot_or_call_with_(cast_expr, span)?;
|
let with_postfix = self.parse_expr_dot_or_call_with(AttrVec::new(), cast_expr, span)?;
|
||||||
|
|
||||||
// Check if an illegal postfix operator has been added after the cast.
|
// Check if an illegal postfix operator has been added after the cast.
|
||||||
// If the resulting expression is not a cast, it is an illegal postfix operator.
|
// If the resulting expression is not a cast, it is an illegal postfix operator.
|
||||||
@ -885,42 +876,22 @@ fn parse_expr_dot_or_call(&mut self, attrs: AttrWrapper) -> PResult<'a, P<Expr>>
|
|||||||
self.collect_tokens_for_expr(attrs, |this, attrs| {
|
self.collect_tokens_for_expr(attrs, |this, attrs| {
|
||||||
let base = this.parse_expr_bottom()?;
|
let base = this.parse_expr_bottom()?;
|
||||||
let span = this.interpolated_or_expr_span(&base);
|
let span = this.interpolated_or_expr_span(&base);
|
||||||
this.parse_expr_dot_or_call_with(base, span, attrs)
|
this.parse_expr_dot_or_call_with(attrs, base, span)
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
pub(super) fn parse_expr_dot_or_call_with(
|
pub(super) fn parse_expr_dot_or_call_with(
|
||||||
&mut self,
|
&mut self,
|
||||||
e0: P<Expr>,
|
|
||||||
lo: Span,
|
|
||||||
mut attrs: ast::AttrVec,
|
mut attrs: ast::AttrVec,
|
||||||
|
mut e: P<Expr>,
|
||||||
|
lo: Span,
|
||||||
) -> PResult<'a, P<Expr>> {
|
) -> PResult<'a, P<Expr>> {
|
||||||
// Stitch the list of outer attributes onto the return value.
|
let res = ensure_sufficient_stack(|| {
|
||||||
// A little bit ugly, but the best way given the current code
|
|
||||||
// structure
|
|
||||||
let res = ensure_sufficient_stack(
|
|
||||||
// this expr demonstrates the recursion it guards against
|
|
||||||
|| self.parse_expr_dot_or_call_with_(e0, lo),
|
|
||||||
);
|
|
||||||
if attrs.is_empty() {
|
|
||||||
res
|
|
||||||
} else {
|
|
||||||
res.map(|expr| {
|
|
||||||
expr.map(|mut expr| {
|
|
||||||
attrs.extend(expr.attrs);
|
|
||||||
expr.attrs = attrs;
|
|
||||||
expr
|
|
||||||
})
|
|
||||||
})
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn parse_expr_dot_or_call_with_(&mut self, mut e: P<Expr>, lo: Span) -> PResult<'a, P<Expr>> {
|
|
||||||
loop {
|
loop {
|
||||||
let has_question =
|
let has_question =
|
||||||
if self.prev_token.kind == TokenKind::Ident(kw::Return, IdentIsRaw::No) {
|
if self.prev_token.kind == TokenKind::Ident(kw::Return, IdentIsRaw::No) {
|
||||||
// we are using noexpect here because we don't expect a `?` directly after a `return`
|
// We are using noexpect here because we don't expect a `?` directly after
|
||||||
// which could be suggested otherwise
|
// a `return` which could be suggested otherwise.
|
||||||
self.eat_noexpect(&token::Question)
|
self.eat_noexpect(&token::Question)
|
||||||
} else {
|
} else {
|
||||||
self.eat(&token::Question)
|
self.eat(&token::Question)
|
||||||
@ -930,9 +901,10 @@ fn parse_expr_dot_or_call_with_(&mut self, mut e: P<Expr>, lo: Span) -> PResult<
|
|||||||
e = self.mk_expr(lo.to(self.prev_token.span), ExprKind::Try(e));
|
e = self.mk_expr(lo.to(self.prev_token.span), ExprKind::Try(e));
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
let has_dot = if self.prev_token.kind == TokenKind::Ident(kw::Return, IdentIsRaw::No) {
|
let has_dot =
|
||||||
// we are using noexpect here because we don't expect a `.` directly after a `return`
|
if self.prev_token.kind == TokenKind::Ident(kw::Return, IdentIsRaw::No) {
|
||||||
// which could be suggested otherwise
|
// We are using noexpect here because we don't expect a `.` directly after
|
||||||
|
// a `return` which could be suggested otherwise.
|
||||||
self.eat_noexpect(&token::Dot)
|
self.eat_noexpect(&token::Dot)
|
||||||
} else if self.token.kind == TokenKind::RArrow && self.may_recover() {
|
} else if self.token.kind == TokenKind::RArrow && self.may_recover() {
|
||||||
// Recovery for `expr->suffix`.
|
// Recovery for `expr->suffix`.
|
||||||
@ -957,6 +929,21 @@ fn parse_expr_dot_or_call_with_(&mut self, mut e: P<Expr>, lo: Span) -> PResult<
|
|||||||
_ => return Ok(e),
|
_ => return Ok(e),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
});
|
||||||
|
|
||||||
|
// Stitch the list of outer attributes onto the return value. A little
|
||||||
|
// bit ugly, but the best way given the current code structure.
|
||||||
|
if attrs.is_empty() {
|
||||||
|
res
|
||||||
|
} else {
|
||||||
|
res.map(|expr| {
|
||||||
|
expr.map(|mut expr| {
|
||||||
|
attrs.extend(expr.attrs);
|
||||||
|
expr.attrs = attrs;
|
||||||
|
expr
|
||||||
|
})
|
||||||
|
})
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub(super) fn parse_dot_suffix_expr(
|
pub(super) fn parse_dot_suffix_expr(
|
||||||
@ -1388,7 +1375,7 @@ fn parse_dot_suffix(&mut self, self_arg: P<Expr>, lo: Span) -> PResult<'a, P<Exp
|
|||||||
/// Parses things like parenthesized exprs, macros, `return`, etc.
|
/// Parses things like parenthesized exprs, macros, `return`, etc.
|
||||||
///
|
///
|
||||||
/// N.B., this does not parse outer attributes, and is private because it only works
|
/// N.B., this does not parse outer attributes, and is private because it only works
|
||||||
/// correctly if called from `parse_dot_or_call_expr()`.
|
/// correctly if called from `parse_expr_dot_or_call`.
|
||||||
fn parse_expr_bottom(&mut self) -> PResult<'a, P<Expr>> {
|
fn parse_expr_bottom(&mut self) -> PResult<'a, P<Expr>> {
|
||||||
maybe_recover_from_interpolated_ty_qpath!(self, true);
|
maybe_recover_from_interpolated_ty_qpath!(self, true);
|
||||||
|
|
||||||
|
@ -128,27 +128,11 @@ pub(super) fn parse_item_common(
|
|||||||
Some(item.into_inner())
|
Some(item.into_inner())
|
||||||
});
|
});
|
||||||
|
|
||||||
let item =
|
self.collect_tokens_trailing_token(attrs, force_collect, |this, mut attrs| {
|
||||||
self.collect_tokens_trailing_token(attrs, force_collect, |this: &mut Self, attrs| {
|
let lo = this.token.span;
|
||||||
let item =
|
let vis = this.parse_visibility(FollowedByType::No)?;
|
||||||
this.parse_item_common_(attrs, mac_allowed, attrs_allowed, fn_parse_mode);
|
let mut def = this.parse_defaultness();
|
||||||
Ok((item?, TrailingToken::None))
|
let kind = this.parse_item_kind(
|
||||||
})?;
|
|
||||||
|
|
||||||
Ok(item)
|
|
||||||
}
|
|
||||||
|
|
||||||
fn parse_item_common_(
|
|
||||||
&mut self,
|
|
||||||
mut attrs: AttrVec,
|
|
||||||
mac_allowed: bool,
|
|
||||||
attrs_allowed: bool,
|
|
||||||
fn_parse_mode: FnParseMode,
|
|
||||||
) -> PResult<'a, Option<Item>> {
|
|
||||||
let lo = self.token.span;
|
|
||||||
let vis = self.parse_visibility(FollowedByType::No)?;
|
|
||||||
let mut def = self.parse_defaultness();
|
|
||||||
let kind = self.parse_item_kind(
|
|
||||||
&mut attrs,
|
&mut attrs,
|
||||||
mac_allowed,
|
mac_allowed,
|
||||||
lo,
|
lo,
|
||||||
@ -158,26 +142,27 @@ fn parse_item_common_(
|
|||||||
Case::Sensitive,
|
Case::Sensitive,
|
||||||
)?;
|
)?;
|
||||||
if let Some((ident, kind)) = kind {
|
if let Some((ident, kind)) = kind {
|
||||||
self.error_on_unconsumed_default(def, &kind);
|
this.error_on_unconsumed_default(def, &kind);
|
||||||
let span = lo.to(self.prev_token.span);
|
let span = lo.to(this.prev_token.span);
|
||||||
let id = DUMMY_NODE_ID;
|
let id = DUMMY_NODE_ID;
|
||||||
let item = Item { ident, attrs, id, kind, vis, span, tokens: None };
|
let item = Item { ident, attrs, id, kind, vis, span, tokens: None };
|
||||||
return Ok(Some(item));
|
return Ok((Some(item), TrailingToken::None));
|
||||||
}
|
}
|
||||||
|
|
||||||
// At this point, we have failed to parse an item.
|
// At this point, we have failed to parse an item.
|
||||||
if !matches!(vis.kind, VisibilityKind::Inherited) {
|
if !matches!(vis.kind, VisibilityKind::Inherited) {
|
||||||
self.dcx().emit_err(errors::VisibilityNotFollowedByItem { span: vis.span, vis });
|
this.dcx().emit_err(errors::VisibilityNotFollowedByItem { span: vis.span, vis });
|
||||||
}
|
}
|
||||||
|
|
||||||
if let Defaultness::Default(span) = def {
|
if let Defaultness::Default(span) = def {
|
||||||
self.dcx().emit_err(errors::DefaultNotFollowedByItem { span });
|
this.dcx().emit_err(errors::DefaultNotFollowedByItem { span });
|
||||||
}
|
}
|
||||||
|
|
||||||
if !attrs_allowed {
|
if !attrs_allowed {
|
||||||
self.recover_attrs_no_item(&attrs)?;
|
this.recover_attrs_no_item(&attrs)?;
|
||||||
}
|
}
|
||||||
Ok(None)
|
Ok((None, TrailingToken::None))
|
||||||
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Error in-case `default` was parsed in an in-appropriate context.
|
/// Error in-case `default` was parsed in an in-appropriate context.
|
||||||
|
@ -101,7 +101,6 @@ pub enum TrailingToken {
|
|||||||
MaybeComma,
|
MaybeComma,
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Like `maybe_whole_expr`, but for things other than expressions.
|
|
||||||
#[macro_export]
|
#[macro_export]
|
||||||
macro_rules! maybe_whole {
|
macro_rules! maybe_whole {
|
||||||
($p:expr, $constructor:ident, |$x:ident| $e:expr) => {
|
($p:expr, $constructor:ident, |$x:ident| $e:expr) => {
|
||||||
|
@ -392,9 +392,9 @@ fn maybe_recover_trailing_expr(
|
|||||||
// Parse `?`, `.f`, `(arg0, arg1, ...)` or `[expr]` until they've all been eaten.
|
// Parse `?`, `.f`, `(arg0, arg1, ...)` or `[expr]` until they've all been eaten.
|
||||||
if let Ok(expr) = snapshot
|
if let Ok(expr) = snapshot
|
||||||
.parse_expr_dot_or_call_with(
|
.parse_expr_dot_or_call_with(
|
||||||
|
AttrVec::new(),
|
||||||
self.mk_expr(pat_span, ExprKind::Dummy), // equivalent to transforming the parsed pattern into an `Expr`
|
self.mk_expr(pat_span, ExprKind::Dummy), // equivalent to transforming the parsed pattern into an `Expr`
|
||||||
pat_span,
|
pat_span,
|
||||||
AttrVec::new(),
|
|
||||||
)
|
)
|
||||||
.map_err(|err| err.cancel())
|
.map_err(|err| err.cancel())
|
||||||
{
|
{
|
||||||
|
@ -164,7 +164,7 @@ fn parse_stmt_path_start(&mut self, lo: Span, attrs: AttrWrapper) -> PResult<'a,
|
|||||||
};
|
};
|
||||||
|
|
||||||
let expr = this.with_res(Restrictions::STMT_EXPR, |this| {
|
let expr = this.with_res(Restrictions::STMT_EXPR, |this| {
|
||||||
this.parse_expr_dot_or_call_with(expr, lo, attrs)
|
this.parse_expr_dot_or_call_with(attrs, expr, lo)
|
||||||
})?;
|
})?;
|
||||||
// `DUMMY_SP` will get overwritten later in this function
|
// `DUMMY_SP` will get overwritten later in this function
|
||||||
Ok((this.mk_stmt(rustc_span::DUMMY_SP, StmtKind::Expr(expr)), TrailingToken::None))
|
Ok((this.mk_stmt(rustc_span::DUMMY_SP, StmtKind::Expr(expr)), TrailingToken::None))
|
||||||
@ -206,7 +206,7 @@ fn parse_stmt_mac(&mut self, lo: Span, attrs: AttrVec, path: ast::Path) -> PResu
|
|||||||
// Since none of the above applied, this is an expression statement macro.
|
// Since none of the above applied, this is an expression statement macro.
|
||||||
let e = self.mk_expr(lo.to(hi), ExprKind::MacCall(mac));
|
let e = self.mk_expr(lo.to(hi), ExprKind::MacCall(mac));
|
||||||
let e = self.maybe_recover_from_bad_qpath(e)?;
|
let e = self.maybe_recover_from_bad_qpath(e)?;
|
||||||
let e = self.parse_expr_dot_or_call_with(e, lo, attrs)?;
|
let e = self.parse_expr_dot_or_call_with(attrs, e, lo)?;
|
||||||
let e = self
|
let e = self
|
||||||
.parse_expr_assoc_with(0, LhsExpr::Parsed { expr: e, starts_statement: false })?;
|
.parse_expr_assoc_with(0, LhsExpr::Parsed { expr: e, starts_statement: false })?;
|
||||||
StmtKind::Expr(e)
|
StmtKind::Expr(e)
|
||||||
|
Loading…
Reference in New Issue
Block a user