~cpp
C supports two kinds of parameter passing mode, pass-by-value and pass-byreference,
but not pass-by-name. A technique for implementing pass-by-name is to
treat the actual parameters as thunks. Whenever a formal parameter is referenced in a
subprogram, the corresponding thunk compiled for that parameter is executed. Even
though it is difficult to avoid run-time overhead in the execution of thunks, sometimes it
provides a very powerful feature for some applications like a generic summation routine.
Suppose that whenever a programmer wants to pass a parameter by name in C, it is
required to prefix the keyword name just in front of both the actual and formal
parameters as below:
Sum (name i + j, 1, n, name V[i]);
Of course, if a C program with the call statement above is to be compiled by a
conventional compiler, syntax errors should occur since it violates the syntactical rules
of C.
You are required to implement C preprocessor that supports the pass-by-name
parameter-passing method. The preprocessor should transform C programs with name
parameters into pure C programs so that the transformed programs manage to handle
parameters prefixed with name as if they were called by name without causing any
syntax errors.

��������� ��������� ��������� ������ thunks ������ ��������� ��������� ������������������.
thunks ��� �������� ��������� ���������������. ���������, ��������� ������������ ��������� ��������� 계��� ���������, ������������ ��������� ������������ ������������ 간��� ��������� ��������� ������
������ ������������ 구������������ ����� ������������ ��������� ��������� 계���(delayed computation)��� ���������������. call-by-name, call-by-need��� ������ ���������게 ������������ ��������� ���개��������� thunk������ ������������ ������������. 간������ ������ thunk������ ����� ������������ 계��������� ��������� 값��� ��������������� ���������������. (������ 기������ ������������ ������������ ������������ Call ������ ��������� ��������������� ��과��� ������������.) ������ 기������ ��������� 구������ Algol60���������.
Requirement

~cpp
x = sigma(i=1, n) {V}

1) Your program should handle Jensen���s device; show that your program works
properly by testing it for various summation below.
2) You are also recommended to check if Swap (x, y) does work properly or not
by passing parameters by name.
3) You have to show off the robustness of your program by checking various
error conditions.

Jensen's Machine ��� Jørn Jensen������ ��������� Algol 60��� ������������ ���고��������� ��������� ������그������ ������������ ������������.

~cpp
  begin integer i;
     real procedure sum(i, lo, hi, term);
          value lo, hi; integer i, lo, hi; real term;
          comment term is passed by-name;
     begin real temp; temp := 0;
           for i := lo step 1 until hi do
              temp := temp + term;
           sum := temp
     end;
     print( sum(i, 1, 100, 1/i))
  end

��������� ��������� ���기��� ��������, ������ 100��������� ������������ 구������ ��������� ���결������ ���������������. ��������� 그 ��������� ��������� Knuth ��������� Man Boy Test��� ���������������������.
�������� ��� �������� ���������������... -_-; 계��� ���������고 ������;;;
cf) Jensen's Device, Man Boy Test ��� Compiler Theory ��� ��� ������������������.
Hand-In

~cpp
You should follow the guideline suggested later. To be specific, your report is
supposed to include an external documentation as well as an internal documentation.
The external documentation should explain your program in detail so that we can
understand what kind of data structures have been used, the characteristics and general
as well as unique features of your program, etc. An internal documentation means the
comment attached in your source.
You are supposed to upload your source program and executable file. You are also
required to submit a listing of your program and a set of test data of your own choice,
and its output, when you show up for demo. Be sure to design carefully your test data
to exercise your program completely.

��� ���깐 ��������� ���각��������.... ��� ������ ��������� 구������. ����� ������게 ������������ ��������� ���게����� ������구������ binary �����고 ��������� ������ ������������������. ��������� ���������꺼��� ���������게 ������������... C ��������� ������ �����고 ���������... ��������� 구������������ ���각���~ - eternalbleu