NAME

Question types


Start with


Question limit

of 102 available terms

Advertisement
Print test

5 Written questions

5 Matching questions

  1. chart parser
  2. overloading
  3. syntax
  4. concatenation
  5. rehash
  1. a the rules by which legitimate statements can be constructed. cf. semantics.
  2. 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.
  3. c making a sequence that consists of the elements of a first sequence followed by those of a second sequence.
  4. 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.
  5. 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

  1. 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.
  2. a grammar production, as in a Yacc grammar, that is executed if no other (legal) production matches the input.
  3. Backus-Naur Form, a syntax for writing context-free grammars that describe computer languages.
  4. 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.
  5. a description of a kind of variables, including a set of possible values and a set of operations.

5 True/False questions

  1. reserved worda data area consisting of contiguous component fields, which may be of different types.

          

  2. Chomsky hierarchya parser such as CKY that maintains an array-like data structure called a chart that describes all possible parses in a compact form.

          

  3. parsinginsertion of unused storage in order to achieve storage alignment.

          

  4. prefixan expression written with an operator between its operand, e.g. a + b . cf. prefix, postfix.

          

  5. address alignmentsee alignment.