Greedy regular expression matching

被引：0

作者：

Frisch, A

Cardelli, L

机构：

[1] Ecole Normale Super, F-75231 Paris, France

[2] Ecole Natl Super Telecommun Bretagne, Paris, France

[3] Microsoft Res, Paris, France

来源：

AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS | 2004年 / 3142卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper studies the problem of matching sequences against regular expressions in order to produce structured values.

引用

页码：618 / 629

页数：12

共 18 条

[1]

Benzaken V., 2003, ICFP 03

[2]

BOAG S, 2003, XQUERY 1 0 XML QUERY

[3] Efficiently building a parse tree from a regular expression [J].

Dubé, D ;

Feeley, M .

[4]

FRISCH A, 2004, INT C THEOR COMP SCI

[5]

GAPAYEV V, 2003, P 10 WORKSH FOOL

[6]

Harper R., 1999, Journal of Functional Programming, V9, P463, DOI 10.1017/S0956796899003378

[7]

Hosoya H., 2003, ACM T INTERNET TECHN, V3, P117, DOI DOI 10.1145/767193.767195

[8]

HOSOYA H, 2000, SIGPLAN NOTICES, V35

[9]

HOSOYA H, 2001, THESIS U TOKYO

[10]

HOSOYA H, 2001, 25 ANN ACM SIGPLAN S