Abstract

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 trees and we propose a compilation algorithm to produce these automata.

Citations

157	Regular expression types for XML - Hosoya, Vouillon, et al. - 2000
139	CDuce: an XML-centric general-purpose language - Benzaken, Castagna, et al. - 2003
119	EXtensible Markup Language (XML) 1.0 - Bray, Paoli, et al. - 2000
104	Regular expression pattern matching for XML - Hosoya, Pierce - 2002
71	Automata Theory for XML Researchers - Neven - 2002
60	Regular object types - Gapeyev, Pierce - 2003
53	The essence of XML - Siméon, Wadler - 2003
52	Locating Matches of Tree Patterns in Forests - Neumann, Seidl - 1998
43	XML Schema part 1: Structures - THOMPSON, BEECH, et al. - 2001
15	Compiling regular patterns - Levin - 2003
10	Véronique Benzaken. Semantic subtyping - Frisch, Castagna - 2002