Issue No.02 - March (1992 vol.3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.127261
Examines the generation of parallel evaluators for attribute grammars, targeted to shared-memory MIMD computers. Evaluation-time overhead due to process scheduling and synchronization is reduced by detecting coarse-grain parallelism (as opposed to the naive one-process-per-node approach). As a means to more clearly expose inherent parallelism, it is shown how to automatically transform productions of the form X to Y X into list-productions of the form X to Y/sup +/. This transformation allows for many simplifications to be applied to the semantic rules, which can expose a significant degree of inherent parallelism, and thus further increase the evaluator's performance. Effectively, this constitutes an extension of the concept of attribute grammars to the level of abstract syntax.
Index Termsattribute grammars; parallel evaluators; shared-memory MIMD computers; processscheduling; synchronization; coarse-grain parallelism; inherent parallelism;list-productions; semantic rules; abstract syntax; attribute grammars; parallelprogramming; programming theory
A. Klaiber, M. Gokhale, "Parallel Evaluation of Attribute Grammars", IEEE Transactions on Parallel & Distributed Systems, vol.3, no. 2, pp. 206-220, March 1992, doi:10.1109/71.127261