Abstract
This paper provides a top-down description of an interpreter for a nucleus of a simple nondeterministic language designed to be utilized in computer aided problem-solving. The given description can be readily programmed in a language which allows the use of recursive procedures and which has record-type definition capabilities. After a minimal set of primitive commands is defined, an interpreter for these commands is developed using nondeterministic and recursive programming techniques. The examples presented are among many which have been tested using a version of the interpreter written inpascal.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. G. Bobrow and B. Raphael, “New programming languages for artificial intelligence research,”ACM Computing Surveys 6 (3):155–174 (September 1974).
D. G. Bobrow and B. Wegbreit, “A model and stack implementation of multiple environments,”Comm. ACM 16 (10):591–603 (October 1973).
J. Cohen, “Interpretation of non-deterministic algorithms in higher-level languages,”Inform. Proc. Letters 3 (4):104–109 (March 1975).
J. Cohen, “Non-deterministic algorithms,”ACM Computing Surveys 11 (2):79–94 (June 1979).
O. J. Dahl, E. W. Dijkstra, and C. A. R. Hoare,Structured Programming (Academic Press, London, 1972).
R. W. Floyd, “Non-deterministic algorithms,”J. ACM 14 (4):636–644(October 1967).
J. W. Garwick, “Data storage in compilers,”Nordisk Tidskrift for Informations- behandling 4:137–140 (1964).
E. B. Hunt,Artificial Intelligence (Academic Press, New York, 1975).
J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, Reading, Mass., 1969).
K. Jensen and N. Wirth,Pascal-User Manual and Report (Springer-Verlag, New York, 1975).
G. Lindstrom, “Backtracking in a generalized control setting,”ACM Trans. Programming Languages and Systems 1 (1):8–26 (July 1979).
D. Michie, “Memo-functions and machine learning,”Nature 218:19–22 (1968).
C. Montangero, G. Pacini, and F. Turini, “Two-level control structure for nondeterministic programming,”Comm. ACM 20 (10):725–730 (October 1977).
N. Nilsson,Problem-Solving Methods in Artificial Intelligence (McGraw-Hill, New York, 1971).
C. Weissman,Lisp 1.5 Primer (Dickenson Publishing Co., Belmont, California, 1967).
Author information
Authors and Affiliations
Additional information
The work reported here was supported by the National Science Foundation under Grant Number MCS 79-0522.
Rights and permissions
About this article
Cite this article
Cohen, J., Stachel, R. An interpreter for a nondeterministic language. International Journal of Computer and Information Sciences 9, 193–217 (1980). https://doi.org/10.1007/BF00977784
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00977784