dlls/msi/tokenize.c

   1 /*
   2 ** 2001 September 15
   3 **
   4 ** The author disclaims copyright to this source code.  In place of
   5 ** a legal notice, here is a blessing:
   6 **
   7 **    May you do good and not evil.
   8 **    May you find forgiveness for yourself and forgive others.
   9 **    May you share freely, never taking more than you give.
  10 **
  11 *************************************************************************
  12 ** An tokenizer for SQL
  13 **
  14 ** This file contains C code that splits an SQL input string up into
  15 ** individual tokens and sends those tokens one-by-one over to the
  16 ** parser for analysis.
  17 */
  18
  19 #include <ctype.h>
  20 #include <stdarg.h>
  21 #include <stdlib.h>
  22
  23 #include "windef.h"
  24 #include "winbase.h"
  25 #include "wine/debug.h"
  26 #include "wine/unicode.h"
  27 #include "query.h"
  28 #include "sql.tab.h"
  29
  30 WINE_DEFAULT_DEBUG_CHANNEL(msi);
  31
  32 /*
  33 ** All the keywords of the SQL language are stored as in a hash
  34 ** table composed of instances of the following structure.
  35 */
  36 typedef struct Keyword Keyword;
  37 struct Keyword {
  38   const WCHAR *zName;             /* The keyword name */
  39   int tokenType;           /* The token value for this keyword */
  40 };
  41
  42 #define MAX_TOKEN_LEN 11
  43
  44 static const WCHAR ABORT_W[] = { 'A','B','O','R','T',0 };
  45 static const WCHAR AFTER_W[] = { 'A','F','T','E','R',0 };
  46 static const WCHAR ALTER_W[] = { 'A','L','T','E','R',0 };
  47 static const WCHAR ALL_W[] = { 'A','L','L',0 };
  48 static const WCHAR AND_W[] = { 'A','N','D',0 };
  49 static const WCHAR AS_W[] = { 'A','S',0 };
  50 static const WCHAR ASC_W[] = { 'A','S','C',0 };
  51 static const WCHAR BEFORE_W[] = { 'B','E','F','O','R','E',0 };
  52 static const WCHAR BEGIN_W[] = { 'B','E','G','I','N','W',0 };
  53 static const WCHAR BETWEEN_W[] = { 'B','E','T','W','E','E','N',0 };
  54 static const WCHAR BY_W[] = { 'B','Y',0 };
  55 static const WCHAR CASCADE_W[] = { 'C','A','S','C','A','D','E',0 };
  56 static const WCHAR CASE_W[] = { 'C','A','S','E',0 };
  57 static const WCHAR CHAR_W[] = { 'C','H','A','R',0 };
  58 static const WCHAR CHARACTER_W[] = { 'C','H','A','R','A','C','T','E','R',0 };
  59 static const WCHAR CHECK_W[] = { 'C','H','E','C','K',0 };
  60 static const WCHAR CLUSTER_W[] = { 'C','L','U','S','T','E','R',0 };
  61 static const WCHAR COLLATE_W[] = { 'C','O','L','L','A','T','E',0 };
  62 static const WCHAR COMMIT_W[] = { 'C','O','M','M','I','T',0 };
  63 static const WCHAR CONFLICT_W[] = { 'C','O','N','F','L','I','C','T',0 };
  64 static const WCHAR CONSTRAINT_W[] = { 'C','O','N','S','T','R','A','I','N','T',0 };
  65 static const WCHAR COPY_W[] = { 'C','O','P','Y',0 };
  66 static const WCHAR CREATE_W[] = { 'C','R','E','A','T','E',0 };
  67 static const WCHAR CROSS_W[] = { 'C','R','O','S','S',0 };
  68 static const WCHAR DEFAULT_W[] = { 'D','E','F','A','U','L','T',0 };
  69 static const WCHAR DEFERRED_W[] = { 'D','E','F','E','R','R','E','D',0 };
  70 static const WCHAR DEFERRABLE_W[] = { 'D','E','F','E','R','R','A','B','L','E',0 };
  71 static const WCHAR DELETE_W[] = { 'D','E','L','E','T','E',0 };
  72 static const WCHAR DELIMITERS_W[] = { 'D','E','L','I','M','I','T','E','R','S',0 };
  73 static const WCHAR DESC_W[] = { 'D','E','S','C',0 };
  74 static const WCHAR DISTINCT_W[] = { 'D','I','S','T','I','N','C','T',0 };
  75 static const WCHAR DROP_W[] = { 'D','R','O','P',0 };
  76 static const WCHAR END_W[] = { 'E','N','D',0 };
  77 static const WCHAR EACH_W[] = { 'E','A','C','H',0 };
  78 static const WCHAR ELSE_W[] = { 'E','L','S','E',0 };
  79 static const WCHAR EXCEPT_W[] = { 'E','X','C','E','P','T',0 };
  80 static const WCHAR EXPLAIN_W[] = { 'E','X','P','L','A','I','N',0 };
  81 static const WCHAR FAIL_W[] = { 'F','A','I','L',0 };
  82 static const WCHAR FOR_W[] = { 'F','O','R',0 };
  83 static const WCHAR FOREIGN_W[] = { 'F','O','R','E','I','G','N',0 };
  84 static const WCHAR FREE_W[] = { 'F','R','E','E',0 };
  85 static const WCHAR FROM_W[] = { 'F','R','O','M',0 };
  86 static const WCHAR FULL_W[] = { 'F','U','L','L',0 };
  87 static const WCHAR GLOB_W[] = { 'G','L','O','B',0 };
  88 static const WCHAR GROUP_W[] = { 'G','R','O','U','P',0 };
  89 static const WCHAR HAVING_W[] = { 'H','A','V','I','N','G',0 };
  90 static const WCHAR HOLD_W[] = { 'H','O','L','D',0 };
  91 static const WCHAR IGNORE_W[] = { 'I','G','N','O','R','E',0 };
  92 static const WCHAR IMMEDIATE_W[] = { 'I','M','M','E','D','I','A','T','E',0 };
  93 static const WCHAR IN_W[] = { 'I','N',0 };
  94 static const WCHAR INDEX_W[] = { 'I','N','D','E','X',0 };
  95 static const WCHAR INITIALLY_W[] = { 'I','N','I','T','I','A','L','L','Y',0 };
  96 static const WCHAR INNER_W[] = { 'I','N','N','E','R',0 };
  97 static const WCHAR INSERT_W[] = { 'I','N','S','E','R','T',0 };
  98 static const WCHAR INSTEAD_W[] = { 'I','N','S','T','E','A','D',0 };
  99 static const WCHAR INT_W[] = { 'I','N','T',0 };
 100 static const WCHAR INTERSECT_W[] = { 'I','N','T','E','R','S','E','C','T',0 };
 101 static const WCHAR INTO_W[] = { 'I','N','T','O',0 };
 102 static const WCHAR IS_W[] = { 'I','S',0 };
 103 static const WCHAR ISNULL_W[] = { 'I','S','N','U','L','L',0 };
 104 static const WCHAR JOIN_W[] = { 'J','O','I','N',0 };
 105 static const WCHAR KEY_W[] = { 'K','E','Y',0 };
 106 static const WCHAR LEFT_W[] = { 'L','E','F','T',0 };
 107 static const WCHAR LIKE_W[] = { 'L','I','K','E',0 };
 108 static const WCHAR LIMIT_W[] = { 'L','I','M','I','T',0 };
 109 static const WCHAR LOCALIZABLE_W[] = { 'L','O','C','A','L','I','Z','A','B','L','E',0 };
 110 static const WCHAR LONG_W[] = { 'L','O','N','G',0 };
 111 static const WCHAR LONGCHAR_W[] = { 'L','O','N','G','C','H','A','R',0 };
 112 static const WCHAR MATCH_W[] = { 'M','A','T','C','H',0 };
 113 static const WCHAR NATURAL_W[] = { 'N','A','T','U','R','A','L',0 };
 114 static const WCHAR NOT_W[] = { 'N','O','T',0 };
 115 static const WCHAR NOTNULL_W[] = { 'N','O','T','N','U','L','L',0 };
 116 static const WCHAR NULL_W[] = { 'N','U','L','L',0 };
 117 static const WCHAR OBJECT_W[] = { 'O','B','J','E','C','T',0 };
 118 static const WCHAR OF_W[] = { 'O','F',0 };
 119 static const WCHAR OFFSET_W[] = { 'O','F','F','S','E','T',0 };
 120 static const WCHAR ON_W[] = { 'O','N',0 };
 121 static const WCHAR OR_W[] = { 'O','R',0 };
 122 static const WCHAR ORDER_W[] = { 'O','R','D','E','R',0 };
 123 static const WCHAR OUTER_W[] = { 'O','U','T','E','R',0 };
 124 static const WCHAR PRAGMA_W[] = { 'P','R','A','G','M','A',0 };
 125 static const WCHAR PRIMARY_W[] = { 'P','R','I','M','A','R','Y',0 };
 126 static const WCHAR RAISE_W[] = { 'R','A','I','S','E',0 };
 127 static const WCHAR REFERENCES_W[] = { 'R','E','F','E','R','E','N','C','E','S',0 };
 128 static const WCHAR REPLACE_W[] = { 'R','E','P','L','A','C','E',0 };
 129 static const WCHAR RESTRICT_W[] = { 'R','E','S','T','R','I','C','T',0 };
 130 static const WCHAR RIGHT_W[] = { 'R','I','G','H','T',0 };
 131 static const WCHAR ROLLBACK_W[] = { 'R','O','L','L','B','A','C','K',0 };
 132 static const WCHAR ROW_W[] = { 'R','O','W',0 };
 133 static const WCHAR SELECT_W[] = { 'S','E','L','E','C','T',0 };
 134 static const WCHAR SET_W[] = { 'S','E','T',0 };
 135 static const WCHAR SHORT_W[] = { 'S','H','O','R','T',0 };
 136 static const WCHAR STATEMENT_W[] = { 'S','T','A','T','E','M','E','N','T',0 };
 137 static const WCHAR TABLE_W[] = { 'T','A','B','L','E',0 };
 138 static const WCHAR TEMP_W[] = { 'T','E','M','P',0 };
 139 static const WCHAR TEMPORARY_W[] = { 'T','E','M','P','O','R','A','R','Y',0 };
 140 static const WCHAR THEN_W[] = { 'T','H','E','N',0 };
 141 static const WCHAR TRANSACTION_W[] = { 'T','R','A','N','S','A','C','T','I','O','N',0 };
 142 static const WCHAR TRIGGER_W[] = { 'T','R','I','G','G','E','R',0 };
 143 static const WCHAR UNION_W[] = { 'U','N','I','O','N',0 };
 144 static const WCHAR UNIQUE_W[] = { 'U','N','I','Q','U','E',0 };
 145 static const WCHAR UPDATE_W[] = { 'U','P','D','A','T','E',0 };
 146 static const WCHAR USING_W[] = { 'U','S','I','N','G',0 };
 147 static const WCHAR VACUUM_W[] = { 'V','A','C','U','U','M',0 };
 148 static const WCHAR VALUES_W[] = { 'V','A','L','U','E','S',0 };
 149 static const WCHAR VIEW_W[] = { 'V','I','E','W',0 };
 150 static const WCHAR WHEN_W[] = { 'W','H','E','N',0 };
 151 static const WCHAR WHERE_W[] = { 'W','H','E','R','E',0 };
 152
 153 /*
 154 ** These are the keywords
 155 */
 156 static const Keyword aKeywordTable[] = {
 157   { ABORT_W, TK_ABORT },
 158   { AFTER_W, TK_AFTER },
 159   { ALTER_W, TK_ALTER },
 160   { ALL_W, TK_ALL },
 161   { AND_W, TK_AND },
 162   { AS_W, TK_AS },
 163   { ASC_W, TK_ASC },
 164   { BEFORE_W, TK_BEFORE },
 165   { BEGIN_W, TK_BEGIN },
 166   { BETWEEN_W, TK_BETWEEN },
 167   { BY_W, TK_BY },
 168   { CASCADE_W, TK_CASCADE },
 169   { CASE_W, TK_CASE },
 170   { CHAR_W, TK_CHAR },
 171   { CHARACTER_W, TK_CHAR },
 172   { CHECK_W, TK_CHECK },
 173   { CLUSTER_W, TK_CLUSTER },
 174   { COLLATE_W, TK_COLLATE },
 175   { COMMIT_W, TK_COMMIT },
 176   { CONFLICT_W, TK_CONFLICT },
 177   { CONSTRAINT_W, TK_CONSTRAINT },
 178   { COPY_W, TK_COPY },
 179   { CREATE_W, TK_CREATE },
 180   { CROSS_W, TK_JOIN_KW },
 181   { DEFAULT_W, TK_DEFAULT },
 182   { DEFERRED_W, TK_DEFERRED },
 183   { DEFERRABLE_W, TK_DEFERRABLE },
 184   { DELETE_W, TK_DELETE },
 185   { DELIMITERS_W, TK_DELIMITERS },
 186   { DESC_W, TK_DESC },
 187   { DISTINCT_W, TK_DISTINCT },
 188   { DROP_W, TK_DROP },
 189   { END_W, TK_END },
 190   { EACH_W, TK_EACH },
 191   { ELSE_W, TK_ELSE },
 192   { EXCEPT_W, TK_EXCEPT },
 193   { EXPLAIN_W, TK_EXPLAIN },
 194   { FAIL_W, TK_FAIL },
 195   { FOR_W, TK_FOR },
 196   { FOREIGN_W, TK_FOREIGN },
 197   { FROM_W, TK_FROM },
 198   { FULL_W, TK_JOIN_KW },
 199   { GLOB_W, TK_GLOB },
 200   { GROUP_W, TK_GROUP },
 201   { HAVING_W, TK_HAVING },
 202   { HOLD_W, TK_HOLD },
 203   { IGNORE_W, TK_IGNORE },
 204   { IMMEDIATE_W, TK_IMMEDIATE },
 205   { IN_W, TK_IN },
 206   { INDEX_W, TK_INDEX },
 207   { INITIALLY_W, TK_INITIALLY },
 208   { INNER_W, TK_JOIN_KW },
 209   { INSERT_W, TK_INSERT },
 210   { INSTEAD_W, TK_INSTEAD },
 211   { INT_W, TK_INT },
 212   { INTERSECT_W, TK_INTERSECT },
 213   { INTO_W, TK_INTO },
 214   { IS_W, TK_IS },
 215   { ISNULL_W, TK_ISNULL },
 216   { JOIN_W, TK_JOIN },
 217   { KEY_W, TK_KEY },
 218   { LEFT_W, TK_JOIN_KW },
 219   { LIKE_W, TK_LIKE },
 220   { LIMIT_W, TK_LIMIT },
 221   { LOCALIZABLE_W, TK_LOCALIZABLE },
 222   { LONG_W, TK_LONG },
 223   { LONGCHAR_W, TK_LONGCHAR },
 224   { MATCH_W, TK_MATCH },
 225   { NATURAL_W, TK_JOIN_KW },
 226   { NOT_W, TK_NOT },
 227   { NOTNULL_W, TK_NOTNULL },
 228   { NULL_W, TK_NULL },
 229   { OBJECT_W, TK_OBJECT },
 230   { OF_W, TK_OF },
 231   { OFFSET_W, TK_OFFSET },
 232   { ON_W, TK_ON },
 233   { OR_W, TK_OR },
 234   { ORDER_W, TK_ORDER },
 235   { OUTER_W, TK_JOIN_KW },
 236   { PRAGMA_W, TK_PRAGMA },
 237   { PRIMARY_W, TK_PRIMARY },
 238   { RAISE_W, TK_RAISE },
 239   { REFERENCES_W, TK_REFERENCES },
 240   { REPLACE_W, TK_REPLACE },
 241   { RESTRICT_W, TK_RESTRICT },
 242   { RIGHT_W, TK_JOIN_KW },
 243   { ROLLBACK_W, TK_ROLLBACK },
 244   { ROW_W, TK_ROW },
 245   { SELECT_W, TK_SELECT },
 246   { SET_W, TK_SET },
 247   { SHORT_W, TK_SHORT },
 248   { STATEMENT_W, TK_STATEMENT },
 249   { TABLE_W, TK_TABLE },
 250   { TEMP_W, TK_TEMP },
 251   { TEMPORARY_W, TK_TEMP },
 252   { THEN_W, TK_THEN },
 253   { TRANSACTION_W, TK_TRANSACTION },
 254   { TRIGGER_W, TK_TRIGGER },
 255   { UNION_W, TK_UNION },
 256   { UNIQUE_W, TK_UNIQUE },
 257   { UPDATE_W, TK_UPDATE },
 258   { USING_W, TK_USING },
 259   { VACUUM_W, TK_VACUUM },
 260   { VALUES_W, TK_VALUES },
 261   { VIEW_W, TK_VIEW },
 262   { WHEN_W, TK_WHEN },
 263   { WHERE_W, TK_WHERE },
 264 };
 265
 266 #define KEYWORD_COUNT ( sizeof aKeywordTable/sizeof (Keyword) )
 267
 268 /*
 269 ** Comparison function for binary search.
 270 */
 271 static int compKeyword(const void *m1, const void *m2){
 272   const Keyword *k1 = m1, *k2 = m2;
 273
 274   return strcmpiW( k1->zName, k2->zName );
 275 }
 276
 277 /*
 278 ** This function looks up an identifier to determine if it is a
 279 ** keyword.  If it is a keyword, the token code of that keyword is
 280 ** returned.  If the input is not a keyword, TK_ID is returned.
 281 */
 282 static int sqliteKeywordCode(const WCHAR *z, int n){
 283   WCHAR str[MAX_TOKEN_LEN+1];
 284   Keyword key, *r;
 285
 286   if( n>MAX_TOKEN_LEN )
 287     return TK_ID;
 288
 289   memcpy( str, z, n*sizeof (WCHAR) );
 290   str[n] = 0;
 291   key.tokenType = 0;
 292   key.zName = str;
 293   r = bsearch( &key, aKeywordTable, KEYWORD_COUNT, sizeof (Keyword), compKeyword );
 294   if( r )
 295     return r->tokenType;
 296   return TK_ID;
 297 }
 298
 299
 300 /*
 301 ** If X is a character that can be used in an identifier then
 302 ** isIdChar[X] will be 1.  Otherwise isIdChar[X] will be 0.
 303 **
 304 ** In this implementation, an identifier can be a string of
 305 ** alphabetic characters, digits, and "_" plus any character
 306 ** with the high-order bit set.  The latter rule means that
 307 ** any sequence of UTF-8 characters or characters taken from
 308 ** an extended ISO8859 character set can form an identifier.
 309 */
 310 static const char isIdChar[] = {
 311 /* x0 x1 x2 x3 x4 x5 x6 x7 x8 x9 xA xB xC xD xE xF */
 312     0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  /* 0x */
 313     0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  /* 1x */
 314     0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  /* 2x */
 315     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,  /* 3x */
 316     0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* 4x */
 317     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1,  /* 5x */
 318     0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* 6x */
 319     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0,  /* 7x */
 320     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* 8x */
 321     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* 9x */
 322     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* Ax */
 323     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* Bx */
 324     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* Cx */
 325     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* Dx */
 326     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* Ex */
 327     1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /* Fx */
 328 };
 329
 330
 331 /*
 332 ** Return the length of the token that begins at z[0].  Return
 333 ** -1 if the token is (or might be) incomplete.  Store the token
 334 ** type in *tokenType before returning.
 335 */
 336 int sqliteGetToken(const WCHAR *z, int *tokenType){
 337   int i;
 338   switch( *z ){
 339     case ' ': case '\t': case '\n': case '\f': case '\r': {
 340       for(i=1; isspace(z[i]); i++){}
 341       *tokenType = TK_SPACE;
 342       return i;
 343     }
 344     case '-': {
 345       if( z[1]==0 ) return -1;
 346       if( z[1]=='-' ){
 347         for(i=2; z[i] && z[i]!='\n'; i++){}
 348         *tokenType = TK_COMMENT;
 349         return i;
 350       }
 351       *tokenType = TK_MINUS;
 352       return 1;
 353     }
 354     case '(': {
 355       if( z[1]=='+' && z[2]==')' ){
 356         *tokenType = TK_ORACLE_OUTER_JOIN;
 357         return 3;
 358       }else{
 359         *tokenType = TK_LP;
 360         return 1;
 361       }
 362     }
 363     case ')': {
 364       *tokenType = TK_RP;
 365       return 1;
 366     }
 367     case ';': {
 368       *tokenType = TK_SEMI;
 369       return 1;
 370     }
 371     case '+': {
 372       *tokenType = TK_PLUS;
 373       return 1;
 374     }
 375     case '*': {
 376       *tokenType = TK_STAR;
 377       return 1;
 378     }
 379     case '/': {
 380       if( z[1]!='*' || z[2]==0 ){
 381         *tokenType = TK_SLASH;
 382         return 1;
 383       }
 384       for(i=3; z[i] && (z[i]!='/' || z[i-1]!='*'); i++){}
 385       if( z[i] ) i++;
 386       *tokenType = TK_COMMENT;
 387       return i;
 388     }
 389     case '%': {
 390       *tokenType = TK_REM;
 391       return 1;
 392     }
 393     case '=': {
 394       *tokenType = TK_EQ;
 395       return 1 + (z[1]=='=');
 396     }
 397     case '<': {
 398       if( z[1]=='=' ){
 399         *tokenType = TK_LE;
 400         return 2;
 401       }else if( z[1]=='>' ){
 402         *tokenType = TK_NE;
 403         return 2;
 404       }else if( z[1]=='<' ){
 405         *tokenType = TK_LSHIFT;
 406         return 2;
 407       }else{
 408         *tokenType = TK_LT;
 409         return 1;
 410       }
 411     }
 412     case '>': {
 413       if( z[1]=='=' ){
 414         *tokenType = TK_GE;
 415         return 2;
 416       }else if( z[1]=='>' ){
 417         *tokenType = TK_RSHIFT;
 418         return 2;
 419       }else{
 420         *tokenType = TK_GT;
 421         return 1;
 422       }
 423     }
 424     case '!': {
 425       if( z[1]!='=' ){
 426         *tokenType = TK_ILLEGAL;
 427         return 2;
 428       }else{
 429         *tokenType = TK_NE;
 430         return 2;
 431       }
 432     }
 433     case '|': {
 434       if( z[1]!='|' ){
 435         *tokenType = TK_BITOR;
 436         return 1;
 437       }else{
 438         *tokenType = TK_CONCAT;
 439         return 2;
 440       }
 441     }
 442     case '?': {
 443       *tokenType = TK_WILDCARD;
 444       return 1;
 445     }
 446     case ',': {
 447       *tokenType = TK_COMMA;
 448       return 1;
 449     }
 450     case '&': {
 451       *tokenType = TK_BITAND;
 452       return 1;
 453     }
 454     case '~': {
 455       *tokenType = TK_BITNOT;
 456       return 1;
 457     }
 458     case '`': case '\'': case '"': {
 459       int delim = z[0];
 460       for(i=1; z[i]; i++){
 461         if( z[i]==delim ){
 462           if( z[i+1]==delim ){
 463             i++;
 464           }else{
 465             break;
 466           }
 467         }
 468       }
 469       if( z[i] ) i++;
 470       if( delim == '`' )
 471         *tokenType = TK_ID;
 472       else
 473         *tokenType = TK_STRING;
 474       return i;
 475     }
 476     case '.': {
 477       if( !isdigit(z[1]) ){
 478         *tokenType = TK_DOT;
 479         return 1;
 480       }
 481       /* Fall thru into the next case */
 482     }
 483     case '0': case '1': case '2': case '3': case '4':
 484     case '5': case '6': case '7': case '8': case '9': {
 485       *tokenType = TK_INTEGER;
 486       for(i=1; isdigit(z[i]); i++){}
 487       if( z[i]=='.' ){
 488         i++;
 489         while( isdigit(z[i]) ){ i++; }
 490         *tokenType = TK_FLOAT;
 491       }
 492       if( (z[i]=='e' || z[i]=='E') &&
 493            ( isdigit(z[i+1])
 494             || ((z[i+1]=='+' || z[i+1]=='-') && isdigit(z[i+2]))
 495            )
 496       ){
 497         i += 2;
 498         while( isdigit(z[i]) ){ i++; }
 499         *tokenType = TK_FLOAT;
 500       }else if( z[0]=='.' ){
 501         *tokenType = TK_FLOAT;
 502       }
 503       return i;
 504     }
 505     case '[': {
 506       for(i=1; z[i] && z[i-1]!=']'; i++){}
 507       *tokenType = TK_ID;
 508       return i;
 509     }
 510     default: {
 511       if( !isIdChar[*z] ){
 512         break;
 513       }
 514       for(i=1; isIdChar[z[i]]; i++){}
 515       *tokenType = sqliteKeywordCode(z, i);
 516       return i;
 517     }
 518   }
 519   *tokenType = TK_ILLEGAL;
 520   return 1;
 521 }