Parallel recognition and parsing on mesh connected computers with multiple broadcasting

Authors:
B Pradeep;C Siva Ram Murthy
Affiliations:
Tata Information Systems Ltd, Golden Enclave, Airport Road, Bangalore 560 017, India;Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600 036, India
Venue:
Computer Languages
Year:
1994

Citing 11
Cited 0

Parallel parsing on a one-way array of finite-state machines

IEEE Transactions on Computers
Array processor with multiple broadcasting

Journal of Parallel and Distributed Computing
Connection autonomy in SIMD computers: a VLSI implementation

Journal of Parallel and Distributed Computing
Parallel Recognition and Parsing on the Hypercube

IEEE Transactions on Computers
Square Meshes are Not Always Optimal

IEEE Transactions on Computers
Context-free parsing on O(n) processors

Computer Languages
Compiling in parallel

Journal of Parallel and Distributed Computing
A time-optimal multiple search algorithm on enhanced meshes, with applications

Journal of Parallel and Distributed Computing
Sorting on a mesh-connected parallel computer

Communications of the ACM
A Fast Selection Algorithm for Meshes with Multiple Broadcasting

IEEE Transactions on Parallel and Distributed Systems
Finding Maximum on an Array Processor with a Global Bus

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.