News for hackers. Stuff that matters.
Re:Let's create a Tree-sitter grammar by duped on Wednesday March 20, 2024 @01:10PM (#39769378)
To be a bit pedantic, an AST is a kind of IR that represents syntactic constructs. Languages have different syntaxes so you can't really have a language agnostic syntax tree.

Consider three languages, one with binary operators but no function application, and another with only function application, and a third with both. What would the "agnostic" AST be, except a union of the AST of the first two?

Re:Let's create a Tree-sitter grammar by riwsky on Thursday March 21, 2024 @12:10AM (#39774823)
Why, Lisp of course!