|
36
|
1
|
|
|
2 int heap[100];
|
|
|
3
|
|
|
4 #define car(e) (heap[(int)(e)])
|
|
|
5 #define cadr(e) (heap[((int)(e))+1])
|
|
|
6
|
|
|
7 #define TEST
|
|
|
8 int i;
|
|
|
9 TEST
|
|
|
10
|
|
115
|
11 #define TEST0 33
|
|
|
12 #define TEST111 TEST0
|
|
|
13
|
|
36
|
14 #define c(a,b) g(a+1,b+1)
|
|
|
15 #define g(a,b) printf("%d %d\n",a+1,b+1);
|
|
|
16
|
|
|
17 main() {
|
|
|
18 int a,b,e;
|
|
|
19
|
|
115
|
20 b = heap[TEST111];
|
|
36
|
21 a =1; b = 3;
|
|
|
22 #ifndef a
|
|
|
23 c(a,
|
|
|
24 b);
|
|
|
25 /* 3,5 expected */
|
|
|
26 #endif
|
|
111
|
27 e=50; heap[51]=3; heap[3]=4;
|
|
|
28 /* 5,4 expected */
|
|
|
29 #if 0
|
|
|
30 g(car(cadr(e)),cadr(e));
|
|
|
31 #endif
|
|
172
|
32 return 0;
|
|
36
|
33 }
|
|
|
34
|
