Viswanathan, N and Srikant, YN (1991) Parallel attribute evaluation. In: Supercomputing Symposium '91. Symposium Proceedings, 3-5 June 1991, Fredericton, NB, Canada, pp. 529-540.
Full text not available from this repository. (Request a copy)Abstract
The authors have applied tree contraction to evaluate attribute expressions in parallel. Attribute expression operators can have multiple operands and are not restricted to binary arithmetic operators. Given a predefined set of domains and operators for the attributes, they associate a priori attribute functions with intermediate results to the operators. As parse tree contraction is performed attribute functions are composed to compute the attribute values. For an attribute grammar (AG) with only synthesized attributes, using this tree contraction method one can compute all the attributes of a parse tree with n nodes in $O(log_2 n)$ time using a n processors on a CREW PRAM model. For AGS allowing inherited attributes also, they construct a new class of evaluator called the m-pass parallel attribute evaluator having two alternating pass types: synthesized attribute evaluation pass and inherited attribute evaluation pass. In the synthesized attribute evaluation pass the compute exclusively synthesized attributes using the parse tree contraction method while in the inherited attribute evaluation pass they compute only inherited attributes by a recursive doubling algorithm. All the attributes of a parse tree with n nodes are evaluated in O$(m log_2 n)$ time using n processors on a CREW PRAM model
| Item Type: | Conference Paper |
|---|---|
| Publisher: | University of New Brunswick |
| Additional Information: | Copyright of this article belongs to University of New Brunswick. |
| Keywords: | attribute grammars;parallel algorithms |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 18 Jan 2008 |
| Last Modified: | 12 Jan 2012 09:17 |
| URI: | http://eprints.iisc.ac.in/id/eprint/11191 |
Actions (login required)
 |
View Item |
