A three-pass compiler with the following properties is briefly described: The last two passes scan an intermediate language produced by the preceding pass in essentially the reverse of the order in which it was generated, so
…
C. W. Gear
Pages 483-488
W. Gautschi
Pages 488-492
J. G. Herriot
Pages 489-492
J. H. Gunn
Page 492
J. H. Gunn
Page 492
J. K. S. Mckay
Page 493
J. K. S. McKay
Page 493
J. K. S. McKay
Page 493
A routine has been developed which computes and prints out the symbolic derivative of an absolutely continuous elementary function of one or several variables. No use is made of list processing languages. The chain rule is applied …
Peter J. Smith
Pages 494-496
An ALGOL compiler has been written by the ALCOR group for the IBM 7090. Some little known but significant techniques in compiler writing, together with organizational details of this compiler, are described. Timing estimates
…
D. Gries, M. Paul, H. R. Wiehle
Pages 496-500
A set of subroutines to allow algebraic manipulations on the IBM 7094 computer has been written using a List Processor, SLIP.
A series of four problems of increasing difficulty were solved using these routines.
Arnold Lapidus, Max Goldstein
Pages 501-508
The use and implementation of two new FORTRAN format conversions are discussed. These format types give the FORTRAN programmer control of input/output specifications at execution time.
John E. Ranelletti
Pages 508-510
It is suggested that the convergence properties of the usual Picard successive approximation scheme may be improved through use of nonlinear extrapolation techniques. A numerical example is provided.
Richard Bellman, Harriet Kagiwada, Robert Kalaba
Pages 511-512
A method for storing strings is described which uses blocks of indefinite size, and is therefore completely dynamic. Its relation to similar schemes is discussed.
A. T. Berztiss
Page 512
This note describes some FORTRAN subroutines to facilitate handling of tape files. They allow symbolic naming or information files, without violating the casual scientific programmer's idea of simplicity. Some comments on two …
Malcolm C. Harrison
Pages 514-515
The requirement that subscripts be unsigned integers creates some inconvenience in FORTRAN programming for summarization of completed questionnaires in which the responses may be scaled beginning at zero.
M. J. Garber
Pages 515-516
During the preliminary logical design of the NEBULA computer for the Oregon State University Department of Mathematics, it was decided to simulate the logic equations on one of the computers available on campus. Thus most of
…
Fred W. Weingarten
Pages 516-517
Recently M. Morris Mano presented a method for performing Boolean OR, AND and NOT operations by means of arithmetic and conditional transfer operations in a decimal computer lacking builtin logical instructions [1]. When
A,
B …
George G. Dodd
Page 517
A computer-oriented method for processing and communicating numerical data is described. The Instrument Reliability Factors (IRF), which exactly define the limits of reliability of each measured item of information, are used
…
P. A. D. de Maine
Pages 518-526
