Manipulation of data strings is the most complex processing function in information storage and retrieval applications. Data string manipulation is discussed within the context of an interpretive processing environment controlled …
Robert P. Larsen
Pages 785-789
A translation approach is described which allows one to extend the syntax and semantics of a given high-level base language by the use of a new formalism called a syntax-macro. Syntax-macros define string transformations based …
B. M. Leavenworth
Pages 790-793
Walter Gautschi
Pages 793-795
R. Williams
Page 795
Kenneth Hillstrom
Page 795
The rule mask technique is one method of converting limited entry decision tables to computer programs. Recent discussion suggests that in many circumstances it is to be preferred to the technique of constructing networks or
…
P. J. H. King
Pages 796-801
In this technical note, the numerical steps for the simplex method of linear programming are reviewed and the tolerances needed in the numerical procedure are defined. Objective criteria are given for accomplishing the numerical …
R. J. Clasen
Pages 802-803
Two efficient methods for automatic numerical integration are Romberg integration and adaptive Simpson integration. For integrands of the form ƒ(
x)
g(
x, &agr;) where
&agr; is a parameter, it is shown that Romberg's method is more efficient …
Philip Rabinowitz
Pages 804-806
A procedure for implementing an interval arithmetic version of the Newton-Raphson method is proposed. The procedure requires only a starting interval over which the zeros of a given rational function are to be located. The method …
Robert H. Dargel, Frank R. Loscalzo, Thomas H. Witt
Pages 806-809
It has been proven by Greibach that for a given context-free grammar G, a standard-form grammar G
s, can be constructed, which generates the same language as is generated by G and whose rules are all of the form
Z→
cY1 ··· …
Susumu Kuno
Pages 810-823
