{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

comp_314_quiz_06 - http/cs.bilgi.edu.tr Name Surname...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
http://cs.bilgi.edu.tr Name Surname . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Number (ID) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Comp 314 — Quiz ( Week 06) Do not use pencil to write your answers. Use only black or dark blue indelible pen. Cross through errors with a single line. Question 1 10 Marks Give formal definitions for 1. A grammar 2. The grammar of the WAE language of PLAI. Just addition and subtraction are enough for the arithmetic. You may treat symbols as terminals. Document last compiled on March 23, 2009 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
http://cs.bilgi.edu.tr Question 2 20 Marks Prove that there does not exist a finite state automaton that can recognise sentences of the WAE language of the previous question. Document last compiled on March 23, 2009 2
Background image of page 2
http://cs.bilgi.edu.tr Question 3 30 marks Suppose you are given parser, debruijniser and debruijnised unparser functions named λ -parse, λ -db and λ -db-unparse for the fully bracketed λ -calculus, just like the ones you had to write for last week’s assignment. Write a function that takes an s-expression representing a sentence of the fully bracketed λ -calculus and produces the equivalent debruijnised s-expression.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}