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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
|
// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
// SPDX-FileCopyrightText: Bradley M. Bell <bradbell@seanet.com>
// SPDX-FileContributor: 2003-22 Bradley M. Bell
// ----------------------------------------------------------------------------
# include <cppad/cppad.hpp>
bool json_lexer(void)
{ bool ok = true;
typedef CppAD::graph::graph_op_enum graph_op_enum;
using CppAD::local::graph::op_name2enum;
//
// match_any_string
std::string match_any_string = "";
//
// An AD graph example
// node_1 : p[0]
// node_2 : x[0]
// node_3 : x[1]
// node_4 : -2.0
// node_5 : p[0] + x[0] + x[1]
// node_6 : (p[0] + x[0] + x[1]) * (p[0] + x[0] + x[1])
// y[0] = (p[0] + x[0] + x[1]) * (p[0] + x[0] + x[1])
// use single quote to avoid having to escape double quote
std::string graph =
"{\n"
" 'op_define_vec' : [ 3, [\n"
" { 'op_code':1, 'name':'add', 'n_arg':2 } ,\n"
" { 'op_code':2, 'name':'mul', 'n_arg':2 } ,\n"
" { 'op_code':3, 'name':'sum' } ]\n"
" ],\n"
" 'n_dynamic_ind' : 1,\n"
" 'n_variable_ind' : 2,\n"
" 'constant_vec' : [ 1, [ -2.0 ] ],\n"
" 'op_usage_vec' : [ 2, [\n"
" [ 3, 1, 3, [1, 2, 3] ] ,\n"
" [ 2, 5, 5 ] ] \n"
" ],\n"
" 'dependent_vec' : [ 1, [6] ]\n"
"}\n";
// Convert the single quote to double quote
for(size_t i = 0; i < graph.size(); ++i)
if( graph[i] == '\'' ) graph[i] = '"';
//
// json_lexer constructor checks for { at beginning
CppAD::local::graph::json_lexer json_lexer(graph);
// -----------------------------------------------------------------------
// op_define_vec
json_lexer.check_next_string("op_define_vec");
json_lexer.check_next_char(':');
json_lexer.check_next_char('[');
//
// n_define
json_lexer.next_non_neg_int();
size_t n_define = json_lexer.token2size_t();
json_lexer.check_next_char(',');
json_lexer.check_next_char('[');
CppAD::vector<graph_op_enum> op_code2enum(1);
for(size_t i = 0; i < n_define; ++i)
{ json_lexer.check_next_char('{');
//
// op_code
json_lexer.check_next_string("op_code");
json_lexer.check_next_char(':');
json_lexer.next_non_neg_int();
# ifndef NDEBUG
size_t op_code = json_lexer.token2size_t();
assert( op_code == op_code2enum.size() );
# endif
json_lexer.check_next_char(',');
//
// name
json_lexer.check_next_string("name");
json_lexer.check_next_char(':');
json_lexer.check_next_string(match_any_string);
std::string name = json_lexer.token();
graph_op_enum op_enum = op_name2enum[name];
//
// op_code2enum
op_code2enum.push_back(op_enum);
//
if( op_enum != CppAD::graph::sum_graph_op )
{ json_lexer.check_next_char(',');
//
// n_arg
json_lexer.check_next_string("n_arg");
json_lexer.check_next_char(':');
json_lexer.next_non_neg_int();
ok &= json_lexer.token2size_t() == 2;
}
//
json_lexer.check_next_char('}');
if( i + 1 == n_define )
json_lexer.check_next_char(']');
else
json_lexer.check_next_char(',');
}
json_lexer.check_next_char(']');
json_lexer.check_next_char(',');
// -----------------------------------------------------------------------
// n_dynamic_ind
json_lexer.check_next_string("n_dynamic_ind");
json_lexer.check_next_char(':');
json_lexer.next_non_neg_int();
size_t n_dynamic_ind = json_lexer.token2size_t();
json_lexer.check_next_char(',');
//
ok &= n_dynamic_ind == 1;
// -----------------------------------------------------------------------
// n_variable_ind
json_lexer.check_next_string("n_variable_ind");
json_lexer.check_next_char(':');
json_lexer.next_non_neg_int();
size_t n_variable_ind = json_lexer.token2size_t();
json_lexer.check_next_char(',');
//
ok &= n_variable_ind == 2;
// -----------------------------------------------------------------------
// constant_vec
json_lexer.check_next_string("constant_vec");
json_lexer.check_next_char(':');
json_lexer.check_next_char('[');
json_lexer.next_non_neg_int();
size_t n_constant = json_lexer.token2size_t();
CppAD::vector<double> constant_vec(n_constant);
json_lexer.check_next_char(',');
//
// [ first_constant, ... , last_constant ]
json_lexer.check_next_char('[');
for(size_t i = 0; i < n_constant; ++i)
{ json_lexer.next_float();
constant_vec[i] = json_lexer.token2double();
//
if( i + 1 == n_constant )
json_lexer.check_next_char(']');
else
json_lexer.check_next_char(',');
}
//
json_lexer.check_next_char(']');
json_lexer.check_next_char(',');
//
ok &= constant_vec.size() == 1;
ok &= constant_vec[0] == -2.0;
// -----------------------------------------------------------------------
// op_usage_vec
json_lexer.check_next_string("op_usage_vec");
//
json_lexer.check_next_char(':');
json_lexer.check_next_char('[');
//
json_lexer.next_non_neg_int();
size_t n_usage = json_lexer.token2size_t();
CppAD::vector<graph_op_enum> operator_vec(n_usage);
//
json_lexer.check_next_char(',');
//
// [ first_operator, ... , last_operator ]
json_lexer.check_next_char('[');
for(size_t i = 0; i < n_usage; ++i)
{ // start next operator
json_lexer.check_next_char('[');
graph_op_enum op_usage;
//
// op_code
json_lexer.next_non_neg_int();
size_t op_code = json_lexer.token2size_t();
//
// op_enum
op_usage = op_code2enum[op_code];
json_lexer.check_next_char(',');
//
size_t n_result, n_arg;
if( op_usage != CppAD::graph::sum_graph_op )
{ n_result = 1;
n_arg = 2;
}
else
{ // n_result
json_lexer.next_non_neg_int();
n_result = json_lexer.token2size_t();
json_lexer.check_next_char(',');
ok &= n_result == 1;
//
// n_arg
json_lexer.next_non_neg_int();
n_arg = json_lexer.token2size_t();
json_lexer.check_next_char(',');
json_lexer.check_next_char('[');
ok &= n_arg == 3;
//
}
ok &= n_result == 1;
CppAD::vector<size_t> arg_node(0);
// first_arg_node, ... , last_arg_node
for(size_t j = 0; j < n_arg; ++j)
{ // next argument node
json_lexer.next_non_neg_int();
size_t argument_node = json_lexer.token2size_t();
arg_node.push_back( argument_node );
//
if( j + 1 == n_arg )
json_lexer.check_next_char(']');
else
json_lexer.check_next_char(',');
}
if( op_usage == CppAD::graph::sum_graph_op )
{
json_lexer.check_next_char(']');
ok &= arg_node.size() == 3;
ok &= arg_node[0] == 1;
ok &= arg_node[1] == 2;
ok &= arg_node[2] == 3;
}
else
{ ok &= arg_node.size() == 2;
ok &= arg_node[0] == 5;
ok &= arg_node[1] == 5;
}
//
// end of this operator
operator_vec[i] = op_usage;
//
if( i + 1 == n_usage )
json_lexer.check_next_char(']');
else
json_lexer.check_next_char(',');
}
json_lexer.check_next_char(']');
//
json_lexer.check_next_char(',');
//
ok &= operator_vec.size() == 2;
//
graph_op_enum op_enum = operator_vec[0];
ok &= op_enum == CppAD::graph::sum_graph_op;
//
op_enum = operator_vec[1];
ok &= op_enum == CppAD::graph::mul_graph_op;
// -----------------------------------------------------------------------
// dependent_vec
json_lexer.check_next_string("dependent_vec");
json_lexer.check_next_char(':');
json_lexer.check_next_char('[');
json_lexer.next_non_neg_int();
size_t n_dependent = json_lexer.token2size_t();
CppAD::vector<size_t> dependent_vec(n_dependent);
//
json_lexer.check_next_char(',');
//
// [ first_dependent, ... , last_dependent ]
json_lexer.check_next_char('[');
for(size_t i = 0; i < n_dependent; ++i)
{ json_lexer.next_float();
dependent_vec[i] = json_lexer.token2size_t();
//
if( i + 1 == n_dependent )
json_lexer.check_next_char(']');
else
json_lexer.check_next_char(',');
}
//
json_lexer.check_next_char(']');
//
ok &= dependent_vec.size() == 1;
ok &= dependent_vec[0] == 6;
// -----------------------------------------------------------------------
// }
json_lexer.check_next_char('}');
//
return ok;
}
|
