5 Written questions
5 Matching questions
- type lattice
- parse tree
- a a lattice structure that shows which types are higher or derivable from others, e.g. float is higher than integer. When an operation is specified on different types, the arguments may be coerced to the least upper bound of the two types in the lattice.
- b the assignment of multiple meanings to an operator, depending on the type of data to which it is applied; e.g., the symbol + could represent integer addition, floating-point addition, or matrix addition.
- c an ordering of operators that specifies that certain operators should be performed before others when no ordering is otherwise specified.
- d a description of a kind of variables, including a set of possible values and a set of operations.
- e a data structure that shows how a statement in a language is derived from the context-free grammar of the language; it may be annotated with additional information, e.g. for compilation purposes.
5 Multiple choice questions
- Signaling Not a Number, a special value defined by IEEE floating point. An attempt to do arithmetic on a SNaN will cause a processor fault and halt execution; if an array is initialized to SNaN values, this can detect errors of uninitialized data at no runtime cost.
- a data area consisting of contiguous component fields, which may be of different types.
- the initial, or sentence nonterminal symbol S of a grammar.
- a classification of characters, e.g. alphabetic or numeric.
- the assignment of memory locations to data and program code.
5 True/False questions
grammar → a formal specification of a language, consisting of a set of nonterminal symbols, a set of terminal symbols or words, and production rules that specify transformations of strings containing nonterminals into other strings.
address alignment → a list of steps that shows how a sentence in a language is derived from a grammar by application of grammar rules.
base address → the address of the beginning of a data area. This address is added to a relative address or offset to compute an absolute address.
symbol table → a data structure that associates a name (symbol) with information about the named object.
AVL tree → a contiguous area of memory, specified by its base address and size. Data within the area are referenced by the base address of the area and the offset, or relative address, of the data within the area.