LR Parsing for LCFRS

被引：2
|
作者：
Kallmeyer, Laura [1 ]
Maier, Wolfgang [1 ]
机构：
[1] Univ Dusseldorf, Inst Language & Informat, Dept Computat Linguist, Univ Str 1, D-40225 Dusseldorf, Germany
来源：
ALGORITHMS | 2016年 / 9卷 / 03期
关键词：
parsing; automata; LCFRS;
D O I：
10.3390/a9030058
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar. In this paper, we present the first LR-style parsing algorithm for Linear Context-Free Rewriting Systems (LCFRS), a mildly context-sensitive extension of CFG which has received considerable attention in the last years in the context of natural language processing.
引用
收藏
页数：28
相关论文
共 50 条
  • [41] Solving Difficult LR Parsing Conflicts by Postponing Them
    Rodriguez-Leon, C.
    Garcia-Forte, L.
    COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2011, 8 (02) : 517 - 531
  • [42] LR-PARSING OF EXTENDED CONTEXT FREE GRAMMARS
    MADSEN, OL
    KRISTENSEN, BB
    ACTA INFORMATICA, 1976, 7 (01) : 61 - 73
  • [43] Software visualization of LR parsing and synthesized attribute evaluation
    White, Elizabeth L.
    Ruby, Jeffrey
    Deddens, Laura Denise
    Software - Practice and Experience, 1999, 29 (01): : 1 - 16
  • [44] YET ANOTHER STORAGE TECHNIQUE FOR LR PARSING TABLES
    ALHUSSAINI, AMM
    STONE, RG
    SOFTWARE-PRACTICE & EXPERIENCE, 1986, 16 (04): : 389 - 401
  • [45] On different LL and LR parsers used in LLLR parsing
    Slivnik, Bostjan
    COMPUTER LANGUAGES SYSTEMS & STRUCTURES, 2017, 50 : 108 - 126
  • [46] Software visualization of LR parsing and synthesized attribute evaluation
    White, EL
    Ruby, J
    Deddens, LD
    SOFTWARE-PRACTICE & EXPERIENCE, 1999, 29 (01): : 1 - 16
  • [47] New parsing method for non-LR(1) grammars
    Harford, A.Gayler
    Heuring, Vincent P.
    Main, Michael G.
    Software - Practice and Experience, 1992, 22 (05) : 419 - 437
  • [48] Some observations on LR-like parsing with delayed reduction
    Bertsch, E.
    Nederhof, M.-J.
    INFORMATION PROCESSING LETTERS, 2007, 104 (06) : 195 - 199
  • [49] Fast LR parsing using rich (tree adjoining) grammars
    Prolo, CA
    PROCEEDINGS OF THE 2002 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING, 2002, : 103 - 110
  • [50] A method for automatic program inversion based on LR(0) parsing
    Glück, R
    Kawabe, M
    FUNDAMENTA INFORMATICAE, 2005, 66 (04) : 367 - 395
12345