Does APL really need run‐time parsing?

@article{Strawn1977DoesAR,
  title={Does APL really need run‐time parsing?},
  author={George O. Strawn},
  journal={Software: Practice and Experience},
  year={1977},
  volume={7}
}
  • George O. Strawn
  • Published 1 March 1977
  • Computer Science
  • Software: Practice and Experience
Most APL systems delay all parsing until run‐time. Because the APL expression language is inherently ambiguous and because identifier binding is delayed until run‐time, some runtime parsing is shown to be necessary. Nevertheless we argue that most APL statement parsing can be done at entry‐time and that there are several reasons for doing so. Then a technique is described whereby APL statements are partially parsed at entry‐time and are parse completed at run‐time. 
Compile time syntax analysis of APL programs
TLDR
Empirical evidence supports the hypothesis that the restricted APL language encompasses almost all existing APL code, and a technique for the compiling of the syntactic attribute of names essential for the development of a compile-time parser for APL is presented.
Parsing and evaluation of APL with operators
TLDR
The difficulties that arise with the introduction of function valued and basic valued operators in APL are considered and various modifications to the syntactic and semantic structure of APL that serve to avoid these difficulties are discussed.
Parsing and evaluation of APL with operators
TLDR
The difficulties that arise with the introduction of function valued and basic valued operators are considered and various modifications to the syntactic and semantic structure of APL that serve to avoid these difficulties are discussed.
Steps toward an APL compiler
TLDR
The proposed language changes are regarded as improvements because they facilitate deductions about programs by humans and therefore contribute to program readability and reliability and the impact is minimal because compilation of APL would be appropriate mainly for production programs that already have been tested.
Steps toward an APL compiler
TLDR
The proposed language changes are regarded as improvements because they facilitate deductions about programs by humans and therefore contribute to program readability and reliability and the impact is minimal because compilation of APL would be appropriate mainly for production programs that already have been tested.
The Effect of Operators on Parsing and Evaluation in APL
Dataflow analysis in APL
  • T. Budd
  • Computer Science
    APL '85
  • 1985
TLDR
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.
Is APL a suitable tool for the design of large-system software?
TLDR
As a programming language, APL is not new, but a myriad of other programming languages have come into existence and the definitions of the most noteworthy of these have been strongly influenced by advances in, or at least theories from, the field of software engineering.
An Implementation of the Haskell Language
TLDR
The areas implemented are the lexical analysis, parsing, intepretation of the lambda tree, and machine code generation of HASKELL system.
Handling context-sensitive syntactic issues in the design of a front-end for a MATLAB compiler
TLDR
The front-end was designed and implemented as part of the MATCH project, which addresses the translation of a MATLAB program by a compiler onto a heterogeneous target consisting of embedded and commerical-off-the-shelf processors.
...
1
2
3
...

References

SHOWING 1-2 OF 2 REFERENCES
Does APL really need run‐time checking?
TLDR
The results indicate that the overhead involved in checking type and size compatibility of the arguments of APL primitive functions during execution can be substantially avoided without loss of error detection.
Deterministic parsing of ambiguous grammars
TLDR
This work considers methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions and shows how efficient LL and LR parsers can be constructed directly from certain classes of these specifications.