The Generation of Optimal Code for Arithmetic Expressions
Journal of the ACM (JACM)
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Restructuring of Arithmetic Expressions For Parallel Evaluation
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A parallel approach to compilation
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A preliminary architecture for a basic data-flow processor
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
Parallel Compilation In A Multiprocessor Environment (Extended Abstract)
ACM '78 Proceedings of the 1978 annual conference
Lexical analysis and parsing techniques for a vector machine
Proceedings of the conference on Programming languages and compilers for parallel and vector machines
A parallel approach to code generation for Fortran like compilers
Proceedings of the conference on Programming languages and compilers for parallel and vector machines
On parsing context free languages in parallel environments.
On parsing context free languages in parallel environments.
Parallel programming techniques for compilers
ACM SIGPLAN Notices
Formal languages and their relation to automata
Formal languages and their relation to automata
A bibliography on parallel parsing
ACM SIGPLAN Notices
Parallel Generation of Postfix and Tree Forms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Compilation on Associative Computers
PACT '94 Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
An Asynchronous Parallel Interpreter for Arithmetic Expressions and Its Evaluation
IEEE Transactions on Computers
| Hi-index | 0.00 |
The problem of parsing and compiling arithmetic expressions on vector computers is considered. Methods are developed which allow encodings of one or more arithmetic expressions to be transformed directly into encodings of their corresponding derivation trees. The algorithm which performs this transformation is compact, efficient, and able to make extensive use of concurrent vector operations. Routines which concurrently transverse encoded derivation trees in a top-down or bottom-up manner are presented. These routines can be used to structure efficient, compact, and highly concurrent algorithms which complete the process of compiling arithmetic expressions.