메뉴 건너뛰기




Volumn 2985, Issue , 2004, Pages 89-103

Generalised parsing: Some costs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EID: 35048877688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24723-4_7     Document Type: Article
Times cited : (22)

References (21)
  • 2
    • 84862475507 scopus 로고    scopus 로고
    • Eggert, P.: http://compilers.iecc.com/comparch/article/03-01-042. (2003)
    • (2003)
    • Eggert, P.1
  • 5
    • 84958052870 scopus 로고    scopus 로고
    • Generalised recursive descent parsing and follow determinism
    • Koskimies, K., ed.: Proc. 7th Intnl. Conf. Compiler Construction (CC'98), Berlin, Springer
    • Johnstone, A., Scott, E.: Generalised recursive descent parsing and follow determinism. In Koskimies, K., ed.: Proc. 7th Intnl. Conf. Compiler Construction (CC'98), Lecture notes in Computer Science 1383, Berlin, Springer (1998) 16-30
    • (1998) Lecture Notes in Computer Science , vol.1383 , pp. 16-30
    • Johnstone, A.1    Scott, E.2
  • 6
    • 0348097897 scopus 로고
    • GLR parsing for e-grammars
    • Tomita, M., ed.: Kluwer Academic Publishers, Netherlands
    • Nozohoor-Farshi, R.: GLR parsing for e-grammars. In Tomita, M., ed.: Generalized LR parsing. Kluwer Academic Publishers, Netherlands (1991) 60-75
    • (1991) Generalized LR Parsing , pp. 60-75
    • Nozohoor-Farshi, R.1
  • 9
    • 21144449926 scopus 로고    scopus 로고
    • Reducing non-determinism in reduction modified GLR parsers
    • Scott, E., Johnstone, A.: Reducing non-determinism in reduction modified GLR parsers. To appear in: Acta Informatica (2004)
    • (2004) Acta Informatica
    • Scott, E.1    Johnstone, A.2
  • 11
    • 21144433771 scopus 로고    scopus 로고
    • BRN-table based GLR parsers
    • Royal Holloway, University of London, Computer Science Department
    • Scott, E., Johnstone, A., Economopoulos, G.: BRN-table based GLR parsers. Technical Report TR-03-06, Royal Holloway, University of London, Computer Science Department (2003)
    • (2003) Technical Report , vol.TR-03-06
    • Scott, E.1    Johnstone, A.2    Economopoulos, G.3
  • 12
    • 84949192315 scopus 로고    scopus 로고
    • Faster generalised LR parsing
    • Compiler Construction: 8th International Conference, CC'99. Springer-Verlag
    • Aycock, J., Horspool, N.: Faster generalised LR parsing. In: Compiler Construction: 8th International Conference, CC'99. Volume 1575 of Lecture Notes in computer science., Springer-Verlag (1999) 32 - 46
    • (1999) Lecture Notes in Computer Science , vol.1575 , pp. 32-46
    • Aycock, J.1    Horspool, N.2
  • 13
    • 35248869691 scopus 로고    scopus 로고
    • Generalised regular parsers
    • Hedin, G., ed.: Compiler Construction, 12th Intnl. Conf, CC2003. Springer-Verlag, Berlin
    • Johnstone, A., Scott, E.: Generalised regular parsers. In Hedin, G., ed.: Compiler Construction, 12th Intnl. Conf, CC2003. Volume 2622 of Lecture Notes in Computer Science., Springer-Verlag, Berlin (2003) 232-246
    • (2003) Lecture Notes in Computer Science , vol.2622 , pp. 232-246
    • Johnstone, A.1    Scott, E.2
  • 14
    • 84862477145 scopus 로고    scopus 로고
    • Dodd, C., Maslov, V.: http://www.siber.com/btyacc. (2002)
    • (2002)
    • Dodd, C.1    Maslov, V.2
  • 16
    • 0346837214 scopus 로고
    • The computational complexity of GLR parsing
    • Tomita, M., ed.: Kluwer Academic Publishers, Netherlands
    • Johnson, M.: The computational complexity of GLR parsing. In Tomita, M., ed.: Generalized LR parsing. Kluwer Academic Publishers, Netherlands (1991) 35-42
    • (1991) Generalized LR Parsing , pp. 35-42
    • Johnson, M.1
  • 17
    • 0038638461 scopus 로고
    • Parsing of general context-free languages
    • Graham, S.L., Harrison, M.A.: Parsing of general context-free languages. Advances in Computing 14 (1976) 77-185
    • (1976) Advances in Computing , vol.14 , pp. 77-185
    • Graham, S.L.1    Harrison, M.A.2
  • 18
    • 84975847950 scopus 로고
    • Deterministic techniques for efficient non-deterministic parsers
    • Automata, Languages and Programming: 2nd Colloquium. Springer-Verlag
    • Lang, B.: Deterministic techniques for efficient non-deterministic parsers. In: Automata, Languages and Programming: 2nd Colloquium. Lecture Notes in computer science, Springer-Verlag (1974) 255 - 269
    • (1974) Lecture Notes in Computer Science , pp. 255-269
    • Lang, B.1
  • 21
    • 33645606339 scopus 로고    scopus 로고
    • Table based parsers with reduced stack activity
    • Royal Holloway, University of London, Computer Science Department
    • Scott, E., Johnstone, A.: Table based parsers with reduced stack activity. Technical Report TR-02-08, Royal Holloway, University of London, Computer Science Department (2002)
    • (2002) Technical Report , vol.TR-02-08
    • Scott, E.1    Johnstone, A.2


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