DOCSLIB.ORG

CSC 372, Spring 2018 the University of Arizona William H. Mitchell Whm@Cs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
CSC 372, Spring 2018 the University of Arizona William H. Mitchell Whm@Cs SNOBOL4 CSC 372, Spring 2018 The University of Arizona William H. MitChell whm@Cs CSC 372 Spring 2018, SNOBOL4 Slide 1 A little SNOBOL history Developed in the Programming Research Studies Department at Bell Telephone Laboratories. Their interests: Automata theory, graph analysis, associative processors, high-level programming languages. Were using SCL (Symbolic Communication Language) for symbolic integration, factoring of multivariate polynomials, and analysis of Markov chains. First called SCL7, then SEXI (String EXpression Interpreter). Renamed to SNOBOL, with a backronym StriNg Oriented SymBOlic Language Four versions of SNOBOL from 1963-1966, culminating with SNOBOL4. Ralph Griswold was involved with all, and was lead on SNOBOL4. CSC 372 Spring 2018, SNOBOL4 Slide 2 A line-numbering program Consider a program that reads lines from standard input and writes numbered lines to standard output: % cat lines one two three four five % snobol4 numlines.sno < lines 1: one 2: two 3: three 4: four 5: five Try it! spring18/bin/snobol4 is the executable; examples are in spring18/snobol4. CSC 372 Spring 2018, SNOBOL4 Slide 3 numlines.sno * * Read lines from standard input and write * numbered lines to standard output, a bit * like "cat -n" * n = 1 loop line = input :f(end) output = n ': ' line n = n + 1 :(loop) end CSC 372 Spring 2018, SNOBOL4 Slide 4 Two language design decisions String concatenation: "The decision not to have an explicit operator for concatenation, but instead just to use blanks to separate the strings to be concatenated, was motivated by a belief in the fundamental role of concatenation in a string-manipulation language. The model for this feature was simply the convention used in natural languages to separate words by blanks." Control structures: "We felt that providing a statement with a test-and-goto format would allow division of program logic into simple units and that inexperienced users would find a more technical, highly structured language difficult to learn and use." Source: History of Programming Languages (from ACM SIGPLAN History of Programming Languages Conference, June 1-3, 1978) CSC 372 Spring 2018, SNOBOL4 Slide 5 repl.sno Imagine a program that prompts the user for a repetition count and a string to repeat: $ snobol4 repl.sno How many of what? 5 * ***** How many of what? 7 abc abcabcabcabcabcabcabc How many of what? 11 1011 10111011101110111011101110111011101110111011 CSC 372 Spring 2018, SNOBOL4 Slide 6 repl.sno define('repl(s,n)') :(main) * * function repl(s,n) is like s * n in Ruby * repl eq(n,0) :s(return) repl = repl s n = n - 1 :(repl) main output = 'How many of what?' line = input :f(end) line span(&digits) . count span(' ') rem . string output = repl(string, count) output = :(main) end CSC 372 Spring 2018, SNOBOL4 Slide 7 An expression recognizer In formal language theory, a language is a possibly infinite set of strings. A recognizer for a language determines whether a string is in the language. Consider a recognizer for simple arithmetic expressions: Expression? 3*(4+5) OK! Expression? ((x+y)*z)/2+((x))-(q/3)*500 OK! Expression? (x+3)* Huh? Note: we'll not handle whitespace. CSC 372 Spring 2018, SNOBOL4 Slide 8 expr.sno Here is a first version of a recognizer for arithmetic expressions. nl = char(10) expr = 'x' loop line = input :f(end) line pos(0) expr rpos(0) :f(huh) output = 'ok: ' line nl :(loop) huh output = '??: ' line nl :(loop) end How can we characterize the arithmetic expressions it recognizes? How does the above version behave wrt. input and output? CSC 372 Spring 2018, SNOBOL4 Slide 9 expr.sno, continued Let's extend the expressions that can be handled! $ cat expr.1 var = span(&lcase) x abc int = span(&digits) abc+x op = any('+-/*') a+b+c expr = int | var | *expr op *expr a*b+c-d/e | '-' *expr | '(' *expr ')' 10 -20 loop 10+a-20--x line = input :f(end) (a-1) line pos(0) expr rpos(0) :f(huh) -20*(3+4-(x*y)) output = 'ok: ' line nl :(loop) 3*(4+5) ... -x*-(-(-(x))) ((x+y)*z)/2+((x))-(q/3)*500 CSC 372 Spring 2018, SNOBOL4 Slide 10 Summary of SNOBOL4 pattern matching General form of a pattern match statement: label subject pattern = replacement goto Pattern creation: Alternation (|) and concatenation Value assignment with . and $ Unevaluated expressions Control keywords: &anchor, &fullscan Predefined patterns: arb, bal, fail, fence, null, rem, succeed Functions that produce patterns: any(chars), arbno(pattern), break(chars), len(n), notany(chars), pos(n), rpos(n), rtab(n), span(chars), tab(n) CSC 372 Spring 2018, SNOBOL4 Slide 11 SNOBOL4 patterns vs. regular expressions Number of "words" reported by wc for... • Summary of SNOBOL4 patterns on previous slide: 54 • Summary of Ruby 2.0 REs in "Pickaxe" book: 705 • Microsoft's quick reference for REs: 2,091 • Summary of Icon string scanning in Ruby slides: 81 Recognition capability: • Regular expressions can recognize strings in a "regular" language— type(3) in the Chomsky hierarchy. • SNOBOL4 patterns can recognize strings in an "unrestricted" language—type(0). Notable: There are few idioms to learn with SNOBOL4 patterns. Why is the industry using regular expressions when SNOBOL4 patterns are both simpler and more powerful? CSC 372 Spring 2018, SNOBOL4 Slide 12 SNOBOL4 implementation SNOBOL4 is implemented in SIL—SNOBOL Implementation Language. * * Output Procedure * PUTOUT PROC , Output procedure POP (IO1PTR,IO2PTR) Restore block and val VEQLC IO2PTR,S,,PUTV Is value STRING? VEQLC IO2PTR,I,,PUTI Is value INTEGER? RCALL IO2PTR,DTREP,IO2PTR Get data type repr. GETSPC IOSP,IO2PTR,0 Get specifier BRANCH PUTVU Join processing *_ PUTV LOCSP IOSP,IO2PTR Get specifier PUTVU STPRNT IOKEY,IO1PTR,IOSP Perform print AEQLC IOKEY,0,,COMP6 Check status INCRA WSTAT,1 Inc count of writes BRANCH RTN1 Return *_ PUTI INTSPC IOSP,IO2PTR Convert INT. to STRING BRANCH PUTVU Rejoin processing In essence, SIL instructions are instructions for a virtual machine. SNOBOL4 SIL implementation: spring18/snobol4/v311.sil (12,189 lines) CSC 372 Spring 2018, SNOBOL4 Slide 13 David R. Hanson developed RATSNO, an adaptation of RATFOR to SNOBOL4. Here is assignment 5's seqwords in RATSNO: (not tested!) &anchor = 1; maxlen = 100000 word = input for (;;) { if (word '.') break words = words rpad(word,m axlen) word = input } while (num = input) { if (num '.') { output = line line = } else { words len((num - 1) * maxlen) len(maxlen) . word line = line trim(word) ' ' } } output = line CSC 372 Spring 2018, SNOBOL4 Slide 14 A little more history In 1968 the University of Arizona formed a committee to develop a computer science program. A graduate program with courses from a variety of departments was assembled. Murray Sargent III, a UA optics professor with an interest in programming languages, had visited Bell Labs and knew of the SNOBOL family. Sargent embarked on a one-man recruiting campaign to convince Ralph Griswold to leave Bell Labs and join the University of Arizona. In August of 1971, Ralph Griswold joined the University of Arizona as its first Professor of Computer Science. On his first day, Dr. Griswold arrived to find a line of students waiting outside his office for advising. In his office was a desk, but no chair. CSC 372 Spring 2018, SNOBOL4 Slide 15 SNOBOL4 takeaways I'd like you to know... • The syntax for string and pattern concatenation • How flow of control works • The basic form of pattern matching, with functions and operators that build patterns, and the "dot" notation for extracting parts of matches • That there is implicit conversion between integers and strings • What the variables input and output represent • That SNOBOL4 patterns are capable of recognizing an unrestricted language (type 0 in the Chomsky hierarchy) CSC 372 Spring 2018, SNOBOL4 Slide 16.
Load more

