Differences

This shows you the differences between two versions of the page.

--- projects:proof [2021/11/05 15:37] – Owen Mellema
+++ projects:proof [2021/11/08 22:00] (current) – Owen Mellema
@@ Line 34: / Line 34: @@
 The linked AST pair looks like this
 {{ :projects:linked_ast_pair.png?600 |}}
+Of course, ASTs are not just circles with letters on them. Each node in the AST has two properties - the "Label", which is the type of element, and the "Value", the information in the element. We define the following rules for the Linked AST Pair:
+  * Only nodes with the same label may be linked
+  * Any node may be linked to at most one other node
+Outside of that, matching can be done in any way that makes sense. I implemented the [Change Distillation Algorithim](https://www.researchgate.net/publication/3189787_Change_DistillingTree_Differencing_for_Fine-Grained_Source_Code_Change_Extraction) described by Fluri et. al., and have so far had stellar results.
+==== The DiffTree Populator and the DiffTree ====
+A DiffTree is a tree where every node has one of a few labels:
+  * CREATE: This is a new node
+  * DELETE: This node will be deleted
+  * MOVE_FROM: This node was deleted here and moved elsewhere
+  * MOVE_TO: This node was moved from somewhere else.
+  * MODIFY: The value of the node has changed.
+  * NONE: This node stays the same
+The DiffTree Populator takes a Linked AST Pair and constructs a DiffTree based on how nodes are matched. For example, here's a DiffTree constructed from the previous Linked AST Pair.
+{{:projects:difftree_fixed.png?600}}
+Although the algorithim is fairly complex (it took over a month to iron out all the kinks and determine the correct behavior for all cases), the relationship between the Linked AST Pair and the DiffTree can be summarized like this
+  * If an unmatched node is in the after tree, the node is created.
+  * If an unmatched node is in the before tree, the node is deleted.
+  * If a matched pair of nodes has different parents or exists at a different position under the same parent, it needs to be moved.
+  * If a matched pair of nodes has different values, it needs to be modified.
+  * If none of the above apply, no operation needs to be taken.
+Using this simple set of rules, we start from the top of the tree and proceed in level order. As you might expect, the ability for nodes to move complicates the algorithm significantly, both in terms of implementation and expected output 😁. (The test suite used for testing the algorithm contains 53 tests, and is over 2600 lines in length.)
+==== Unparser and Semantic Diff ====
+The Unparser's job is to take a DiffTree, and return something resembling code, albeit with a bit more structure than code. Since this is the opposite job of the Parser, I thought it was fitting to call it an "unparser".
+{{ :projects:unparsing_version_1.png?600 |}}