Search

The use of the Kleene regular expression notation for describing algebraic language syntax, in particular of ALGOL is described in this paper. A FORTRAN II computer program for carrying out the elimination algorithm of Gorn, similar to Gaussian elimination for linear systems of algebraic equations, is described. This was applied to numerous smaller languages, including some sublanguages of ALGOL. A hand calculation result of the application of the algorithm to all of ALGOL is given, thus expressing the Revised ALGOL 1960 syntax in completely nonrecursive terms, as far as its context-free portion is concerned. This description in many ways is far more intuitively understood than the previous recursive description, it is suggested. The paper also includes results of the machine program, which does not include a simplification algorithm. [ABSTRACT FROM AUTHOR]

The article presents the impact of subscripts with unsigned integers to FORTRAN II programming. The elimination of attaching sign to integers creates a negative response in terms of summarizing completed questionnaires. The study concerning subscript values using the IBM 1620 in FORMAT FORTRAN and in FORTRAN II provides a conclusion that the requirement of eliminating signs on subscripts is not implemented by programming logic but by the processor. Various examples illustrating negative and zero subscripts in one-way, two-way, and three-way arrays are provided.

The article discusses the use of Cobol subroutines in Fortran main programs. The program demonstrate the simple technique of combining two computer program language, Cobol and Fortran. The main program were run on IBM 7090 and written in Fortran and the subroutine Cobol. Some of the advantages of Fortran II Chain System is presented including the immediate availability of a set of chain jobs, thus reducing the tape-handling necessary, setting up of an additional chain or modifying one of the chains without having to recompile the entire chain.