1/*
2 * Calculate the Greatest Common Divisor of a and b.
3 */
4define gcd(a, b) {
5    auto tmp;
6
7    /*
8     * Euclidean algorithm
9     */
10    while (b != 0) {
11        tmp = a % b;
12        a = b;
13        b = tmp;
14    }
15    return a;
16}
17"gcd(225, 150) = " ; gcd(225, 150)
18
19/* assign operators */
20a = 10
21a += 1
22a++
23++a
24a--
25--a
26a += 5
27a -= 5
28a *= 2
29a /= 3
30a ^= 2
31a %= 2
32
33/* comparison */
34if (a > 2) {
35}
36if (a >= 2) {
37}
38if (a == 2) {
39}
40if (a != 2) {
41}
42if (a <= 2) {
43}
44if (a < 2) {
45}
46
47a /* /*/ * 2        /* == a * 2       */
48a //* /*/ 1.5       /* == a / 1.5     */
49a /*/*/ * 3         /* == a * 3       */
50a * 3 /**/ * 4      /* == a * 3 * 4   */
51a / 3 //*//*/ .4    /* == a / 3 / 0.4 */
52a / 3 //*//*/ 1.3   /* == a / 3 / 1.4 */
53a / 3 /*//*// 1.3   /* == a / 3 / 1.4 */
54