Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

DBPL
2005
Springer

favoriteEmaildiscussreport

135views Database» more DBPL 2005»

Type-Based Optimization for Regular Patterns

13 years 10 months ago

Type-Based Optimization for Regular Patterns

Download www.cis.upenn.edu

Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The ﬂexibility 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 ﬂowing into a pattern matching expression to generate more eﬃcient target code.

Michael Y. Levin, Benjamin C. Pierce

Real-time Traffic

DBPL 2005 | Pattern Matching | Pattern Matching Expression | Pattern Matching Mechanisms |

claim paper

Related Content

» A Novel Regularization Learning for SingleView Patterns MultiView Discriminative Regulariz...

» Optimal Regular Tree Pattern Matching Using Pushdown Automata

» Optimization of regular expression pattern matching circuits on FPGA

» OrderOptimal Data Aggregation in Wireless Sensor Networks Part I Regular Networks

» Explaining clinical decisions by extracting regularity patterns

» Detecting Regular Visit Patterns

» High Regularities in EyeMovement Patterns Reveal the Dynamics of the Visual Working Memory...

» Pattern Mutation in Wireless Sensor Deployment

» A Bayesian Approach to Object Identification in Pattern Recognition

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	DBPL
Authors	Michael Y. Levin, Benjamin C. Pierce

Comments (0)