CS 412/413
Introduction to Compilers
Spring 2001

List Operations

Performs various operations on a list.  The operations are repeated N times.  The list implementation is the same doubly-linked list used in FileRev.im.  The operations performed are:

• Create a list (L1) of integers from 1 through SIZE (SIZE is currently defined as 10000).
• Copy L1 to L2.
• Remove each individual item from left side (head) of L2 and append to right side (tail) of L3 (preserving order).
• Remove each individual item from right side (tail) of L3 and append to right side (tail) of L2, thus reversing the list.
• Reverse L1 in place.
• Check that first item of L1 is now == SIZE.
• Compare L1 and L2 for equality and return length of L1 (which should be equal to SIZE).

This tests the object-oriented features of your compiler, in particular, null checking and method dispatch.  If your compiler optimizes method calls into function calls for classes, it will generate much more efficient code. Although the Iota programs are faster than the C++ and Java programs, this is probably because the Iota program uses a better data structure.

Source: [lists.im lists.cpp Lists.java]
Input: N=16
Output: SIZE

B	1.28
C	1.28
D	1.3
E	1.31
C++	1.32
Java	1.49