Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Revert "Merge #4233" | Aleksey Kladov | 2020-05-02 | 1 | -1/+4 |
| | | | | | This reverts commit a5f2b16366f027ad60c58266a66eb7fbdcbda9f9, reversing changes made to c96b2180c1c4206a0a98c280b4d30897eb116336. | ||||
* | Merge #4246 | bors[bot] | 2020-05-01 | 1 | -1/+1 |
|\ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 4246: Validate uses of self and super r=matklad a=djrenren This change follows on the validation of the `crate` keyword in paths. It verifies the following things: `super`: - May only be preceded by other `super` segments - If in a `UseItem` then all semantically preceding paths also consist only of `super` `self` - May only be the start of a path Just a note, a couple times while working on this I found myself really wanting a Visitor of some sort so that I could traverse descendants while skipping sub-trees that are unimportant. Iterators don't really work for this, so as you can see I reached for recursion. Considering paths are generally small a fancy debounced visitor probably isn't important but figured I'd say something in case we had something like this lying around and I wasn't using it. Co-authored-by: John Renner <[email protected]> | ||||
| * | Validate uses of self and super | John Renner | 2020-05-01 | 1 | -1/+1 |
| | | |||||
* | | Remove dead code, which elaborately pretends to be alive | Aleksey Kladov | 2020-04-30 | 1 | -4/+1 |
|/ | |||||
* | Fix a bunch of false-positives in join-lines | Aleksey Kladov | 2020-04-30 | 1 | -1/+1 |
| | |||||
* | Validate the location of `crate` in paths | John Renner | 2020-04-29 | 1 | -1/+1 |
| | |||||
* | Align grammar for record patterns and literals | Aleksey Kladov | 2020-04-11 | 1 | -1/+1 |
| | | | | | | The grammar now looks like this [name_ref :] pat | ||||
* | Simplify | Aleksey Kladov | 2020-04-10 | 1 | -1/+1 |
| | |||||
* | Rename some tokens | Aleksey Kladov | 2020-04-10 | 1 | -9/+9 |
| | |||||
* | Generate only minimal set of ineresting tokens | Aleksey Kladov | 2020-04-10 | 1 | -0/+2 |
| | |||||
* | Scale token generation back | Aleksey Kladov | 2020-04-10 | 1 | -74/+40 |
| | |||||
* | Convert more tokens | Aleksey Kladov | 2020-04-10 | 1 | -49/+17 |
| | |||||
* | Other delimiters | Aleksey Kladov | 2020-04-10 | 1 | -18/+18 |
| | |||||
* | Curley tokens | Aleksey Kladov | 2020-04-10 | 1 | -17/+15 |
| | |||||
* | Start replacing tokens | Aleksey Kladov | 2020-04-10 | 1 | -1/+1 |
| | |||||
* | Semicolon token | Aleksey Kladov | 2020-04-10 | 1 | -11/+11 |
| | |||||
* | More readable ast_src for keywords | Aleksey Kladov | 2020-04-10 | 1 | -70/+77 |
| | |||||
* | Simplify | Aleksey Kladov | 2020-04-10 | 1 | -4/+4 |
| | |||||
* | Simpler acessors for keywords | Aleksey Kladov | 2020-04-09 | 1 | -2/+2 |
| | |||||
* | Drop needless trait | Aleksey Kladov | 2020-04-09 | 1 | -4/+4 |
| | |||||
* | Be consistent about token accesors | Aleksey Kladov | 2020-04-09 | 1 | -2/+3 |
| | |||||
* | Move the rest of the tokens to generated/tokens | Aleksey Kladov | 2020-04-09 | 1 | -5/+8 |
| | |||||
* | Scale back to only two traits | Aleksey Kladov | 2020-04-09 | 1 | -8/+0 |
| | |||||
* | Provide more complete AST accessors to support usage in rustc | Luca Barbieri | 2020-04-09 | 1 | -91/+292 |
| | |||||
* | Macro patterns are not confused with expressions. | Aleksey Kladov | 2020-04-03 | 1 | -0/+3 |
| | | | | | | | | | | | We treat macro calls as expressions (there's appropriate Into impl), which causes problem if there's expresison and non-expression macro in the same node (like in the match arm). We fix this problem by nesting macor patterns into another node (the same way we nest path into PathExpr or PathPat). Ideally, we probably should add a similar nesting for macro expressions, but that needs some careful thinking about macros in blocks: `{ am_i_expression!() }`. | ||||
* | Get rid of ItemOrMacro | Aleksey Kladov | 2020-03-26 | 1 | -0/+1 |
| | |||||
* | Rename ast::ImplBlock -> ast::ImplDef | Aleksey Kladov | 2020-02-29 | 1 | -3/+3 |
| | |||||
* | Some docs | Aleksey Kladov | 2020-02-27 | 1 | -0/+2 |
| | |||||
* | Merge #3062 | bors[bot] | 2020-02-11 | 1 | -4/+4 |
|\ | | | | | | | | | | | | | | | | | | | 3062: Implement slice pattern AST > HIR lowering r=jplatte a=jplatte WIP. The necessary changes for parsing are implemented, but actual inference is not yet. Just wanted to upload what I've got so far so it doesn't get duplicated :) Will fix #3043 Co-authored-by: Jonas Platte <[email protected]> | ||||
| * | Implement slice pattern AST > HIR lowering | Jonas Platte | 2020-02-11 | 1 | -4/+4 |
| | | |||||
* | | Add or- and parenthesized-patterns | Matthew Jasper | 2020-02-09 | 1 | -1/+7 |
|/ | |||||
* | Improve const generics parsing | Michael Chesser | 2020-01-06 | 1 | -0/+3 |
| | | | | | - Handle const generics type args - Fix issue with const generic as first parameter in trait impl | ||||
* | Switch ast declaration from ron to a macro | Aleksey Kladov | 2020-01-03 | 1 | -0/+618 |