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
|
/* Grapheme cluster break function test.
Copyright (C) 2010-2022 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>. */
/* Written by Ben Pfaff <blp@cs.stanford.edu>, 2010. */
#include <config.h>
/* Specification. */
#include <unigbrk.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "unictype.h"
const char *
graphemebreakproperty_to_string (int gbp)
{
printf ("%d\n", gbp);
switch (gbp)
{
#define CASE(VALUE) case GBP_##VALUE: return #VALUE;
CASE(OTHER)
CASE(CR)
CASE(LF)
CASE(CONTROL)
CASE(EXTEND)
CASE(PREPEND)
CASE(SPACINGMARK)
CASE(L)
CASE(V)
CASE(T)
CASE(LV)
CASE(LVT)
CASE(RI)
CASE(ZWJ)
CASE(EB)
CASE(EM)
CASE(GAZ)
CASE(EBG)
}
abort ();
}
int
main (int argc, char *argv[])
{
const char *filename;
char line[1024];
int exit_code;
FILE *stream;
int lineno;
if (argc != 2)
{
fprintf (stderr, "usage: %s FILENAME\n"
"where FILENAME is the location of the GraphemeBreakTest.txt\n"
"test file.\n", argv[0]);
exit (1);
}
filename = argv[1];
stream = fopen (filename, "r");
if (stream == NULL)
{
fprintf (stderr, "error during fopen of '%s'\n", filename);
exit (1);
}
exit_code = 0;
lineno = 0;
while (fgets (line, sizeof line, stream))
{
char *comment;
const char *p;
ucs4_t prev;
int last_char_prop;
bool emoji_modifier_sequence;
bool emoji_modifier_sequence_before_last_char;
size_t ri_count;
lineno++;
comment = strchr (line, '#');
if (comment != NULL)
*comment = '\0';
if (line[strspn (line, " \t\r\n")] == '\0')
continue;
last_char_prop = -1;
emoji_modifier_sequence = false;
emoji_modifier_sequence_before_last_char = false;
ri_count = 0;
prev = 0;
p = line;
do
{
bool should_break;
ucs4_t next;
p += strspn (p, " \t\r\n");
if (!strncmp (p, "\303\267" /* ÷ */, 2))
{
should_break = true;
p += 2;
}
else if (!strncmp (p, "\303\227" /* × */, 2))
{
should_break = false;
p += 2;
}
else
{
fprintf (stderr, "%s:%d.%d: syntax error expecting '÷' or '×'\n",
filename, lineno, (int) (p - line + 1));
exit (1);
}
p += strspn (p, " \t\r\n");
if (*p == '\0')
next = 0;
else
{
unsigned int next_int;
int n;
if (sscanf (p, "%x%n", &next_int, &n) != 1)
{
fprintf (stderr, "%s:%d.%d: syntax error at '%s' "
"expecting hexadecimal Unicode code point number\n",
filename, lineno, (int) (p - line + 1), p);
exit (1);
}
p += n;
next = next_int;
}
/* Skip unsupported rules involving 3 or more characters. */
if (last_char_prop == GBP_ZWJ
&& emoji_modifier_sequence_before_last_char
&& uc_is_property_extended_pictographic (next))
{
int prev_gbp = uc_graphemeclusterbreak_property (prev);
int next_gbp = uc_graphemeclusterbreak_property (next);
fprintf (stderr, "%s:%d: skipping GB11: should join U+%04X (%s) "
"and U+%04X (%s)\n",
filename, lineno,
prev, graphemebreakproperty_to_string (prev_gbp),
next, graphemebreakproperty_to_string (next_gbp));
}
else if (uc_graphemeclusterbreak_property (next) == GBP_RI
&& ri_count % 2 != 0)
{
int prev_gbp = uc_graphemeclusterbreak_property (prev);
int next_gbp = uc_graphemeclusterbreak_property (next);
fprintf (stderr, "%s:%d: skipping GB12: should join U+%04X (%s) "
"and U+%04X (%s)\n",
filename, lineno,
prev, graphemebreakproperty_to_string (prev_gbp),
next, graphemebreakproperty_to_string (next_gbp));
}
else if (uc_is_grapheme_break (prev, next) != should_break)
{
int prev_gbp = uc_graphemeclusterbreak_property (prev);
int next_gbp = uc_graphemeclusterbreak_property (next);
fprintf (stderr, "%s:%d: should %s U+%04X (%s) and "
"U+%04X (%s)\n",
filename, lineno,
should_break ? "break" : "join",
prev, graphemebreakproperty_to_string (prev_gbp),
next, graphemebreakproperty_to_string (next_gbp));
exit_code = 1;
}
p += strspn (p, " \t\r\n");
prev = next;
emoji_modifier_sequence_before_last_char = emoji_modifier_sequence;
emoji_modifier_sequence =
(emoji_modifier_sequence
&& uc_graphemeclusterbreak_property (next) == GBP_EXTEND)
|| uc_is_property_extended_pictographic (next);
last_char_prop = uc_graphemeclusterbreak_property (next);
if (uc_graphemeclusterbreak_property (next) == GBP_RI)
ri_count++;
else
ri_count = 0;
}
while (*p != '\0');
}
return exit_code;
}
|
