Allow caching in loose subtrees by adding implicit final check

A node is a root of its tree if it has no parent. This condition can be used as an implicit final condition when accessing children of the node.

Evaluation of attributes in a loose subtree currently works, but the values are not cached. Having implicit final allows caching in loose subtrees. This may cause problems for rewrites of the root after it has been placed as a child in another tree.