Srikant, YN and Shankar, Priti (1987) A new parallel algorithm for parsing arithmetic infix expressions. In: Parallel Computing, 4 (3). 291 -304.
Full text not available from this repository. (Request a copy)Abstract
A new parallel algorithm for transforming an arithmetic infix expression into a par se tree is presented. The technique is based on a result due to Fischer (1980) which enables the construction of the parse tree, by appropriately scanning the vector of precedence values associated with the elements of the expression. The algorithm presented here is suitable for execution on a shared memory model of an SIMD machine with no read/write conflicts permitted. It uses O(n) processors and has a time complexity of O(log2n) where n is the expression length. Parallel algorithms for generating code for an SIMD machine are also presented.
| Item Type: | Journal Article |
|---|---|
| Publication: | Parallel Computing |
| Publisher: | Elsevier Science |
| Additional Information: | Copy right of this article belongs to Elsevier Science. |
| Keywords: | Arithmetic infix expression, parse tree, SIMD computer, parallel parsing algorithm, parallel programruing, parallel code generation. |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 15 Jan 2010 04:50 |
| Last Modified: | 15 Jan 2010 04:50 |
| URI: | http://eprints.iisc.ac.in/id/eprint/20893 |
Actions (login required)
 |
View Item |
