Hello, and thank you for sharing this work.
Got a little question:
the paper (https://arxiv.org/abs/1711.09573) says we need to encode two additional bits of info for each flattened AST node:
- has children
- has a right sibling
the note about "right" is essential, as otherwise it will be impossible (I believe) to restore the tree.
However, the implementation seems to encode the fact that this node has (any) siblings (not necessarily a "right" one):
Am I missing anything or it's something to be be fixed?
Thank you.
Hello, and thank you for sharing this work.
Got a little question:
the paper (https://arxiv.org/abs/1711.09573) says we need to encode two additional bits of info for each flattened AST node:
the note about "right" is essential, as otherwise it will be impossible (I believe) to restore the tree.
However, the implementation seems to encode the fact that this node has (any) siblings (not necessarily a "right" one):
Am I missing anything or it's something to be be fixed?
Thank you.