• Corpus ID: 17306407

Program Analysis and Code

  title={Program Analysis and Code},
  author={Wai-Mee Ching},
We have implemented an APL/370 compiler which accepts a subset of APL that includes most language features and a majority of APL primitive functions. It produces System/370 assembly code directly to be run independently of an interpreter. The compiler does not require variable declarations. Its front end, which is machine-independent, employs extensive typeshape analysis based on a type-shape calculus of the primitive functions and global dataflow analysis. Its back end does storage mapping… 

Tables from this paper


A performance comparison between an APL interpreter and compiler
An analysis of the execution of several simple APL statements illustrates that interpretive overhead in the form of setup time is awesome, and is on the order of 100 times as much as the per-element
Compiling APL: The Yorktown APL Translator
The history of APL compilation, the motivation for producing YAT, the design choices that were made, and the manner of implementation are outlined.
An introduction to STSC's APL compiler
Although many programs can be written efficiently in APL without iteration, some programs absolutely require iteration and these aspects of APL programming neither make the language easier to use nor enhance programmer productivity.
Dataflow analysis in APL
  • T. Budd
  • Computer Science
    APL '85
  • 1985
An algorithm is described to perform dataflow analysis on programs written in an APL-like language that is simpler and tailored more directly to the target language than previously published algorithms for data flow analysis in APL.
A Scheme for the Automatic Inference of Variable Types
It is demonstrated that this algonthra is superior to other pubhshed algortthms m in the sense that it produces stronger assertions about the set of possible types for variables than do other known algorithms.
A program data flow analysis procedure
The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper. A procedure is given which determines all the definitions which can
An APL compiler for the UNIX timesharing system
  • T. Budd
  • Computer Science
    APL '83
  • 1983
An APL compiler running under the UNIX timesharing system on a PDP 11/70 is described.
Testing flow graph reducibility
An algorithm for testing whether a flow graph is reducible is described, which uses depth-first search to reveal the structure of the flow graph and a good method for computing disjoint set unions to determine reducibility from the search information.
The art of programming
A Portable Compiler for Parallel Machines
  • Proceedings of the International Conference on Computer Design
  • 1984