Sciweavers

Share
DBPL
2005
Springer

Type-Based Optimization for Regular Patterns

11 years 5 months ago
Type-Based Optimization for Regular Patterns
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches to the familiar problems of pattern-match compilation—how to minimize the number of tests performed during pattern matching while keeping the size of the output code small. We describe work in progress on a compilation method based on matching automata, a form of tree automata specialized for pattern compilation [9], in which we use the schema of the value flowing into a pattern matching expression to generate more efficient target code.
Michael Y. Levin, Benjamin C. Pierce
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where DBPL
Authors Michael Y. Levin, Benjamin C. Pierce
Comments (0)
books