R. Griswold and M. Griswold. The Icon programming language. Prentice Hall, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... In this case maintaining the state is implicit in the controlflow of the the explode function and in particular the borderline cases are handled correctly by definition. Streams and generators are not new concepts. They are supported by a wide range of languages in various forms [19, 5, 37, 26, 29, 34]. Our approach is a little di#erent in that: We classify streams into a hierachy of streams of di#erent length (see below) We automatically flatten streams of streams (see Section 2.1) We identify the value null with the empty stream (see Section 2.2) To keep type checking ....

R. Griswold and M. Griswold. The Icon Programming Language (2nd edition). Prentice Hall, 1990.

....experimental code, very easy to modify and adapt to our needs in a small fraction of the time we would have needed using a more conventional programming language. We would like to thank the people from the University of Arizona Computer Science Department for their very fine work (Griswold, [13]) More information about Icon is available from ftp: cs.arizona.edu icon. ....

Griswold R.E., Griswold M.T., The Icon Programming Language, PrenticeHall, second edition, 1990. 37

....There is, therefore, a desperate need for computer text processing technology applicable to Chinese language. The importance of computer text processing has long been appreciated in the Western world. This led to the development of the programming language, SNOBOL [1] and its successor Icon [2,3,4,5] which were designed with efficient built in text manipulation utilities. These languages are suitable for applications in natural language processing, compiler, text editing and formatting, questionnaire analysis. etc. Direct application of the aforesaid programming languages to Chinese text ....

