Lines Matching +full:0 +full:- +full:9 +full:a +full:- +full:e

1 /* SPDX-License-Identifier: GPL-2.0-or-later */
22 /* We've got a two-level lexer here.  We let flex do basic tokenization
28 IDENT			[A-Za-z_\$][A-Za-z0-9_\$]*
30 O_INT			0[0-7]*
31 D_INT			[1-9][0-9]*
32 X_INT			0[Xx][0-9A-Fa-f]+
36 FRAC			([0-9]*\.[0-9]+)|([0-9]+\.)
37 EXP			[Ee][+-]?[0-9]+
39 REAL			({FRAC}{EXP}?{F_SUF}?)|([0-9]+{EXP}{F_SUF}?)
44 MC_TOKEN		([~%^&*+=|<>/-]=)|(&&)|("||")|(->)|(<<)|(>>)
67  /* The Pedant requires that the other C multi-character tokens be
78 .					return yytext[0];
91  * We mark any token, that that equals to a known enumerator, as
94  *    enum e { a, b }; struct s { int a, b; }
102 			  next_node->next = cur_node;			   \
103 			  cur_node->string = memcpy(xmalloc(L+1), T, L+1); \
104 			  cur_node->tag =				   \
105 			    find_symbol(cur_node->string, SYM_ENUM_CONST, 1)?\
107 			  cur_node->in_source_file = in_source_file;       \
108 			} while (0)
128   int token, count = 0;
134       next_node->next = NULL;
141   if (token == 0)
142     return 0;
145       char *file, *e;
153       e = strchr(file, '\"');
154       *e = '\0';
155       cur_filename = memcpy(xmalloc(e-file+1), file, e-file+1);
162         in_source_file = (strcmp(cur_filename, source_file) == 0);
177 	    if (r >= 0)
183 		    count = 0;
187 		    count = 0;
191 		    count = 0;
206 		    count = 0;
251 	  if (--count == 0)
271 	  if (--count == 0)
286 	  if (is_reserved_word(yytext, yyleng) >= 0
289 	      yyless(0);
311 	  if (--count == 0)
332 	  if (--count == 0)
352 	  if (--count == 0)
373 	  if (count == 0)
385 	  --count;
389 	  if (count == 0)
415 	  if (--count == 0)
432   if (suppress_type_lookup > 0)
433     --suppress_type_lookup;
434   if (dont_want_brace_phrase > 0)
435     --dont_want_brace_phrase;
437   yylval = &next_node->next;