Write and run programs that demonstrate where these languages are not fully specified as to their computational behavior.
For example in some of these languages order of evaluation may be left unspecified. Demonstrate by running the same program on different system that the computation is not fully specified. Discuss briefly which feature is unspecified or system dependent and why. Your code should not exceed more than 100 lines in these demonstrations.
Program clarity and quality of discussion will be equally important in this problem
Option 2:
Convert the RK program in algol60 (a main example in the algol 60 report) to two of the above languages. Discuss what changes need to be made in the conversion. Make sure the program runs correctly.
Due date: in class April 21, 1998.