2
/* Expression parsing for plural form selection.
3
Copyright (C) 2000-2001, 2003, 2005 Free Software Foundation, Inc.
4
Written by Ulrich Drepper <drepper@cygnus.com>, 2000.
6
This program is free software; you can redistribute it and/or modify it
7
under the terms of the GNU Library General Public License as published
8
by the Free Software Foundation; either version 2, or (at your option)
11
This program is distributed in the hope that it will be useful,
12
but WITHOUT ANY WARRANTY; without even the implied warranty of
13
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14
Library General Public License for more details.
16
You should have received a copy of the GNU Library General Public
17
License along with this program; if not, write to the Free Software
18
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
21
/* For bison < 2.0, the bison generated parser uses alloca. AIX 3 forces us
22
to put this declaration at the beginning of the file. The declaration in
23
bison's skeleton file comes too late. This must come before <config.h>
24
because <config.h> may include arbitrary system headers.
25
This can go away once the AM_INTL_SUBDIR macro requires bison >= 2.0. */
26
#if defined _AIX && !defined __GNUC__
37
#include "plural-exp.h"
39
/* The main function generated by the parser is called __gettextparse,
40
but we want it to be called PLURAL_PARSE. */
42
# define __gettextparse PLURAL_PARSE
45
#define YYLEX_PARAM &((struct parse_args *) arg)->cp
46
#define YYPARSE_PARAM arg
52
unsigned long int num;
54
struct expression *exp;
58
/* Prototypes for local functions. */
59
static int yylex (YYSTYPE *lval, const char **pexp);
60
static void yyerror (const char *str);
62
/* Allocation of expressions. */
64
static struct expression *
65
new_exp (int nargs, enum operator op, struct expression * const *args)
68
struct expression *newp;
70
/* If any of the argument could not be malloc'ed, just return NULL. */
71
for (i = nargs - 1; i >= 0; i--)
75
/* Allocate a new expression. */
76
newp = (struct expression *) malloc (sizeof (*newp));
81
for (i = nargs - 1; i >= 0; i--)
82
newp->val.args[i] = args[i];
87
for (i = nargs - 1; i >= 0; i--)
88
FREE_EXPRESSION (args[i]);
93
static inline struct expression *
94
new_exp_0 (enum operator op)
96
return new_exp (0, op, NULL);
99
static inline struct expression *
100
new_exp_1 (enum operator op, struct expression *right)
102
struct expression *args[1];
105
return new_exp (1, op, args);
108
static struct expression *
109
new_exp_2 (enum operator op, struct expression *left, struct expression *right)
111
struct expression *args[2];
115
return new_exp (2, op, args);
118
static inline struct expression *
119
new_exp_3 (enum operator op, struct expression *bexp,
120
struct expression *tbranch, struct expression *fbranch)
122
struct expression *args[3];
127
return new_exp (3, op, args);
132
/* This declares that all operators have the same associativity and the
133
precedence order as in C. See [Harbison, Steele: C, A Reference Manual].
134
There is no unary minus and no bitwise operators.
135
Operators with the same syntactic behaviour have been merged into a single
136
token, to save space in the array generated by bison. */
140
%left EQUOP2 /* == != */
141
%left CMPOP2 /* < > <= >= */
142
%left ADDOP2 /* + - */
143
%left MULOP2 /* * / % */
146
%token <op> EQUOP2 CMPOP2 ADDOP2 MULOP2
156
((struct parse_args *) arg)->res = $1;
160
exp: exp '?' exp ':' exp
162
$$ = new_exp_3 (qmop, $1, $3, $5);
166
$$ = new_exp_2 (lor, $1, $3);
170
$$ = new_exp_2 (land, $1, $3);
174
$$ = new_exp_2 ($2, $1, $3);
178
$$ = new_exp_2 ($2, $1, $3);
182
$$ = new_exp_2 ($2, $1, $3);
186
$$ = new_exp_2 ($2, $1, $3);
190
$$ = new_exp_1 (lnot, $2);
194
$$ = new_exp_0 (var);
198
if (($$ = new_exp_0 (num)) != NULL)
211
FREE_EXPRESSION (struct expression *exp)
216
/* Handle the recursive case. */
220
FREE_EXPRESSION (exp->val.args[2]);
223
FREE_EXPRESSION (exp->val.args[1]);
226
FREE_EXPRESSION (exp->val.args[0]);
237
yylex (YYSTYPE *lval, const char **pexp)
239
const char *exp = *pexp;
250
if (exp[0] != ' ' && exp[0] != '\t')
259
case '0': case '1': case '2': case '3': case '4':
260
case '5': case '6': case '7': case '8': case '9':
262
unsigned long int n = result - '0';
263
while (exp[0] >= '0' && exp[0] <= '9')
289
lval->op = not_equal;
296
if (exp[0] == result)
306
lval->op = less_or_equal;
309
lval->op = less_than;
317
lval->op = greater_or_equal;
320
lval->op = greater_than;
354
/* Nothing, just return the character. */
360
/* Be safe and let the user call this function again. */
380
yyerror (const char *str)
382
/* Do nothing. We don't print error messages here. */
added
removed
intl/plural.y