....are omitted. A membership test can be efficiently achieved using a binary search through the sorted character list. 3.4.2 String Matching String matching is by far the most widely used function in any text processing programs. In particular, in Icon and Chicon application programs, generators [2,3,4,5] are widely used for this purpose. The concept of a generator is best explained by an example. Consider the following set of expressions: sentence : Store it in the neighboring harbor. if (i : find( or ,sentence) 5 then write(i) The second expression shows a typical use of a generator ....

Griswold, R. E. and M. T. Griswold. The Icon Programming Language, Englewood Cliffs. N.J., Prentice-Hall, Inc. 2nd Ed. 1990.

....There is, therefore, a desperate need for computer text processing technology applicable to Chinese language. The importance of computer text processing has long been appreciated in the Western world. This led to the development of the programming language, SNOBOL [1] and its successor Icon [2,3,4,5] which were designed with efficient built in text manipulation utilities. These languages are suitable for applications in natural language processing, compiler, text editing and formatting, questionnaire analysis. etc. Direct application of the aforesaid programming languages to Chinese text ....

....are omitted. A membership test can be efficiently achieved using a binary search through the sorted character list. 3.4.2 String Matching String matching is by far the most widely used function in any text processing programs. In particular, in Icon and Chicon application programs, generators [2,3,4,5] are widely used for this purpose. The concept of a generator is best explained by an example. Consider the following set of expressions: sentence : Store it in the neighboring harbor. if (i : find( or ,sentence) 5 then write(i) The second expression shows a typical use of a generator ....

Griswold, R. E. and M. T. Griswold. The Icon Programming Language, Englewood Cliffs. N.J., Prentice-Hall, Inc. 1983.

....simple experimental code, very easy to modify and adapt to our needs in a small fraction of the time we would have needed using a more conventional programming language. We would like to thank the people from the University of Arizona Computer Science Department for their very fine work (Griswold, [13]) More information about Icon is available from ftp: cs.arizona.edu icon. ....

Griswold R.E., Griswold M.T., The Icon Programming Language, PrenticeHall, second edition, 1990. 37

....Ends of lines are often used as delimiters, sometimes in complicated ways. FORTRAN, COBOL, and UNIX shell languages are examples of line oriented languages in which escape symbols are required to prevent textual line breaks from being treated as logical end of statement delimiters. In Icon [12], a line break sometimes serves as a statement delimiter; but only if the last token before the line break and the first token after it are not part of the same construct. In Haskell [17] indentation can be used to indicate nesting, in place of explicit bracketing tokens, thereby making some line ....

R. E. Griswold and M. T. Griswold. The Icon Programming Language. PrenticeHall, Englewood Cliffs, N.J., 1983.

....in [1] Alamo s primary domain is that of visualization tools used in debugging and program understanding. Such monitors present a visual analysis of the dynamic behavior of programs. Alamo was created by generalizing monitoring facilities that were developed for Icon, an interpreted language [2]. After using these facilities in classes 1 This work supported in part by the National Science Foundation under grants CCR9409082 and CDA 9633299 c fl2000 Published by Elsevier Science B. V. Jeffery and writing a large number of visualization tools, a similar monitoring framework for ANSI C ....

Griswold, R., and M. Griswold, "The Icon Programming Language," Peer-toPeer Communications, San Jose, 1997

....An Imperative Language that Supports Declarative Programming Delta 49 ment, and the failure and success statements with the expected meaning. The failure and success statements are present in many imperative languages that support automatic backtracking, the most known of them being Icon (see Griswold and Griswold [1983]) and SETL (see Schwartz et al. 1986] The language Icon allows for nondeterministic constructors similar to our ORELSE and SOME statements. In order to explore the full set of branches of a nondeterministic construction the user can use the every statement, which resembles our FORALL ....

Griswold, R. E. and Griswold, M. T. 1983. The Icon Programming Language. Prentice-Hall, Englewood Cliffs, N. J.

....we present how the information from our CCL descriptions can be used to generate calling sequences for the vpcc vpo optimizing compiler. 5.1 The Interpreter We have implemented an interpreter for the CCL specification language. The interpreter s source is approximately 2500 lines of Icon code [Griswold and Griswold 1990]. The interpreter takes as input the CCL description of a procedure calling convention, a procedure s signature, and some additional information about the target architecture, and produces locations of the values to be transmitted, in terms of both the callee and the caller s frame of reference. ....

Griswold, R. E. and Griswold, M. T. (1990). The Icon Programming Language. Prentice-hall, second edition.

....feasibility of this framework. AME initially used Solaris threads to implement coroutines and semaphore operations to suspend and resume them, allowing only one thread to be active at a time. Subsequently, AME was modified to employ a simpler coroutine model based on Icon s co expression data type [Gris90]. This chapter first presents AME s context switch mechanism in detail, followed 30 31 by the mechanisms of event reporting and filtering that are used to further minimize the overhead associated with monitoring. The synchronization and coordination of several EMs is discussed at the end of the ....

....and uses a more portable and simpler model. Our second approach is based on the activation of co expression implemented in the Icon language [Wamp81] A co expression in Icon is a data object that contains a reference to an expression and an environment for the evaluation of that expression [Gris90]. Activation of one co expression by another co expression entails that evaluation is interrupted in the first and continued in the second. This mechanism is adopted by our framework. In our second approach, a new user level context is created for each loaded program. The new context includes a ....

R. E. Griswold and M. T. Griswold, The Icon programming language, Prentice Hall, 1990.

....that have well tested and heavily used implementation of a GLR parser generator as part of a system. We note that the latest version of the so called Ibpag2 system (Icon Based Parser Generation System 2) can handle GLR grammars for Icon. Icon is a high level, general purpose programming language [17]. 4.1 The GLR algorithm The GLR algorithm uses an ordinary LR parse table. This table may contain shift reduce and or reduce reduce conflicts. The GLR algorithm operates in exactly the same way as the LR algorithm, until either a shift reduce or reduce reduce conflict in the parse table is ....

R.E. Griswold and M.T. Griswold. The Icon Programming Language. Prentice-Hall, Englewood Cliffs (NJ), 1990. 9

....a multitree form a tree, and the ancestors of any node form an inverted tree. Multitrees can share both leaves and complete subtrees. Several novel hierarchy visualization methods have been proposed for displaying large hierarchies in the context of the Icon graphics programming language project [12]. In one variation, a tree is converted to a horizontal brick wall display. In another example, a tree is represented as a tree ring. See Figure 3, Displaying Hierarchies. The appealing 2D or even 3D display of large hierarchies (e.g. displaying a large hierarchy like the Great Wall of China ) ....

R. E. Griswold and M. T. Griswold. The Icon Programming Language. Prentice Hall, Englewood Cliffs, NJ, 1990.

.... descendant of Icon, and shares that language s very high language level (comparable to Common Lisp) familiar Pascal ish (or C ish) syntax, strong set of facilities for manipulating strings and structures, built in backtracking via goal directed expression evaluation, and novel control structures [Gris90]. Idol adds support for objects to Icon much as C adds support for objects to C, only the emphasis is on a small, clean design consistent with the Icon language s very high level and style. 2 Closure Based Inheritance Closure based inheritance (CBI) is a definition of inheritance based on the ....

Griswold, R. E. and Griswold, M. T. The Icon Programming Language, second edition. Prentice-Hall, Englewood Cliffs, New Jersey, 1990.

....Improvements The generated matcher described in the previous section is practical for many code generation applications. iburg implements, however, several simple improvements that make the generated matchers smaller and faster. Even with the improvements below, iburg takes only 642 lines of Icon [9]. The short elements of the rule vector can accommodate any external rule number, but many non terminals are defined by only a few rules. For example, only lines 10 and 11 in Figure 2 define disp, so only two bits are needed to record one of the two positive values. Definitions can be mapped into ....

R. E. Griswold and M. T. Griswold. The Icon Programming Language. Prentice Hall, Englewood Cliffs, NJ, second edition, 1990.

....possible were eliminating redundant Icon system calls, replacing Icon literals with C literals, and eliminating unnecessary logic in variable initialization blocks. 1. 1 The Icon Compiler The Icon programming language is a high level language designed and implemented at the University of Arizona [Gris90]. Normally, Icon programs are translated into virtual machine code which is 1 2 CHAPTER 1. INTRODUCTION interpreted at run time by the Icon interpreter; however, an Icon compiler was also developed that translates Icon code into C code which is then compiled into executable code by a C compiler ....

Griswold, R. E. and Griswold, M. T. The Icon Programming Language, second edition. Prentice-Hall, Englewood Cliffs, New Jersey, 1990.

....statement, a parameterized nondeterministic choice, here adopted as a SOME statement, and the failure and success statements with the expected meaning. The failure and success statements are present in many imperative languages that support backtracking, the most known of them being Icon (see Griswold Griswold (1983)) and SETL (see Schwartz, Dewar, Dubinsky Schonberg (1986) The language Icon allows for nondeterministic constructors similar to our ORELSE and SOME statements. In order to explore the full set of branches of a nondeterministic construction the user can use the every statement, which ....

Griswold, R. E. & Griswold, M. T. (1983), The Icon Programming Language, Prentice-Hall, Englewood Cliffs, New Jersey, USA.

....or where the compiler directly adds profiling code to the program when the appropriate compiler options are specified. Related work includes a Prolog profiler described by Gorlick and Kesselman [8] and the profiler for Icon, a programming language that supports pattern matching and backtracking [10]. The former uses instruction execution counts obtained at runtime, together with statistical estimates of the time spent in each instruction, to compute the time spent in each clause. In Icon, profiling is handled by surrounding each expression in the program with code that accumulates profiling ....

R. Griswold and M. Griswold, The Icon Programming Language, Prentice Hall, Inc., 1983.

....memory processing is crucial to an effective implementation. 22 Pascal sets must be of limited size. Semantically, they are really only fixed length bit strings with Boolean operators defined on them. SETL [SDD86] is a complete set based language, but it has not gained wide acceptance. Icon [GrG83] too, may be regarded as a set language, although its generators (which are in many ways analogous to our enumerator) really generate sequences, or ordered sets. 23 A relation is a set of values; the relational model employs value based set semantics. For us, a set will always means a set of ....

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice Hall, Englewood Cliffs, NJ, 1983.

....V[i] A[i,i] V[i 1] END; V[N] b; This solution, which one would write for example in ILOG Solver, has the obvious drawback of creating N new unknowns for stating one single constraint. Therefore we propose the use of lists of unknowns (as done for example in the ICON programming language of [6] for the case of variables) identified by the keyword LIST, upon which constraints of various forms can be stated by means of built ins. The above program fragment would then be replaced by VAR A: ARRAY [1. N] 1. N] OF CONSTRAINED INTEGER; L: LIST OF CONSTRAINED INTEGER; b: INTEGER; Empty(L) ....

R. E. Griswold and M. T. Griswold. The Icon Programming Language. PrenticeHall, Englewood Cliffs, New Jersey, USA, 1983.

....for a general purpose programming language is a significant effort. For practical reasons it was necessary to find a language that did not require an inordinate amount of work to compile. At the same time it had to be complex enough to enable realistic evaluation. The Icon programming language [12] was chosen because translation of Icon is of intermediate difficulty and a welldocumented implementation of the language is freely available [13] Icon is a general purpose procedural language with particularly good support for string processing and high level data structures such as tables and ....

GRISWOLD, R. E., AND GRISWOLD, M. T. The Icon Programming Language. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1983.

....module. 5 GRAPH Visualizer The Visualizer reads trace data from a Physical Communication File and presents it in an interactive X windows display. GRAPH s visualization package is being developed in the Icon programming language because of Icon s support for graphics and interface programming [6, 11]. 5.1 Visualizer views Although data was collected for physical processors, the current Visualizer views display only internode communication. Examples of the Visualizer views are shown in Figure 2. Views are organized hierarchically, starting with a view that maps communication data onto an ....

R. E. Griswold and M. T. Griswold, The Icon Programming Language, second edition, PrenticeHall, Englewood Cliffs, New Jersey, 1990.

....of these flaws, but the same low level machine oriented character that makes it efficient also makes C less than ideal as an algorithmic notation usable by nonexperts. Idol owes most of its desirable traits to its foundation, the Icon programming language, developed at the University of Arizona [Gris90]. In fact, Idol presents objects simply as a tool to aid in the writing of Icon programs. Idol integrates a concise, robust notation for object oriented programming into a language considerably more advanced than C or Pascal. Icon already uses a powerful notation for expressing a general class of ....

Griswold, R. E. and Griswold, M. T. The Icon Programming Language, second edition. PrenticeHall, Englewood Cliffs, New Jersey, 1990.

....case CVCI: if (l op = INDIRC l left rule[dispNT] c = l left cost[dispNT] 1; record(p, regNT, c, 7) record(p, rcNT, c 0, 13) record(p, stmtNT, c 0, 5) break; return (int)p; Fig. 4. Implementation of state. 8 1 improvements below, iburg takes only 642 lines of Icon [14]. The short elements of the rule vector can accommodate any external rule number, but many non terminals are defined by only a few rules. For example, only lines 10 and 11 in Figure 2 define disp, so only two bits are needed to record one of the two positive values. Definitions can be mapped into ....

Griswold, R. E., and Griswold, M. T. The Icon Programming Language, second ed. Prentice Hall, Englewood Cliffs, NJ, 1990.

....Tucson, Arizona 85721 This work was supported by the National Science Foundation under Grants CCR 8901573 and DCR 8502015. The Run Time Implementation Language for Icon V8.7 1. Introduction This report describes a language to aid in the implementation of a run time system for the Icon language [1]. This language is called RTL. The design of RTL is motivated by the needs of the optimizing compiler for Icon, iconc. The optimizing compiler needs a variety of information about run time routines and needs to be able to use both general and specialized versions of these routines to generate ....

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990. - 18 -

....[23] Synthesizing grammar: Code generation is expressed by merely using a synthesizinggrammar. The synthesizing grammar applies very similar notations to those used for parsinggrammars. Experimenting grounds: An open architecture approach and high level code generation (and the choice of Icon [12, 35] for Soop implementation) facilitates easy experimentation by the scientist and programmer and quick development and evaluation of new ideas and tools. Outline The rest of this paper is organized as follows. The following section presents Soop more formally and gives some insight into its ....

R. E. Griswold and M. T. Griswold. The Icon Programming Language. Software Series. Prentice-Hall, Englewood Cliffs, NJ, Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold, C. L. Jeffery, and G. M. Townbsend, Version 9.0 of the Icon Programming Language, The Univ. of Arizona IPD236, 1994.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language , Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. E. Griswold, Clinton L. Jeffery, Gregg M. Townsend, Version 9.0 of the Icon Programming Language, The Univeristy of Arizona, technical report IPD236, 1994.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, second edition, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, second edition, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

....9.0 of the Icon Programming Language Ralph E. Griswold, Clinton L. Jeffery, and Gregg M. Townsend Department of Computer Science, The University of Arizona 1. Introduction The current version of Icon is Version 9.0. The second edition of the Icon book [1] describes Version 8.0. This description is a supplement to that book. Most of the language extensions in Version 9.0 are upward compatible with previous versions of Icon and most programs written for earlier versions work properly under Version 9.0. The language additions to Version 9.0 are: # ....

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

R. Griswold and M. Griswold. The Icon programming language. Prentice Hall, 1990.

No context found.

Griswold, R. E. and Griswold, M.T. The Icon Programming Language , second edition. Prentice-Hall, Englewood Cliffs, New Jersey, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

Griswold, R. E. and Griswold, M. T. The Icon Programming Language, second edition. Prentice-Hall, Englewood Cliffs, New Jersey, 1990.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990.

No context found.

Griswold, R. E. and Griswold, M. T. The Icon Programming Language, second edition. Prentice-Hall, Englewood Cliffs, New Jersey, 1990.

No context found.

R. E. Griswold and M. T. Griswold. The Icon Programming Language. Prentice-Hall, 1983.

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1983 (new version to appear).

No context found.

R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1983 (new version to appear).

No context found.

Griswold R.E., Griswold M.T., The Icon Programming Language, Prentice-Hall, second edition, 1990.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC