blob: eee27a4aefd2b27d62dedbd08ec2655a86c7fef7 (
plain) (
blame)
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
|
// So far instructions can only contain linear lists of properties. Now we add
// support for more complex trees of properties in dilated reagents. This will
// come in handy later for expressing complex types, like "a dictionary from
// (address to array of charaters) to (list of numbers)".
:(scenario dilated_reagent_with_nested_brackets)
recipe main [
{1: number, foo: (bar (baz quux))} <- copy 34
]
+parse: product: {"1": "number", "foo": <"bar" : <<"baz" : <"quux" : <>>> : <>>>}
:(before "End Parsing Reagent Property(value)")
value = parse_string_tree(value);
:(code)
string_tree* parse_string_tree(string_tree* s) {
assert(!s->left && !s->right);
if (s->value.at(0) != '(') return s;
string_tree* result = parse_string_tree(s->value);
delete s;
return result;
}
string_tree* parse_string_tree(const string& s) {
istringstream in(s);
in >> std::noskipws;
return parse_string_tree(in);
}
string_tree* parse_string_tree(istream& in) {
skip_whitespace(in);
if (in.eof()) return NULL;
if (in.peek() == ')') {
in.get();
return NULL;
}
if (in.peek() != '(') {
string_tree* result = new string_tree(next_word(in));
return result;
}
in.get(); // skip '('
string_tree* result = NULL;
string_tree** curr = &result;
while (in.peek() != ')') {
assert(!in.eof());
*curr = new string_tree("");
skip_whitespace(in);
skip_ignored_characters(in);
if (in.peek() == '(')
(*curr)->left = parse_string_tree(in);
else
(*curr)->value = next_word(in);
curr = &(*curr)->right;
}
in.get(); // skip ')'
return result;
}
:(scenario dilated_reagent_with_type_tree)
recipe main [
{1: (map (address array character) (list number))} <- copy 34
]
+parse: product: {"1": <"map" : <<"address" : <"array" : <"character" : <>>>> : <<"list" : <"number" : <>>> : <>>>>}
|