Week Five
Thursday (3/11/05)
Coming to the class we started from where we had left i.e. the conditions of the getreg() function, the an example demonstrating its use and also showing that how the removal of common sub-expressions could lead to optimized codes which is always a guiding force behind good programme. The final part of the discussion was about the global register allocation which was shown to be efficient by the method of cost saving.
Monday (7/11/05)
With the compiler test at our hands today, most of the lot seemed drowsy….. hmm…. may be the previous night out , the assignment submission…. Well this sem. is truly torturous…. And also IITans have this strange affinity towards the create on demand algorithm….. I mean the if the test is on Monday then most of us pick up the notes on Sunday…. The same is the case with the assignments…..
Today we started our discussion on the DAG(Directed Acyclic Graph) method of code generation. The inherent feature of this method is the identification of the common sub-expressions and thereby leading to a minimized code. Finally the discussion concluded with the algorithm to generate the DAG and people rushed as they didn’t want to loose any precious time to prepare for the test
The test in the evening was straight-forward but the only problem was that it was a bit lengthy….. hhmmmmm Sir why are all your question papers so time demanding? Please give us a manageable paper in the end sems…
Tuesday(8/11/05)
The 7:30 class has always been and will always be a difficult thing to fix…. But its still a better situation than last year…. Remember last year the classes were to begin at 7:00 am… uff impossible in these chilling mornings.
The Class began resuming the discussion on DAG, pertaining to the topic of re-construction of the graph backwards, leading to a compressed code. Just when Prof NG finished explaining the example of code optimization under the constrain of two registers, students pointed out that it would had been better if the example had consisted of a DAG and not a tree. Well pointed!!
Then there was a question which Joydeep answered, regarding the maximum registers required, if a node had two children requiring R1 and R2 registers, R1 and R2. Well u can find the answer in the class notes…. But I tell u what… I forced to mention this…. JD is my wingmate J. Finally the class ended in a bit of confusion as Prof NG. asked us to replace all the “R” in the traverse left algo. to label….
But for the first time Prof NG seemed a bit reluctant to take attendance… mayebe he had judged who attends the kectures regularly and who doesn’t… but still the students forced him into it as to some it’s the only incentive…..
Thrusday(10/11/05)
Today was the day when the effects of thin attendance in the previous class surfaced. Prof NG was continuing with his discussion on the GENCODE(n) algorithm and was asking questions…. He could have really shouted at the students who didn’t attend the previous class and were not able to answer but showed a calm attitude and kept on asking “did u attend the previous class?”… so nice
The algo being taught was really confusing and with more than half of the class sitting dumb the atmosphere was not so stimulating….. but still Prof NG kept on trying his best…. Finally the discussion was held up on the Tstack and Rstack and when Prof NG was trying to device a logic for having a single function for computing the push and pop. Finally when Sankalp pointed out that there was recursion in the functions the names of the functions were changed leading to further doubts….
Finally sir announced that today was the last day for the attendance to be taken and I heard a few voices saying then what abt the monday class
Today also saw Sourish in formals… indicating that he had gone for the ITC group discussion…. He along with Puspesh and Aneesh were selected for the GD and Aneesh was finally selected for the summer training….. Congrats Aneesh..
