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. regular language
  2. parse tree
  3. reduction step
  4. bottom-up parsing
  5. symbol table
  1. a a data structure that associates a name (symbol) with information about the named object.
  2. b in shift-reduce parsing, the reduction of items at the top of the stack to a phrase that encompasses those items.
  3. c a language described by a regular grammar, or recognizable by a finite automaton, e.g. a simple item such as a variable name or a number in a programming language.
  4. d a parsing method in which input words are matched against the right-hand sides of grammar productions in an attempt to build a parse tree from the bottom towards the top.
  5. e a 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.

5 Multiple choice questions

  1. the location of data relative to the start of a data area.
  2. describes 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.
  3. the assignment of memory locations to data and program code.
  4. a set of symbols used in the definition of a language.
  5. 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.

5 True/False questions

  1. prefix1. 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. semanticsthe process of reading a source language, determining its structure, and producing intermediate code for it.

          

  3. recognizera program or abstract device that can read a string of symbols and decide whether the string is a member of a particular language.

          

  4. leftmost derivationa derivation in which the leftmost nonterminal of the string is replaced at each step.

          

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