This paper presents some results of R. W. Floyd (1966). He proposes inclusion of additional features in present programming languages to be able to express in a convenient way algorithms based on the technique of backtrack described by Golomb and Baumert (1965). Floyd proposes a way of implementation. Here we suggest an alternative method and present results obtained from an experimental implementation.
KeywordsComputational Mathematic Programming Language Experimental Implementation Present Programming
Unable to display preview. Download preview PDF.
- 1.Dahl, O. J. and Nygaard, K.,SIMULA- an ALGOL-Based Simulation Language, Comm. ACM, Vol. 9, No. 9, September 1966.Google Scholar
- 2.Dijkstra, E. W.,Cooperating Sequential Processes, Technological University, Eindhoven, September 1965.Google Scholar
- 3.Domolki,A.,Programming Technique for the Recognition of the Syntactic Structure of Symbol Strings, Colloquium on the Foundations of Mathematics, Mathematical Machines and their Applications, Editor, Laszlo Kalmar, Budapest, 1965.Google Scholar
- 4.Floyd, R. W.,Non-deterministic Algorithms, Journal of the ACM, Vol. 14, No. 4, October 1967.Google Scholar
- 5.Floyd, R. W.,Course-notes, NATO Summer School on Programming Languages, Grenoble, (1966).Google Scholar
- 6.Golomb, S. W., and Baumert, L. D.,Backtrack Programming, Journal of the ACM, Vol. 12, No. 4, October 1965.Google Scholar
- 7.Naur, P.,The Design of the GIER ALGOL Compiler, BIT Vol. 3, No. 2 and 3, 1963.Google Scholar