Regular Tree Language Recognition with Static Information [chapter]

Alain Frisch
IFIP International Federation for Information Processing  
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type system. Indeed, this information allows in many cases to compute the result (that is, to decide which branch to consider) by looking only at a small fragment of the tree. Formally, we introduce a new kind of deterministic tree automata that can efficiently recognize regular tree languages with static information about the
more » ... rees and we propose a compilation algorithm to produce these automata.
doi:10.1007/1-4020-8141-3_50 dblp:conf/ifipTCS/Frisch04 fatcat:2wwn575rfzccbiouv3nbczxsgm