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. concatenation
  2. finite automaton
  3. CKY
  4. observability
  5. reduction step
  1. a making a sequence that consists of the elements of a first sequence followed by those of a second sequence.
  2. b 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.
  3. c in shift-reduce parsing, the reduction of items at the top of the stack to a phrase that encompasses those items.
  4. d a kind of parser, due to Cocke, Kasami, and Younger, that efficiently produces all possible parses of an input. Also written CYK.
  5. e an abstract computer consisting of an alphabet of symbols, a finite set of states, a starting state, a subset of accepting states, and transition rules that specify transitions from one state to another depending on the input symbol. The machine begins in the starting state; for each input symbol, it makes a transition as specified by the transition rules. If the automaton is in an accepting state at the end of the input, the input is recognized. Also, finite state machine. Abbreviated FA.

5 Multiple choice questions

  1. an ordering of operators that specifies that certain operators should be performed before others when no ordering is otherwise specified.
  2. a sequence of symbols or characters.
  3. see alignment.
  4. a description of a kind of variables, including a set of possible values and a set of operations.
  5. a 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 True/False questions

  1. character classa classification of characters, e.g. alphabetic or numeric.

          

  2. parsingthe process of reading a source language, determining its structure, and producing intermediate code for it.

          

  3. leftmost derivationa list of steps that shows how a sentence in a language is derived from a grammar by application of grammar rules.

          

  4. declarationa 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.

          

  5. hash tablean element of computer memory that can hold a value.

          

Create Set