NAME

Question Types


Start With


Question Limit

of 102 available terms

Advertisement Upgrade to remove ads

5 Written Questions

5 Matching Questions

  1. hash table
  2. nondeterministic finite automaton
  3. production
  4. token
  5. type constructor
  1. 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.
  2. b a table that associates key values with data by use of a hash function.
  3. c an occurrence of a word, name, or sequence of characters having a meaning as a unit in a language.
  4. d a rule of a context-free grammar, specifying that a nonterminal symbol can be replaced by another string of symbols.
  5. e an operator that makes a type from other types, e.g. array or record.

5 Multiple Choice Questions

  1. 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.
  2. 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.
  3. a phase of a compiler or assembler in which the entire source program (in its original form or some later representation) is processed.
  4. a sequence of symbols at the end of a string.
  5. an ordering of operators that specifies that certain operators should be performed before others when no ordering is otherwise specified.

5 True/False Questions

  1. code generationa 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.

          

  2. storage allocationthe assignment of memory locations to data and program code.

          

  3. reduce-reduce conflictin a grammar for a shift-reduce parser, a case in which an input might be reduced by more than one production.

          

  4. rehashlexical analyzer.

          

  5. recursive descenta 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.

          

Create Set