A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
A tree can be compressed into a DAG by sharing common subtrees. The resulting DAG is at most exponentially smaller than the original tree. Consider an attribute grammar that generates trees as output. It is well known that, given an input tree s, a DAG representation of the corresponding output tree can be computed in time linear in the size of s. A more powerful way of tree compression is to allow the sharing of tree patterns, i.e., internal parts of the tree. The resulting "sharing graph" isdoi:10.1007/978-3-540-24727-2_26 fatcat:7tzr7rrdyjf5lny7i2pdzilyqq