Conference paper
From regular expression matching to parsing
Given a regular expression R and a string Q, the regular expression parsing problem is to determine if Q matches R and if so, determine how it matches, e.g., by a mapping of the characters of Q to the characters in R. Regular expression parsing makes finding matches of a regular expression even more useful by allowing us to directly extract subpatterns of the match, e.g., for extracting IP-addresses from internet traffic analysis or extracting subparts of genomes from genetic data bases.
We present a new general techniques for efficiently converting a large class of algorithms that determine if a string Q matches regular expression R into algorithms that can construct a corresponding mapping. As a consequence, we obtain the first efficient linear space solutions for regular expression parsing.
Language: | English |
---|---|
Publisher: | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Year: | 2019 |
Proceedings: | 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019International Symposium on Mathematical Foundations of Computer Science |
Series: | Leibniz International Proceedings in Informatics, Lipics |
ISBN: | 3959771177 and 9783959771177 |
ISSN: | 18688969 |
Types: | Conference paper |
DOI: | 10.4230/LIPIcs.MFCS.2019.71 |
ORCIDs: | Bille, Philip and Gørtz, Inge Li |