🔥🔥 Don’t Miss Out on Our End of Autumn Sale. If you have any questions, feel free to click the bottom right corner to contact our customer service..

Concat us[email protected]
Shopping Cart

No products in the cart.

🔍
BS ISO/IEC 9496:2003 2004

BS ISO/IEC 9496:2003 2004

$215.11

CHILL. The ITU-T programming language

Published By Publication Date Number of Pages
BSI 2004 232
PDF Format Searchable Printable Preview Now
Guaranteed Safe Checkout
Category:

If you have any questions, feel free to reach out to our online customer service team by clicking on the bottom right corner. We’re here to assist you 24/7.
Email:[email protected]

PDF Catalog

PDF Pages PDF Title
5 CONTENTS
9 Foreword
17 2 Preliminaries
2.1 The metalanguage
18 2.2 Vocabulary
19 2.3 The use of spaces
2.4 Comments
2.5 Format effectors
20 2.6 Compiler directives
2.7 Names and their defining occurrences
22 3 Modes and classes
3.1 General
23 3.2 Mode definitions
26 3.3 Mode classification
27 3.4 Discrete modes
30 3.5 Real modes
32 3.6 Powerset modes
3.7 Reference modes
33 3.8 Procedure modes
34 3.9 Instance modes
35 3.10 Synchronization modes
36 3.11 Input-Output Modes
38 3.12 Timing modes
39 3.13 Composite modes
47 3.14 Dynamic modes
48 3.15 Moreta Modes
55 4 Locations and their accesses
4.1 Declarations
57 4.2 Locations
64 5 Values and their operations
5.1 Synonym definitions
65 5.2 Primitive value
80 5.3 Values and expressions
89 6 Actions
6.1 General
6.2 Assignment action
91 6.3 If action
6.4 Case action
93 6.5 Do action
96 6.6 Exit action
97 6.7 Call action
100 6.8 Result and return action
6.9 Goto action
101 6.10 Assert action
6.11 Empty action
6.12 Cause action
6.13 Start action
6.14 Stop action
102 6.15 Continue action
6.16 Delay action
6.17 Delay case action
103 6.18 Send action
104 6.19 Receive case action
107 6.20 CHILL built-in routine calls
112 7 Input and Output
7.1 I/O reference model
114 7.2 Association values
7.3 Access values
115 7.4 Built-in routines for input output
122 7.5 Text input output
130 8 Exception handling
8.1 General
131 8.2 Handlers
8.3 Handler identification
132 9 Time supervision
9.1 General
9.2 Timeoutable processes
9.3 Timing actions
134 9.4 Built-in routines for time
135 10 Program Structure
10.1 General
137 10.2 Reaches and nesting
139 10.3 Begin-end blocks
10.4 Procedure specifications and definitions
144 10.5 Process specifications and definitions
10.6 Modules
145 10.7 Regions
10.8 Program
146 10.9 Storage allocation and lifetime
10.10 Constructs for piecewise programming
151 10.11 Genericity
154 11 Concurrent execution
11.1 Processes, tasks, threads and their definitions
155 11.2 Mutual exclusion and regions
158 11.3 Delaying of a thread
11.4 Re-activation of a thread
11.5 Signal definition statements
159 11.6 Completion of Region and Task locations
12 General semantic properties
12.1 Mode rules
170 12.2 Visibility and name binding
177 12.3 Case selection
179 12.4 Definition and summary of semantic categories
183 13 Implementation options
13.1 Implementation defined built-in routines
13.2 Implementation defined integer modes
13.3 Implementation defined floating point modes
13.4 Implementation defined process names
13.5 Implementation defined handlers
13.6 Implementation defined exception names
13.7 Other implementation defined features
185 Appendix I Character set for CHILL
186 Appendix II Special symbols
187 Appendix III Special simple name strings
III.1 Reserved simple name strings
188 III.2 Predefined simple name strings
III.3 Exception names
189 Appendix IV Program examples
IV.1 Operations on integers
IV.2 Same operations on fractions
190 IV.3 Same operations on complex numbers
IV.4 General order arithmetic
IV.5 Adding bit by bit and checking the result
191 IV.6 Playing with dates
192 IV.7 Roman numerals
193 IV.8 Counting letters in a character string of arbitrary length
194 IV.9 Prime numbers
IV.10 Implementing stacks in two different ways, transparent to the user
195 IV.11 Fragment for playing chess
198 IV.12 Building and manipulating a circularly linked list
199 IV.13 A region for managing competing accesses to a resource
200 IV.14 Queuing calls to a switchboard
IV.15 Allocating and deallocating a set of resources
202 IV.16 Allocating and deallocating a set of resources using buffers
204 IV.17 String scanner1
205 IV.18 String scanner2
206 IV.19 Removing an item from a double linked list
IV.20 Update a record of a file
207 IV.21 Merge two sorted files
208 IV.22 Read a file with variable length records
209 IV.23 The use of spec modules
IV.24 Example of a context
IV.25 The use of prefixing and remote modules
210 IV.26 The use of text i/o
211 IV.27 A generic stack
212 IV.28 An abstract data type
IV.29 Example of a spec module
IV.30 Object-Orientation: Modes for Simple, Sequential Stacks
214 IV.31 Object-Orientation: Mode Extension: Simple, Sequential Stack with Operation “Top”
IV.32 Object-Orientation: Modes for Stacks with Access Synchronization
216 Appendix V Decommitted features
V.1 Free directive (subclause 2.6)
V.2 Integer modes syntax (subclause 3.4.2)
V.3 Set modes with holes (subclause 3.4.5)
V.4 Procedure modes syntax (subclause 3.7)
217 V.5 String modes syntax (subclause 3.11.2)
V.6 Array modes syntax (subclause 3.11.3)
V.7 Level structure notation (subclause 3.11.5)
V.8 Map reference names (subclause 3.11.6)
V.9 Based declarations (subclause 4.1.4)
V.10 Character string literals (subclause 5.2.4.6)
V.11 Receive expressions (see 5.3.9/Z.200 (1988))
V.12 Addr notation (subclause 5.3.8)
V.13 Assignment syntax (subclause 6.2)
V.14 Case action syntax (subclause 6.4)
V.15 Do for action syntax (subclause 6.5.2)
218 V.16 Explicit loop counters (subclause 6.5.2)
V.17 Call action syntax (subclause 6.7)
V.18 RECURSEFAIL exception (subclause 6.7)
V.19 Start action syntax (subclause 6.13)
V.20 Explicit value receive names (subclause 6.19)
V.21 Blocks (subclause 8.1)
V.22 Entry statement (subclause 8.4)
V.23 Register names (subclause 8.4)
V.24 Recursive attribute (10.4/Z.200 (1988))
219 V.25 Quasi cause statements and quasi handlers (subclause 8.10.3)
V.26 Syntax of quasi statements (10.10.3/Z.200 (1988))
V.27 Weakly visible names and visibility statements (12.2.1/Z.200 (1988))
V.28 Weakly visible names and visibility statements (subclause 10.2.4.3)
V.29 Pervasiveness (subclause 10.2.4.4)
V.30 Seizing by modulion name (subclause 10.2.4.5)
V.31 Predefined simple name strings (subclause C.2)
220 Appendix VI Index of production rules

Related products

BS ISO/IEC 9496:2003 2004
$215.11