5 Written questions
5 Matching questions
- Kleene closure
- a zero or more occurrences of a grammar item; indicated by a superscript *.
- b a symbol that denotes an operation to be performed on data in an expression.
- c the meaning of a statement in a language. cf. syntax.
- d a data area consisting of contiguous component fields, which may be of different types.
- e in a hash table, a case in which a symbol has the same hash function value as another symbol.
5 Multiple choice questions
- the initial, or sentence nonterminal symbol S of a grammar.
- a case where more than one interpretation is possible.
- a basic symbol in a language; e.g., a variable name would be a lexeme for a grammar of a programming language.
- a self-balancing binary search tree.
- an occurrence of a word, name, or sequence of characters having a meaning as a unit in a language.
5 True/False questions
substring → a sequence of symbols or characters.
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.
storage allocation → the assignment of memory locations to data and program code.
preorder → 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.
shift-reduce conflict → in a grammar for a shift-reduce parser, a case in which an input might either be shifted onto the stack or reduced.