5 Written Questions
5 Matching Questions
- hash table
- nondeterministic finite automaton
- type constructor
- a a finite automaton that has multiple state transitions from a single state for a given input symbol, or that has a null transition, not requiring an input symbol. Abbreviated NFA.
- b a table that associates key values with data by use of a hash function.
- c an occurrence of a word, name, or sequence of characters having a meaning as a unit in a language.
- d a rule of a context-free grammar, specifying that a nonterminal symbol can be replaced by another string of symbols.
- e an operator that makes a type from other types, e.g. array or record.
5 Multiple Choice Questions
- parsing and conversion to internal form of the simplest elements of a language, usually specified by a regular grammar, such as variable names, numbers, etc.
- a statement in a programming language that provides information to the compiler, such as the structure of a data record, but does not specify executable code.
- a phase of a compiler or assembler in which the entire source program (in its original form or some later representation) is processed.
- a sequence of symbols at the end of a string.
- an ordering of operators that specifies that certain operators should be performed before others when no ordering is otherwise specified.
5 True/False Questions
code generation → a statement in a programming language that provides information to the compiler, such as the structure of a data record, but does not specify executable code.
storage allocation → the assignment of memory locations to data and program code.
reduce-reduce conflict → in a grammar for a shift-reduce parser, a case in which an input might be reduced by more than one production.
rehash → lexical analyzer.
recursive descent → a method of writing a parser in which a grammar rule is written as a procedure that recognizes that phrase, calling subroutines as needed for sub-phrases and producing a parse tree or other data structure as output.