IBM Smalltalk: Programmer's Reference

Total Page:16

File Type:pdf, Size:1020Kb

IBM Smalltalk: Programmer's Reference IBM Smalltalk Programmer’s Reference Ve r s i o n 5.5 Note Before using this document, read the general information under “Notices” on page ix. May 2001 This edition applies to Version 5.5 of the VisualAge Smalltalk products, and to all subsequent releases and modifications until otherwise indicated in new editions. Make sure you are using the correct edition for the level of the product. The term “VisualAge,” as used in this publication, refers to the VisualAge Smalltalk product set. Portions of this book describe materials developed by Object Technology International Inc. of Ottawa, Ontario, Canada. Object Technology International Inc. is a subsidiary of the IBM® Corporation. If you have comments about the product or this document, address them to: IBM Corporation, Attn: IBM Smalltalk Group, 621-107 Hutton Street, Raleigh, NC 27606-6324. You can fax comments to (919) 828-9633. When you send information to IBM, you grant IBM a nonexclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. © Copyright International Business Machines Corporation 1994, 2000. All rights reserved. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Notices ...............ix Magnitude classes ............13 Trademarks..............ix Magnitudecomparing..........14 Association.............14 About this book ...........xi Character ..............14 Date................16 What this book includes ..........xi Time................16 Who this book is for ...........xi Number..............17 About this product or feature ........xi Integer...............18 Conventions used in this book ........xii Fraction ..............19 References...............xii Float................19 Common Language Data Types, Common ScaledDecimal ............20 Language Implementation, and Common Process Graphical classes ............20 Model...............xii Point...............20 Common File System ..........xiii Rectangle ..............21 CommonGraphics...........xiii Stream classes .............22 CommonWidgets...........xiii Accessing ..............23 CommonPrinting...........xiv Copying ..............23 Dynamic Data Exchange .........xiv Enumerating .............23 National Language Support........xiv Positioning .............24 Telluswhatyouthink..........xiv Reading..............24 Testing ...............24 Chapter 1. IBM Smalltalk overview . 1 Truncating..............24 Base subsystems .............1 Writing ...............24 Common Language Data Types .......1 Creatinginstances...........24 Common Language Implementation .....1 Support classes .............24 Common Process Model .........1 UndefinedObject............24 Common File System ..........1 Message and DirectedMessage .......25 CommonGraphics...........2 Block...............25 CommonWidgets...........2 Exception handling classes .........25 ExtendedWidgets...........2 ExceptionalEvent ...........25 DragandDrop............2 Signal ...............25 CommonPrinting...........2 Creatingnewexceptions.........25 Design intent ..............2 Signalinganexception..........26 Architecture ..............3 Handlingofexceptions.........26 Industry-standard support ..........3 ExceptionalEvent collections ........28 Platform support .............4 Completion blocks ...........29 Default exception handler ........30 Chapter 2. Common Language Data System exceptions ...........30 Types ................5 Examples of exception handling ......30 Object behavior .............6 Basicdependentsmechanism........6 Chapter 3. Common Language Behavior testing ............6 Implementation ...........33 Class identity testing ..........6 Behavior messages ............34 Copying ...............6 Class queries .............34 Printingandstoring...........6 Compiling ..............34 Performing ..............7 Creatinginstances...........34 Error handling.............7 Enumeration .............35 Primitive accessing ...........7 Instance accessing ...........35 Mutating..............7 Instance structure testing .........35 Testing object equality or identity ......7 Method accessing ...........35 Boolean classes .............7 Method adding and deleting .......36 Booleanmessages............7 Method queries ............36 Collection classes .............8 Classmessages.............36 Collection protocols ...........9 Class variable accessing .........37 Common collection protocols .......10 Instance variable accessing ........37 Unique collection protocol ........12 © Copyright IBM Corp. 1994, 2000 iii Shared pool accessing ..........37 Reading directory entries .........59 Class accessing ............37 Closing the directory descriptor ......61 Initializing and removing.........38 Using file streams ............61 Superclass accessing ..........38 File stream classes ...........61 Metaclassmessages............38 Opening and closing file streams ......61 Accessing ..............38 Reading and writing file streams ......62 Creating new classes ...........38 Characters versus bytes .........63 Creating fixed classes ..........39 Line delimiters ............63 Creating variable classes .........39 Using low-level file operations ........64 Creating variable byte classes .......39 Opening files .............64 Extended classes.............39 Closing file descriptors .........65 Multiple instance accessing ........40 Reading and writing data ........66 String converting ...........40 Changing the file offset .........66 Compiling and evaluating code........40 Other low-level operations ........67 Compiling ..............41 Mixing streams and file descriptors ......67 Evaluating..............41 Using access modes and flags with file streams 67 CompiledMethod ............42 Performing low-level file operations on streams 68 Accessing ..............42 Filelockingandsharemodes........68 Testing ...............42 Filelocking.............68 EmSystemConfiguration ..........42 Share modes .............70 Handlingerrors.............71 Chapter 4. Common Process Model . 45 Suppressing system error dialogs ......73 Creating a process ............45 Testing existence and obtaining other file properties 74 Suspending, resuming, and ending a process . 46 ObtainingaCfsStatinstance........74 Setting and modifying process priorities .....46 Mixing platform-specific and Common File System Synchronization using semaphore and delay . 47 operations...............76 Block evaluation methods ........48 Performing a platform-specific call with a Process-related block methods .......49 CfsFileDescriptor ...........76 Process methods............49 Converting a platform file descriptor into a ProcessorScheduler methods........50 CfsFileDescriptor ...........76 Delay class and instance methods ......50 Obtaining platform-specific error information . 76 Semaphore class and instance methods ....51 Chapter 6. Common Graphics .....79 Chapter 5. Common File System....53 X Window system graphics library compatibility . 79 Accessing the capabilities of the Common File CoreCommonGraphicsclasshierarchy.....80 System ................53 Seldom-used and abstract classes .......82 Basic file protocols ...........53 A simplified drawing process overview .....83 Streamprotocols............53 Beforedrawing............83 Portability protocols ..........53 Duringdrawing............83 Error handling protocols .........53 Afterdrawing............83 CfsConstants pool dictionary .......54 A simple example of the drawing process . 83 Basic classes .............54 CgConstants pool dictionary........83 Specifying file names and paths .......54 Usinggraphicscontexts..........84 Portable file names ...........54 Basic graphics context methods.......84 File system roots ...........55 Creatinggraphicscontexts........85 Pathseparators............55 Copying graphics contexts ........88 Managing files and directories ........55 Changing graphics contexts ........89 Current working directory ........55 Freeinggraphicscontexts.........89 Creating and removing directories ......55 Using graphics contexts with other drawables . 89 Deleting files .............56 Drawingoperations...........89 Renaming files ............56 Drawingpoints............90 Copying files .............56 Drawinglines............90 Startup directory ...........57 Drawingrectangles...........91 Obtainingvolumeinformation........57 Drawing polygons ...........92 Volumenameandtype.........57 Drawingarcsandcircles.........92 File names and directory path case .....57 Drawing pie slices and chords using filled arcs 93 Filenamelength............57 Usingfonts..............93 Volumes with different file name lengths . 58 A simplified view of the font process .....94 Searching directories ...........58 Querying the system for fonts .......95 Opening a directory for searching ......58 Loading fonts.............97 Assigning fonts for use in drawing operations 100 iv IBM Smalltalk: Programmer’s Reference String drawing operations with fonts ....101 The parent-child widget tree .......138 Releasing CgFonts and CgFontStructs from The widget lifecycle ..........138 memory..............102 Mapping and unmapping widgets .....140 Obtaining the current font from a graphics Managing and unmanaging widgets.....141 context..............102 Widgetresourcesandfunctions......141 Usingcursors.............103 CwConstants pool dictionary .......144 The process for using cursors .......103 Example code to create a widget tree ....144 Font cursors .............103 Widget event handling and callbacks ....146
Recommended publications
  • Preview Objective-C Tutorial (PDF Version)
    Objective-C Objective-C About the Tutorial Objective-C is a general-purpose, object-oriented programming language that adds Smalltalk-style messaging to the C programming language. This is the main programming language used by Apple for the OS X and iOS operating systems and their respective APIs, Cocoa and Cocoa Touch. This reference will take you through simple and practical approach while learning Objective-C Programming language. Audience This reference has been prepared for the beginners to help them understand basic to advanced concepts related to Objective-C Programming languages. Prerequisites Before you start doing practice with various types of examples given in this reference, I'm making an assumption that you are already aware about what is a computer program, and what is a computer programming language? Copyright & Disclaimer © Copyright 2015 by Tutorials Point (I) Pvt. Ltd. All the content and graphics published in this e-book are the property of Tutorials Point (I) Pvt. Ltd. The user of this e-book can retain a copy for future reference but commercial use of this data is not allowed. Distribution or republishing any content or a part of the content of this e-book in any manner is also not allowed without written consent of the publisher. We strive to update the contents of our website and tutorials as timely and as precisely as possible, however, the contents may contain inaccuracies or errors. Tutorials Point (I) Pvt. Ltd. provides no guarantee regarding the accuracy, timeliness or completeness of our website or its contents including this tutorial. If you discover any errors on our website or in this tutorial, please notify us at [email protected] ii Objective-C Table of Contents About the Tutorial ..................................................................................................................................
    [Show full text]
  • C Strings and Pointers
    Software Design Lecture Notes Prof. Stewart Weiss C Strings and Pointers C Strings and Pointers Motivation The C++ string class makes it easy to create and manipulate string data, and is a good thing to learn when rst starting to program in C++ because it allows you to work with string data without understanding much about why it works or what goes on behind the scenes. You can declare and initialize strings, read data into them, append to them, get their size, and do other kinds of useful things with them. However, it is at least as important to know how to work with another type of string, the C string. The C string has its detractors, some of whom have well-founded criticism of it. But much of the negative image of the maligned C string comes from its abuse by lazy programmers and hackers. Because C strings are found in so much legacy code, you cannot call yourself a C++ programmer unless you understand them. Even more important, C++'s input/output library is harder to use when it comes to input validation, whereas the C input/output library, which works entirely with C strings, is easy to use, robust, and powerful. In addition, the C++ main() function has, in addition to the prototype int main() the more important prototype int main ( int argc, char* argv[] ) and this latter form is in fact, a prototype whose second argument is an array of C strings. If you ever want to write a program that obtains the command line arguments entered by its user, you need to know how to use C strings.
    [Show full text]
  • Functional Languages
    Functional Programming Languages (FPL) 1. Definitions................................................................... 2 2. Applications ................................................................ 2 3. Examples..................................................................... 3 4. FPL Characteristics:.................................................... 3 5. Lambda calculus (LC)................................................. 4 6. Functions in FPLs ....................................................... 7 7. Modern functional languages...................................... 9 8. Scheme overview...................................................... 11 8.1. Get your own Scheme from MIT...................... 11 8.2. General overview.............................................. 11 8.3. Data Typing ...................................................... 12 8.4. Comments ......................................................... 12 8.5. Recursion Instead of Iteration........................... 13 8.6. Evaluation ......................................................... 14 8.7. Storing and using Scheme code ........................ 14 8.8. Variables ........................................................... 15 8.9. Data types.......................................................... 16 8.10. Arithmetic functions ......................................... 17 8.11. Selection functions............................................ 18 8.12. Iteration............................................................. 23 8.13. Defining functions ...........................................
    [Show full text]
  • Algorithms and Data Structures Lecture 11: Symbol Table ADT
    cs2010: algorithms and data structures Lecture 11: Symbol Table ADT Vasileios Koutavas School of Computer Science and Statistics Trinity College Dublin Algorithms ROBERT SEDGEWICK | KEVIN WAYNE 3.1 SYMBOL TABLES ‣ API ‣ elementary implementations Algorithms ‣ ordered operations FOURTH EDITION ROBERT SEDGEWICK | KEVIN WAYNE http://algs4.cs.princeton.edu 3.1 SYMBOL TABLES ‣ API ‣ elementary implementations Algorithms ‣ ordered operations ROBERT SEDGEWICK | KEVIN WAYNE http://algs4.cs.princeton.edu Symbol tables Key-value pair abstraction. ・Insert a value with specified key. ・Given a key, search for the corresponding value. Ex. DNS lookup. ・Insert domain name with specified IP address. ・Given domain name, find corresponding IP address. domain name IP address www.cs.princeton.edu 128.112.136.11 www.princeton.edu 128.112.128.15 www.yale.edu 130.132.143.21 www.harvard.edu 128.103.060.55 www.simpsons.com 209.052.165.60 key value 3 Symbol table applications application purpose of search key value dictionary find definition word definition book index find relevant pages term list of page numbers file share find song to download name of song computer ID financial account process transactions account number transaction details web search find relevant web pages keyword list of page names compiler find properties of variables variable name type and value routing table route Internet packets destination best route DNS find IP address domain name IP address reverse DNS find domain name IP address domain name genomics find markers DNA string known positions file system find file on disk filename location on disk 4 Symbol tables: context Also known as: maps, dictionaries, associative arrays.
    [Show full text]
  • On Goto Statement in Basic
    On Goto Statement In Basic James spores his coeditor arrest lowse, but ribbony Clarence never perambulating so defenselessly. orFingered ferniest and after sold grapy Barry Jimmy sublime countermarches his microclimates so thwart? envelop snigs opinionatively. Is Skylar mismatched Download On Goto Statement In Basic pdf. Download On Goto Statement In Basic doc. Well before withthe statement recursion, basic, and look understandable like as labe not, usage i learned of. Normal to that precedence include support that the content goto basic;is a goto. back Provided them up by statementthe adjectives basic, novel the anddim knowsstatement exactly with be the in below. basic doesMany not and supported the active for on the goto vba. in theSkip evil the comes error asfrom on movesthe specified to go toworkbook go with thename _versionname_ to see the value home does page. not Activeprovided on byone this is withinsurvey? different Outline if ofa trailingbasic withinspace theor responding value if by thisto. Repaired page? Print in favor statement of code along so we with need recursion: to go with many the methods product. becomeThought of goto is startthousands running of intothe code?more readable Slightly moreand in instances vb. Definitely that runnot onprovided basic program, by a more goto explicit that construct,exponentiation, basic i moreinterpreter about? jump Stay to thatadd youthe workbookwhen goto name. basic commandPrediction gotoor go used, on statement we were basicnot, same moves page to the returns slightly isresults a boolean specific in toworkbook the trademarks name to of. the Day date is of.another Exactly if you what forgot you runa stack on in overflow basic does but misusingnot complete it will code isgenerally the window.
    [Show full text]
  • 7. Control Flow First?
    Copyright (C) R.A. van Engelen, FSU Department of Computer Science, 2000-2004 Ordering Program Execution: What is Done 7. Control Flow First? Overview Categories for specifying ordering in programming languages: Expressions 1. Sequencing: the execution of statements and evaluation of Evaluation order expressions is usually in the order in which they appear in a Assignments program text Structured and unstructured flow constructs 2. Selection (or alternation): a run-time condition determines the Goto's choice among two or more statements or expressions Sequencing 3. Iteration: a statement is repeated a number of times or until a Selection run-time condition is met Iteration and iterators 4. Procedural abstraction: subroutines encapsulate collections of Recursion statements and subroutine calls can be treated as single Nondeterminacy statements 5. Recursion: subroutines which call themselves directly or indirectly to solve a problem, where the problem is typically defined in terms of simpler versions of itself 6. Concurrency: two or more program fragments executed in parallel, either on separate processors or interleaved on a single processor Note: Study Chapter 6 of the textbook except Section 7. Nondeterminacy: the execution order among alternative 6.6.2. constructs is deliberately left unspecified, indicating that any alternative will lead to a correct result Expression Syntax Expression Evaluation Ordering: Precedence An expression consists of and Associativity An atomic object, e.g. number or variable The use of infix, prefix, and postfix notation leads to ambiguity An operator applied to a collection of operands (or as to what is an operand of what arguments) which are expressions Fortran example: a+b*c**d**e/f Common syntactic forms for operators: The choice among alternative evaluation orders depends on Function call notation, e.g.
    [Show full text]
  • Truffle/C Interpreter
    JOHANNES KEPLER UNIVERSITAT¨ LINZ JKU Faculty of Engineering and Natural Sciences Truffle/C Interpreter Master’s Thesis submitted in partial fulfillment of the requirements for the academic degree Diplom-Ingenieur in the Master’s Program Computer Science Submitted by Manuel Rigger, BSc. At the Institut f¨urSystemsoftware Advisor o.Univ.-Prof. Dipl.-Ing. Dr.Dr.h.c. Hanspeter M¨ossenb¨ock Co-advisor Dipl.-Ing. Lukas Stadler Dipl.-Ing. Dr. Thomas W¨urthinger Xiamen, April 2014 Contents I Contents 1 Introduction 3 1.1 Motivation . .3 1.2 Goals and Scope . .4 1.3 From C to Java . .4 1.4 Structure of the Thesis . .6 2 State of the Art 9 2.1 Graal . .9 2.2 Truffle . 10 2.2.1 Rewriting and Specialization . 10 2.2.2 Truffle DSL . 11 2.2.3 Control Flow . 12 2.2.4 Profiling and Inlining . 12 2.2.5 Partial Evaluation and Compilation . 12 2.3 Clang . 13 3 Architecture 14 3.1 From Clang to Java . 15 3.2 Node Construction . 16 3.3 Runtime . 16 4 The Truffle/C File 17 4.1 Truffle/C File Format Goals . 17 4.2 Truffle/C File Format 1 . 19 4.2.1 Constant Pool . 19 4.2.2 Function Table . 20 4.2.3 Functions and Attributes . 20 4.3 Truffle/C File Considerations and Comparison . 21 4.3.1 Java Class File and Truffle/C File . 21 4.3.2 ELF and Truffle/C File . 22 4.4 Clang Modification Truffle/C File . 23 Contents II 5 Truffle/C Data Types 25 5.1 Data Type Hierarchy: Boxing, Upcasts and Downcasts .
    [Show full text]
  • What Is an Operating System III 2.1 Compnents II an Operating System
    Page 1 of 6 What is an Operating System III 2.1 Compnents II An operating system (OS) is software that manages computer hardware and software resources and provides common services for computer programs. The operating system is an essential component of the system software in a computer system. Application programs usually require an operating system to function. Memory management Among other things, a multiprogramming operating system kernel must be responsible for managing all system memory which is currently in use by programs. This ensures that a program does not interfere with memory already in use by another program. Since programs time share, each program must have independent access to memory. Cooperative memory management, used by many early operating systems, assumes that all programs make voluntary use of the kernel's memory manager, and do not exceed their allocated memory. This system of memory management is almost never seen any more, since programs often contain bugs which can cause them to exceed their allocated memory. If a program fails, it may cause memory used by one or more other programs to be affected or overwritten. Malicious programs or viruses may purposefully alter another program's memory, or may affect the operation of the operating system itself. With cooperative memory management, it takes only one misbehaved program to crash the system. Memory protection enables the kernel to limit a process' access to the computer's memory. Various methods of memory protection exist, including memory segmentation and paging. All methods require some level of hardware support (such as the 80286 MMU), which doesn't exist in all computers.
    [Show full text]
  • Irmx® 286/Irmx® II Troubleshooting Guide
    iRMX® 286/iRMX® II Troubleshooting Guide Q1/1990 Order Number: 273472-001 inter iRMX® 286/iRMX® II Troubleshooting Guide Q1/1990 Order Number: 273472-001 Intel Corporation 2402 W. Beardsley Road Phoenix, Arizona Mailstop DV2-42 Intel Corporation (UK) Ltd. Pipers Way Swindon, Wiltshire SN3 1 RJ United Kingdom Intel Japan KK 5-6 Tokodai, Toyosato-machi Tsukuba-gun Ibaragi-Pref. 300-26 An Intel Technical Report from Technical Support Operations Copyright ©1990, Intel Corporation Copyright ©1990, Intel Corporation The information in this document is subject to change without notice. Intel Corporation makes no warranty of any kind with regard to this material, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose. Intel Corporation assumes no responsibility for any errors that ~ay :!ppe3r in this d~ur:::ent. Intel Corpomtion make:; nc ccmmitmcut tv update nor to keep C"l..iiTeilt thc information contained in this document. Intel Corporation assUmes no responsibility for the use of any circuitry other than circuitry embodied in an Intel product. No other circuit patent licenses are implied. Intel software products are copyrighted by and shall remain the property of Intel Corporation. Use, duplication or disclosure is subject to restrictions stated in Intel's software license, or as defined in FAR 52.227-7013. No part of this document may be copied or reproduced in any form or by any means without the prior written consent of Intel Corporation. The following are trademarks of Intel Corporation
    [Show full text]
  • (Pdf) of from Push/Enter to Eval/Apply by Program Transformation
    From Push/Enter to Eval/Apply by Program Transformation MaciejPir´og JeremyGibbons Department of Computer Science University of Oxford [email protected] [email protected] Push/enter and eval/apply are two calling conventions used in implementations of functional lan- guages. In this paper, we explore the following observation: when considering functions with mul- tiple arguments, the stack under the push/enter and eval/apply conventions behaves similarly to two particular implementations of the list datatype: the regular cons-list and a form of lists with lazy concatenation respectively. Along the lines of Danvy et al.’s functional correspondence between def- initional interpreters and abstract machines, we use this observation to transform an abstract machine that implements push/enter into an abstract machine that implements eval/apply. We show that our method is flexible enough to transform the push/enter Spineless Tagless G-machine (which is the semantic core of the GHC Haskell compiler) into its eval/apply variant. 1 Introduction There are two standard calling conventions used to efficiently compile curried multi-argument functions in higher-order languages: push/enter (PE) and eval/apply (EA). With the PE convention, the caller pushes the arguments on the stack, and jumps to the function body. It is the responsibility of the function to find its arguments, when they are needed, on the stack. With the EA convention, the caller first evaluates the function to a normal form, from which it can read the number and kinds of arguments the function expects, and then it calls the function body with the right arguments.
    [Show full text]
  • CS 151: Introduction to Computers
    Information Technology: Introduction to Computers Handout One Computer Hardware 1. Components a. System board, Main board, Motherboard b. Central Processing Unit (CPU) c. RAM (Random Access Memory) SDRAM. DDR-RAM, RAMBUS d. Expansion cards i. ISA - Industry Standard Architecture ii. PCI - Peripheral Component Interconnect iii. PCMCIA - Personal Computer Memory Card International Association iv. AGP – Accelerated Graphics Port e. Sound f. Network Interface Card (NIC) g. Modem h. Graphics Card (AGP – accelerated graphics port) i. Disk drives (A:\ floppy diskette; B:\ obsolete 5.25” floppy diskette; C:\Internal Hard Disk; D:\CD-ROM, CD-R/RW, DVD-ROM/R/RW (Compact Disk-Read Only Memory) 2. Peripherals a. Monitor b. Printer c. Keyboard d. Mouse e. Joystick f. Scanner g. Web cam Operating system – a collection of files and small programs that enables input and output. The operating system transforms the computer into a productive entity for human use. BIOS (Basic Input Output System) date, time, language, DOS – Disk Operating System Windows (Dual, parallel development for home and industry) Windows 3.1 Windows 3.11 (Windows for Workgroups) Windows 95 Windows N. T. (Network Technology) Windows 98 Windows N. T. 4.0 Windows Me Windows 2000 Windows XP Home Windows XP Professional The Evolution of Windows Early 80's IBM introduced the Personal PC using the Intel 8088 processor and Microsoft's Disk Operating System (DOS). This was a scaled down computer aimed at business which allowed a single user to execute a single program. Many changes have been introduced over the last 20 years to bring us to where we are now.
    [Show full text]
  • THE 1995 STANDARD MUMPS POCKET GUIDE Fifth Edition of the Mumps Pocket Guide Second Printing
    1995 S TA N DA R D M U M P S P O C K E T G U I D E FIFTH EDITION FREDERICK D. S. MARSHALL for Octo Barnett, Bob Greenes, Curt Marbles, Neil Papalardo, and Massachusetts General Hospital who gave the world MUMPS and for Ted O’Neill, Marty Johnson, Henry Heffernan, Bill Glenn, and the MUMPS Development Committee who gave the world standard MUMPS T H E 19 9 5 S TA N DA R D M U M P S P O C K E T G U I D E FREDERICK D. S. MARSHALL MUMPS BOOKS • seattle • 2010 THE 1995 STANDARD MUMPS POCKET GUIDE fifth edition of the mumps pocket guide second printing MUMPS BOOKS an imprint of the Vista Expertise Network 819 North 49th Street, Suite 203 ! Seattle, Washington 98103 www.vistaexpertise.net [email protected] (206) 632-0166 copyright © 2010 by frederick d. s. marshall All rights reserved. V I S t C E X P E R T I S E N E T W O R K C O N T E N T S 1 ! I N T R O D U C T I O N ! 1 1.1 ! Purpose ! 1 1.2 ! Acknowledgments ! 1 2 ! O T H E R R E F E R E N C E S ! 2 3 ! T H E S U I T E O F S T A N D A R D S ! 3 4 ! S Y S T E M M O D E L ! 5 4.1 ! Multi-processing ! 5 4.2 ! Data ! 5 4.3 ! Code ! 7 4.4 ! Environments ! 7 4.5 ! Pack ages ! 7 4.6 ! Char acter Sets ! 7 4.7 ! Input/Output Devices ! 8 5 ! S Y N T A X ! 9 5.1 ! Metalanguage Element Index ! 9 6 ! R O U T I N E S ! 15 6.1 ! Routine Structure ! 15 6.2 ! Lines ! 15 6.3 ! Line References ! 17 6.4 ! Execution ! 19 6.4.1 ! the process stack ! 19 6.4.2 ! block Processing ! 19 6.4.3 ! error codes ! 21 7 ! E X P R E S S I O N S ! 2 3 7.1 ! Values ! 24 7.1.1 ! representation ! 24 7.1.2 ! interpretation
    [Show full text]