Concepts Of Programming Languages Ch 5

Front 1

Derived type?

Back 1

Derived type is a new type that is based on some previously defined type with which it is incompatible, although it may have identical structure. Derived types inherit all the properties of their parent types.

Front 2

Binding?

Back 2

BINDING is an association, such as between an attribute and an entity or between an operation and a symbol.

Front 3

Implicit Declaration?

Back 3

An IMPLICIT DECLARATION is a means of associating variables with types through default conventions instead of declaration statements.

Front 4

Dynamic?

Back 4

If binding first occurs during run time or can change in the course of program execution, it is called DYNAMIC.

Front 5

Structure type compatibility?

Back 5

Structure type compatibility means two variables have compatible types if their types have identical structures.

Front 6

Explicit Declaration?

Back 6

An EXPLICIT DECLARATION is a statement in a program that lists variable names and specifies that they are a particular type.

Front 7

Coercion?

Back 7

Coercion is the automatic conversion of a compatible type legal for the operator or is allowed under language rules to be implicitly converted by compiler-generated code to a legal type.

Front 8

Aliases?

Back 8

When more than one variable name can be used to access a single memory location.

Front 9

Name type compatibility?

Back 9

Name type compatibility means that two variables have compatible type only if they are in either the same declaration or in declarations that use the same type name.

Front 10

Static?

Back 10

A binding is STATIC if it first occurs before run time and remains unchanged throughout program execution.

Front 11

l-value?

Back 11

L-value of a variable is the address of a variable, because that is required when a variable appears in the left side of an assignment statement.

Front 12

Type?

Back 12

The TYPE of a variable determines the range of values the variable can have and the set of operations that are defined for values of the type.

Front 13

Type error?

Back 13

Type error is the application of an operator to an operand of an inappropriate type.

Front 14

Name?

Back 14

A NAME is a string of characters used to identify some entity in a program.

Front 15

Static variables?

Back 15

Static variables are those that are bound to those same memory cells until program execution terminates.

Front 16

Reserved word?

Back 16

A RESERVED WORD is a special word of a programming language that cannot be used as a name.

Front 17

binding time?

Back 17

Binding time is the time at which a binding takes place.

Front 18

Keyword?

Back 18

A KEYWORD is a word of a programming language that is special only in certain contexts.

Front 19

Stack-dynamic variables?

Back 19

Stack-dynamic variables are those whose storage binding are created when their declaration statements are elaborated, but whose type are statically bound.

Front 20

Address?

Back 20

The ADDRESS of a variable is the memory address with which it is associated.

Front 21

Allocation?

Back 21

The memory cell to which a variable is bound somehow must be taken from a pool of avaialbe memory. This is called allocation.

Front 22

Lifetime?

Back 22

The LIFETIME of a variable is the time during which the variable is bound to a specific memory location.

Front 23

Deallocation?

Back 23

DEALLOCATION is the process of placing memory cell that has been unbound from a variable back into the pool of available memory.

Front 24

Static variable?

Back 24

STATIC VARIABLES are those that are bound to memory cells before program execution begins and remain bound to those same memory cells until program execution terminates.

Front 25

Strong Typing?

Back 25

Strong typing is one in which each name in a program in the language has a single type associated with it, and that type is known at compile time, and type errors are always detected.

Front 26

R-value?

Back 26

R-value is the variable's value because it is what is required when the variable is used on the right side of an assignment statement.

Front 27

binding?

Back 27

Binding is an association, such as between an attribute and an entity or between an operation and a symbol.

Front 28

Explicit heap-dynamic variables?

Back 28

Explicit heap-dynamic variables are nameless (abstract) memory cells that are allocated and deallocated by explicit run-time instructions specified by the programmer.

Front 29

Implicit heap-dynamic variables?

Back 29

Implicit heap-dynamic variables are bound to heap storage only when they are assigned values, all their attributes are bound every time they assigned.

Front 30

Type checking?

Back 30

Type checking is the activity of ensuring that the operands of an operator are of compatible types.

Front 31

Nonlocal variables?

Back 31

Nonlocal variables of a program unit or block are those that are visible within the program unit or block but are not declared there.

Front 32

Dynamic scoping?

Back 32

Dynamic scoping is based on the calling sequence of subprograms, not on their spatial relationship on each other.

Front 33

Referencing environment?

Back 33

Referencing environment of a statement is the collection of all names that are visible in the statement.

Front 34

Named constant?

Back 34

A Named Constant is a variable that is bound to a value only at the time it is bound to storage; its value cannot be changed by assignment or by an input statement.

Front 35

Manifest constants?

Back 35

Named constants in languages that use static binding of values.

Front 36

Initialization?

Back 36

The binding of a variable to a value at the time it is bound to storage.