aboutsummaryrefslogtreecommitdiff
path: root/tests/programs/basics.zc
blob: 9865527a5b4b0e3c5ad1028f7f17c207a0a1c18d (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
let table[10];
let greeting = "hey";
const N = 10, BIG = 0x100 * 2;
fn fib(n) { if (n < 2) return n; return fib(n - 1) + fib(n - 2); }
fn twice(f, x) { return f(f(x)); }
fn inc(x) { return x + 1; }
fn main() {
	let i, s = 0, a[5];
	for (i = 0; i < N; i++) table[i] = i * i;
	for (let j = 0; j < N; j++) s += table[j];
	put_n(s); put_c(' '); put_n(fib(15)); put_c(' '); put_n(twice(inc, 40)); put_c(' '); put_n(BIG); put_c(10);
	put_s(greeting); put_c(' '); put_n('A'); put_c(' '); put_n(-17 / 5); put_c(' '); put_n(-17 % 5); put_c(' '); put_n(1 << 10); put_c(' '); put_n(-64 >> 3); put_c(10);
	i = 0; while (1) { i++; if (i == 3) continue; if (i > 6) break; put_n(i); } put_c(10);
	a[0] = 5; a[1] = a[0]++; a[2] = ++a[0]; put_n(a[0]); put_n(a[1]); put_n(a[2]); put_c(10);
	let b = { let t = 3; t * t };
	put_n(b); put_c(' '); put_n(3 > 2 && 2 > 1); put_n(0 || 0); put_n(!5); put_n(~0); put_n(5 != 5); put_n(4 >= 4); put_c(10);
	let x = asm { 2 3 + };
	put_n(x); put_c(10);
	asm { 'o' . 'k' . 10 . }
	return 0;
}