GOPHERSPACE.DE - P H O X Y
gophering on hngopher.com
HN Gopher Feed (2017-08-25) - page 1 of 10
 
___________________________________________________________________
Designing a Tree Diff Algorithm Using Dynamic Programming and A*
75 points by yminsky
http://thume.ca/2017/06/17/tree-diffing/
___________________________________________________________________
 
robertkrahn01 - 2 hours ago
Interesting problem, and useful for creating semantically
meaningful diffs, i.e. using entities of the programming language.
A different approach to that is implemented in gumtree [1,2].[1]
Fine-grained and Accurate Source Code Differencing https://hal
.archives-ouvertes.fr/hal-01054552/document[2]
https://github.com/GumTreeDiff/gumtree
 
kuwze - 1 hours ago
There's also ydiff in case anyone is interested (it works well with
lisp/scheme): https://github.com/JexCheng/ydiff
 
  trishume - 1 hours ago
  Neat, it looks similar in spirit to the original dynamic
  programming diff algorithm I used, but it doesn't have the A*
  acceleration so I imagine it doesn't scale to large files.
  Probably nice for most cases though.
 
how_gauche - 1 hours ago
Similar dynamic programming idea from Zhang + Shasha 1992:
http://www.cs.nyu.edu/shasha/papers/treebook3.pdf