Rule-driven processing of tree-structured data using pointed trees
This paper puts forward a data model based on pointed unranked trees labelled with arbitrary strings. An abstract transformation machine for this data model is presented that combines rule-driven processing with a very simple query mechanism. This machine is shown to be able to express any computable tree transformation. This suggests that the rule-driven processing principle is a powerful tool even when it is used in conjunction with a simple and weak query model. An implementation of this machine enhanced with regular expression-based query mechanism is discussed.
tree-structured data pointed tree transducer tree walking regular expression