A parallel compilation technique based on grammar partitioning

Authors:
Sanjay Khanna;Arif Ghafoor;Amrit Goel
Affiliations:
Dept. of Electrical and Computer Engineering, Syracuse University, Syracuse, NY;Dept. of Electrical and Computer Engineering, Syracuse University, Syracuse, NY;Dept. of Electrical and Computer Engineering, Syracuse University, Syracuse, NY
Venue:
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Year:
1990

Citing 8
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Upper Bounds for Speedup in Parallel Parsing

Journal of the ACM (JACM)
Parallel Compilation In A Multiprocessor Environment (Extended Abstract)

ACM '78 Proceedings of the 1978 annual conference
A parallel approach to code generation for Fortran like compilers

Proceedings of the conference on Programming languages and compilers for parallel and vector machines
On parsing context free languages in parallel environments.

On parsing context free languages in parallel environments.
A compiler design for multiple independent processor computers.

A compiler design for multiple independent processor computers.
Methods for constructing parallel compilers for use in a multiprocessor environment.

Methods for constructing parallel compilers for use in a multiprocessor environment.
The architecture of closely-coupled distributed computers and their language processors

The architecture of closely-coupled distributed computers and their language processors

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new data partitioning scheme for parallel compilation is presented. The scheme is based on partitioning the grammar, which in turn effectively decomposes the language specification into multiple subsets. The scheme requires definition and development of specialized subcompilers. A simple and practical method is suggested for the implementation of such subcompilers using Parser Generators. The proposed scheme is illustrated through an example, using the grammar of Pascal language. A comparison with other methods such as functional decomposition, reveals that the proposed methodology has a larger potential speed-up factor.