Complete this assignment with Team One.
You must submit this in an archive named "lazy.zip". This archive must contain a folder named "lazy". This folder must contain all the files specified below. You must attach "lazy.zip" to an email whose subject is "BYU - Fall 2010 - CS 330 - lazy" and whose message body contains the name of everyone on your team (each on a separate line.) You must send this email to email@example.com before 5pm (Provo time) on 10/12. Ensure that what you are satisfied with what you submit, because only your chronologically first submission will be graded. Ensure that you follow these instructions exactly, since submissions that do not meet these requirements (i.e. do not have the correct format) will receive no credit, despite the time and energy you put into the assignment. Please see Turn In Policy for more information.
You must submit this in a file named "lazy.rkt".
Develop the following functions and data structures in the Lazy Racket language.
|(define print-only-errors #t)|
|(define (test l r)|
|(if (equal? l r)|
|(printf "Test Passed~n"))|
|(printf "Test Failed.~nActual: ~S ~nExpected: ~S~n" l r)))|
|(build-table rows cols f) → (vectorof (vectorof any/c))|
|rows : exact-positive-integer?|
|cols : exact-positive-integer?|
|f : (exact-nonnegative-integer? exact-nonnegative-integer? . -> . any/c)|
You will find the following function helpful:
|(define (build-vector num f)|
|(apply vector (build-list num f)))|
You must use build-table to construct a table of the longest common subsequence of prefixes of s1 and s2 then synthesize the result from these intermediate points. You will not get credit if you do a computation twice.
Warning: Many people errorneously implement the longest common substring. The longest common substring of Artist and Artsy is Art. The longest common subsequence of Artist and Artsy is Arts. You are implementing longest common subsequence.