| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2022-01-01 | add expr tests | Aleksey Kladov | -1/+10 | |
| 2022-01-01 | tests for ty | Aleksey Kladov | -0/+7 | |
| 2022-01-01 | internal: add tests for patterns | Aleksey Kladov | -0/+10 | |
| 2021-12-29 | restore invariatns | Aleksey Kladov | -10/+25 | |
| 2021-12-29 | parse empty statemet as statemetn | Aleksey Kladov | -15/+6 | |
| 2021-12-29 | rename | Aleksey Kladov | -20/+19 | |
| 2021-12-29 | compress | Aleksey Kladov | -5/+6 | |
| 2021-12-29 | internal: add tests for extra parser entry points | Aleksey Kladov | -1/+46 | |
| 2021-12-28 | dead code | Aleksey Kladov | -62/+2 | |
| 2021-12-28 | remove Item::parse | Aleksey Kladov | -2/+0 | |
| 2021-12-28 | internal: start isolating ssr-related parsing APIs to SSR | Aleksey Kladov | -2/+0 | |
| 2021-12-28 | dead code | Aleksey Kladov | -2/+0 | |
| 2021-12-28 | add TopEntryPoint | Aleksey Kladov | -35/+82 | |
| 2021-12-28 | simplify | Aleksey Kladov | -11/+13 | |
| 2021-12-28 | move path | Aleksey Kladov | -8/+7 | |
| 2021-12-28 | move expr | Aleksey Kladov | -0/+5 | |
| 2021-12-28 | move ty | Aleksey Kladov | -3/+7 | |
| 2021-12-28 | move pat to prefix entry points | Aleksey Kladov | -4/+9 | |
| 2021-12-28 | move stmt to entry points | Aleksey Kladov | -12/+6 | |
| 2021-12-28 | internal: move block to prefix entry point | Aleksey Kladov | -0/+6 | |
| 2021-12-28 | internal: move visibility to a prefix entry point | Aleksey Kladov | -7/+4 | |
| 2021-12-28 | internal: add prefix entry points | Aleksey Kladov | -0/+36 | |
| 2021-12-26 | internal: move inline parser tests to parser crate | Aleksey Kladov | -11/+147 | |
| 2021-12-26 | internal: move outlined parser tests | Aleksey Kladov | -2/+57 | |
| 2021-12-26 | internal: move ws attachment logic to the parser crate | Aleksey Kladov | -25/+222 | |
| This has to re-introduce the `sink` pattern, because doing this purely with iterators is awkward :( Maaaybe the event vector was a false start? But, anyway, I like the current factoring more -- it sort-of obvious that we do want to keep ws-attachment business in the parser, and that we also don't want that to depend on the particular tree structure. I think `shortcuts` module achieves that. | ||||
| 2021-12-25 | internal: rename | Aleksey Kladov | -55/+72 | |
| 2021-12-25 | internal: replace TreeSink with a data structure | Aleksey Kladov | -35/+91 | |
| The general theme of this is to make parser a better independent library. The specific thing we do here is replacing callback based TreeSink with a data structure. That is, rather than calling user-provided tree construction methods, the parser now spits out a very bare-bones tree, effectively a log of a DFS traversal. This makes the parser usable without any *specifc* tree sink, and allows us to, eg, move tests into this crate. Now, it's also true that this is a distinction without a difference, as the old and the new interface are equivalent in expressiveness. Still, this new thing seems somewhat simpler. But yeah, I admit I don't have a suuper strong motivation here, just a hunch that this is better. | ||||
| 2021-12-18 | Update crates/parser/src/lexed_str.rs | Aleksey Kladov | -1/+1 | |
| Co-authored-by: bjorn3 <bjorn3@users.noreply.github.com> | ||||
| 2021-12-18 | internal: move all the lexing to the parser crate | Aleksey Kladov | -7/+33 | |
| 2021-12-18 | converting lexed str to tokens | Aleksey Kladov | -1/+28 | |
| 2021-12-18 | soa all the things | Aleksey Kladov | -34/+75 | |
| 2021-12-18 | move lexing to the parser crate | Aleksey Kladov | -1/+283 | |
| 2021-12-12 | prettyfy | Aleksey Kladov | -19/+20 | |
| 2021-12-12 | consistency | Aleksey Kladov | -6/+6 | |
| 2021-12-12 | simplify | Aleksey Kladov | -47/+23 | |
| 2021-12-12 | tighten up invariants | Aleksey Kladov | -5/+2 | |
| 2021-12-12 | add cross-crate inlines | Aleksey Kladov | -1/+5 | |
| 2021-12-12 | port mbe to soa tokens | Aleksey Kladov | -2/+26 | |
| 2021-12-12 | more orthogonal interface | Aleksey Kladov | -7/+10 | |
| 2021-12-12 | parser tests work | Aleksey Kladov | -37/+32 | |
| 2021-12-12 | Switch parser to use tokens | Aleksey Kladov | -53/+47 | |
| 2021-12-12 | use eof token pattenr | Aleksey Kladov | -4/+12 | |
| 2021-12-12 | start SOA parser interface | Aleksey Kladov | -0/+59 | |
| 2021-12-06 | Bump parser step limit a little | Laurențiu Nicola | -1/+4 | |
| 2021-11-18 | fix: parse the range pat inside the tuple pat | zhoufan | -1/+6 | |
| 2021-11-10 | Handle pub tuple fields in tuple structs | Adam Bratschi-Kaye | -8/+16 | |
| The current implementation will throw a parser error for tuple structs that contain a pub tuple field. For example, ```rust struct Foo(pub (u32, u32)); ``` is valid Rust, but rust-analyzer will throw a parser error. This is because the parens after `pub` is treated as a visibility context. Allowing a tuple type to follow `pub` in the special case when we are defining fields in a tuple struct can fix the issue. | ||||
| 2021-10-23 | internal: remove unused dollars | Aleksey Kladov | -43/+4 | |
| 2021-10-19 | internal: Parse const trait bounds | Lukas Wirth | -6/+16 | |
| 2021-10-07 | Support `let...else` | Jonas Schievink | -0/+11 | |
| 2021-10-06 | parser: fix parsing of macro call inside generic args | cynecx | -1/+4 | |
