DITRAN—a compiler emphasizing diagnostics
@article{Moulton1967DITRANaCE, title={DITRAN—a compiler emphasizing diagnostics}, author={Peter Moulton and Mervin E. Muller}, journal={Communications of the ACM}, year={1967}, volume={10}, pages={45 - 52} }
DITRAN DIagnostic FORTRAN) is an implementation of ASA Basic FORTRAN with rather extensive error checking capabilities both at compilation time and during execution of a program. The need for improved diagnostic capabilities and some objectives to be met by any compiler are discussed. Attention is given to the design and implementation of DITRAN and the particular techniques employed to provide the diagnostic features. The handling of error messages by a general macro approach is described…
Figures from this paper
59 Citations
Third generation compiler design
- Computer ScienceACM '75
- 1975
Several techniques that are currently implementable in a compiler are surveyed, several new techniques that can be applied to programs are described, and one such implementation of many of these ideas is described.
An Elementary Discussion of Compiler/Interpreter Writing
- Computer ScienceCSUR
- 1969
The techniques used to implement a PL/I inter-pretive system, written in the FORTRAN language for the UNIVAC 1108 at Boeing, are described, covering in breadth the general approach used, and in depth some of the more interesting techniques.
Automatic program analysis and evaluation
- Computer ScienceICSE '76
- 1976
An automatic data collection facility has been implemented as part of a PL/1 compiler at the University of Maryland and will evaluate some of the characteristics ofsome of the 25,000 programs that have been run since July, 1975.
The impact of language design on the production of reliable software
- Computer ScienceReliable Software
- 1975
This paper discusses the design of programming languages to enhance reliability by presenting several general design principles, and then applies them to particular language constructs.
Mining Helium programs with Neon
- Computer Science
- 2007
A sizable library in Haskell, called Neon, is developed for computing characteristics of this collection of Haskell programs written by students in a first-year functional programming course using the Helium compiler.
Mining for Helium
- Computer Science
- 2006
A library in Haskell, called Neon, is developed for computing characteristics of this collection of Haskell programs written by students in a first-year functional programming course using the Helium compiler and presenting the results visually.
A survey of run-time and logic errors in a classroom environment
- Computer ScienceSCOU
- 1983
The study found that two classes of errors accounted for over half of all noncompiletime errors: those errors related to input/output and assignment statements and less than half of the run-time error messages generated by the compiler actually pinpointed the cause of error or provided a meaningful hint.
Language design for programming reliability
- Computer ScienceIEEE Transactions on Software Engineering
- 1975
This paper discusses the design of programming languages to enhance reliability by presenting several general design principles, and then applies them to particular languages constructs.
Experimental evaluation of programming language features: Implications for introductory programming languages
- Computer ScienceSIGCSE '79
- 1979
The methodology and results of a number of research studies on the interaction between programmer and programming language affects the maintainability, reliability, and understandability of the resulting programs are examined.
14 References
WATFOR—The University of Waterloo FORTRAN IV compiler
- Computer ScienceCommun. ACM
- 1967
The principal advantage of the WATFOR compiler is that it translates FORTRAN IV programs at speeds of up to 100 statements per second, and hence large batches of “student” programs may be processed very efficiently.
PUFFT—The Purdue University fast FORTRAN translator
- Computer ScienceCACM
- 1965
An extension to the AXLE language will permit the computer to make inferences during run time, and a facility is needed for permitting the computer itself to change imperative and assertion tables as a result of earlier operations.
An error-correcting parse algorithm
- Computer ScienceCACM
- 1963
It is the author's opinion that those algorithms which do the best job of error recovery are those which are restricted to simpler forms of formal languages.
CORC—the Cornell computing language
- EducationCACM
- 1963
CORC is an experimental computing language that was developed at Cornell University to serve the needs of a large and increasing group of computer users whose demands are both limited and…
Remote computing--an experimental system: part 1: external specifications
- Computer ScienceAFIPS '64 (Spring)
- 1964
Remote computing has been around as long as computers themselves. More recently, interest has revived in providing remote users with convenient, economical access to a large central computer.…
Bounded context translation
- Computer Science, LinguisticsAFIPS '64 (Spring)
- 1964
All translators are syntax-directed in the sense that the translator must obviously recognize the various syntactic structures and the output of the translator is a function of the syntax of the language, and bounded context translation is possible.
Remote computing--an experimental system: part 2: internal design
- Computer ScienceAFIPS '64 (Spring)
- 1964
The internal design of the experimental remote-computing system is described, with attention focused on those features which are of general interest and applicable to the design of other programming systems.
An improved equivalence algorithm
- Computer ScienceCACM
- 1964
An algorithm for assigning storage on the basis of EQUIVALENCE, DIMENSION and COMMON declarations is presented, and has reduced computation time by 40 percent over a previously published algorithm.
Syntactic Analysis and Operator Precedence
- Computer Science, LinguisticsJACM
- 1963
Three increasingly restricted types of formal grammar are phrase structure Grammars, operator grammars and precedence grammar, which form models of mathematical and algorithmic languages which may be analyzed mechanically by a simple procedure based on a matrix representation of a relation between character pairs.