Write a Makefile to compile and link GNU indent -- a utility for pretty printing C programs.
Implement cal.
$ cal 1 2011
Su Mo Tu We Th Fr Sa
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31
This lab should be done on lore.cs.purdue.edu using gmake (GNU make). The supplied code may not compile on other machines. Note that lore runs Solaris operating system and thus make and gmake are not the same program unlike on many Linux machines.
Begin by creating a directory named lab01. Inside lab01, create subdirectories Makefile and cal.
Do this part of the lab on GNU indent inside the Makefile subdirectory and the next part inside the cal subdirectory.
Download GNU source provided HERE. To untar the archive, enter command: gzip -d indent.tar.gz | tar -x
Create your Makefile in the source directory (i.e. indent).
In the Makefile:
Create target indent as the first target. Hence, if you just type gmake in the source directory, your Makefile should build indent.
Create target clean to erase all object files and binary file indent. Use option -f to suppress any warnings for non-existent files.
Set compiler(CC) to gcc and compiler flags(CFLAGS) to use optimization level 2 and include directory indent/include.
Set library flags(LDFLAGS) to link libintl.so
Create binary indent by linking the following source files: indent.c args.c backup.c comments.c lexi.c parse.c globs.c io.c output.c
To test whether the indent binary you built is working as expected, try using it to indent one of the source files using different styles. Use the man command to find out how to use indent. Make sure that you are using the indent binary you built and not the one that is available on lore:-)
Zeller's congruence is an algorithm devised by Christian Zeller to calculate the day of the week for any Julian or Gregorian calendar date.
For the Gregorian calendar, Zeller's congruence is:
where,
h is the day of the week (0 = Saturday, 1 = Sunday, 2 = Monday, ...)
q is the day of the month
m is the month (3 = March, 4 = April, 5 = May, ..., 14 = February)
Y is the year.
NOTE: In this algorithm January and February are counted as months 13 and 14 of the previous year. E.g. if it is February 2, 2010, the algorithm counts the date as the second day of the fourteenth month of 2009 (14/02/2009 in MM/DD/YYYY format)
Your next task for this lab is to write a program that when provided with a month (first argument) and an year (second argument), outputs the calender for that month as shown in the example above. Make sure that you print the correct number of days (28, 29, 30 or 31) for each month. NOTE: Feb has 29 days in leap years, when the year number is divisible by four (except for years that are divisible by 100 and not by 400 in the Gregorian calendar).
If the date is a single digit it should be right aligned and if the first day of the month is not a Sunday, print spaces for the rest of that week. Please terminate each line with a newline character and do not have any spaces between the last non-space character and the newline. Make sure to stick to these formatting guide lines.
Create a Makefile to build your code inside lab01/cal directory. Name your final executable (and the Makefile target) as lab01-cal.
Please make sure that output of your program is the same as that of reference implementation provided HERE. Use diff to compare outputs.
Type cd .. in lab01 and change working directory to the parent directory of lab01.
In the parent directory of lab01, type turnin -v -c cs240=XXX -p lab01 lab01 to turnin your work. Replace XXX with your section number-- F1130, F130, F330, F730, F930, R1130, R330, R930, T1130.
Now, you may use the command, turnin -c cs240=XXX -p lab01 -v to verify your submission.
This lab is due on Sunday 23 January 11:59PM.