메뉴 건너뛰기




Volumn 35, Issue 1, 1996, Pages 2-17

An LR substring parser applied in a parallel environment

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0030600995     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0063     Document Type: Article
Times cited : (2)

References (21)
  • 3
    • 38249000291 scopus 로고
    • Error handling on a parallel LR substring parser
    • 3. Clarke, G., and Barnard, D. T. Error handling on a parallel LR substring parser. Comput. Languages 19, 4 (1993) 247-259.
    • (1993) Comput. Languages , vol.19 , Issue.4 , pp. 247-259
    • Clarke, G.1    Barnard, D.T.2
  • 4
    • 84976657021 scopus 로고
    • Upper bounds for speedup in parallel parsing
    • Apr.
    • 4. Cohen, J., Hickey, T., and Katcoff, J. Upper bounds for speedup in parallel parsing. J. Assoc. Comput. Mach. 29, 2 (Apr. 1982), 408-428.
    • (1982) J. Assoc. Comput. Mach. , vol.29 , Issue.2 , pp. 408-428
    • Cohen, J.1    Hickey, T.2    Katcoff, J.3
  • 5
    • 0021853532 scopus 로고
    • Estimating the speedup in parallel parsing
    • Jan.
    • 5. Cohen, J., and Kolodner, S. Estimating the speedup in parallel parsing. IEEE Trans. Software Engrg. SE-11, 1 (Jan. 1985), 114-124.
    • (1985) IEEE Trans. Software Engrg. , vol.SE-11 , Issue.1 , pp. 114-124
    • Cohen, J.1    Kolodner, S.2
  • 6
    • 0024700618 scopus 로고
    • An LR substring parser for noncorrecting syntax error recovery
    • July
    • 6. Cormack, G. V. An LR substring parser for noncorrecting syntax error recovery. SIGPLAN Notices 24, 7 (July 1989), 161-169.
    • (1989) SIGPLAN Notices , vol.24 , Issue.7 , pp. 161-169
    • Cormack, G.V.1
  • 8
    • 84939351570 scopus 로고
    • Bounded context syntactic analysis
    • Feb.
    • 8. Floyd, R. W. Bounded context syntactic analysis. Comm. ACM 7, 2 (Feb. 1961).
    • (1961) Comm. ACM , vol.7 , Issue.2
    • Floyd, R.W.1
  • 9
    • 0022882379 scopus 로고
    • Data parallel algorithms
    • Dec.
    • 9. Hillis, W. D., and Steele, G. L. Data parallel algorithms. Comm. ACM. 29, 12 (Dec. 1986), 1170-1183.
    • (1986) Comm. ACM , vol.29 , Issue.12 , pp. 1170-1183
    • Hillis, W.D.1    Steele, G.L.2
  • 12
    • 85027637295 scopus 로고
    • Parallel compilation in a multiprocessor environment
    • 12. Mickunas, M. D., and Schell, R. M. Parallel compilation in a multiprocessor environment (extended abstract). J. Assoc. Comput. Mach. 29, 2 (1978), 241-246.
    • (1978) J. Assoc. Comput. Mach. , vol.29 , Issue.2 , pp. 241-246
    • Mickunas, M.D.1    Schell, R.M.2
  • 13
    • 84976726690 scopus 로고
    • Substring parsing for arbitrary context-free grammars
    • May
    • 13. Rekers, J., and Koorn, W. Substring parsing for arbitrary context-free grammars. ACM Sigplan Notices 26, 5 (May 1991), 59-66.
    • (1991) ACM Sigplan Notices , vol.26 , Issue.5 , pp. 59-66
    • Rekers, J.1    Koorn, W.2
  • 14
    • 84976653480 scopus 로고
    • Noncorrecting syntax error recovery
    • July
    • 14. Richter, H. Noncorrecting syntax error recovery. Trans. Programming Languages and Systems 7, 3 (July 1985), 478-489.
    • (1985) Trans. Programming Languages and Systems , vol.7 , Issue.3 , pp. 478-489
    • Richter, H.1
  • 20
    • 0024964565 scopus 로고
    • Parallel parsing on the connection machine
    • May
    • 20. Skillicorn, D. B., and Barnard, D. T. Parallel parsing on the Connection Machine. Inform. Process. Lett. 31, 3 (May 1988), 111-117.
    • (1988) Inform. Process. Lett. , vol.31 , Issue.3 , pp. 111-117
    • Skillicorn, D.B.1    Barnard, D.T.2
  • 21
    • 0016543014 scopus 로고
    • Bounded context parsable grammars
    • 21. Williams, J. H. Bounded context parsable grammars. Inform. and Control 28 (1975), 314-334.
    • (1975) Inform. and Control , vol.28 , pp. 314-334
    • Williams, J.H.1


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