LR parsing for global index languages (GILs)

被引：0
|
作者：
Castaño, JM [1 ]
机构：
[1] Brandeis Univ, Dept Comp Sci, Waltham, MA 02254 USA
来源：
IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS | 2003年 / 2759卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present here Global Index Grammars (GIGs) and the characterizing 2 Stack automaton model (LR-2PDA). We present the techniques to construct an LR parsing table for deterministic Global Index Grammars. GILs include languages which axe beyond the power of Linear Indexed Grammars/Tree Adjoining Grammars. GILs generalize properties of CF Languages in a straightforward way and their descriptive power is relevant at least for natural language and molecular biology phenomena.
引用
收藏
页码：269 / 281
页数：13
相关论文
共 50 条
  • [1] SUFFIX LANGUAGES IN LR PARSING
    SEYFARTH, BR
    BERMUDEZ, ME
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1995, 55 (3-4) : 135 - 153
  • [2] On parsing and condensing substrings of LR languages in linear time
    Goeman, H
    THEORETICAL COMPUTER SCIENCE, 2001, 267 (1-2) : 61 - 82
  • [3] LR Parsing for LCFRS
    Kallmeyer, Laura
    Maier, Wolfgang
    ALGORITHMS, 2016, 9 (03)
  • [4] SCHEME FOR LR(K) PARSING WITH ERROR RECOVERY .1. LR(K) PARSING
    SIPPU, S
    SOISALONSOININEN, E
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1980, 8 (01) : 27 - 42
  • [5] PARALLEL INCREMENTAL LR PARSING
    VISWANATHAN, N
    SRIKANT, YN
    COMPUTER LANGUAGES, 1994, 20 (03): : 151 - 175
  • [6] On LR Parsing with Selective Delays
    Bertsch, Eberhard
    Nederhof, Mark-Jan
    Schmitz, Sylvain
    COMPILER CONSTRUCTION, CC 2013, 2013, 7791 : 244 - 263
  • [7] VERY FAST LR PARSING
    PENNELLO, TJ
    SIGPLAN NOTICES, 1986, 21 (07): : 145 - 151
  • [8] LR parsing for conjunctive grammars
    Okhotin, Alexander
    Grammars, 2002, 5 (02): : 81 - 124
  • [9] LR PARSING OF CFGS WITH RESTRICTIONS
    MCKENZIE, BJ
    SOFTWARE-PRACTICE & EXPERIENCE, 1990, 20 (08): : 823 - 832
  • [10] LR-PARSING DERIVED
    HESSELINK, WH
    SCIENCE OF COMPUTER PROGRAMMING, 1992, 19 (02) : 171 - 196
12345