Regular expression sub-matching using partial derivatives

Authors:
Martin Sulzmann;Kenny Zhuo Ming Lu
Affiliations:
Hochschule Karlsruhe, Karlsruhe, Germany;Nanyang Polytechnic, Singapore, Singapore
Venue:
Proceedings of the 14th symposium on Principles and practice of declarative programming
Year:
2012

Citing 13
Cited 1

Extending regular expressions with context operators and parse extraction

Software—Practice & Experience
Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Regular expression pattern matching for XML

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Compact DFA Representation for Fast Regular Expression Search

WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
XHaskell --- Adding Regular Expression Types to Haskell

Implementation and Application of Functional Languages
Regular-expression derivatives re-examined

Journal of Functional Programming
A Type-Safe Embedding of XDuce into ML

Electronic Notes in Theoretical Computer Science (ENTCS)
Testing extended regular language membership incrementally by rewriting

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A play on regular expressions: functional pearl

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
A unified construction of the glushkov, follow, and antimirov automata

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regular expression sub-matching is the problem of finding for each sub-part of a regular expression a matching sub-string. Prior work applies Thompson and Glushkov NFA methods for the construction of the matching automata. We propose the novel use of derivatives and partial derivatives for regular expression sub-matching. Our benchmarking results show that the run-time performance is promising and that our approach can be applied in practice.