生成正则表达式的所有可能匹配项

Given a regular expression, I want to produce the set of strings that that regular expression would match. It is important to note that this set would not be infinite because there would be maximum length for each string. Are there any well known algorithms in place to do this? Are there any research papers I could read to gain insight into this problem?

给定正则表达式，我想生成正则表达式匹配的字符串集。重要的是要注意，这个集合不会是无限的，因为每个字符串都有最大长度。有没有任何众所周知的算法来做到这一点？我是否有任何研究论文可以阅读以深入了解这个问题？

Thanks.

谢谢。

p.s. Would this sort of question be more appropriate in the theoretical cs stack exchange?

附：在理论cs堆栈交换中，这类问题会更​​合适吗？

1 个解决方案

#1

In the Perl world we have a module on CPAN that does just that -> Regexp::Genex

在Perl世界中，我们有一个关于CPAN的模块 - > Regexp :: Genex