381prelim2_FA05 - CS381 Fall 2005 Second Mid Term Olin 155...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS381 Second Mid Term Friday, Nov. 4, 2005 Fall 2005 Olin 155 9:05-9:55 am This is a 50-minute in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. Thank you. 1. Is the language { } |1 , 1 iji j La b c d i j =≥ a context-free language? If yes give a Chomsky normal form context-free grammar for it. If not use the pumping lemma to prove that it is not a context-free language. 2. What is the specific class of languages defined by grammars in which each production is of one of the following forms: A variable goes to epsilon A ε A variable goes to a terminal A a A variable goes to a string consisting of two terminals
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.
Ask a homework question - tutors are online