Compiling regular patterns
Published • Aug 25, 2003
NobleIDNI4P19W81R28S04
Authors:
Michael Y. Levin
Abstract
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing tree-structured data such as XML. A compiler for such a language must address not only the familiar problems of pattern optimization for ML-style algebraic datatypes and pattern matching, ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!