메뉴 건너뛰기




Volumn 141, Issue 4 SPEC. ISS., 2005, Pages 143-160

Recursion engineering for reduction incorporated parsers

Author keywords

Context free languages; Recursion analysis; RI parsing

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; CONTEXT FREE LANGUAGES; EMBEDDED SYSTEMS; HEURISTIC METHODS; INFORMATION ANALYSIS;

EID: 28444485073     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.02.060     Document Type: Conference Paper
Times cited : (2)

References (18)
  • 3
    • 84949192315 scopus 로고    scopus 로고
    • Faster generalised LR parsing
    • Compiler Construction, 8th Intnl. Conf CC'99 Springer-Verlag
    • John Aycock, and Nigel Horspool Faster generalised LR parsing Compiler Construction, 8th Intnl. Conf CC'99 Lecture Notes in Computer Science volume 1575 1999 Springer-Verlag 32 46
    • (1999) Lecture Notes in Computer Science , vol.1575 , pp. 32-46
    • John, A.1    Nigel, H.2
  • 4
    • 28444472680 scopus 로고    scopus 로고
    • Even faster generalised LR parsing
    • John Aycock, R. Nigel Horspool, Jan Janousek, and Borivo Melichar Even faster generalised LR parsing Acta Informatica 37 8 2001 33 651
    • (2001) Acta Informatica , vol.37 , Issue.8 , pp. 33-651
    • John, A.1    Nigel, H.R.2    Jan, J.3    Borivo, M.4
  • 5
    • 0027944162 scopus 로고
    • Gene structure prediction by linguistic methods
    • S. Dong, and D.B. Searls Gene structure prediction by linguistic methods Genomics 23 1994 40 551
    • (1994) Genomics , vol.23 , pp. 40-551
    • Dong, S.1    Searls, D.B.2
  • 6
    • 0014732304 scopus 로고
    • An efficient context-free parsing algorithm
    • J. Earley An efficient context-free parsing algorithm Communications of the ACM 13 2 February 1970 94 102
    • (1970) Communications of the ACM , vol.13 , Issue.2 , pp. 94-102
    • Earley, J.1
  • 7
    • 35248869691 scopus 로고    scopus 로고
    • Generalised regular parsers
    • Gorel Hedin Editor, Compiler Construction, 12th Intnl. Conf CC'03
    • Adrian Johnstone, and Elizabeth Scott Generalised regular parsers Gorel Hedin Editor, Compiler Construction, 12th Intnl. Conf CC'03 Lecture Notes in Computer Science volume 2622 2003 Springer-Verlag Berlin 232 246
    • (2003) Lecture Notes in Computer Science , vol.2622 , pp. 232-246
    • Adrian, J.1    Elizabeth, S.2
  • 8
    • 35048877688 scopus 로고    scopus 로고
    • Generalised parsing: Some costs
    • Evelyn Duesterwald Editor, Compiler Construction, 13th Intnl. Conf CC'04
    • Adrian Johnstone, Elizabeth Scott, and Giorgios Economopoulos Generalised parsing: some costs Evelyn Duesterwald Editor, Compiler Construction, 13th Intnl. Conf CC'04 Lecture Notes in Computer Science volume 2985 2004 Springer-Verlag Berlin 89 103
    • (2004) Lecture Notes in Computer Science , vol.2985 , pp. 89-103
    • Adrian, J.1    Elizabeth, S.2    Giorgios, E.3
  • 9
    • 23144435730 scopus 로고    scopus 로고
    • The grammar tool box: A case study comparing GLR parsing algorithms
    • Gorel Hedin and Eric Van Wick, editors also in Electronic Notes in Theoretical Computer Science. Elsevier
    • Adrian Johnstone, Elizabeth Scott, and Giorgios Economopoulos. The grammar tool box: a case study comparing GLR parsing algorithms. In Gorel Hedin and Eric Van Wick, editors, Proc. 4th Workshop on Language Descriptions, Tools and Applications LDTA2004, also in Electronic Notes in Theoretical Computer Science. Elsevier, 2004
    • (2004) Proc. 4th Workshop on Language Descriptions, Tools and Applications LDTA2004
    • Johnstone, A.1    Scott, E.2    Economopoulos, G.3
  • 10
    • 0001621268 scopus 로고
    • On the translation of languages from left to right
    • Donald E. Knuth On the translation of languages from left to right Information and Control 8 6 1965 07 639
    • (1965) Information and Control , vol.8 , Issue.6 , pp. 07-639
    • Knuth Donald, E.1
  • 11
    • 84975847950 scopus 로고
    • Deterministic techniques for efficient non-deterministic parsers
    • Automata, Lanugages and Programming: 2nd Colloquium, Springer-Verlag
    • Bernard Lang Deterministic techniques for efficient non-deterministic parsers Automata, Lanugages and Programming: 2nd Colloquium Lecture Notes in Computer Science volume 14 1974 Springer-Verlag 255 269
    • (1974) Lecture Notes in Computer Science , vol.14 , pp. 255-269
    • Bernard, L.1
  • 12
    • 0348097897 scopus 로고
    • GLR parsing for ε-grammars
    • Masaru Tomita Kluwer Academic Publishers Netherlands
    • Rahman Nozohoor-Farshi GLR parsing for ε-grammars Masaru Tomita Generalized LR Parsing 1991 Kluwer Academic Publishers Netherlands 60 75
    • (1991) Generalized LR Parsing , pp. 60-75
    • Rahman, N.1
  • 13
    • 0002965885 scopus 로고
    • Universität des Saarlandes, 66041 Saarbrücken, Germany, February
    • Georg Sander. VCG Visualisation of Compiler Graphs. Universität des Saarlandes, 66041 Saarbrücken, Germany, February 1995
    • (1995) VCG Visualisation of Compiler Graphs
    • Sander, G.1
  • 14
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • Robert E. Tarjan Depth-first search and linear graph algorithms SIAM Journal on Computing 1 2 1972 46 160
    • (1972) SIAM Journal on Computing , vol.1 , Issue.2 , pp. 46-160
    • Tarjan Robert, E.1
  • 17
    • 0345985561 scopus 로고    scopus 로고
    • Re-engineering needs generic programming language technology
    • M.G.J. van den Brand, C. Verhoef, and P. Klint Re-engineering needs generic programming language technology ACM SIGPLAN notices 32 20 1997 4 61
    • (1997) ACM SIGPLAN Notices , vol.32 , Issue.20 , pp. 4-61
    • Van Den Brand, M.G.J.1    Verhoef, C.2    Klint, P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.