Repository navigation
Expand file tree
/
Copy pathsgf.cc
More file actions
320 lines (283 loc) · 8.37 KB
/
Copy pathsgf.cc
File metadata and controls
320 lines (283 loc) · 8.37 KB
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
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
// Copyright 2018 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "cc/sgf.h"
#include <cctype>
#include <iostream>
#include <utility>
#include "absl/strings/ascii.h"
#include "absl/strings/str_cat.h"
#include "absl/strings/str_join.h"
#include "cc/check.h"
#include "cc/constants.h"
namespace minigo {
namespace sgf {
namespace {
class Parser {
public:
Parser(absl::string_view contents, std::string* error)
: original_contents_(contents), contents_(contents), error_(error) {}
bool Parse(std::vector<Ast::Tree>* trees) {
*error_ = "";
while (SkipWhitespace()) {
trees->emplace_back();
if (!ParseTree(&trees->back())) {
return false;
}
}
return done();
}
bool done() const { return contents_.empty(); }
char peek() const { return contents_[0]; }
private:
bool ParseTree(Ast::Tree* tree) {
if (!Read('(')) {
return false;
}
if (!ParseSequence(tree)) {
return false;
}
for (;;) {
if (!SkipWhitespace()) {
return Error("reached EOF when parsing tree");
}
if (peek() == '(') {
tree->children.emplace_back();
if (!ParseTree(&tree->children.back())) {
return false;
}
} else {
return Read(')');
}
}
}
bool ParseSequence(Ast::Tree* tree) {
if (!SkipWhitespace()) {
return Error("reached EOF when parsing sequence");
}
for (;;) {
if (peek() != ';') {
// All valid trees must contain at least one node.
if (tree->nodes.empty()) {
return Error("tree has no nodes");
}
return true;
}
Read(';');
tree->nodes.emplace_back();
if (!ParseNode(&tree->nodes.back())) {
return false;
}
}
}
bool ParseNode(Ast::Node* node) {
for (;;) {
if (!SkipWhitespace()) {
return Error("reached EOF when parsing node");
}
if (!absl::ascii_isupper(peek())) {
return true;
}
node->properties.emplace_back();
if (!ParseProperty(&node->properties.back())) {
return false;
}
}
}
bool ParseProperty(Ast::Property* prop) {
if (!ReadTo('[', &prop->id)) {
return false;
}
if (prop->id.empty()) {
return Error("property has an empty ID");
}
bool read_value = false;
for (;;) {
if (!SkipWhitespace()) {
return Error("reached EOF when parsing property ", prop->id);
}
if (peek() != '[') {
if (!read_value) {
return Error("property ", prop->id, " has no values");
}
return true;
}
Read('[');
read_value = true;
absl::string_view value;
if (!ReadTo(']', &value)) {
return false;
}
prop->values.push_back(value);
Read(']');
}
}
bool Read(char c) {
if (done()) {
return Error("expected '", absl::string_view(&c, 1), "', got EOF");
}
if (contents_[0] != c) {
return Error("expected '", absl::string_view(&c, 1), "', got '",
contents_.substr(0, 1), "'");
}
contents_ = contents_.substr(1);
return true;
}
bool ReadTo(char c, absl::string_view* result) {
for (size_t i = 0; i < contents_.size(); ++i) {
if (contents_[i] == c) {
*result = contents_.substr(0, i);
contents_ = contents_.substr(i);
return result;
}
}
return Error("reached EOF before finding '", absl::string_view(&c, 1), "'");
}
// Skip over whitespace.
// Updates contents_ and returns true if there are non-whitespace characters
// remaining. Leaves contents_ alone and returns false if only whitespace
// characters remain.
bool SkipWhitespace() {
contents_ = absl::StripLeadingAsciiWhitespace(contents_);
return !contents_.empty();
}
template <typename... Args>
bool Error(Args&&... args) {
// Find the line & column number the error occured at.
int line = 1;
int col = 1;
for (auto* c = original_contents_.data(); c != contents_.data(); ++c) {
if (*c == '\n') {
++line;
col = 1;
} else {
++col;
}
}
*error_ = absl::StrCat("ERROR at line:", line, " col:", col, ": ", args...);
return false;
}
absl::string_view original_contents_;
absl::string_view contents_;
std::string* error_;
};
} // namespace
std::string Ast::Property::ToString() const {
return absl::StrCat(id, "[", absl::StrJoin(values, "]["), "]");
}
std::string Ast::Node::ToString() const {
std::string str = ";";
for (const auto& property : properties) {
absl::StrAppend(&str, property.ToString());
}
return str;
}
const Ast::Property* Ast::Node::FindProperty(absl::string_view id) const {
for (const auto& property : properties) {
if (property.id == id) {
return &property;
}
}
return nullptr;
}
std::string Ast::Tree::ToString() const {
std::vector<std::string> parts;
for (const auto& node : nodes) {
parts.push_back(node.ToString());
}
for (const auto& child : children) {
parts.push_back(child.ToString());
}
return absl::StrCat("(", absl::StrJoin(parts, "\n"), ")");
}
bool Ast::Parse(std::string contents) {
error_ = "";
trees_.clear();
contents_ = std::move(contents);
return Parser(contents_, &error_).Parse(&trees_);
}
std::string CreateSgfString(absl::Span<const MoveWithComment> moves,
const CreateSgfOptions& options) {
std::string str = "(";
// TODO(tommadams): Clean this up once the Abseil team releases proper
// formatting functions.
absl::StrAppend(
&str, absl::StrCat(";GM[1]FF[4]CA[UTF-8]AP[Minigo_sgfgenerator]RU[",
options.ruleset, "]\n", "SZ[", kN, "]KM[",
options.komi, "]PW[", options.white_name, "]PB[",
options.black_name, "]RE[", options.result, "]\n"));
if (!options.game_comment.empty()) {
absl::StrAppend(&str, "C[", options.game_comment, "]\n");
}
for (const auto& move_with_comment : moves) {
Move move = move_with_comment.move;
MG_CHECK(move.color == Color::kBlack || move.color == Color::kWhite);
const char* color = move.color == Color::kBlack ? "B" : "W";
absl::StrAppend(&str, absl::StrCat(";", color, "[", move.c.ToSgf(), "]"));
if (!move_with_comment.comment.empty()) {
absl::StrAppend(&str, "C[", move_with_comment.comment, "]");
}
}
absl::StrAppend(&str, ")\n");
return str;
}
std::vector<Move> GetMainLineMoves(const Ast::Tree& tree) {
std::vector<Move> moves;
const auto* t = &tree;
const Ast::Property* prop;
for (;;) {
// Extract all the nodes out of this tree.
for (const auto& node : t->nodes) {
Move move;
if ((prop = node.FindProperty("B")) != nullptr) {
move.color = Color::kBlack;
} else if ((prop = node.FindProperty("W")) != nullptr) {
move.color = Color::kWhite;
} else {
continue;
}
// TODO(tommadams): Change this to a LOG(FATAL) once we get glog
// integrated.
if (prop->values.empty()) {
std::cerr << "Skipping node " << node.ToString() << " because property "
<< prop->ToString() << " has no values";
continue;
}
move.c = Coord::FromSgf(prop->values[0]);
moves.push_back(std::move(move));
}
// If the tree has no children, we're done.
if (t->children.empty()) {
break;
}
// Otherwise, traverse into the first child tree (which is the main line).
t = &t->children[0];
}
return moves;
}
std::ostream& operator<<(std::ostream& os, const MoveWithComment& move) {
MG_CHECK(move.move.color == Color::kBlack ||
move.move.color == Color::kWhite);
if (move.move.color == Color::kBlack) {
os << "B";
} else {
os << "W";
}
os << "[" << move.move.c.ToSgf() << "]";
if (!move.comment.empty()) {
os << "C[" << move.comment << "]";
}
return os;
}
} // namespace sgf
} // namespace minigo