CIS 625: Mid Term Exam
 
We, Nov 4, 1998, 50 minutes
Open Notes, Open Books
The exam consists of problems
Answers not appearing in designated spaces WILL NOT be graded

• Problem #1 (10 points)

  Let G be a grammar consisting just of the production rules used in the following parsing graph.

  1. List the production rules of G.

  2. Find a parse graph for baabba in G.
  

• Problem #2 (10 points) Write a program that outputs an input value v which, for some i, appears at locations i and i + v in the input.

  Example On input ”6, 5, 3, 1, 8, 3, 5” the program may output ”3” or ”5”.

• Problem #3 (10 points) Give the transition diagram of a finite state transducer that computes the following relation.

  {(x, y)|x and y are in {a, b, c}^*, and x is obtained from y by removing the characters that are equal to their predecessors}

  Example On input “abacac” the transducer may output “aabbbaaacaaccc”.

• Problem #4 (10 points) Give the transition diagram of a deterministic finite state automaton accepting the language generated by the following grammar.
  

[grades]