ADDING REGULAR EXPRESSIONS TO PASCAL

被引：0
|
作者：
SHARPE, D [1 ]
机构：
[1] W GEORGIA COLL,DEPT MATH CSC,CARROLLTON,GA 30118
来源：
SIGPLAN NOTICES | 1988年 / 23卷 / 12期
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：125 / 133
页数：9
相关论文
共 50 条
  • [31] Regular expressions of conditions
    Popa, Emil Marin
    3RD INT CONF ON CYBERNETICS AND INFORMATION TECHNOLOGIES, SYSTEMS, AND APPLICAT/4TH INT CONF ON COMPUTING, COMMUNICATIONS AND CONTROL TECHNOLOGIES, VOL 3, 2006, : 174 - 176
  • [32] Rewriting of regular expressions and regular path queries
    Calvanese, D
    De Giacomo, G
    Lenzerini, M
    Vardi, MY
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 64 (03) : 443 - 465
  • [33] Regular binoid expressions and regular binoid languages
    Hashiguchi, K
    Wada, Y
    Jimbo, S
    THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) : 291 - 313
  • [34] Unimodal rays in the regular and generalized Pascal pyramids
    Belbachir, Hacene
    Szalay, Laszlo
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [35] Modelling the semantics of calendar expressions as extended regular expressions
    Niemi, Jyrki
    Carlson, Lauri
    FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2006, 4002 : 179 - +
  • [36] COMPLEXITY MEASURES FOR REGULAR EXPRESSIONS
    EHRENFEUCHT, A
    ZEIGER, P
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 12 (02) : 134 - 146
  • [37] The generalized regular expressions of conditions
    Popa, Emil Marin
    5th RoEduNet IEEE International Conference, Proceedings, 2006, : 272 - 274
  • [38] The Complexity of Regular(-Like) Expressions
    Holzer, Markus
    Kutrib, Martin
    DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 16 - 30
  • [39] Derivatives for Enhanced Regular Expressions
    Thiemann, Peter
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2016, 9705 : 285 - 297
  • [40] Parameterized Regular Expressions and Their Languages
    Barcelo, Pablo
    Libkin, Leonid
    Reutter, Juan L.
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 351 - 362
12345