License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2019.71
URN: urn:nbn:de:0030-drops-110150
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11015/
Go to the corresponding LIPIcs Volume Portal


Bille, Philip ; Gørtz, Inge Li

From Regular Expression Matching to Parsing

pdf-format:
LIPIcs-MFCS-2019-71.pdf (1 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{bille_et_al:LIPIcs:2019:11015,
  author =	{Philip Bille and Inge Li G{\o}rtz},
  title =	{{From Regular Expression Matching to Parsing}},
  booktitle =	{44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
  pages =	{71:1--71:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-117-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{138},
  editor =	{Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11015},
  URN =		{urn:nbn:de:0030-drops-110150},
  doi =		{10.4230/LIPIcs.MFCS.2019.71},
  annote =	{Keywords: regular expressions, finite automata, regular expression parsing, algorithms}
}

Keywords: regular expressions, finite automata, regular expression parsing, algorithms
Collection: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Issue Date: 2019
Date of publication: 20.08.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI