Data Types Data Types COSC337 • Evolution of Data Types: – FORTRAN I (1956) - INTEGER, REAL, arrays… – COBOL allowed users to define precision – ALGOL (1968) provided a few basic types, and by Matt Evett allowed user to form new aggregate types. – Ada (1983) - User can create a unique type for adopted from slides by Robert Sebesta every category of variables in the problem space and have the system enforce the types

Descriptors Primitive Data Types:

• Def: A descriptor is the collection of the • Primitive Data Types are those types not attributes of a variable defined in terms of other data types. – If all attributes are static, descriptors are required • Integer only at compilation time (usually stored within – Almost always an exact reflection of the hardware, compiler’s symbol table) so the mapping is trivial – If dynamic, this information must be stored in – There may be as many as eight different integer memory (Lisp does this via property lists) and types in a language used by run-time system. • Ex: int, long, char, byte • Data type is part of a descriptor.

Floating Point Internal Representation of Floats

• Model real numbers, but only approximately • IEEE Floating-Point Standard 754 • Languages for scientific use support at least sign bit two floating-point types 8 bits 23 bits

• Usually the representation matches the exponent fraction hardware’s, but not always; some languages allow accuracy specs in code 11 bits 52 bits – e.g. (Ada) exponent fraction • type SPEED is digits 7 range 0.0..1000.0; • type VOLTAGE is delta 0.1 range -12.0..24.0; Decimal Boolean

• Common in systems supporting financial applications • Could be implemented as bits, but often as • Store a fixed number of decimal digits (coded) bytes – Advantage: accuracy • Advantage: readability – Disadvantages: limited range, wastes memory

Strings Examples of Strings

• Pascal • Values are sequences of characters – Not primitive; assignm ent and comparison only (of • Design issues: packed arrays) – Is it a primitive type or just a special kind of array? • Ada, FORTRAN 77, FORTRAN 90 and – Is the length of objects static or dynamic? BASIC • Operations: – Somewhat primitive – Assignm ent – Assignm ent, comparison, catenation, substring – Comparison (=, >, etc.) reference – Catenation (or “concatenation”) – FORTRAN has an intrinsic for pattern matching – Substring reference – Ada provides catenation (N := N1 & N2 ) and – Pattern matching (find matching substrings, etc.) substrings (N(2..4))

Strings in C More String Examples

•C • SNOBOL4 (a string manipulation language) – Not primitive – Primitive – Use char arrays and a library of functions that – Many operations, including elaborate pattern provide operations matching • C++ • Perl – Provides C-style strings – Patterns are defined in terms of regular expressions – Use of STL class provides “primitive” strings • A very powerful facility! Similar to Unix’s grep • e.g: /[A-Za-z][A-Za-z\d]+/ • Java – String class primitive String Length Encoding Utility (of string types):

• String Length Options: • Aid to writability • Static - FORTRAN 77, Ada, COBOL • As a primitive type with static length, they are – e.g. (FORTRAN 90) inexpensive to provide--why not have them? CHARACTER (LEN = 15) NAME; • Dynamic length is nice, but is it worth the – NAME knows its own length expense? • Limited Dynamic Length - C and C++ actual – An additional pointer indirection. length is indicated implicitly by a null character delimiter • Dynamic - SNOBOL4, Perl, C++ and Java String classes

Implementing Strings Ordinal Types

• Static strings - compile-time descriptor • Def: ordinal type = range of possible values • Limited dynamic strings - may need a run-time can be easily associated with the set of positive descriptor for current & max length integers – But not in C and C++. Of course there’s no index – Enumeration checking provided! – Subrange • Dynamic strings - need run-time descriptor; allocation/deallocation is the biggest implementation problem

Enumerations Enumerations in Languages

• The user enumerates all of the possible values, • Pascal which are symbolic constants. – cannot reuse constants; they can be used for array – Design Issue: Should a symbolic constant be subscripts, for variables, case selectors; NO input allowed to be in more than one enumeration type? or output; can be compared. • No in C, C++, Pascal, because they’re implicitly • Predecessor and successor functions, loops converted into integers. •Ada • Ex (Pascal): – constants can be reused (overloaded literals); type WATER_TEMP = ( Frigid, Cold, Warm, Hot); disambiguate with context or type_name ‘ (one of var temp : WATER_TEMP; … them); can be used as in Pascal; CAN be input if temp > Warm ... and output Enumeration in Languages (2) Utility (of enumerations)

• C and C++ • Aid to readability--e.g. no need to code a color – like Pascal, except they can be input and output as as a number integers • Aid to reliability--e.g. compiler can check • Java does not include an enumeration type operations and ranges of values – E.g. Don’t have to worry about bad indices: • int dailyHighTemp[MONDAY] vs. • int dailyHighTemp[1]

Subrange Type Examples of Subrange Types

• An ordinal type representing an ordered contiguous subsequence of another ordinal – Ada type • Subtypes are not new types, just constrained existing types (so they are compatible); can be used as in Pascal, plus case • Examples: constants – Pascal • Ex: • Subrange types behave as their parent types; can be used subtype POS_TYPE is INTEGER range 0 ..INTEGER'LAST; as for variables and array indices e.g. type pos = 0 .. MAXINT;

Implementating user-defined Utility of subrange types: ordinal types

• Aid to readability • Enumeration types are implemented as integers • Aid to reliability - restricted ranges add error • Subrange types are the parent types with code detection inserted (by the compiler) to restrict assignments to subrange variables Arrays Indexing

• A homogeneous aggregate of data elements in • Def: mapping from indices to elements which an individual element is identified by its map(array_name, index_value_list) : an element position in the aggregate, relative to the first. • Syntax • Design Issues: – FORTRAN, PL/I, Ada use parentheses – What types are legal for subscripts? – Most others use brackets – Are subscripting expressions in element references range checked? – When are subscript ranges bound? • Subscript Types: – When does allocation take place? – FORTRAN, C - int only – What is the maximum number of subscripts? – Pascal - any ordinal type (int, boolean, char, enum) – Can array objects be initialized? – Ada - int or enum (includes boolean and char) – Are any kind of slices allowed? – Java - integer types only

Categories of Arrays Static and Fixed Stack • Static • (based on subscript binding and binding to – range of subscripts and storage bindings are static storage) – e.g. FORTRAN 77, some arrays in Ada, static and – Static global C arrays – Fixed stack dynamic – Advantage: execution efficiency (no allocation or – Stack-dynamic deallocation) – Heap-dynamic • Fixed stack dynamic – range of subscripts is statically bound, but storage is bound at elaboration time – e.g. Pascal locals and, C locals that are not static – Advantage: space efficiency

Stack-Dynamic Heap-dynamic • Subscript range and storage bindings are • Range and storage are dynamic, but fixed from dynamic and not fixed then on for the variable’s lifetime • e.g. (FORTRAN 90) • e.g. Ada declare blocks: INTEGER, ALLOCATABLE, ARRAY (:,:) :: MAT declare (Declares MAT to be a dynamic 2-dim array) ALLOCATE (MAT (10, NUMBER_OF_COLS)) STUFF : array (1..N) of FLOAT; (Allocates MAT to have 10 rows and begin NUMBER_OF_COLS columns) ... DEALLOCATE MAT end; (Deallocates MAT’s storage) • Advantage: flexibility - size need not be • APL & Perl: arrays grow and shrink as needed known until the array is about to be used • In Java, all arrays are objects (heap-dynamic) Subscripts Array Initialization • Usually just a list of values that are put in the • Number of subscripts array in the order in which the array elements – FORTRAN I allowed up to three are stored in memory – FORTRAN 77 allows up to seven • Examples: – C, C++, and Java allow just one, but elements can – FORTRAN - uses the DATA statement, or put the be arrays values in / ... / on the declaration – Others - no limit – C and C++ - put the values in braces; can let the compiler count them • e.g. int stuff [] = {2, 4, 6, 8}; – Ada - positions for the values can be specified SCORE : array (1..14, 1..2) := (1 => (24, 10), 2 => (10, 7), 3 =>(12, 30), others => (0, 0));

Slices Implementing Arrays

¥ 1. FORTRAN 90 ¥ - Access function maps subscript expressions to ¥ INTEGER MAT (1 : 4, 1 : 4) ¥ an address in the array • MAT(1 : 4, 1) - the first column ¥ - Row major (by rows) or column major order (by • MAT(2, 1 : 4) - the second row ¥ columns) ¥ 2. Ada - single-dimensioned arrays only ¥ LIST(4..10)

Chapter 5 Associative Arrays

¥ - An associative array is an unordered collection of ¥ data elements that are indexed by an equal ¥ number of values called keys

¥ - Design Issues: ¥ 1. What is th eform of references to elements? ¥ 2. Is the size static or dynamic? Chapter 5 Chapter 5 Record Definition Syntax - Structure and Operations in Perl - COBOL uses level numbers to show nested - Names begin with % records; others use recursive definitions - Literals are delimited by parentheses e.g., Record Field References

%hi_temps = ("Monday" => 77, 1. COBOL "Tuesday" => 79,…); field_name OF record_name_1 OF ... OF - Subscripting is done using braces and keys record_name_n e.g., 2. Others (dot notation) $hi_temps{"Wednesday"} = 83; record_name_1.record_name_2. ... .record_name_n.field_name - Elements can be removed with delete e.g., Fully qualified references must include all record names delete $hi_temps{"Tuesday"}; Elliptical references allow leaving out record Records names as long as the reference is unambiguous Pascal and Modula-2 provide a with clause to A record is a possibly heterogeneous aggregate of abbreviate references data elements in which the individual elements are identified by names Record Operations

Chapter 5 Record Operations (continued) Design Issues for unions: Chapter 5

2. Initialization 1. What kind of type checking, if any, must be - Allowed in Ada, using an aggregate constant done?

3. Comparison 2. Should uni ons be integrated with records? - In Ada, = and /=; one operand can be an Examples: aggregate constant 1. FORTRAN - with 4. MOVE CORRESPONDING EQUIVALENCE - In COBOL - it moves all fields in the source record to fields with the same names in the 2. Algol 68 - di scriminated unions destination record - Use a hidden tag to maintain the current type - Tag is implicitly set by assignment Comparing records and arrays - References are legal only in conformity clauses (see book example p. 231) 1. Access to array elements is much slower than - This runtime type selection is a safe method of access to record fields, because subscripts are accessing union objects dynamic (field names are static) 2. Dynamic subscripts could be used with record field access, but it would disallow type checking 3. Pascal - both discriminated and and it would be much slower nondiscriminated unions e.g. type intreal = Unions record tagg : Boolean of tr e (blint integer)

Chapter 5 Problem with Pascal’s design: type checking is Chapter 5 ineffective 5. C and C++ - free unions (no tags) - Not part of their records Reasons: - No type checking of references

a. User can create inconsistent unions (because 6. Java has neither records nor unions the tag can be individually assigned) Evaluation - potentially unsafe in most languages var blurb : intreal; x : real; (not Ada) blurb.tagg := true; { it is an integer } blurb.blint := 47; { ok } Sets blurb.tagg := false; { it is a real } x := blurb.blreal; { assigns an integer to a real } A set is a type whose variables can store unordered collections of distinct values from some ordinal type b. The tag is optional! - Now, only the declaration and the second and Design Issue: last assignments are required to cause trouble What is the maximum number of elements in any set base type? 4. Ada - discriminated unions Examples: - Reasons they are safer than Pascal & Modula-2: 1. Pascal Examples (continued) Chapter 5 Pointers Chapter 5

2. Modula-2 and Modula-3 A pointer type is a type in which the range of values - Additional operations: INCL, EXCL, / consists of memory addresses and a special value, (symmetric set difference (elements in one nil (or null) but not both operands)) Uses: 3. Ada - does not include sets, but defines in as set membership operator for all enumeration 1. Addressing flexibil ity types 2. Dynamic storage management

4. Java includes a class for set operations Design Issues: 1. What is the scope and lifetime of pointer Evaluation variables? 2. What is the lifetime of heap-dynamic variables? - If a language does not have sets, they must be 3. Are pointers restricted to pointing at a simulated, either with enumerated types or with particular type? arrays 4. Are pointers used for dynamic storage management, indirect addressing, or both? - Arrays are more flexible than sets, but have 5. Should a language support pointer types, much slower operations reference types, or both?

Chapter Chapter 5 5 Problems with pointers: Examples:

1. Dangling pointers (dangerous) 1. Pascal: used for dynamic storage management - A pointer points to a heap-dynamic variable only that has been deallocated - Explicit dereferencing

- Creating one: - Dangling pointers are possible (dispose) a. Allocate a heap-dynamic variable and set a pointer to point at it - Dangling objects are also possible b. Set a second pointer to the value of the first pointer c. Deallocate the heap-dynamic variable, 2. Ada: a little better than Pascal and Modula-2 using the first pointer - Some dangling pointers are disallowed because dynamic objects can be automatically 2. Lost Heap-Dynamic Variables (wasteful) deallocated at the end of pointer's scope - A heap-dynamic variable that is no longer referenced by any program pointer - All pointers are initiali zed to null

- Creating one: - Similar dangling object problem (but rarely a. Pointer p1 is set to point to a newly created happens) heap-dynamic variable p1

Chapter 5 Chapter 5 4. FORTRAN 90 Pointers 3. C and C++ - Can point to heap and non-heap variables - Used for dynamic storage management and addressing - Implicit dereferencing - Explicit dereferencing and address-of operator - Special assignment operator for non- dereferenced references - Can do address arithmetic in restricted forms e.g. - Domain type need not be fixed (void * )

REAL, POINTER :: ptr (POINTER is an attribute) e.g. float stuff[100]; ptr => target (where target is either a float *p; pointer or a non-pointer with p = stuff; the TARGET attribute)) *(p+5) is equivalent to stuff[5] and p[5] *(p+i) is equivalent to stuff[i] and p[i] - The TARGET attribute is assigned in the declaration, as in: - void * - can point to any type and can be type checked (cannot be dereferenced) INTEGER, TARGET :: NODE

Chapter 5 5. C++ Reference Types - Constant pointers that are implicitly dereferenced - Used for parameters - Advantages of both pass-by-reference and pass-by-value

6. Java - Only references - No pointer arithmetic - Can only point at objects (which are all on the heap) - No expli cit deallocator (garbage collection is used) - Means there can be no dangling references - Dereferencing is always implicit

Evaluation of pointers:

1. Dangling pointers and dangling objects are problems, as is heap management