A recursive interpreter for the Icon programming language

ABSTRACT

The implementation of the Icon programming language is more interesting and difficult than the implementation of many other programming languages because an expression in Icon can generate a sequence of results. The implementation therefore must support control backtracking in expression evaluation. There also are several novel control structures related to generators. Because expression evaluation is limited lexically, a full coroutine mechanism is not needed and expression evaluation can be handled in a stack-like fashion.The implementation of Icon consists of a virtual machine with a stack-based architecture and an interpreter that executes the virtual machine instructions. There have been several different interpreters for Icon's virtual machine. This paper describes a new approach in which the interpreter is called recursively whenever the context for expression evaluation changes. This recursive interpreter has the advantage of being conceptually clear and flexible without sacrificing efficiency.

REFERENCES

• 1: Ralph E. Griswold , Madge T. Griswold, ICON Programmng Language, Prentice Hall Professional Technical Reference, 1983
• 2: Ralph E. Griswold , David R. Hanson , John T. Korb, Generators in Icon, ACM Transactions on Programming Languages and Systems (TOPLAS), v.3 n.2, p.144-161, April 1981 [doi>10.1145/357133.357136]
• 3: John Timothy Korb, The design and implementation of a goal-directed programming language., The University of Arizona, 1979
• 4: Stephen Berry Wampler, Control mechanisms for generators in icon, The University of Arizona, 1981
• 5: 5. S. B. Wampler and R. E. Griswold, "The Implementation of Generators and Goal-Directed Evaluation in Icon", Software-Practice & Experience 13, 6 (June 1983), 495-518.
• 6: 6. R. E. Griswold and W. H. Mitchell, A Tour Through the C Implementation of Icon; Version 5.10, The Univ. of Arizona Tech. Rep. 85-19, 1985.
• 7: Ralph E Griswold , Madge T Griswold, The implementation of the Icon programming language, Princeton University Press, Princeton, NJ, 1986
• 8: John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962
• 9: Harold Abelson , Gerald Jay Sussman , Julie Sussman, Structure and interpretation of computer programs, MIT Press, Cambridge, MA, 1985
• 10: John A. Campbell, Implementation of PROLOG, Prentice Hall PTR, Upper Saddle River, NJ, 1984
• 11: J Stojanovski, A note on implementing Prolog in Lisp, Information Processing Letters, v.23 n.5, p.261-264, Nov. 1986 [doi>10.1016/0020-0190(86)90083-9]
• 12: Jacques Cohen, Describing Prolog by its interpretation and compilation, Communications of the ACM, v.28 n.12, p.1311-1324, Dec. 1985 [doi>10.1145/214956.214960]
• 13: Gert Smolka, Making control and data flow in logic programs explicit, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.311-322, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802048]
• 14: 14. T. A. Budd, "An Implementation of Generators in C", J. Computer Lang. 7(1982), 69-87.
• 15: 15. E. Gallesio, The Programming Language ¿, Draft Report, University of Nice, 1985.

INDEX TERMS

Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: ICON
      D.3.4 Processors
          Subjects: Interpreters

General Terms:
Design, Languages