5 Written questions
5 Matching questions
- start symbol
- left recursion
- base address
- hash with buckets
- a in a grammar, a case where A ⇒ A α for some nonterminal symbol A. In top-down parsing, left recursion will cause an infinite recursion. Also, describes such a production.
- b a form of hash table in which the hash code denotes a bucket or set of entries whose keys hash to that value.
- c the initial, or sentence nonterminal symbol S of a grammar.
- d an element of computer memory that can hold a value.
- e the address of the beginning of a data area. This address is added to a relative address or offset to compute an absolute address.
5 Multiple choice questions
- a data structure that associates a name (symbol) with information about the named object.
- the number of arguments of a function.
- a description of a kind of variables, including a set of possible values and a set of operations.
- a data type that occupies a fixed amount of storage.
- a scalar type consisting of a finite set of enumerated values, e.g. type boolean = (false, true);.
5 True/False questions
observability → 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.
alphabet → a set of symbols used in the definition of a language.
type lattice → a rule of a context-free grammar, specifying that a nonterminal symbol can be replaced by another string of symbols.
regular grammar → a grammar that denotes a regular language; its productions can only have on the right-hand side either a terminal string or a terminal string followed by a single nonterminal.
ambiguous grammar → a grammar that allows some sentence or string to be generated or parsed in more than one way ( i.e., with distinct parse trees).