This assignment entails writing a program in C/C++/FORTRAN/Java for converting an input string of literals, into both the Canonical SOP and Canonical POS forms.
1. You may assume the input to be in SOP form, without any errors.
2. The input is a string, without any brackets. A sample input is:
     z    x' + y'u                     +  z'  v
     Note the presence of spaces, and arbitrary lowercase letters to denote variables.
    A  ' represents a complement. The input is to be in the SOP form (lowercase letters alone), (Note: SOP, not necessarily Canonical SOP - the latter is what you have to find out!). You may assume that incorrect input will not be given e.g., a space between a ' and a lowercase letter. You can further assume that terms such as x'a b x or x abx will not be given as input.

Venue: SPANN Lab, 3rd Floor, EE Department (Ph. 4478)

Suny Dewanand Gedam: sdgedam@ee.iitb.ac.in

P. L. S. S. S. N. Raju: raju@ee.iitb.ac.in

Sapavat Sujatha: sujatha@ee.iitb.ac.in

Sridhar Iyengar: sridhar@ee.iitb.ac.in

(Exact group assignment to the particular TA will be announced at at the eleventh hour. Literally, around 11pm the previous night.)

[Please check the Assignment 2 page for the final Groups and Time Assignments]