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. prefix
  2. right-associative operator
  3. ambiguous grammar
  4. rehash
  5. alphabet
  1. a 1. a contiguous set of symbols at the beginning of a string. 2. a way of writing expressions in which an operator appears before its operands: +ab.
  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 a set of symbols used in the definition of a language.
  4. d a grammar that allows some sentence or string to be generated or parsed in more than one way ( i.e., with distinct parse trees).
  5. e an operator in an arithmetic expression such that if there are two adjacent occurrences of operators with equal precedence, the right one should be done first.

5 Multiple choice questions

  1. an expression written with an operator between its operand, e.g. a + b . cf. prefix, postfix.
  2. a word in a programming language that is reserved for use as part of the language and may not be used as an identifier.
  3. a description of a kind of variables, including a set of possible values and a set of operations.
  4. an algebraic expression that denotes a regular language. Regular expressions are usually easier to write than an equivalent regular grammar.
  5. a list of steps that shows how a sentence in a language is derived from a grammar by application of grammar rules.

5 True/False questions

  1. storage alignmentthe assignment of memory locations to data and program code.

          

  2. overloadinga symbol that denotes an operation to be performed on data in an expression.

          

  3. preorderan 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.

          

  4. left-associativedescribes operators in an arithmetic expression such that if there are two adjacent occurrences of operators with the same precedence, the left one should be done first. Thus, a - b + c means (a - b) + c. Most operators are left-associative.

          

  5. Chomsky hierarchythe phase of a compiler in which executable output code is generated from intermediate code.

          

Create Set