Change:
} else { (lo, None) }; <del> Ok(this.mk_expr(span, this.mk_range(None, opt_end, limits), attrs.into())) </del> <ins> let range = this.mk_range(None, opt_end, limits); Ok(this.mk_expr(span, range, attrs.into())) </ins> }) }

Discussion:
<!-- Thank you for filing a bug report! Please provide a short summary of the bug, along with any information you feel relevant to replicating the bug. If you cannot produce a minimal reproduction case (something that would work in isolation), please provide the steps or even link to a repository that causes the problematic output to occur. --Given the following code: The current output is: <!-- The following is not always necessary. --Ideally the output should look like: <!-- If the problem is not self-explanatory, please provide a rationale for the change. --<!-- If dramatically different output is caused by small changes, consider also adding them here. If you're using the stable version of the compiler, you should also check if the bug also exists in the beta or nightly versions. The output might also be different depending on the Edition. --<!-- TRIAGEBOTSTART --<!-- TRIAGEBOTASSIGNSTART --<!-- TRIAGEBOTASSIGNDATASTARTTRIAGEBOTASSIGNDATAEND --<!-- TRIAGEBOTASSIGNEND --<!-- TRIAGEBOTEND --
Other test cases,
Thank you for filing this! I'm going to have a look and see if I can figure it out. claim label +C-enhancement +D-newcomer-roadblock
This is surprisingly complicated in a bunch of ways. The relevant function, at least for the base case, is . At first glance, all you've gotta do is handle the case where there's a token next in the queue. Now for the problems. First off, implementing this cleanly requires adding at least one new feature to . Currently, the way you check if a token is next up is to call the , which logs whatever token it's checking for as an expected token. This token isn't expected. It being logged as an expected token messes up the error message for other cases. The solution is to add versions of and that do not log the token as expected. Adding these alternate versions is probably a good idea anyway, since . Then there's the whole context sensitivity thing. Dealing with this the way Esteban suggested is way above my pay grade. But you've got to do something, or you can't even handle simple cases like . What I could realistically do is look for without any spaces separating the two .

That isn't the right way to handle it, but it would work for most cases. However, even that requires another change to . It would need to log the of the token before the present token. That's somewhat reasonable, as it already logs the previous token itself. Still, it's a bit much as a change to make to implement something in a quick but dirty way. I'm open to advice on whether a minimalist approach might be acceptable, but I'm currently inclined to leave this for someone who actually knows what they're doing.
you don't have to add a new method, you use . That function doesn't affect the "expected token" list and won't cause any effects to existing error messages. As for the context sensitive checks, you can also use to see if the next thing is something that looks like a range, a literal or an identifier and use that, as well as checking 's against the 's to see if they touch or not (differentiating between and . The case will need to be dealt with in a different part of the parser I think, and should recover in such a way as if you had written. Now, we don't need to address all the cases, we can work incrementally, starting on the low hanging fruit and eventually getting to the "perfect output from the compiler reading my mind". :)
Thanks, That's extraordinarily helpful. I've implemented this, limited to the case (so not or ). I'm going to wait till is merged, since that will simplify my implementation substantially and they'd merge conflict anyway. I'll you when I open the PR. Now to try this again: claim label +C-enhancement +D-newcomer-roadblock
Wow, well done Over time I hope that I can improve things myself. Nice work!