diffsitter

I believe Unison is the only attempt to do this at a programming language/environment level. For Git diffs, there is Diffsitter, which uses Tree Sitter to generate semantic diffs of code files: https://github.com/afnanenayet/diffsitter I have not used it, but it is high on my todo list.

I think everyone may be interested in: https://github.com/afnanenayet/diffsitter Github having an option to have their PR GUI use an AST diff like this could be a fun and useful option.

Counterpoint: a quick google reveals diffsitter: https://github.com/afnanenayet/diffsitter The output could be a lot more compact, it could do better at adding context (in the same way https://github.com/romgrk/nvim-treesitter-context does, etc), but if you're interested in this it's really within reach, go help out. I wonder if you can use it for automerge yet.

Anyone know how to compute the diff between two ASTs if the edits _are_ known, either in general or with tree-sitter. The method used by diffsitter is to compute the path with minimal editing distance: https://github.com/afnanenayet/diffsitter/blob/main/src/ast..... In the case where the edits are known (because you're re-creating the AST per keystroke), you can save parsing time by passing in the old tree and a set of edits: https://tree-sitter.github.io/tree-sitter/using-parsers#edit.... Intuitively, I feel like there should be a way to reduce diffing time as well to avoid O(mn) run and space time that comes from the dynamic programming solution to compute the minimal edit.

FWIW, as soon as I saw this project, I wondered specifically about Treesitter's applicability to this problem, and I found https://github.com/afnanenayet/diffsitter. Maybe there's something to be learned there?