File: binary.bs

package info (click to toggle)
storm-lang 0.7.5-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 52,028 kB
  • sloc: ansic: 261,471; cpp: 140,432; sh: 14,891; perl: 9,846; python: 2,525; lisp: 2,504; asm: 860; makefile: 678; pascal: 70; java: 52; xml: 37; awk: 12
file content (106 lines) | stat: -rw-r--r-- 1,787 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
use test;
use parser;
use core:io;

binaryParser : parser(recursive descent, binary) {
	start = Start;

	Array<Buffer> Start();
	Start => Array<Buffer>() : "[^\n]*" -> push - ("\n" - "[^\n]*" -> push)*;
}

test BinaryParser {
	Buffer b = "ab\ncd\ne".toUtf8();

	var result = binaryParser(b);
	check result.value;
	if (v = result.value) {
		check v.count == 3.nat;
	} else {
		print("Error at ${result.end}, ${result.error}");
	}

	result = binaryParser(b, 2);
	check result.value;
	if (v = result.value) {
		check v.count == 3.nat;
		check v[0].filled == 0.nat;
	} else {
		print("Error at ${result.end}, ${result.error}");
	}
}

pseudoParser : parser(recursive descent, binary) {
	use parser.special;
	start = Start;

	Buffer Start();
	Start => x : Number n - Bytes(n) x;

	Nat Number();
	Number => toNat(x) : "[0-9]" x;
}

pseudoStr : parser(recursive descent) {
	use parser.special;
	start = Start;

	Str Start();
	Start => x : Number n - Chars(n) x;

	Nat Number();
	Number => toNat(x) : "[0-9]" x;
}

Nat toNat(Buffer b) {
	b.fromUtf8.toNat;
}

test PseudoRules {
	Buffer b = "3abcde".toUtf8();
	var r = pseudoParser(b);
	check r.value;
	check r.end == 4;
	if (x = r.value) {
		check x.count == 3;
		check x.fromUtf8 == "abc";
	}

	var z = pseudoStr("3abcde");
	check z.value;
	if (x = z.value) {
		check x == "abc";
	}
}

value BinData {
	init(Nat a, Int b) {
		init { a = a; b = b; }
	}

	Nat a;
	Int b;
}

binNumParser : parser(recursive descent, binary) {
	use parser.special;
	start = Start;

	BinData Start();
	Start => BinData(a, b) : Nat16LE a - Int16BE b;
}

test BinNumRules {
	Buffer b = buffer(4);
	b.push(0x01);
	b.push(0x80);
	b.push(0xFF);
	b.push(0xFF);

	var r = binNumParser(b);
	check r.value;
	if (x = r.value) {
		check x.a == 0x8001_n;
		check x.b == -1;
	}
}