| 
|
QuoteRef: wirtN1_1971
topics >
all references >
Topic:
safe use of pointers
Topic:
set operations
Topic:
packed data
Topic:
access to components of a data object
Topic:
case statement
Topic:
range data type
Topic:
pointers to data
Topic:
function signature
Topic:
enumerated data types
Group:
programming notation
Topic:
set data type
Topic:
notation for declarations
ThesaHelp:
references t-z
Topic:
for loop
Topic:
object-defined names
Topic:
function syntax definition
Topic:
variant data types
Topic:
operator precedence
Topic:
notation for operations
Topic:
notations for object access
Topic:
primitive data types for Thesa
Topic:
file
Group:
derived data types
Reference
Wirth, N., "The programming language Pascal", Acta Informatica, 1, 1, pp. 35-63, 1971. Google
QuoteRef: wirtN1_1971 ;;37 allow subrange types eg integer 1-10 by 1..10 [42] QuoteRef: wirtN1_1971 ;;37 record variants by tag field eg alloc ( p[tag]) QuoteRef: wirtN1_1971 ;;37 structures (arrays, records %variants, powerset %set of all subsets, file (ordered with current position QuoteRef: wirtN1_1971 ;;38 class: each alloc returns a bound pointer (pointer may be nil QuoteRef: wirtN1_1971 ;;38 operations on powersets -- int, union, difference, membership QuoteRef: wirtN1_1971 ;;41 scalar types by enumeration of literals (ordered so succ and pred func) eg colors = (red, orange, yellow, blue) succ (red) == orange QuoteRef: wirtN1_1971 ;;42 array [boolean (true or false)] of color [red orange yellow blue] QuoteRef: wirtN1_1971 ;;42 record #field id# : type eg x,y: real variants by CASE #tag field id# : type of tag field of eg yellow: (record descriptor END terminates QuoteRef: wirtN1_1971 ;;44 class [maximum number of components] of pointer by class type eg p= integer QuoteRef: wirtN1_1971 ;;45 declarations by j,j: integer QuoteRef: wirtN1_1971 ;;46 in Pascal, variable access by b[red] or U.realpart or file_name^ or pointer^ QuoteRef: wirtN1_1971 ;;47 precedence done by syntax definition is monadic, multiplying, adding and relational QuoteRef: wirtN1_1971 ;;47 sets have a base type, null set [.] ?? QuoteRef: wirtN1_1971 ;;52 CASE expression OF > value-of-same-type: statement; QuoteRef: wirtN1_1971 ;;54 FOR I:= e1 TO (DOWNTO) e2 (fixed at start) DO (uses succ(.) or pred QuoteRef: wirtN1_1971 ;;54 in Pascal, WITH record-variable DO, all ids assumed first within record QuoteRef: wirtN1_1971 ;;55 PROCEDURE ( ids:type; CONST id:type; VAR ids:type also FUNCTION, PROCEDURE local literal definitions, type definitions, variable definitions, procedure etc. QuoteRef: wirtN1_1971 ;;58 pack (array, index, structure ?? and unpack QuoteRef: wirtN1_1971 ;;58 FUNCTION id (param list): result-type QuoteRef: wirtN1_1971 ;;58 procedures put, get reset for I/O functions odd (x), eof (file) and int (character) and chr (integer), succ and pres of scalar list
Topic: safe use of pointers (102 items)
Topic: set operations (12 items)
Topic: packed data (11 items)
Topic: access to components of a data object (4 items)
Topic: case statement (25 items)
Topic: range data type (17 items)
Topic: pointers to data (55 items)
Topic: function signature (21 items)
Topic: enumerated data types (17 items)
Group: programming notation (14 topics, 221 quotes)
Topic: set data type (16 items)
Topic: notation for declarations (20 items)
ThesaHelp: references t-z (309 items)
Topic: for loop (18 items)
Topic: object-defined names (15 items)
Topic: function syntax definition (17 items)
Topic: variant data types (7 items)
Topic: operator precedence (13 items)
Topic: notation for operations (18 items)
Topic: notations for object access (7 items)
Topic: primitive data types for Thesa (82 items)
Topic: file (22 items)
Group: derived data types (9 topics, 119 quotes)