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 条
[11]  
HOSOYA H, 2003, UNPUB REGULAR EXPRES
[12]   EXTENDING REGULAR EXPRESSIONS WITH CONTEXT OPERATORS AND PARSE EXTRACTION [J].
KEARNS, SM .
SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (08) :787-804
[13]  
Laurikari V., 2001, THESIS HELSINKI U TE
[14]  
LEVIN M, 2003, ICFP 03
[15]  
MEIJER E, 2003, DP COOL 2003
[16]  
TABUCHI N, 2002, WORKSH TYP PROGR TIP
[17]  
VANSUMMEREN S, 2003, UNIQUE PATTERN MATCH
[18]  
XI HW, 2001, LOGIC COMPUTER SCI