are abstractions of the von Neumann Computer architecture.
The architecture’s two primary components are its _____ and ______.
The abstractions in a language for the memory cells of the machine are ______.
can be characterized by a collection of properties, or attributes.
a fundamental concept in programming languages.
is a string of characters used to identify some entity in a program.
are used to make programs more readable by naming actions to be performed.
also are used to separate the syntactic entities of programs.
is a word of programming languages that is special only in certain context .
is a special word of a programming language that cannot be used as a name.
may be aliased .
may not be aliased.
An abstraction of a memory location and the methods to perform operations.
are the most common names in programs .
are often referred as identifiers.
Names are often referred as _____.
The ______ of a variable is the memory address with which it is associated.
When more than one variable name can be used to access a single memory location, the names are called _____. .
Aliasing can be created in many languages through _____.
determines the range of values the variable can have and the set of operations that are defined for values .
The _____ of the variable is the contents of the memory cell or cells associated with the variable .
the association of an object to its attributes/operations/name .
the time that the binding takes place.
Binding is ____ if it occurs before run time and remains unchanged .
Binding is ____ if it occurs the opposite before run time and remains unchanged .
All the information required to call a function or all the values of the variables during compile time, it is called _____.
Implemented in a program at the time of coding.
Calling a function or assigning a value to a variable, at run-time is called ____.
Can be associated with run time “polymorphism” and “inheritance” in OOP.
binding of type is not explicit but derived by examining assignment statements at runtime (e.g. Lisp).
using inference rules to determine the type returned by a function.
The primary advantage of dynamic binding of variables to types is that it provides a ______________________.
2 disadvantages to dynamic type binding.
The memory cell to which a variable is bound is somehow must be taken from a pool of available memory. This process is called __.
is the process of placing a memory cell that has been unbound from a variable back into the pool of available memory.
Time from which a variable is bound to memory until it is unbound .
bound from beginning to ending of execution .
Most efficient form of binding because of ability to _______ & no overhead for allocation/deallocation at runtime.
One disadvantage of static binding to storage is _______.
Another disadvantage of static binding is that ___________________________.
Used to ensure operands of an operator are compatible types .
automatic conversion of a variable’s type to a legal type for the operation.
if the variables are declared using the same declaration or the same type .
if the variables have the same structure even though they are of differently name types .
The range of statements from which a variable is “visible”.
Scope can be determined prior to execution .
Section of code in which local variables are allocated/deallocated at start/end .
Introduced in Algol 60 and included in languages like Ada, C, Lisp .
Scope is based on the sequence of calling subprograms, not their physical sequence .
To determine value of a referenced variable, search backward through the chain of procedure calls until the procedure in which the variable was declared is found .
Identifier bound to a value at the time it is bound to storage and unalterable during its lifetime .
Can aid readability and reliability of a program .