Recommended publications
  • Oral History Interview with William Mitchell
    An Interview with WILLIAM MITCHELL OH 203 Conducted by David S. Cargo on 26 July 1990 Flagstaff, AZ Charles Babbage Institute Center for the History of Information Processing University of Minnesota, Minneapolis Copyright, Charles Babbage Institute 1 William Mitchell Interview 26 July 1990 Abstract Mitchell discusses his introduction to Icon through his use of SPITBOL. He describes the process of making Icon compatible to various environments and notes the types of documentation and tools that are produced. He talks about several research assistants that he worked with on the Icon project. Mitchell discusses the usability of Icon in a software development environment and describes the use of C in conjunction with Icon. 2 WILLIAM MITCHELL INTERVIEW DATE: 26 July 1990 INTERVIEWER: David S. Cargo LOCATION: Flagstaff, AZ CARGO: I am trying to get some background from the people about how they got involved with the Icon Project and what experience they had with programming in general before they got involved with the Icon Project. If you could go over your academic career a bit prior to your involvement, that would be the first thing I would like to cover. MITCHELL: My first real exposure in computer science was at North Carolina State University. I was a freshman there in the computer science program. One of the first trips I made to the library there I happened to notice a book on SNOBOL4. It seemed like an interesting language, so I checked out that and a stack of other books on some odd things. I don't know if I ever got around to reading the book; I guess I looked at it some, you know, but it stuck it in my mind.
    [Show full text]
  • Oral History Interview with Ralph and Madge Griswold
    An Interview with RALPH and MADGE GRISWOLD OH 256 Conducted by Judy E. O'Neill on 29 September 1993 Minneapolis, MN Charles Babbage Institute Center for the History of Information Processing University of Minnesota, Minneapolis Copyright, Charles Babbage Institute 1 Ralph and Madge Griswold Interview 29 September 1993 Abstract Ralph and Madge Griswold discuss how their respective educational backgrounds in electrical engineering and journalism led them separately to Bell Laboratories. Madge discusses her involvement with TEXT90 and TEXT360 in the preparation of technical journal documents. Ralph recalls the informal dissemination of SNOBOL to the academic community. The Griswolds describe Bell Laboratories' involvement with MULTICS and the movement of groups within Bell Laboratories away from GE machines to IBM equipment. From their perspectives as an employee and an administrator respectively, Madge and Ralph describe the climate for women at Bell Laboratories during the 1960s. Ralph discusses how changes in the research environment at Bell Laboratories led him to the University of Arizona. Ralph describes his effort to recruit computer scientists to the fledgling department and Madge discusses her involvement in the recruiting process and the development of the department. The Griswolds also discuss the stagnation of SNOBOL4 after the language manual went out-of-print, and their work at the Bright Forest Company with the development of a commercial Icon implementation. 2 RALPH & MADGE GRISWOLD INTERVIEW DATE: September 29, 1993 INTERVIEWER: Judy E. O'Neill LOCATION: Minneapolis, MN O'NEILL: This is September 29, 1993 and I'm in my office in Minneapolis interviewing Ralph and Madge Griswold. I'd like to start the interview with getting some personal background on both of you.
    [Show full text]
  • CSC 372 Spring 2018 Cs.Arizona.Edu/Classes/Cs372/Spring18
    Comparative Programming Languages CSC 372 Spring 2018 cs.arizona.edu/classes/cs372/spring18 Stranger Danger Introduce yourself to your tablemates while we're waiting to launch! CSC 372, Spring 2018, Introduction slide 1 Instructor William Mitchell (whm) • Consultant/contractor doing software development and training of software developers. Lots with Java, C++, C, Python, Ruby, Icon, and more. Linux stuff, too. • Occasionally teach a CS course. (337, 352, 372, and others) • Adjunct instructor, not a professor • Education: BS CS (North Carolina State University, 1981) MS CS (University of Arizona, 1984) • Incorrect to say "Dr. Mitchell" or "Professor Mitchell"! CSC 372, Spring 2018, Introduction slide 2 Topic Sequence • Functional programming with Haskell • Imperative and object-oriented programming using dynamic typing with Ruby • Logic programming with Prolog • Whatever else in the realm of programming languages that we find interesting and have time for. Note: We'll cover a selection of elements from the languages, not everything. CSC 372, Spring 2018, Introduction slide 3 Themes running through the course • Discerning the philosophy of a language and how it's manifested • Understanding tensions and tradeoffs in language design • Acquiring a critical eye for language design • Assessing the "mental footprint" of a language • Learning how to learn a language (LHtLaL) CSC 372, Spring 2018, Introduction slide 4 Syllabus highlights (cs.arizona.edu/classes/cs372/spring18/syllabus.html) CSC 372, Spring 2018, Introduction slide 5 Prereqs, Piazza,
    [Show full text]
  • The Implementation of Icon and Unicon a Compendium Clinton Jeffery and Don Ward, Editors
    The Implementation of Icon and Unicon a Compendium Clinton Jeffery and Don Ward, editors The Implementation of Icon and Unicon Ralph and Madge T. Griswold Kenneth W. Walker Clinton L. Jeffery Michael D. Wilder Anthony T. Jones Jafar Al Gharaibeh Copyright © 2017 – 2020 Clinton Jeffery Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foun- dation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License". Portions of this document ("The Implementation of the Icon Programming Language") are in the public domain and not subject to the above copyright or license. Other portions of this document ("An Optimizing Compiler for Icon") are copyrighted by Kenneth Walker and appear in edited form in this document with the express permission of the author. This is a draft manuscript dated April 3, 2020. Send comments and errata to [email protected]. This document was prepared using LATEX. Special thanks to Don Ward for assistance with the conversion to LATEX. Contents Preface xvii Compendium Introduction.................................1 I The Implementation of the Icon Programming Language3 1 Introduction5 1.1 Implementing Programming Languages.......................6 1.2 The Background for Icon...............................7 2 Icon Language Overview9 2.1 The Icon Programming Language.......................... 10 2.1.1 Data Types.................................. 10 2.1.2 Expression Evaluation............................ 12 2.1.3 Csets and Strings............................... 19 2.1.4 String Scanning...............................
    [Show full text]
  • Exploring Languages with Interpreters and Functional Programming Chapter 1
    Exploring Languages with Interpreters and Functional Programming Chapter 1 H. Conrad Cunningham 29 August 2018 Contents 1 Evolution of Programming Languages 2 1.1 Chapter Introduction . 2 1.2 Evolving Computer Hardware Affects Programming Languages . 2 1.3 History of Programming Languages . 5 1.4 What Next? . 10 1.5 Exercises . 10 1.6 Acknowledgements . 11 1.7 References . 11 1.8 Terms and Concepts . 12 Copyright (C) 2016, 2017, 2018, H. Conrad Cunningham Professor of Computer and Information Science University of Mississippi 211 Weir Hall P.O. Box 1848 University, MS 38677 (662) 915-5358 Browser Advisory: The HTML version of this textbook requires a browser that supports the display of MathML. A good choice as of August 2018 is a recent version of Firefox from Mozilla. 1 1 Evolution of Programming Languages 1.1 Chapter Introduction The goal of this chapter is motivate the study of programming language organi- zation by: • describing the evolution of computers since the 1940’s and its impact upon contemporary programming language design and implementation • identifying key higher-level programming languages that have emerged since the early 1950’s 1.2 Evolving Computer Hardware Affects Programming Languages To put our study in perspective, let’s examine the effect of computing hardware evolution on programming languages by considering a series of questions. 1. When were the first “modern” computers developed? That is, programmable electronic computers. Although the mathematical roots of computing go back more than a thousand years, it is only with the invention of the programmable electronic digital computer during the World War II era of the 1930s and 1940s that modern computing began to take shape.
    [Show full text]
  • Oh201rmg.Pdf (100.2Kb Application/Pdf)
    An Interview with RALPH and MADGE GRISWOLD OH 201 Conducted by David S. Cargo on 25 July 1990 Flagstaff, AZ Charles Babbage Institute Center for the History of Information Processing University of Minnesota, Minneapolis Copyright, Charles Babbage Institute 1 Ralph and Madge Griswold Interview 25 July 1990 Abstract Ralph and Madge Griswold recall the development of the Icon programming language. Ralph Griswold begins the interview with a description of the evolution of Icon from SNOBOL4 during his work at Bell Laboratories in the early 1960s. In this context he describes the difficulties of developing software in a corporate environment. Most of the interview concentrates on the development of Icon after Griswold took a faculty position at the University of Arizona. The Griswolds describe the creation of the Icon Project, the project's support from the National Science Foundation, the importance of the project in graduate education in computer science and the contributions of graduate students to the language's development. Also discussed is the dissemination of information regarding Icon through the Icon Analyst and the project's interaction with the commercial software industry through two small software firms, Catspaw and The Bright Forest Company. 2 RALPH and MADGE GRISWOLD INTERVIEW DATE: 25 July 1990 INTERVIEWER: David S. Cargo LOCATION: Flagstaff, AZ CARGO: The best place to start is in the beginning. This is supposed to be the history of the Icon Project; you mentioned that it's impossible to disentangle it from the events that preceded it. What would you say was the immediate genesis of what we call the Icon Project? RALPH GRISWOLD: We have been doing programming language design, development, implementation, and distribution for a long time - dating back to 1962 or 1963 in Bell Laboratories, and since 1971 at the University of Arizona.
    [Show full text]
  • The Icon Programming Language
    Third THE ICON Edition PROGRAMMING LANGUAGE Ralph E. Griswold • Madge T. Griswold The Icon Programming Language Third Edition Ralph E. Griswold and Madge T. Griswold This book originally was published by Peer-to-Peer Communications. It is out of print and the rights have reverted to the authors, who hereby place it in the public domain. Library of Congress Cataloging-in-Publication Data Griswold, Ralph E., 1934- The Icon programming language / Ralph E. Griswold and Madge T. Griswold. -- 3rd ed. p. cm. Includes bibliographical references (p. ) and index. ISBN 1-57398-001-3 (pbk.) 1. Icon (computer program language) I. Griswold, Madge T., 1941- . II. Title. QA76.73.I19G74 1996 005.13'3--dc20. 96-43514 CIP 10 9 8 7 6 5 4 3 2 1 ISBN 1-57398-001-3 DISCLAIMER This book is provided "as is". Any implied warranties of merchantability and fitness for a particular purpose are expressly disclaimed. This book contains programs that are furnished as examples. These examples have not been thoroughly tested under all conditions. Therefore, the reliability, serviceability, or function of any program code herein is not guaranteed. To the best of the authors' and publisher's knowledge, the information presented in this book was correct at the time it was written and conveyed as accurately as possible. However, some information may be incorrect or may have changed prior to publication. The authors and publisher make no claim that the material contained in this book is entirely correct, and assume no liability for use of the material contained herein. A number of words that appear in initial capitalization in the text may be trademarks or service marks, or signify other proprietary rights.
    [Show full text]
  • I7te Icon9{Czusccttcr
    I7te Icon9{czusCcttcr No. 34 - October 15,1990 Page 129: Add the following paragraph to the end of the text, before the exercises: The image of an integer that has more than approximately 25 digits is given showing the approximate number of digits, as in "integer(~100)". Page 287: Add i1 to i2 by i3 to the list of genera­ tors at the bottom of the page. Version 8 of Icon Page 328, line 6: Change "star(string(8tlcase))" to "astar(string(&lcase))". Version 8 of Icon is now stable and there are imple­ mentations available for all platforms previously Page 332, lines 28-30: Replace the procedure decla­ supported. ration for star(s) by We've sent out a lot of copies of Version 8 over the procedure astar(s) suspend is | (astar(s) || !s) last few months and we presume most persons using end Icon have upgraded to the new version. If you're still using an older version, you should seriously consider moving to Version 8. It has new features, it's faster, and there's complete, self-contained documentation for Newsletters Version 8 in the second edition of The Icon Programming As announced in the last 0\[ezvsfetter, we've started a Language. The Icon Project also can no longer provide new, more technical newsletter, called Wc[t ,3lcon help with problems that may come up with earlier Analyst. The first two issues of the Analyst appeared versions of Icon. in August and October. Publication is on a bi-monthly For the first time in many years, there is relatively basis and the third issue is scheduled to appear in little going on by way of implementations of Icon for December.
    [Show full text]
  • The Implementation of Icon and Unicon a Compendium
    The Implementation of Icon and Unicon a Compendium Clinton Jeffery, editor ii The Implementation of Icon and Unicon Ralph and Madge T. Griswold Kenneth W. Walker Clinton L. Jeffery ii Copyright © 2014 Clinton Jeffery Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back- Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License". Portions of this document ("The Implementation of the Icon Programming Language") are in the public domain and not subject to the above copyright or license. Portions of this document ("An Optimizing Compiler for Icon") are copyrighted by Kenneth Walker and appear in edited form in this document with the express permission of the author. This is a draft manuscript dated 6/6/2014. Send comments and errata to [email protected]. This document was prepared using OpenOffice.org 4.1. iii Contents Preface................................................................................................................................xi Organization of This Book.............................................................................................xi Acknowledgments..........................................................................................................xi Compendium Introduction...................................................................................................1
    [Show full text]
  • User Contributed Software Supplemental Manual
    User Contributed Software Supplemental Manual August. 1983 Computer Systems Research Group Department of Electrical Engineering and Computer Science University of California Berkeley, California 94720 User Contributed Software The following is a list of acknowledgements to the people and organizations who contributed software for 4.2BSD. AEL Authors: John D. Bruner Lawrence Livermore Laboratory P.O. Box 808. 1-276 Livermore. CA 94550 (415) 422-0758 Prof. Anthony P. Reeves Cornell University. Phillips Hall Itllaca. NY 14853 (607) 256-4296 This implementation of APL is a descendent of a program originally written by Ken Thompson at Bell Labs sometime before UNIXt version 6. It went to Yale for a while and then came to Purdue (Electrical Engineering) via a Chicago dis­ tribution in 1976. It was extensively modified at Purdue by Anthony P. Reeves. Jim Besemer~ and John Bruner. The editor "apled" which APL uses to edit func­ tions was developed from the V6 "ed" editor by Craig Strickland. Improvements which were added at Purdue/EE include quad 1/0 functions, a state indicator of sorts. statement labels, and a number of primitive functions. The current version runs on both large V7 PDP-11's (those which are capable of running 'separated <'lID -programs) and V AXes. (Workspaces' are not directly interchangeable but can be converted). Bib Authors: Timothy A. Budd Gary M. Levin Address: Department of Computer Science University of Arizona Tucson. Arizona 85721 (602) 621-6613 Bib is a program for collecting and formatting reference lists in documents. It is a preprocessor to the nroff/trot! typesetting systems,. much.
    [Show full text]
  • The Icon Newsletter Write("Gen: Starting Up...") Suspend 3 Ralph E
    TheThe IconIcon NewsletterNewsletter No. 51 – December 1, 1996 dresses in the United States, Canada, and Mexico. There is an additional charge for shipping to addresses in other countries. See the order form enclosed with this Newsletter. The book also can be ordered from the pub- lisher: Peer-to-Peer Communications, Inc. P.O. Box 640218 Contents San Jose, California 95164-0218 Third Edition of the Icon Book ........... 1 U.S.A. Graphics Programming Book ............. 1 voice: 408-420-2677 Version 9.3 of Icon ................................ 2 fax: 408-435-0895 [email protected] Version 9.3 of the Program Library ... 2 http://www.peer-to-peer.com New MS-DOS Implementation .......... 2 Peer-to-Peer Communications’ books are dis- Icon in Java ............................................ 2 tributed to bookstores worldwide through Inter- Teaching Icon ........................................ 3 national Thomson Publishing. In the United States, Web Links .............................................. 7 contact ITP at: Chicon .................................................... 7 7625 Empire Drive Florence, KY 41042 Third Edition of The Icon For addresses of ITP offices in other countries, contact Peer-to-Peer. Programming Language The third edition of The Icon Programming Lan- guage is now available. Graphics Programming Book In preparing the third edition, we revised much We have contracted with Peer-to-Peer Commu- of the material in the second edition and added nications, Inc., the publisher of the third edition of chapters on debugging, the Icon program library, the Icon Programming Language, to publish Graph- and an overview of graphics. There also are new ics Programming in Icon as well. appendices and more reference material. The date of publication is uncertain at this point, Here‘s the publication information: but we are aiming for late in the summer of 1997.
    [Show full text]
  • The Icon Programming Language
    Third THE ICON Edition PROGRAMMING LANGUAGE Ralph E. Griswold • Madge T. Griswold The Icon Programming Language Third Edition Ralph E. Griswold and Madge T. Griswold Contents iii This book originally was published by Peer-to-Peer Communications. It is out of print and the rights have reverted to the authors, who hereby place it in the public domain. Library of Congress Cataloging-in-Publication Data Griswold, Ralph E., 1934- The Icon programming language / Ralph E. Griswold and Madge T. Contents Griswold. -- 3rd ed. p. cm. Includes bibliographical references (p. ) and index. ISBN 1-57398-001-3 (pbk.) 1. Icon (computer program language) I. Griswold, Madge T., 1941- . II. Title. QA76.73.I19G74 1996 005.13'3--dc20. 96-43514 CIP FOREWORD xi 10 9 8 7 6 5 4 3 2 1 INTRODUCTION xv ISBN 1-57398-001-3 ACKNOWLEDGMENTS xix DISCLAIMER 1 GETTING STARTED 1 This book is provided "as is". Any implied warranties of merchantability and fitness for a particular purpose are expressly disclaimed. This book contains programs that are furnished as examples. These examples have not been thoroughly tested under all conditions. Therefore, the reliability, serviceability, or function of any program code Program Structure 1 herein is not guaranteed. Success and Failure 4 To the best of the authors' and publisher's knowledge, the information presented in this book was correct at the time it was written and conveyed as accurately as possible. However, some information may be incorrect or may have Control Structures 6 changed prior to publication. The authors and publisher make no claim that the material contained in this book is entirely correct, and assume no liability for use of the material contained herein.
    [Show full text]