A new parallel algorithm for parsing arithmetic infix expressions
- 1 June 1987
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 4 (3) , 291-304
- https://doi.org/10.1016/0167-8191(87)90028-7
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Parallel Generation of Postfix and Tree FormsACM Transactions on Programming Languages and Systems, 1983
- On Parsing and Compiling Arithmetic Expressions on Vector ComputersACM Transactions on Programming Languages and Systems, 1980
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence EquationsIEEE Transactions on Computers, 1973