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
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
|
// **************************************************************************
// * This file is part of the FreeFileSync project. It is distributed under *
// * GNU General Public License: http://www.gnu.org/licenses/gpl.html *
// * Copyright (C) Zenju (zenju AT gmx DOT de) - All Rights Reserved *
// **************************************************************************
#ifndef PARSE_PLURAL_H_INCLUDED
#define PARSE_PLURAL_H_INCLUDED
#include <memory>
#include <functional>
#include <zen/string_base.h>
namespace parse_plural
{
//expression interface
struct Expression { virtual ~Expression() {} };
template <class T>
struct Expr : public Expression
{
typedef T ValueType;
virtual ValueType eval() const = 0;
};
class ParsingError {};
class PluralForm
{
public:
PluralForm(const std::string& stream); //throw ParsingError
int getForm(int n) const { n_ = n ; return expr->eval(); }
private:
std::shared_ptr<Expr<int>> expr;
mutable int n_;
};
//--------------------------- implementation ---------------------------
//http://www.gnu.org/software/hello/manual/gettext/Plural-forms.html
//http://translate.sourceforge.net/wiki/l10n/pluralforms
/*
Grammar for Plural forms parser
-------------------------------
expression:
conditional-expression
conditional-expression:
logical-or-expression
logical-or-expression ? expression : expression
logical-or-expression:
logical-and-expression
logical-or-expression || logical-and-expression
logical-and-expression:
equality-expression
logical-and-expression && equality-expression
equality-expression:
relational-expression
relational-expression == relational-expression
relational-expression != relational-expression
relational-expression:
multiplicative-expression
multiplicative-expression > multiplicative-expression
multiplicative-expression < multiplicative-expression
multiplicative-expression >= multiplicative-expression
multiplicative-expression <= multiplicative-expression
multiplicative-expression:
pm-expression
multiplicative-expression % pm-expression
pm-expression:
variable-number-n-expression
constant-number-expression
( expression )
.po format,e.g.: (n%10==1 && n%100!=11 ? 0 : n%10>=2 && n%10<=4 && (n%100<10 || n%100>=20) ? 1 : 2)
*/
namespace implementation
{
//specific binary expression based on STL function objects
template <class StlOp>
struct BinaryExp : public Expr<typename StlOp::result_type>
{
typedef std::shared_ptr<Expr<typename StlOp::first_argument_type >> ExpLhs;
typedef std::shared_ptr<Expr<typename StlOp::second_argument_type>> ExpRhs;
BinaryExp(const ExpLhs& lhs, const ExpRhs& rhs, StlOp biop) : lhs_(lhs), rhs_(rhs), biop_(biop) { assert(lhs && rhs); }
virtual typename StlOp::result_type eval() const { return biop_(lhs_->eval(), rhs_->eval()); }
private:
ExpLhs lhs_;
ExpRhs rhs_;
StlOp biop_;
};
template <class StlOp> inline
std::shared_ptr<BinaryExp<StlOp>> makeBiExp(const std::shared_ptr<Expression>& lhs, const std::shared_ptr<Expression>& rhs, StlOp biop) //throw ParsingError
{
auto exLeft = std::dynamic_pointer_cast<Expr<typename StlOp::first_argument_type >>(lhs);
auto exRight = std::dynamic_pointer_cast<Expr<typename StlOp::second_argument_type>>(rhs);
if (!exLeft || !exRight)
throw ParsingError();
return std::make_shared<BinaryExp<StlOp>>(exLeft, exRight, biop);
}
template <class T>
struct ConditionalExp : public Expr<T>
{
ConditionalExp(const std::shared_ptr<Expr<bool>>& ifExp,
const std::shared_ptr<Expr<T>>& thenExp,
const std::shared_ptr<Expr<T>>& elseExp) : ifExp_(ifExp), thenExp_(thenExp), elseExp_(elseExp) { assert(ifExp && thenExp && elseExp); }
virtual typename Expr<T>::ValueType eval() const { return ifExp_->eval() ? thenExp_->eval() : elseExp_->eval(); }
private:
std::shared_ptr<Expr<bool>> ifExp_;
std::shared_ptr<Expr<T>> thenExp_;
std::shared_ptr<Expr<T>> elseExp_;
};
struct ConstNumberExp : public Expr<int>
{
ConstNumberExp(int n) : n_(n) {}
virtual int eval() const { return n_; }
private:
int n_;
};
struct VariableNumberNExp : public Expr<int>
{
VariableNumberNExp(int& n) : n_(n) {}
virtual int eval() const { return n_; }
private:
int& n_;
};
//-------------------------------------------------------------------------------
struct Token
{
enum Type
{
TK_TERNARY_QUEST,
TK_TERNARY_COLON,
TK_OR,
TK_AND,
TK_EQUAL,
TK_NOT_EQUAL,
TK_LESS,
TK_LESS_EQUAL,
TK_GREATER,
TK_GREATER_EQUAL,
TK_MODULUS,
TK_VARIABLE_N,
TK_CONST_NUMBER,
TK_BRACKET_LEFT,
TK_BRACKET_RIGHT,
TK_END
};
Token(Type t) : type(t), number(0) {}
Token(int num) : type(TK_CONST_NUMBER), number(num) {}
Type type;
int number; //if type == TK_CONST_NUMBER
};
class Scanner
{
public:
Scanner(const std::string& stream) : stream_(stream), pos(stream_.begin())
{
tokens.push_back(std::make_pair("?" , Token::TK_TERNARY_QUEST));
tokens.push_back(std::make_pair(":" , Token::TK_TERNARY_COLON));
tokens.push_back(std::make_pair("||", Token::TK_OR ));
tokens.push_back(std::make_pair("&&", Token::TK_AND ));
tokens.push_back(std::make_pair("==", Token::TK_EQUAL ));
tokens.push_back(std::make_pair("!=", Token::TK_NOT_EQUAL ));
tokens.push_back(std::make_pair("<=", Token::TK_LESS_EQUAL ));
tokens.push_back(std::make_pair("<" , Token::TK_LESS ));
tokens.push_back(std::make_pair(">=", Token::TK_GREATER_EQUAL));
tokens.push_back(std::make_pair(">" , Token::TK_GREATER ));
tokens.push_back(std::make_pair("%" , Token::TK_MODULUS ));
tokens.push_back(std::make_pair("n" , Token::TK_VARIABLE_N ));
tokens.push_back(std::make_pair("N" , Token::TK_VARIABLE_N ));
tokens.push_back(std::make_pair("(" , Token::TK_BRACKET_LEFT ));
tokens.push_back(std::make_pair(")" , Token::TK_BRACKET_RIGHT));
}
Token nextToken()
{
//skip whitespace
pos = std::find_if(pos, stream_.end(), [](char c) { return !zen::isWhiteSpace(c); });
if (pos == stream_.end())
return Token::TK_END;
for (auto iter = tokens.begin(); iter != tokens.end(); ++iter)
if (startsWith(iter->first))
{
pos += iter->first.size();
return Token(iter->second);
}
auto digitEnd = std::find_if(pos, stream_.end(), [](char c) { return !zen::isDigit(c); });
if (digitEnd != pos)
{
int number = zen::stringTo<int>(std::string(pos, digitEnd));
pos = digitEnd;
return number;
}
throw ParsingError(); //unknown token
}
private:
bool startsWith(const std::string& prefix) const
{
if (stream_.end() - pos < static_cast<ptrdiff_t>(prefix.size()))
return false;
return std::equal(prefix.begin(), prefix.end(), pos);
}
typedef std::vector<std::pair<std::string, Token::Type> > TokenList;
TokenList tokens;
const std::string stream_;
std::string::const_iterator pos;
};
//-------------------------------------------------------------------------------
class Parser
{
public:
Parser(const std::string& stream, int& n) :
scn(stream),
tk(scn.nextToken()),
n_(n) {}
std::shared_ptr<Expr<int>> parse() //throw ParsingError; return value always bound!
{
auto e = std::dynamic_pointer_cast<Expr<int>>(parseExpression()); //throw ParsingError
if (!e)
throw ParsingError();
expectToken(Token::TK_END);
return e;
}
private:
std::shared_ptr<Expression> parseExpression() { return parseConditional(); }//throw ParsingError
std::shared_ptr<Expression> parseConditional() //throw ParsingError
{
std::shared_ptr<Expression> e = parseLogicalOr();
if (token().type == Token::TK_TERNARY_QUEST)
{
nextToken();
auto ifExp = std::dynamic_pointer_cast<Expr<bool>>(e);
auto thenExp = std::dynamic_pointer_cast<Expr<int>>(parseExpression()); //associativity: <-
expectToken(Token::TK_TERNARY_COLON);
nextToken();
auto elseExp = std::dynamic_pointer_cast<Expr<int>>(parseExpression()); //
if (!ifExp || !thenExp || !elseExp)
throw ParsingError();
return std::make_shared<ConditionalExp<int>>(ifExp, thenExp, elseExp);
}
return e;
}
std::shared_ptr<Expression> parseLogicalOr()
{
std::shared_ptr<Expression> e = parseLogicalAnd();
while (token().type == Token::TK_OR) //associativity: ->
{
nextToken();
std::shared_ptr<Expression> rhs = parseLogicalAnd();
e = makeBiExp(e, rhs, std::logical_or<bool>()); //throw ParsingError
}
return e;
}
std::shared_ptr<Expression> parseLogicalAnd()
{
std::shared_ptr<Expression> e = parseEquality();
while (token().type == Token::TK_AND) //associativity: ->
{
nextToken();
std::shared_ptr<Expression> rhs = parseEquality();
e = makeBiExp(e, rhs, std::logical_and<bool>()); //throw ParsingError
}
return e;
}
std::shared_ptr<Expression> parseEquality()
{
std::shared_ptr<Expression> e = parseRelational();
Token::Type t = token().type;
if (t == Token::TK_EQUAL || //associativity: n/a
t == Token::TK_NOT_EQUAL)
{
nextToken();
std::shared_ptr<Expression> rhs = parseRelational();
if (t == Token::TK_EQUAL) return makeBiExp(e, rhs, std::equal_to <int>()); //throw ParsingError
if (t == Token::TK_NOT_EQUAL) return makeBiExp(e, rhs, std::not_equal_to<int>()); //
}
return e;
}
std::shared_ptr<Expression> parseRelational()
{
std::shared_ptr<Expression> e = parseMultiplicative();
Token::Type t = token().type;
if (t == Token::TK_LESS || //associativity: n/a
t == Token::TK_LESS_EQUAL ||
t == Token::TK_GREATER ||
t == Token::TK_GREATER_EQUAL)
{
nextToken();
std::shared_ptr<Expression> rhs = parseMultiplicative();
if (t == Token::TK_LESS) return makeBiExp(e, rhs, std::less <int>()); //
if (t == Token::TK_LESS_EQUAL) return makeBiExp(e, rhs, std::less_equal <int>()); //throw ParsingError
if (t == Token::TK_GREATER) return makeBiExp(e, rhs, std::greater <int>()); //
if (t == Token::TK_GREATER_EQUAL) return makeBiExp(e, rhs, std::greater_equal<int>()); //
}
return e;
}
std::shared_ptr<Expression> parseMultiplicative()
{
std::shared_ptr<Expression> e = parsePrimary();
while (token().type == Token::TK_MODULUS) //associativity: ->
{
nextToken();
std::shared_ptr<Expression> rhs = parsePrimary();
//"compile-time" check: n % 0
if (auto literal = std::dynamic_pointer_cast<ConstNumberExp>(rhs))
if (literal->eval() == 0)
throw ParsingError();
e = makeBiExp(e, rhs, std::modulus<int>()); //throw ParsingError
}
return e;
}
std::shared_ptr<Expression> parsePrimary()
{
if (token().type == Token::TK_VARIABLE_N)
{
nextToken();
return std::make_shared<VariableNumberNExp>(n_);
}
else if (token().type == Token::TK_CONST_NUMBER)
{
const int number = token().number;
nextToken();
return std::make_shared<ConstNumberExp>(number);
}
else if (token().type == Token::TK_BRACKET_LEFT)
{
nextToken();
std::shared_ptr<Expression> e = parseExpression();
expectToken(Token::TK_BRACKET_RIGHT);
nextToken();
return e;
}
else
throw ParsingError();
}
void nextToken() { tk = scn.nextToken(); }
const Token& token() const { return tk; }
void expectToken(Token::Type t) //throw ParsingError
{
if (token().type != t)
throw ParsingError();
}
Scanner scn;
Token tk;
int& n_;
};
}
inline
PluralForm::PluralForm(const std::string& stream) : expr(implementation::Parser(stream, n_).parse()) {} //throw ParsingError
}
#endif // PARSE_PLURAL_H_INCLUDED
|