https://github.com/williamw520/misc_zig/blob/main/identifier...
https://github.com/williamw520/misc_zig/blob/main/identifier...
I assume there is some other use case that is motivating this work.
"When something is fast enough, people start to use it differently" - Linus Torvalds.
Make your parser able to parse the current file at 30FPS and you do not need incremental parsing anymore nor error recovery. That is probably part of the idea here.
Quite a long time ago I was working on a some business application's reporting facility.
It used to take about an hour, and my development reduced this time to a 1 or 2 seconds ballpark.
This was HUGE. And changed the way users create these reports forever.
The runtime cost of type checking is highly dependent on the type system / meta-programming complexity of your language.
For simple languages (Golang?) with a pretty well designed module system: it should be doable to reach ~500KLOC/sec (probably even 1MLOC/s in some case) so more than enough for an interactive usage.
And for complex languages with meta-programming capabilities: they are indeed slow to type check. But are also a giant pain in the butt to cache without side effects for incremental parsing. It is 2025 and clangd / intellisense still fail to do that reliably for C++ codebases that rely heavily on template usage.
So it does not seem a so-crazy approach to me: It is trading a complexity problem for a performance one.