Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Rename NomialDef -> AdtDef | Aleksey Kladov | 2020-07-29 | 1 | -19/+19 |
| | |||||
* | Switch to ungrammar from ast_src | Aleksey Kladov | 2020-07-29 | 1 | -2204/+806 |
| | | | | | | | | | | | | | | | | | | The primary advantage of ungrammar is that it (eventually) allows one to describe concrete syntax tree structure -- with alternatives and specific sequence of tokens & nodes. That should be re-usable for: * generate `make` calls * Rust reference * Hypothetical parser's evented API We loose doc comments for the time being unfortunately. I don't think we should add support for doc comments to ungrammar -- they'll make grammar file hard to read. We might supply docs as out-of band info, or maybe just via a reference, but we'll think about that once things are no longer in flux | ||||
* | Dead code | Aleksey Kladov | 2020-07-29 | 1 | -41/+0 |
| | |||||
* | Remove dead code | Aleksey Kladov | 2020-07-29 | 1 | -3/+1 |
| | |||||
* | Remove dead code | Aleksey Kladov | 2020-07-29 | 1 | -46/+0 |
| | |||||
* | Apply codegen with idiomatic lifetimes | Veetaha | 2020-06-11 | 2 | -141/+141 |
| | |||||
* | Separating parsing of `for` in predicates and types | Matthew Jasper | 2020-06-10 | 1 | -0/+2 |
| | |||||
* | correctly infer labelled breaks | robojumper | 2020-05-31 | 1 | -0/+1 |
| | |||||
* | Support raw_ref_op's raw reference operator | robojumper | 2020-05-28 | 1 | -0/+3 |
| | |||||
* | Remove an equals sign from `ConstArg` (this probably pertains only to ↵ | veetaha | 2020-05-12 | 1 | -1/+0 |
| | | | | | | ConstParam) (As per matklad) | ||||
* | Convert TODO to a Note(matklad) | veetaha | 2020-05-12 | 1 | -0/+1 |
| | |||||
* | Convert to TODOs to FIXMEs as per matklad | veetaha | 2020-05-12 | 1 | -4/+2 |
| | |||||
* | Revert "Remove MacroStmts as per edwin0cheng" (cc @edwin0cheng) and add a ↵ | veetaha | 2020-05-12 | 1 | -0/+32 |
| | | | | | | | | | | fixme to document it. This reverts commit 7a49165f5d5c8186edd04f874eae8a98e39d3df6. MacroStmts ast node is not used by itself, but it pertains to SyntaxNodeKind MACRO_STMTS that is used by ra_paser, so even tho the node itself is not used, it is better to keep it with a FIXME to actually add a doc comment when it becomes useful. | ||||
* | Add a doc comment on the difference between Name and NameRef ast nodes | veetaha | 2020-05-12 | 1 | -1/+16 |
| | |||||
* | Resolve TODO about macro 2.0 def | veetaha | 2020-05-10 | 1 | -6/+4 |
| | |||||
* | Fix typo | veetaha | 2020-05-10 | 1 | -1/+1 |
| | |||||
* | Carify on a semicolon in macro call | veetaha | 2020-05-10 | 1 | -1/+6 |
| | |||||
* | Resolve TODO about curly-braced constructions in expression statement | veetaha | 2020-05-10 | 1 | -1/+3 |
| | |||||
* | Resolve todos about refs and empty statements | veetaha | 2020-05-10 | 1 | -4/+4 |
| | |||||
* | Converted TODO about MacroItems to FIXME as per edwin0cheng | veetaha | 2020-05-10 | 1 | -6/+2 |
| | |||||
* | Verified ConstArg example, waiting for response on what `=` sign pertains to | veetaha | 2020-05-10 | 1 | -1/+1 |
| | |||||
* | Correcy use tree and type args docs | veetaha | 2020-05-10 | 1 | -3/+3 |
| | |||||
* | Correct `use` cannot have type args as per flodiebold | veetaha | 2020-05-10 | 1 | -1/+1 |
| | |||||
* | Correct path docs and add colon2 token to Path ast node | veetaha | 2020-05-10 | 1 | -8/+14 |
| | |||||
* | Add example with const in TypeBound as per flodiebold | veetaha | 2020-05-10 | 1 | -1/+1 |
| | |||||
* | Properly document const impl as per flodiebold | veetaha | 2020-05-10 | 1 | -2/+2 |
| | |||||
* | Remove MacroStmts as per edwin0cheng | veetaha | 2020-05-10 | 1 | -32/+0 |
| | |||||
* | Add proper docs for TokenTree as per edwin0cheng | veetaha | 2020-05-10 | 1 | -1/+2 |
| | |||||
* | Run codegen of ast types with documentation | veetaha | 2020-05-10 | 1 | -138/+1345 |
| | |||||
* | Rename ImplItem to AssocItem | Edwin Cheng | 2020-05-05 | 1 | -18/+18 |
| | |||||
* | Add documents owner for ImplDef and SourceFile | Edwin Cheng | 2020-05-03 | 1 | -0/+2 |
| | |||||
* | Introduce EffectExpr | Aleksey Kladov | 2020-05-02 | 1 | -49/+25 |
| | |||||
* | Revert "Merge #4233" | Aleksey Kladov | 2020-05-02 | 1 | -2/+35 |
| | | | | | This reverts commit a5f2b16366f027ad60c58266a66eb7fbdcbda9f9, reversing changes made to c96b2180c1c4206a0a98c280b4d30897eb116336. | ||||
* | Merge #4246 | bors[bot] | 2020-05-01 | 1 | -0/+2 |
|\ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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 | -0/+2 |
| | | |||||
* | | Remove dead code, which elaborately pretends to be alive | Aleksey Kladov | 2020-04-30 | 1 | -35/+2 |
|/ | |||||
* | Fix a bunch of false-positives in join-lines | Aleksey Kladov | 2020-04-30 | 1 | -0/+1 |
| | |||||
* | Validate the location of `crate` in paths | John Renner | 2020-04-29 | 1 | -0/+1 |
| | |||||
* | Group generated ast boilerplate apart from the interesting part | veetaha | 2020-04-18 | 1 | -1462/+1462 |
| | |||||
* | 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 | -0/+1 |
| | |||||
* | Better readability | Aleksey Kladov | 2020-04-10 | 2 | -0/+142 |
| | |||||
* | Remove dead code | Aleksey Kladov | 2020-04-10 | 1 | -192/+184 |
| | |||||
* | Generate only minimal set of ineresting tokens | Aleksey Kladov | 2020-04-10 | 1 | -1288/+8 |
| | |||||
* | Scale token generation back | Aleksey Kladov | 2020-04-10 | 2 | -298/+65 |
| | |||||
* | Convert more tokens | Aleksey Kladov | 2020-04-10 | 2 | -217/+13 |
| | |||||
* | Other delimiters | Aleksey Kladov | 2020-04-10 | 1 | -32/+32 |
| | |||||
* | Curley tokens | Aleksey Kladov | 2020-04-10 | 2 | -106/+18 |
| | |||||
* | Start replacing tokens | Aleksey Kladov | 2020-04-10 | 1 | -34/+12 |
| | |||||
* | Semicolon token | Aleksey Kladov | 2020-04-10 | 1 | -11/+33 |
| |