Parallel parsing of programming languages
- 30 November 1987
- journal article
- Published by Elsevier in Information Sciences
- Vol. 43 (1-2) , 55-83
- https://doi.org/10.1016/0020-0255(87)90031-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A new parallel algorithm for parsing arithmetic infix expressionsParallel Computing, 1987
- Optimal parallel generation of a computation tree formACM Transactions on Programming Languages and Systems, 1985
- Parallel Generation of Postfix and Tree FormsACM Transactions on Programming Languages and Systems, 1983
- A Multiprocessing Approach to Compile-Time Symbol ResolutionACM Transactions on Programming Languages and Systems, 1981
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978