Parallel Recognition and Parsing on Mesh Connected Computers with Multiple Broadcasting

In this paper we present an optimal linear time algorithm for recognition and parsing of context-free languages on n x n mesh connected computers with multiple broadcasting, for an input string of length n. Our algorithm is based on the well-known Cocke-Younger-Kasami (CYK) algorithm for the recognition and parsing of context-free languages, and is faster than two recent algorithms available in the literature. The parallel recognition of context-free languages is of particular importance since parallel compilation is an increasingly important application because of the availability of parallel hardware and the long running times of optimizing and parallelizing compilers. Our algorithm is a contribution towards this end.

[1]  Benjamin W. Wah,et al.  Systolic processing for dynamic programming problems , 1988, ICPP.

[2]  Hungwen Li,et al.  Connection Autonomy in SIMD Computers: A VLSI Implementation , 1989, J. Parallel Distributed Comput..

[3]  David B. Skillicorn,et al.  Context-Free Parsing on O(n) Processors , 1992, Comput. Lang..

[4]  David Peleg,et al.  Square Meshes are not always Optimal , 1991, IEEE Trans. Computers.

[5]  S. Rao Kosaraju.  Speed of Recognition of Context-Free Languages by Array Automata , 1975, SIAM J. Comput..

[6]  Sambasiva Rao Kosaraju.  Computations on iterative automata , 1969 .

[7]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.

[8]  David B. Skillicorn,et al.  Compiling in Parallel , 1993, J. Parallel Distributed Comput..

[9]  D. Parkinson,et al.  The AMT DAP 500 , 1988, Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference.

[10]  Stephan Olariu,et al.  A Fast Selection Algorithm for Meshes with Multiple Broadcasting , 1994, IEEE Trans. Parallel Distributed Syst..

[11]  H. T. Kung,et al.  Direct VLSI Implementation of Combinatorial Algorithms , 1979 .

[12]  I. V. Ramakrishnan,et al.  Dynamic Programming and Transitive Closure on Linear Pipelines. , 1984 .

[13]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[14]  Stephan Olariu,et al.  A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications , 1994, J. Parallel Distributed Comput..

[15]  Oscar H. Ibarra,et al.  Parallel Regognition and Parsing on the Hypercube , 1991, IEEE Trans. Computers.

[16]  D J Evans,et al.  Parallel processing , 1986 .

[17]  Oscar H. Ibarra,et al.  Parallel Parsing on a One-Way Array of Finite-State Machines , 1987, IEEE Transactions on Computers.