Search
Now showing items 1-10 of 16
Parsing Key Word Grammars
(1969-03-01)
Key word grammars are defined to be the same as context free grammars, except that a production may specify a string of arbitrary symbols. These grammars define languages similar to those used in the programs CARPS and ...
Form and Content in Computer Science
(1969-12-01)
The trouble with computer science today is an obsessive concern with form instead of content. This essay has three parts, suggesting form-content displacements in Theory of Computation in Programming languages and in Education.
ITS 1.5 Reference Manual
(1969-07-01)
This reference manual consists of two parts. The first (sections 1 through 6) is intended for those who are either interested in the ITS 1.5 time sharing monitor for its own sake or who wish to write machine language ...
Discovering Good Regions for Teitelman's Character Recognition Scheme
(1969-05-01)
Warren Teitelman presented a novel scheme for real time character recognition in his master's thesis submitted in June of 1963. A rectangle, in which a character is to be drawn, is divided into two parts, one shaded ...
PROGRAMMER: A Language for Writing Grammars
(1969-11-01)
This memo describes PROGRAMMER, a parser for natural language. It consists of a language for writing grammars in the form of programs, and an interpreter which can use these grammars to parse sentence. PROGRAMMER is ...
Preprocessor for Programs which Recognize Scenes
(1969-08-01)
A visual scene is transformed from a very simple and convenient format, to an internal format which describes the same scene, but is more akin to complex manipulations. This format is compatible with programs like ...
The Integration of a Class of Special Functions with the Risch Algorithm
(1969-09-01)
We indicate how to extend the Risch algorithm to handle a class of special functions defined in terms of integrals. Most of the integration machinery for this class of functions is similar to the machinery in the algorithm ...
On Optimum Recognition Error and Reject Tradeoff
(1969-04-01)
The performance of a pattern recognition system is characterized by its error and reject tradeoff. This paper describes an optimum rejection rule and presents a general relation between the error and reject probabilities ...
The Arithmetic-Statement Pseudo-Ops: .I and .F
(1969-08-01)
This is a feature of MIDAS which facilitates the rapid writing and debugging of programs involving much numerical calculation. The statements used are ALGOL-like and easy to interpret.
Recognition of Topological Invariants by Iterative Arrays
(1969-10-01)
A study is made of the recognition and transformation of figures by iterative arrays of finite state automata. A figure is a finite rectangular two-dimensional array of symbols. The iterative arrays considered are ...