Parallel one-pass compilation

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The parallelization of one-pass compilers is studied systematically. The approach is not restricted to different features in certain languages; instead, L-attributed grammars are used as the model of compilation. This language-independent approach can be used to generate a parallel compiler on the basis of a formal specification of the source language. The scheduling strategy is based on a static examination of the attribute dependencies of a production rule. Thus the potential of parallelism at runtime depends on the attribute dependencies of the grammar. Parallel (asynchronous) processes communicating via events serve as the machine model for attribute evaluation. Aiming at a full model of one-pass compilation, the pure L-attributed model is extended with pipelined parsing. In order to gain experience with parallel attribute evaluation, a simulator has been implemented. Experiments with the simulating system are described and interpreted.

Cite

CITATION STYLE

APA

Klein, E., & Koskimies, K. (1990). Parallel one-pass compilation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 461 LNCS, pp. 76–90). Springer Verlag. https://doi.org/10.1007/3-540-53101-7_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free