NAME

Question types


Start with


Question limit

of 102 available terms

Advertisement Upgrade to remove ads
Print test

5 Written questions

5 Matching questions

  1. start symbol
  2. variable
  3. left recursion
  4. base address
  5. hash with buckets
  1. 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.
  2. b a form of hash table in which the hash code denotes a bucket or set of entries whose keys hash to that value.
  3. c the initial, or sentence nonterminal symbol S of a grammar.
  4. d an element of computer memory that can hold a value.
  5. 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

  1. a data structure that associates a name (symbol) with information about the named object.
  2. the number of arguments of a function.
  3. a description of a kind of variables, including a set of possible values and a set of operations.
  4. a data type that occupies a fixed amount of storage.
  5. a scalar type consisting of a finite set of enumerated values, e.g. type boolean = (false, true);.

5 True/False questions

  1. observabilitythe 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.

          

  2. alphabeta set of symbols used in the definition of a language.

          

  3. type latticea rule of a context-free grammar, specifying that a nonterminal symbol can be replaced by another string of symbols.

          

  4. regular grammara 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.

          

  5. ambiguous grammara grammar that allows some sentence or string to be generated or parsed in more than one way ( i.e., with distinct parse trees).

          

Create Set