From regular expressions to deterministic automata
Theoretical Computer Science
Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
Derivatives of Regular Expressions
Journal of the ACM (JACM)
XDuce: A Typed XML Processing Language (Preliminary Report)
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
CDuce: an XML-centric general-purpose language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Compiling regular patterns to sequential machines
Proceedings of the 2005 ACM symposium on Applied computing
Type inference for unique pattern matching
ACM Transactions on Programming Languages and Systems (TOPLAS)
Construction of Tree Automata from Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
XML goes native: run-time representations for XTATIC
CC'05 Proceedings of the 14th international conference on Compiler Construction
| Hi-index | 0.00 |
We propose hedge pattern partial derivatives, an extension of Antimirov's partial derivatives, in order to give an operational semantics of pattern matching of regular hedge expression patterns, which is crucial in XML processing. We show that correct and small matching automata can be constructed from hedge pattern partial derivatives.