© 1972 by British Computer Society
Formal systems and analysis of context sensitive languages*

Philadelphia Scientific Centre, IBM, 3401 Market Street, Philadelphia, Pennsylvania, USA
Canonic systems, which are applied variants of Post's canonical systems have been used to define sets of strings of symbols recursively. A hierarchy of classes of canonic systems is obtained by introducing restrictions on the general form of canonic systems. One of the classes contains canonic systems which generate only recursive sets including all context sensitive languages. An algorithm has been programmed in APL to parse strings over the alphabet of languages specified by canonic systems of the class mentioned above. A general approach has been taken such that the canonic systems and the parsing algorithm cover a wide variety of applications, as e.g., in constructing syntax directed translators, proof checking systems and linguistical analysis. Some mathematical properties of the classes of canonic systems are also presented.
Received July 1971.
* This paper is based on part of a dissertation presented to the Faculty of the Graduate School of Yale University in candidacy for the degree of Doctor of Philosophy.
Philadelphia Scientific Centre, IBM, 3401 Market Street, Philadelphia, Pennsylvania 19104, USA