1 /* PSPP - a program for statistical analysis.
2 Copyright (C) 1997-9, 2000, 2005, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
4 This program is free software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 3 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <http://www.gnu.org/licenses/>. */
18 This file is concerned with the definition of the PSPP syntax, NOT the
19 action of scanning/parsing code .
24 #include "data/identifier.h"
29 #include "libpspp/assertion.h"
31 #include "gl/c-ctype.h"
34 #define _(msgid) gettext (msgid)
38 /* Returns TYPE as a string, e.g. "ID" for T_ID. */
40 token_type_to_name (enum token_type type)
44 #define TOKEN_TYPE(TYPE) case T_##TYPE: return #TYPE;
49 return "unknown token type";
53 /* Returns an ASCII string that yields TOKEN if it appeared in a syntax file,
54 as a statically allocated constant string. This function returns NULL for
55 tokens that don't have any fixed string representation, such as identifier
58 token_type_to_string (enum token_type token)
151 /* Recognizing identifiers. */
154 is_ascii_id1 (unsigned char c)
156 return c_isalpha (c) || c == '@' || c == '#' || c == '$';
160 is_ascii_idn (unsigned char c)
162 return is_ascii_id1 (c) || isdigit (c) || c == '.' || c == '_';
165 /* Returns true if C may be the first byte in an identifier in the current
168 (PSPP is transitioning to using Unicode internally for syntax, so please
169 use lex_uc_is_id1() instead, if possible.) */
173 return is_ascii_id1 (c) || (unsigned char) c >= 128;
176 /* Returns true if C may be a byte in an identifier other than the first.
178 (PSPP is transitioning to using Unicode internally for syntax, so please
179 use lex_uc_is_idn() instead, if possible.) */
183 return is_ascii_idn (c) || (unsigned char) c >= 128;
186 /* Returns true if Unicode code point UC may be the first character in an
187 identifier in the current locale. */
189 lex_uc_is_id1 (ucs4_t uc)
191 return is_ascii_id1 (uc) || (uc >= 0x80 && uc_is_property_id_start (uc));
194 /* Returns true if Unicode code point UC may be a character in an identifier
195 other than the first. */
197 lex_uc_is_idn (ucs4_t uc)
200 ? is_ascii_id1 (uc) || isdigit (uc) || uc == '.' || uc == '_'
201 : uc >= 0x80 && uc_is_property_id_continue (uc));
204 /* Returns true if Unicode code point UC is a space that separates tokens. */
206 lex_uc_is_space (ucs4_t uc)
208 /* These are all of the Unicode characters in category Zs, Zl, or Zp. */
209 return (uc == ' ' || (uc <= 0x000d && uc >= 0x0009)
211 && (uc == 0xa0 || uc == 0x85 || uc == 0x1680 || uc == 0x180e
212 || (uc >= 0x2000 && uc <= 0x200a)
213 || uc == 0x2028 || uc == 0x2029 || uc == 0x202f
214 || uc == 0x205f || uc == 0x3000)));
218 /* Returns the length of the longest prefix of STRING that forms
219 a valid identifier. Returns zero if STRING does not begin
220 with a valid identifier. */
222 lex_id_get_length (struct substring string)
225 if (!ss_is_empty (string) && lex_is_id1 (ss_first (string)))
228 while (length < ss_length (string)
229 && lex_is_idn (ss_at (string, length)))
235 /* Comparing identifiers. */
237 /* Returns true if TOKEN is a case-insensitive match for KEYWORD.
239 Keywords match if one of the following is true: KEYWORD and
240 TOKEN are identical, or TOKEN is at least 3 characters long
241 and those characters are identical to KEYWORD. (Letters that
242 differ only in case are considered identical.)
244 KEYWORD must be ASCII, but TOKEN may be ASCII or UTF-8. */
246 lex_id_match (struct substring keyword, struct substring token)
248 return lex_id_match_n (keyword, token, 3);
251 /* Returns true if TOKEN is a case-insensitive match for at least
252 the first N characters of KEYWORD.
254 KEYWORD must be ASCII, but TOKEN may be ASCII or UTF-8. */
256 lex_id_match_n (struct substring keyword, struct substring token, size_t n)
258 size_t token_len = ss_length (token);
259 size_t keyword_len = ss_length (keyword);
261 if (token_len >= n && token_len < keyword_len)
262 return ss_equals_case (ss_head (keyword, token_len), token);
264 return ss_equals_case (keyword, token);
267 /* Table of keywords. */
271 const struct substring identifier;
274 static const struct keyword keywords[] =
276 { T_AND, SS_LITERAL_INITIALIZER ("AND") },
277 { T_OR, SS_LITERAL_INITIALIZER ("OR") },
278 { T_NOT, SS_LITERAL_INITIALIZER ("NOT") },
279 { T_EQ, SS_LITERAL_INITIALIZER ("EQ") },
280 { T_GE, SS_LITERAL_INITIALIZER ("GE") },
281 { T_GT, SS_LITERAL_INITIALIZER ("GT") },
282 { T_LE, SS_LITERAL_INITIALIZER ("LE") },
283 { T_LT, SS_LITERAL_INITIALIZER ("LT") },
284 { T_NE, SS_LITERAL_INITIALIZER ("NE") },
285 { T_ALL, SS_LITERAL_INITIALIZER ("ALL") },
286 { T_BY, SS_LITERAL_INITIALIZER ("BY") },
287 { T_TO, SS_LITERAL_INITIALIZER ("TO") },
288 { T_WITH, SS_LITERAL_INITIALIZER ("WITH") },
290 static const size_t keyword_cnt = sizeof keywords / sizeof *keywords;
292 /* Returns true if TOKEN is representable as a keyword. */
294 lex_is_keyword (enum token_type token)
296 const struct keyword *kw;
297 for (kw = keywords; kw < &keywords[keyword_cnt]; kw++)
298 if (kw->token == token)
303 /* Returns the proper token type, either T_ID or a reserved
304 keyword enum, for ID. */
306 lex_id_to_token (struct substring id)
308 if (ss_length (id) >= 2 && ss_length (id) <= 4)
310 const struct keyword *kw;
311 for (kw = keywords; kw < &keywords[keyword_cnt]; kw++)
312 if (ss_equals_case (kw->identifier, id))