The implementation of generators and goal‐directed evaluation in icon

O'Bagy, Janalee; Griswold, Ralph E.

doi:10.1002/spe.4380130605

Cited by 6 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generative control str uctures also introduce control backtrackin g points and may also require additional state information . The limitation control structure, for example, requires a method fo r (1 to 5) The implicit nature of goal-directed evaluation combine d with the generalized concepts of success, failure . and generators gives Icon its expressive power .…”

Section: Expression Evaluation In Ico Nmentioning

confidence: 99%

A recursive interpreter for the Icon programming language

O'Bagy

Griswold

1987

Papers of the Symposium on Interpreters and Interpretive Techniques - SIGPLAN '87

View full text Add to dashboard Cite

Abstrac tThe implementation of the Icon programming language is more interestin g and difficult than the implementation o f many other programming languages because an expression i n Icon can generate a sequence of results . The implementatio n therefore must support contr ol backtracking in expressio n evaluation . There also are several novel control structure s related to g enerators . Because expression evaluation is limite d lexically . a full coroutine mechanism is not needed an d expression evaluation can be handled in a stack-like fashion .The implementation of Icon consists of a virtual machin e with it stack-based architecture and an interpreter that execute s the virtual machine instructions . There have been several different interpreters for Icon's virtual machine . This pape r describes a new approach in which the interpreter is calle d recursively whenever the context for expression evaluatio n changes . This recursive interpreter has the advantage of bein g conceptually clear and flexible without sacrificing efficiency .

show abstract

Section: Expression Evaluation In Ico Nmentioning

confidence: 99%