intermission: the uniq storage option and attributes

If we now add an atribute visited (that we intend to use to indicate if we have visited a node already):

expr {uniq} : { boolean visited = False; };

and build our term (1+1) * (1+1) we get the following graphs (left (or up) non-uniq; right (or below) uniq; the edge numbers indicate a depth-first left-to-right treewalk):

[picture of a tree non-uniq tree with attributes] [picture of a uniq tree with attributes]

next overview up

Last updated at 03 February '98 by kimwitu@cs.utwente.nl