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. synthesized translation
  2. observability
  3. postfix
  4. token
  5. top-down parsing
  1. a an occurrence of a word, name, or sequence of characters having a meaning as a unit in a language.
  2. b a method of translating statements, e.g. in a programming language, such that the translation of a phrase is built up from the translations of its components.
  3. c a way of writing expressions in which an operator appears after its operands: ab+.
  4. d a predictive form of parsing, such as recursive descent, in which the parse tree of a statement is constructed starting at the root (sentence symbol).
  5. e 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 Multiple choice questions

  1. placement of a new data item in its proper position in an ordered sequence, such as a list, array, or symbol table.
  2. 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.
  3. 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.
  4. 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. an operator that makes a type from other types, e.g. array or record.

5 True/False questions

  1. hash with bucketsa set of symbols used in the definition of a language.

          

  2. subrangea contiguous subsequence of a sequence, e.g. 1..10 is a subrange of integer.

          

  3. AVL treea data structure that shows how a statement in a language is derived from the context-free grammar of the language; it may be annotated with additional information, e.g. for compilation purposes.

          

  4. Kleene closurezero or more occurrences of a grammar item; indicated by a superscript *.

          

  5. derivationa 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.

          

Create Set