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, i.e., 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.

给定一个正则表达式R和一个字符串Q，正则表达式解析问题是确定Q是否匹配R，如果匹配，则确定它如何匹配，即通过Q的字符到R中的字符的映射。正则表达式解析通过允许我们直接提取匹配的子模式（例如，从互联网流量分析中提取 IP 地址或从遗传数据库中提取基因组的子部分），使查找正则表达式的匹配项变得更加有用。我们提出了一种新的通用技术，用于有效地转换确定字符串Q是否与正则表达式R匹配的一大类算法成可以构造相应映射的算法。因此，我们获得了第一个用于正则表达式解析的有效线性空间解决方案。