KOI: Lab 1

Part A: Getting friendly with your development environment

If you are using Visual Studio, you might want to look at some instructions for Visual Studio 2008.

Fix this large, meaningless program that doesn't work:

• The source code for a large, meaningless program that doesn't work.

On a Linux or Unix system, the file debug-exercise.tar.gz can be unpacked using the command tar xvzf debug-exercise.tar.gz.

Use a debugger to find out where the program crashes, and why. It's a rather large and intentionally obscure program, so it's probably hard to find the problem without a debugger.

Fix the problem and recompile the program, so it can execute without crashing. It's sufficient just to comment out lines that don't work.

Discuss:

1. Where was the problem?
2. Why did the program crash?
3. What did you do to fix the problem?

Part B: The simple compiler from chapter 2

Compile and try out these two programs from the (old) course book:

• The source code for the program in section 2.5 of ASU-86, the old course book.
• The source code for the very simple compiler in section 2.9 of ASU-86, the old course book.

Both programs translate from infix to postfix notation. They are text-only programs, which read text from the standard input (usually the keyboard) and write text to the standard output (usually a window on the screen), but other than that it is a part of the exercise to find out how to use them, and what input they expect.

Discuss:

4. Which of the phases and other parts of a compiler are present in the 2.9 program?
5. How are they implemented?
6. Which are missing?
7. If you were to modify the 2.9 program so it actually calculates the values of the expressions, and not just prints out postfix code, how would you do that? (Don't actually do it yet, just discuss how it can be done.)

Part C: Recursive and not recursive

int plus(int x, int y) {
  return x + y;
}

#define PLUS(x, y) ((x) + (y))

int factorial(int n) {
  if (n == 0)
    return 1;
  else
    return n * factorial(n - 1);
}

Later in the course, you will come into contact with context-free grammars (which are recursive) and regular expressions (which are not). In that sense (but only in that sense!) context-free grammars are similar to C functions, and regular expressions are similar to C macros.

Some hints about the C preprocessor:

#define FOO 4711
i = FOO;

i = 4711;

#define TIMES(x, y) x * y
i = TIMES(7, 4);
i = TIMES(7, 2 + 2);
i = TIMES(++, {);

i = 7 * 4;
i = 7 * 2 + 2;
i = ++ * {;

#define SQR(n) n*n
#define CUBE(n) n*SQR(n)
i = CUBE(3);

i = 3*3*3;

Det kan vara upplysande att titta på resultatet av preprocessningen:

• I gcc ger man flaggan -E.
• I Visual Studio 2012, gå in på PROJECT -> projektnamn Properties... -> Configuration Properties -> C/C++ -> Preprocessor -> Generate Preprocessed File och ändra Preprocess to a File från No till Yes (/P). Tryck OK. Bygg projektet, och ignorera felmeddelandet om att det inte går att öppna objektfilen. Nu har det skapats en fil med den preprocessade utmatningen. Den har ändelsen .i och finns i underkatalogen Debug i projektkatalogen. (I Visual Studio måste man välja All Files (*.*) för att se den i filväljaren.)

Discuss:

8. Does the macro work?
9. Why, or why not?
10. If it doesn't work: Explain how the C preprocessor would have to be modified for the macro to work!

Report

Even if you don't send a report by e-mail, we advise that you write down your answers, to facilitate communication and for your own later use.