5 Written questions
5 Matching questions
- chart parser
- a the rules by which legitimate statements can be constructed. cf. semantics.
- b 1. in a hash table storage scheme, to calculate a new hash value for an item when the previous hash value caused a collision with an existing item. 2. the algorithm used to calculate the new hash value.
- c making a sequence that consists of the elements of a first sequence followed by those of a second sequence.
- d a parser such as CKY that maintains an array-like data structure called a chart that describes all possible parses in a compact form.
- e 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.
5 Multiple choice questions
- an order of visiting trees, in which a node is examined first, followed by recursive examination of its children, in left-to-right order, in the same fashion.
- a grammar production, as in a Yacc grammar, that is executed if no other (legal) production matches the input.
- Backus-Naur Form, a syntax for writing context-free grammars that describe computer languages.
- the ability to observe the state of a system. For software, the provision of built-in code to allow the internal operations of a program to be easily observed.
- a description of a kind of variables, including a set of possible values and a set of operations.
5 True/False questions
reserved word → a data area consisting of contiguous component fields, which may be of different types.
Chomsky hierarchy → a parser such as CKY that maintains an array-like data structure called a chart that describes all possible parses in a compact form.
parsing → insertion of unused storage in order to achieve storage alignment.
prefix → an expression written with an operator between its operand, e.g. a + b . cf. prefix, postfix.
address alignment → see alignment.