Regular expression pattern matching for XML

Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Grant number
Copyright date
Related resources
Hosoya, Haruo

We propose regular expression pattern matching as a core feature of programming languages for manipulating XML. We extend conventional pattern-matching facilities (as in ML) with regular expression operators such as repetition (*), alternation (|), etc., that can match arbitrarily long sequences of subtrees, allowing a compact pattern to extract data from the middle of a complex sequence. We then show how to check standard notions of exhaustiveness and redundancy for these patterns. Regular expression patterns are intended to be used in languages with type systems based on regular expression types. To avoid excessive type annotations, we develop a type inference scheme that propagates type constraints to pattern variables from the type of input values. The type inference algorithm translates types and patterns into regular tree automata, and then works in terms of standard closure operations (union, intersection, and difference) on tree automata. The main technical challenge is dealing with the interaction of repetition and alternation patterns with the first-match policy, which gives rise to subtleties concerning both the termination and precision of the analysis. We address these issues by introducing a data structure representing these closure operations lazily.

Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
Journal title
Volume number
Issue number
Publisher DOI
Journal Issue
Copyright Cambridge University Press. Reprinted from <i>Journal of Functional Programming</i>, Volume 13, Issue 6, November 2003, pages 961-1004.
<br>Copyright Cambridge University Press. Reprinted from <i>Journal of Functional Programming</i>, Volume 13, November 2003, pages 961-1004. <br><p>
Recommended citation