PARSING REGULAR GRAMMARS WITH FINITE LOOKAHEAD

被引：0
|
作者：
OSTRAND, TJ
PAULL, MC
WEYUKER, EJ
机构：
[1] RUTGERS STATE UNIV,DEPT COMP SCI,NEW BRUNSWICK,NJ 08903
[2] NYU,COURANT INST MATH SCI,DEPT COMP SCI,NEW YORK,NY 10012
来源：
ACTA INFORMATICA | 1981年 / 16卷 / 02期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：125 / 138
页数：14
相关论文
共 50 条
  • [1] Lookahead LR parsing with regular right part grammars
    Colby, JE
    Bermudez, ME
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1997, 64 (1-2) : 1 - 15
  • [2] Lookahead LR parsing with regular right part grammars
    Univ of California, Santa Cruz, United States
    Int J Comput Math, 1-2 (1-15):
  • [3] Certified Parsing of Dependent Regular Grammars
    Sarracino, John
    Tan, Gang
    Morrisett, Greg
    2022 43RD IEEE SYMPOSIUM ON SECURITY AND PRIVACY WORKSHOPS (SPW 2022), 2022, : 113 - 123
  • [4] Translation of regular expression with lookahead into finite state automaton
    Morihata, A., 1600, Japan Society for Software Science and Technology (29):
  • [5] REGULAR ATTRIBUTE GRAMMARS AND FINITE STATE MACHINES
    CHAPMAN, NP
    SIGPLAN NOTICES, 1989, 24 (06): : 97 - 105
  • [6] Regular quantum grammars and regular grammars
    Cheng, W
    Wang, J
    2004 INTERNATIONAL CONFERENCE ON COMMUNICATION, CIRCUITS, AND SYSTEMS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2004, : 75 - 78
  • [7] FROM LL-REGULAR TO LL(1) GRAMMARS - TRANSFORMATIONS, COVERS AND PARSING
    NIJHOLT, A
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1982, 16 (04): : 387 - 406
  • [8] PRACTICAL ARBITRARY LOOKAHEAD LR PARSING
    BERMUDEZ, ME
    SCHIMPF, KM
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1990, 41 (02) : 230 - 250
  • [9] A UNIFYING MODEL FOR LOOKAHEAD LR PARSING
    BERMUDEZ, ME
    COMPUTER LANGUAGES, 1991, 16 (02): : 167 - 178
  • [10] PARSING DEPENDENCY GRAMMARS
    LOMBARDO, V
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 549 : 291 - 300
12345