▲ 17 ▼ Tree-sitter Explained - Vimjoyer (www.youtube.com) submitted 6 months ago by ruffsl@programming.dev to c/nix@programming.dev 2 comments fedilink hide all child comments
[+] NostraDavid@programming.dev 1 point 6 months ago (1 child) [deleted] permalink fedilink source parent hideshow 1 child comment replies: [–] soc@programming.dev 1 point 6 months ago It's layers and layers of indirections with no clear need and technical decisions that make things unnecessarily complex. So your basically writing Regexes in a custom DSL in JavaScript, combined with custom hooks written in C, from which a megabytes-large native-code parser is generated. The complexity of the solution does not fit the niche between dead-easy TextMate grammars and plugging into an LSP. Don't misunderstand me, I wish there was something filling that niche, but TreeSitter 100% certainly isn't it. permalink fedilink source parent
[–] soc@programming.dev 1 point 6 months ago It's layers and layers of indirections with no clear need and technical decisions that make things unnecessarily complex. So your basically writing Regexes in a custom DSL in JavaScript, combined with custom hooks written in C, from which a megabytes-large native-code parser is generated. The complexity of the solution does not fit the niche between dead-easy TextMate grammars and plugging into an LSP. Don't misunderstand me, I wish there was something filling that niche, but TreeSitter 100% certainly isn't it. permalink fedilink source parent