Affiliation:
1. IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, N.Y.
Abstract
The experimental APL/370 E-compiler compiles a subset of APL which is large enough for most scientific and engineering uses, directly into 370 assembly code. The compiler does not require variable declarations. The front-end employs extensive type-shape analysis based on global dataflow analysis. The back-end takes the parse trees, graphs and tables produced by the front-end and generates 370-code which runs independently of the interpreter. The compiled-code executes at 2-10 times the speed of the interpreter on several one-line functions, and this ratio increases significantly with iterative programs. The code quality is comparable to that produced by an optimizing FORTRAN compiler on FORTRAN programs corresponding to our test cases. This removes the performance penalty of APL in computation intensive applications.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. A program data flow analysis procedure
2. An APL compiler for the UNIX timesharing system
3. An APL Compiler for a Vector Processor
4. R.E. Tarjan Testing Flow-graph Reducibility J. Computer System Sciences vo1.9(1974) 355-365. R.E. Tarjan Testing Flow-graph Reducibility J. Computer System Sciences vo1.9(1974) 355-365.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Abstract expressionism for parallel performance;Proceedings of the 2nd ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming;2015-06-13
2. Index Vector Elimination – Making Index Vectors Affordable;Implementation and Application of Functional Languages