A parallel parsing algorithm for arbitrary context-free grammars

Information Processing Letters

Volumn 58, Issue 2, 1996, Pages 87-96

  Ra, Dong Yul ^a   Kim, Jong Hyun ^a  

^a Yonsei University Wonju   (South Korea)

Author keywords

Context free grammars; Multiprocessors; Parallel algorithms; Parsing

Indexed keywords

EID: 30244537106     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00023-3     Document Type: Article

References (6)

1. A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1: Parsing (Prentice-Hall, Englewood Cliffs, NJ, 1972).
2. E.A. Brewer, C.N. Dellarocas, A. Colbrook and W.E. Weihl, PROTEUS: A high-performance parallel-architecture simulator, Tech. Rept. MIT/LCS/TR-516, Lab. for Computer Science, Massachusetts Institute of Technology (1991).
3. J-H. Chang, O.H. Ibarra and M.A. Palis, Parallel parsing on a one-way array of finite-state machines, IEEE Trans. Comput. 36 (1987) 64-75.
4. Y.T. Chiang and K.S. Fu, Parallel parsing algorithms and VLSI implementations for syntactic pattern recognition, IEEE Trans. Pattern Anal. Mach. Intell. 6 (1984) 302-314.
5. O.H. Ibarra, Ting-Chuen Pong and S.M. Sohn, Parallel recognition and parsing on the hypercube, IEEE Trans. Comput. 40 (1991) 764-770.
6. S. Kosaraju, Speed of recognition of context-free languages by array automata, SIAM J. Comput. 4 (1975) 331-340.