lex.yy.c 43 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726
  1. #line 3 "lex.yy.c"
  2. #define YY_INT_ALIGNED short int
  3. /* A lexical scanner generated by flex */
  4. #define FLEX_SCANNER
  5. #define YY_FLEX_MAJOR_VERSION 2
  6. #define YY_FLEX_MINOR_VERSION 6
  7. #define YY_FLEX_SUBMINOR_VERSION 4
  8. #if YY_FLEX_SUBMINOR_VERSION > 0
  9. #define FLEX_BETA
  10. #endif
  11. /* First, we deal with platform-specific or compiler-specific issues. */
  12. /* begin standard C headers. */
  13. #include <stdio.h>
  14. #include <string.h>
  15. #include <errno.h>
  16. #include <stdlib.h>
  17. /* end standard C headers. */
  18. /* flex integer type definitions */
  19. #ifndef FLEXINT_H
  20. #define FLEXINT_H
  21. /* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
  22. #if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
  23. /* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
  24. * if you want the limit (max/min) macros for int types.
  25. */
  26. #ifndef __STDC_LIMIT_MACROS
  27. #define __STDC_LIMIT_MACROS 1
  28. #endif
  29. #include <inttypes.h>
  30. typedef int8_t flex_int8_t;
  31. typedef uint8_t flex_uint8_t;
  32. typedef int16_t flex_int16_t;
  33. typedef uint16_t flex_uint16_t;
  34. typedef int32_t flex_int32_t;
  35. typedef uint32_t flex_uint32_t;
  36. #else
  37. typedef signed char flex_int8_t;
  38. typedef short int flex_int16_t;
  39. typedef int flex_int32_t;
  40. typedef unsigned char flex_uint8_t;
  41. typedef unsigned short int flex_uint16_t;
  42. typedef unsigned int flex_uint32_t;
  43. /* Limits of integral types. */
  44. #ifndef INT8_MIN
  45. #define INT8_MIN (-128)
  46. #endif
  47. #ifndef INT16_MIN
  48. #define INT16_MIN (-32767-1)
  49. #endif
  50. #ifndef INT32_MIN
  51. #define INT32_MIN (-2147483647-1)
  52. #endif
  53. #ifndef INT8_MAX
  54. #define INT8_MAX (127)
  55. #endif
  56. #ifndef INT16_MAX
  57. #define INT16_MAX (32767)
  58. #endif
  59. #ifndef INT32_MAX
  60. #define INT32_MAX (2147483647)
  61. #endif
  62. #ifndef UINT8_MAX
  63. #define UINT8_MAX (255U)
  64. #endif
  65. #ifndef UINT16_MAX
  66. #define UINT16_MAX (65535U)
  67. #endif
  68. #ifndef UINT32_MAX
  69. #define UINT32_MAX (4294967295U)
  70. #endif
  71. #ifndef SIZE_MAX
  72. #define SIZE_MAX (~(size_t)0)
  73. #endif
  74. #endif /* ! C99 */
  75. #endif /* ! FLEXINT_H */
  76. /* begin standard C++ headers. */
  77. /* TODO: this is always defined, so inline it */
  78. #define yyconst const
  79. #if defined(__GNUC__) && __GNUC__ >= 3
  80. #define yynoreturn __attribute__((__noreturn__))
  81. #else
  82. #define yynoreturn
  83. #endif
  84. /* Returned upon end-of-file. */
  85. #define YY_NULL 0
  86. /* Promotes a possibly negative, possibly signed char to an
  87. * integer in range [0..255] for use as an array index.
  88. */
  89. #define YY_SC_TO_UI(c) ((YY_CHAR) (c))
  90. /* Enter a start condition. This macro really ought to take a parameter,
  91. * but we do it the disgusting crufty way forced on us by the ()-less
  92. * definition of BEGIN.
  93. */
  94. #define BEGIN (yy_start) = 1 + 2 *
  95. /* Translate the current start state into a value that can be later handed
  96. * to BEGIN to return to the state. The YYSTATE alias is for lex
  97. * compatibility.
  98. */
  99. #define YY_START (((yy_start) - 1) / 2)
  100. #define YYSTATE YY_START
  101. /* Action number for EOF rule of a given start state. */
  102. #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
  103. /* Special action meaning "start processing a new file". */
  104. #define YY_NEW_FILE yyrestart( yyin )
  105. #define YY_END_OF_BUFFER_CHAR 0
  106. /* Size of default input buffer. */
  107. #ifndef YY_BUF_SIZE
  108. #ifdef __ia64__
  109. /* On IA-64, the buffer size is 16k, not 8k.
  110. * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
  111. * Ditto for the __ia64__ case accordingly.
  112. */
  113. #define YY_BUF_SIZE 32768
  114. #else
  115. #define YY_BUF_SIZE 16384
  116. #endif /* __ia64__ */
  117. #endif
  118. /* The state buf must be large enough to hold one state per character in the main buffer.
  119. */
  120. #define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
  121. #ifndef YY_TYPEDEF_YY_BUFFER_STATE
  122. #define YY_TYPEDEF_YY_BUFFER_STATE
  123. typedef struct yy_buffer_state *YY_BUFFER_STATE;
  124. #endif
  125. #ifndef YY_TYPEDEF_YY_SIZE_T
  126. #define YY_TYPEDEF_YY_SIZE_T
  127. typedef size_t yy_size_t;
  128. #endif
  129. extern int yyleng;
  130. extern FILE *yyin, *yyout;
  131. #define EOB_ACT_CONTINUE_SCAN 0
  132. #define EOB_ACT_END_OF_FILE 1
  133. #define EOB_ACT_LAST_MATCH 2
  134. #define YY_LESS_LINENO(n)
  135. #define YY_LINENO_REWIND_TO(ptr)
  136. /* Return all but the first "n" matched characters back to the input stream. */
  137. #define yyless(n) \
  138. do \
  139. { \
  140. /* Undo effects of setting up yytext. */ \
  141. int yyless_macro_arg = (n); \
  142. YY_LESS_LINENO(yyless_macro_arg);\
  143. *yy_cp = (yy_hold_char); \
  144. YY_RESTORE_YY_MORE_OFFSET \
  145. (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
  146. YY_DO_BEFORE_ACTION; /* set up yytext again */ \
  147. } \
  148. while ( 0 )
  149. #define unput(c) yyunput( c, (yytext_ptr) )
  150. #ifndef YY_STRUCT_YY_BUFFER_STATE
  151. #define YY_STRUCT_YY_BUFFER_STATE
  152. struct yy_buffer_state
  153. {
  154. FILE *yy_input_file;
  155. char *yy_ch_buf; /* input buffer */
  156. char *yy_buf_pos; /* current position in input buffer */
  157. /* Size of input buffer in bytes, not including room for EOB
  158. * characters.
  159. */
  160. int yy_buf_size;
  161. /* Number of characters read into yy_ch_buf, not including EOB
  162. * characters.
  163. */
  164. int yy_n_chars;
  165. /* Whether we "own" the buffer - i.e., we know we created it,
  166. * and can realloc() it to grow it, and should free() it to
  167. * delete it.
  168. */
  169. int yy_is_our_buffer;
  170. /* Whether this is an "interactive" input source; if so, and
  171. * if we're using stdio for input, then we want to use getc()
  172. * instead of fread(), to make sure we stop fetching input after
  173. * each newline.
  174. */
  175. int yy_is_interactive;
  176. /* Whether we're considered to be at the beginning of a line.
  177. * If so, '^' rules will be active on the next match, otherwise
  178. * not.
  179. */
  180. int yy_at_bol;
  181. int yy_bs_lineno; /**< The line count. */
  182. int yy_bs_column; /**< The column count. */
  183. /* Whether to try to fill the input buffer when we reach the
  184. * end of it.
  185. */
  186. int yy_fill_buffer;
  187. int yy_buffer_status;
  188. #define YY_BUFFER_NEW 0
  189. #define YY_BUFFER_NORMAL 1
  190. /* When an EOF's been seen but there's still some text to process
  191. * then we mark the buffer as YY_EOF_PENDING, to indicate that we
  192. * shouldn't try reading from the input source any more. We might
  193. * still have a bunch of tokens to match, though, because of
  194. * possible backing-up.
  195. *
  196. * When we actually see the EOF, we change the status to "new"
  197. * (via yyrestart()), so that the user can continue scanning by
  198. * just pointing yyin at a new input file.
  199. */
  200. #define YY_BUFFER_EOF_PENDING 2
  201. };
  202. #endif /* !YY_STRUCT_YY_BUFFER_STATE */
  203. /* Stack of input buffers. */
  204. static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
  205. static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
  206. static YY_BUFFER_STATE * yy_buffer_stack = NULL; /**< Stack as an array. */
  207. /* We provide macros for accessing buffer states in case in the
  208. * future we want to put the buffer states in a more general
  209. * "scanner state".
  210. *
  211. * Returns the top of the stack, or NULL.
  212. */
  213. #define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
  214. ? (yy_buffer_stack)[(yy_buffer_stack_top)] \
  215. : NULL)
  216. /* Same as previous macro, but useful when we know that the buffer stack is not
  217. * NULL or when we need an lvalue. For internal use only.
  218. */
  219. #define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
  220. /* yy_hold_char holds the character lost when yytext is formed. */
  221. static char yy_hold_char;
  222. static int yy_n_chars; /* number of characters read into yy_ch_buf */
  223. int yyleng;
  224. /* Points to current character in buffer. */
  225. static char *yy_c_buf_p = NULL;
  226. static int yy_init = 0; /* whether we need to initialize */
  227. static int yy_start = 0; /* start state number */
  228. /* Flag which is used to allow yywrap()'s to do buffer switches
  229. * instead of setting up a fresh yyin. A bit of a hack ...
  230. */
  231. static int yy_did_buffer_switch_on_eof;
  232. void yyrestart ( FILE *input_file );
  233. void yy_switch_to_buffer ( YY_BUFFER_STATE new_buffer );
  234. YY_BUFFER_STATE yy_create_buffer ( FILE *file, int size );
  235. void yy_delete_buffer ( YY_BUFFER_STATE b );
  236. void yy_flush_buffer ( YY_BUFFER_STATE b );
  237. void yypush_buffer_state ( YY_BUFFER_STATE new_buffer );
  238. void yypop_buffer_state ( void );
  239. static void yyensure_buffer_stack ( void );
  240. static void yy_load_buffer_state ( void );
  241. static void yy_init_buffer ( YY_BUFFER_STATE b, FILE *file );
  242. #define YY_FLUSH_BUFFER yy_flush_buffer( YY_CURRENT_BUFFER )
  243. YY_BUFFER_STATE yy_scan_buffer ( char *base, yy_size_t size );
  244. YY_BUFFER_STATE yy_scan_string ( const char *yy_str );
  245. YY_BUFFER_STATE yy_scan_bytes ( const char *bytes, int len );
  246. void *yyalloc ( yy_size_t );
  247. void *yyrealloc ( void *, yy_size_t );
  248. void yyfree ( void * );
  249. #define yy_new_buffer yy_create_buffer
  250. #define yy_set_interactive(is_interactive) \
  251. { \
  252. if ( ! YY_CURRENT_BUFFER ){ \
  253. yyensure_buffer_stack (); \
  254. YY_CURRENT_BUFFER_LVALUE = \
  255. yy_create_buffer( yyin, YY_BUF_SIZE ); \
  256. } \
  257. YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
  258. }
  259. #define yy_set_bol(at_bol) \
  260. { \
  261. if ( ! YY_CURRENT_BUFFER ){\
  262. yyensure_buffer_stack (); \
  263. YY_CURRENT_BUFFER_LVALUE = \
  264. yy_create_buffer( yyin, YY_BUF_SIZE ); \
  265. } \
  266. YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
  267. }
  268. #define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
  269. #define yywrap() (/*CONSTCOND*/1)
  270. #define YY_SKIP_YYWRAP
  271. typedef flex_uint8_t YY_CHAR;
  272. FILE *yyin = NULL, *yyout = NULL;
  273. typedef int yy_state_type;
  274. extern int yylineno;
  275. int yylineno = 1;
  276. extern char *yytext;
  277. #ifdef yytext_ptr
  278. #undef yytext_ptr
  279. #endif
  280. #define yytext_ptr yytext
  281. static yy_state_type yy_get_previous_state ( void );
  282. static yy_state_type yy_try_NUL_trans ( yy_state_type current_state );
  283. static int yy_get_next_buffer ( void );
  284. static void yynoreturn yy_fatal_error ( const char* msg );
  285. /* Done after the current pattern has been matched and before the
  286. * corresponding action - sets up yytext.
  287. */
  288. #define YY_DO_BEFORE_ACTION \
  289. (yytext_ptr) = yy_bp; \
  290. yyleng = (int) (yy_cp - yy_bp); \
  291. (yy_hold_char) = *yy_cp; \
  292. *yy_cp = '\0'; \
  293. (yy_c_buf_p) = yy_cp;
  294. #define YY_NUM_RULES 5
  295. #define YY_END_OF_BUFFER 6
  296. /* This struct is not used in this scanner,
  297. but its presence is necessary. */
  298. struct yy_trans_info
  299. {
  300. flex_int32_t yy_verify;
  301. flex_int32_t yy_nxt;
  302. };
  303. static const flex_int16_t yy_accept[12] =
  304. { 0,
  305. 0, 0, 6, 4, 3, 3, 2, 1, 3, 1,
  306. 0
  307. } ;
  308. static const YY_CHAR yy_ec[256] =
  309. { 0,
  310. 1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
  311. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  312. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  313. 1, 2, 1, 1, 1, 1, 1, 1, 1, 4,
  314. 4, 1, 4, 1, 4, 1, 1, 5, 5, 5,
  315. 5, 5, 5, 5, 5, 5, 5, 1, 1, 1,
  316. 4, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  317. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  318. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  319. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  320. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  321. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  322. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  323. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  324. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  325. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  326. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  327. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  328. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  329. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  330. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  331. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  332. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  333. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  334. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  335. 1, 1, 1, 1, 1
  336. } ;
  337. static const YY_CHAR yy_meta[6] =
  338. { 0,
  339. 1, 2, 2, 1, 3
  340. } ;
  341. static const flex_int16_t yy_base[14] =
  342. { 0,
  343. 0, 0, 8, 9, 0, 0, 9, 0, 0, 0,
  344. 9, 5, 3
  345. } ;
  346. static const flex_int16_t yy_def[14] =
  347. { 0,
  348. 11, 1, 11, 11, 12, 12, 11, 13, 12, 13,
  349. 0, 11, 11
  350. } ;
  351. static const flex_int16_t yy_nxt[15] =
  352. { 0,
  353. 4, 5, 6, 7, 8, 10, 9, 11, 3, 11,
  354. 11, 11, 11, 11
  355. } ;
  356. static const flex_int16_t yy_chk[15] =
  357. { 0,
  358. 1, 1, 1, 1, 1, 13, 12, 3, 11, 11,
  359. 11, 11, 11, 11
  360. } ;
  361. static yy_state_type yy_last_accepting_state;
  362. static char *yy_last_accepting_cpos;
  363. extern int yy_flex_debug;
  364. int yy_flex_debug = 0;
  365. /* The intent behind this definition is that it'll catch
  366. * any uses of REJECT which flex missed.
  367. */
  368. #define REJECT reject_used_but_not_detected
  369. #define yymore() yymore_used_but_not_detected
  370. #define YY_MORE_ADJ 0
  371. #define YY_RESTORE_YY_MORE_OFFSET
  372. char *yytext;
  373. #line 1 "eval.l"
  374. /* -- eval.l --
  375. Evaluation d'une expression
  376. Partie analyseur lexical.
  377. Utilisation : flex eval.l */
  378. #line 8 "eval.l"
  379. #include "eval.tab.h" /* Généré par bison grâce à l'option %defines */
  380. #line 454 "lex.yy.c"
  381. #define YY_NO_INPUT 1
  382. #line 456 "lex.yy.c"
  383. #define INITIAL 0
  384. #ifndef YY_NO_UNISTD_H
  385. /* Special case for "unistd.h", since it is non-ANSI. We include it way
  386. * down here because we want the user's section 1 to have been scanned first.
  387. * The user has a chance to override it with an option.
  388. */
  389. #include <unistd.h>
  390. #endif
  391. #ifndef YY_EXTRA_TYPE
  392. #define YY_EXTRA_TYPE void *
  393. #endif
  394. static int yy_init_globals ( void );
  395. /* Accessor methods to globals.
  396. These are made visible to non-reentrant scanners for convenience. */
  397. int yylex_destroy ( void );
  398. int yyget_debug ( void );
  399. void yyset_debug ( int debug_flag );
  400. YY_EXTRA_TYPE yyget_extra ( void );
  401. void yyset_extra ( YY_EXTRA_TYPE user_defined );
  402. FILE *yyget_in ( void );
  403. void yyset_in ( FILE * _in_str );
  404. FILE *yyget_out ( void );
  405. void yyset_out ( FILE * _out_str );
  406. int yyget_leng ( void );
  407. char *yyget_text ( void );
  408. int yyget_lineno ( void );
  409. void yyset_lineno ( int _line_number );
  410. /* Macros after this point can all be overridden by user definitions in
  411. * section 1.
  412. */
  413. #ifndef YY_SKIP_YYWRAP
  414. #ifdef __cplusplus
  415. extern "C" int yywrap ( void );
  416. #else
  417. extern int yywrap ( void );
  418. #endif
  419. #endif
  420. #ifndef YY_NO_UNPUT
  421. #endif
  422. #ifndef yytext_ptr
  423. static void yy_flex_strncpy ( char *, const char *, int );
  424. #endif
  425. #ifdef YY_NEED_STRLEN
  426. static int yy_flex_strlen ( const char * );
  427. #endif
  428. #ifndef YY_NO_INPUT
  429. #ifdef __cplusplus
  430. static int yyinput ( void );
  431. #else
  432. static int input ( void );
  433. #endif
  434. #endif
  435. /* Amount of stuff to slurp up with each read. */
  436. #ifndef YY_READ_BUF_SIZE
  437. #ifdef __ia64__
  438. /* On IA-64, the buffer size is 16k, not 8k */
  439. #define YY_READ_BUF_SIZE 16384
  440. #else
  441. #define YY_READ_BUF_SIZE 8192
  442. #endif /* __ia64__ */
  443. #endif
  444. /* Copy whatever the last rule matched to the standard output. */
  445. #ifndef ECHO
  446. /* This used to be an fputs(), but since the string might contain NUL's,
  447. * we now use fwrite().
  448. */
  449. #define ECHO do { if (fwrite( yytext, (size_t) yyleng, 1, yyout )) {} } while (0)
  450. #endif
  451. /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
  452. * is returned in "result".
  453. */
  454. #ifndef YY_INPUT
  455. #define YY_INPUT(buf,result,max_size) \
  456. if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
  457. { \
  458. int c = '*'; \
  459. int n; \
  460. for ( n = 0; n < max_size && \
  461. (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
  462. buf[n] = (char) c; \
  463. if ( c == '\n' ) \
  464. buf[n++] = (char) c; \
  465. if ( c == EOF && ferror( yyin ) ) \
  466. YY_FATAL_ERROR( "input in flex scanner failed" ); \
  467. result = n; \
  468. } \
  469. else \
  470. { \
  471. errno=0; \
  472. while ( (result = (int) fread(buf, 1, (yy_size_t) max_size, yyin)) == 0 && ferror(yyin)) \
  473. { \
  474. if( errno != EINTR) \
  475. { \
  476. YY_FATAL_ERROR( "input in flex scanner failed" ); \
  477. break; \
  478. } \
  479. errno=0; \
  480. clearerr(yyin); \
  481. } \
  482. }\
  483. \
  484. #endif
  485. /* No semi-colon after return; correct usage is to write "yyterminate();" -
  486. * we don't want an extra ';' after the "return" because that will cause
  487. * some compilers to complain about unreachable statements.
  488. */
  489. #ifndef yyterminate
  490. #define yyterminate() return YY_NULL
  491. #endif
  492. /* Number of entries by which start-condition stack grows. */
  493. #ifndef YY_START_STACK_INCR
  494. #define YY_START_STACK_INCR 25
  495. #endif
  496. /* Report a fatal error. */
  497. #ifndef YY_FATAL_ERROR
  498. #define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
  499. #endif
  500. /* end tables serialization structures and prototypes */
  501. /* Default declaration of generated scanner - a define so the user can
  502. * easily add parameters.
  503. */
  504. #ifndef YY_DECL
  505. #define YY_DECL_IS_OURS 1
  506. extern int yylex (void);
  507. #define YY_DECL int yylex (void)
  508. #endif /* !YY_DECL */
  509. /* Code executed at the beginning of each rule, after yytext and yyleng
  510. * have been set up.
  511. */
  512. #ifndef YY_USER_ACTION
  513. #define YY_USER_ACTION
  514. #endif
  515. /* Code executed at the end of each rule. */
  516. #ifndef YY_BREAK
  517. #define YY_BREAK /*LINTED*/break;
  518. #endif
  519. #define YY_RULE_SETUP \
  520. YY_USER_ACTION
  521. /** The main scanner function which does all the work.
  522. */
  523. YY_DECL
  524. {
  525. yy_state_type yy_current_state;
  526. char *yy_cp, *yy_bp;
  527. int yy_act;
  528. if ( !(yy_init) )
  529. {
  530. (yy_init) = 1;
  531. #ifdef YY_USER_INIT
  532. YY_USER_INIT;
  533. #endif
  534. if ( ! (yy_start) )
  535. (yy_start) = 1; /* first start state */
  536. if ( ! yyin )
  537. yyin = stdin;
  538. if ( ! yyout )
  539. yyout = stdout;
  540. if ( ! YY_CURRENT_BUFFER ) {
  541. yyensure_buffer_stack ();
  542. YY_CURRENT_BUFFER_LVALUE =
  543. yy_create_buffer( yyin, YY_BUF_SIZE );
  544. }
  545. yy_load_buffer_state( );
  546. }
  547. {
  548. #line 17 "eval.l"
  549. #line 674 "lex.yy.c"
  550. while ( /*CONSTCOND*/1 ) /* loops until end-of-file is reached */
  551. {
  552. yy_cp = (yy_c_buf_p);
  553. /* Support of yytext. */
  554. *yy_cp = (yy_hold_char);
  555. /* yy_bp points to the position in yy_ch_buf of the start of
  556. * the current run.
  557. */
  558. yy_bp = yy_cp;
  559. yy_current_state = (yy_start);
  560. yy_match:
  561. do
  562. {
  563. YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)] ;
  564. if ( yy_accept[yy_current_state] )
  565. {
  566. (yy_last_accepting_state) = yy_current_state;
  567. (yy_last_accepting_cpos) = yy_cp;
  568. }
  569. while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
  570. {
  571. yy_current_state = (int) yy_def[yy_current_state];
  572. if ( yy_current_state >= 12 )
  573. yy_c = yy_meta[yy_c];
  574. }
  575. yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
  576. ++yy_cp;
  577. }
  578. while ( yy_base[yy_current_state] != 9 );
  579. yy_find_action:
  580. yy_act = yy_accept[yy_current_state];
  581. if ( yy_act == 0 )
  582. { /* have to back up */
  583. yy_cp = (yy_last_accepting_cpos);
  584. yy_current_state = (yy_last_accepting_state);
  585. yy_act = yy_accept[yy_current_state];
  586. }
  587. YY_DO_BEFORE_ACTION;
  588. do_action: /* This label is used only to access EOF actions. */
  589. switch ( yy_act )
  590. { /* beginning of action switch */
  591. case 0: /* must back up */
  592. /* undo the effects of YY_DO_BEFORE_ACTION */
  593. *yy_cp = (yy_hold_char);
  594. yy_cp = (yy_last_accepting_cpos);
  595. yy_current_state = (yy_last_accepting_state);
  596. goto yy_find_action;
  597. case 1:
  598. YY_RULE_SETUP
  599. #line 19 "eval.l"
  600. yylval = atoi(yytext); return nombre; /* atoi = ascii to integer; yylval est la
  601. valeur sémantique (par défaut un int)
  602. associée au token */
  603. YY_BREAK
  604. case 2:
  605. YY_RULE_SETUP
  606. #line 22 "eval.l"
  607. return yytext[0]; /* caracteres unites lexicales */
  608. YY_BREAK
  609. case 3:
  610. /* rule 3 can match eol */
  611. YY_RULE_SETUP
  612. #line 23 "eval.l"
  613. ;
  614. YY_BREAK
  615. case 4:
  616. YY_RULE_SETUP
  617. #line 24 "eval.l"
  618. fprintf(stderr, "Caractere (%c) non reconnu\n", yytext[0]); /* tout le reste (les règles sont évaluées de haut en bas */
  619. YY_BREAK
  620. case 5:
  621. YY_RULE_SETUP
  622. #line 26 "eval.l"
  623. ECHO;
  624. YY_BREAK
  625. #line 759 "lex.yy.c"
  626. case YY_STATE_EOF(INITIAL):
  627. yyterminate();
  628. case YY_END_OF_BUFFER:
  629. {
  630. /* Amount of text matched not including the EOB char. */
  631. int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
  632. /* Undo the effects of YY_DO_BEFORE_ACTION. */
  633. *yy_cp = (yy_hold_char);
  634. YY_RESTORE_YY_MORE_OFFSET
  635. if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
  636. {
  637. /* We're scanning a new file or input source. It's
  638. * possible that this happened because the user
  639. * just pointed yyin at a new source and called
  640. * yylex(). If so, then we have to assure
  641. * consistency between YY_CURRENT_BUFFER and our
  642. * globals. Here is the right place to do so, because
  643. * this is the first action (other than possibly a
  644. * back-up) that will match for the new input source.
  645. */
  646. (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
  647. YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
  648. YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
  649. }
  650. /* Note that here we test for yy_c_buf_p "<=" to the position
  651. * of the first EOB in the buffer, since yy_c_buf_p will
  652. * already have been incremented past the NUL character
  653. * (since all states make transitions on EOB to the
  654. * end-of-buffer state). Contrast this with the test
  655. * in input().
  656. */
  657. if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
  658. { /* This was really a NUL. */
  659. yy_state_type yy_next_state;
  660. (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
  661. yy_current_state = yy_get_previous_state( );
  662. /* Okay, we're now positioned to make the NUL
  663. * transition. We couldn't have
  664. * yy_get_previous_state() go ahead and do it
  665. * for us because it doesn't know how to deal
  666. * with the possibility of jamming (and we don't
  667. * want to build jamming into it because then it
  668. * will run more slowly).
  669. */
  670. yy_next_state = yy_try_NUL_trans( yy_current_state );
  671. yy_bp = (yytext_ptr) + YY_MORE_ADJ;
  672. if ( yy_next_state )
  673. {
  674. /* Consume the NUL. */
  675. yy_cp = ++(yy_c_buf_p);
  676. yy_current_state = yy_next_state;
  677. goto yy_match;
  678. }
  679. else
  680. {
  681. yy_cp = (yy_c_buf_p);
  682. goto yy_find_action;
  683. }
  684. }
  685. else switch ( yy_get_next_buffer( ) )
  686. {
  687. case EOB_ACT_END_OF_FILE:
  688. {
  689. (yy_did_buffer_switch_on_eof) = 0;
  690. if ( yywrap( ) )
  691. {
  692. /* Note: because we've taken care in
  693. * yy_get_next_buffer() to have set up
  694. * yytext, we can now set up
  695. * yy_c_buf_p so that if some total
  696. * hoser (like flex itself) wants to
  697. * call the scanner after we return the
  698. * YY_NULL, it'll still work - another
  699. * YY_NULL will get returned.
  700. */
  701. (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
  702. yy_act = YY_STATE_EOF(YY_START);
  703. goto do_action;
  704. }
  705. else
  706. {
  707. if ( ! (yy_did_buffer_switch_on_eof) )
  708. YY_NEW_FILE;
  709. }
  710. break;
  711. }
  712. case EOB_ACT_CONTINUE_SCAN:
  713. (yy_c_buf_p) =
  714. (yytext_ptr) + yy_amount_of_matched_text;
  715. yy_current_state = yy_get_previous_state( );
  716. yy_cp = (yy_c_buf_p);
  717. yy_bp = (yytext_ptr) + YY_MORE_ADJ;
  718. goto yy_match;
  719. case EOB_ACT_LAST_MATCH:
  720. (yy_c_buf_p) =
  721. &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
  722. yy_current_state = yy_get_previous_state( );
  723. yy_cp = (yy_c_buf_p);
  724. yy_bp = (yytext_ptr) + YY_MORE_ADJ;
  725. goto yy_find_action;
  726. }
  727. break;
  728. }
  729. default:
  730. YY_FATAL_ERROR(
  731. "fatal flex scanner internal error--no action found" );
  732. } /* end of action switch */
  733. } /* end of scanning one token */
  734. } /* end of user's declarations */
  735. } /* end of yylex */
  736. /* yy_get_next_buffer - try to read in a new buffer
  737. *
  738. * Returns a code representing an action:
  739. * EOB_ACT_LAST_MATCH -
  740. * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
  741. * EOB_ACT_END_OF_FILE - end of file
  742. */
  743. static int yy_get_next_buffer (void)
  744. {
  745. char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
  746. char *source = (yytext_ptr);
  747. int number_to_move, i;
  748. int ret_val;
  749. if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
  750. YY_FATAL_ERROR(
  751. "fatal flex scanner internal error--end of buffer missed" );
  752. if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
  753. { /* Don't try to fill the buffer, so this is an EOF. */
  754. if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
  755. {
  756. /* We matched a single character, the EOB, so
  757. * treat this as a final EOF.
  758. */
  759. return EOB_ACT_END_OF_FILE;
  760. }
  761. else
  762. {
  763. /* We matched some text prior to the EOB, first
  764. * process it.
  765. */
  766. return EOB_ACT_LAST_MATCH;
  767. }
  768. }
  769. /* Try to read more data. */
  770. /* First move last chars to start of buffer. */
  771. number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr) - 1);
  772. for ( i = 0; i < number_to_move; ++i )
  773. *(dest++) = *(source++);
  774. if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
  775. /* don't do the read, it's not guaranteed to return an EOF,
  776. * just force an EOF
  777. */
  778. YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
  779. else
  780. {
  781. int num_to_read =
  782. YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
  783. while ( num_to_read <= 0 )
  784. { /* Not enough room in the buffer - grow it. */
  785. /* just a shorter name for the current buffer */
  786. YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE;
  787. int yy_c_buf_p_offset =
  788. (int) ((yy_c_buf_p) - b->yy_ch_buf);
  789. if ( b->yy_is_our_buffer )
  790. {
  791. int new_size = b->yy_buf_size * 2;
  792. if ( new_size <= 0 )
  793. b->yy_buf_size += b->yy_buf_size / 8;
  794. else
  795. b->yy_buf_size *= 2;
  796. b->yy_ch_buf = (char *)
  797. /* Include room in for 2 EOB chars. */
  798. yyrealloc( (void *) b->yy_ch_buf,
  799. (yy_size_t) (b->yy_buf_size + 2) );
  800. }
  801. else
  802. /* Can't grow it, we don't own it. */
  803. b->yy_ch_buf = NULL;
  804. if ( ! b->yy_ch_buf )
  805. YY_FATAL_ERROR(
  806. "fatal error - scanner input buffer overflow" );
  807. (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
  808. num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
  809. number_to_move - 1;
  810. }
  811. if ( num_to_read > YY_READ_BUF_SIZE )
  812. num_to_read = YY_READ_BUF_SIZE;
  813. /* Read in more data. */
  814. YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
  815. (yy_n_chars), num_to_read );
  816. YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
  817. }
  818. if ( (yy_n_chars) == 0 )
  819. {
  820. if ( number_to_move == YY_MORE_ADJ )
  821. {
  822. ret_val = EOB_ACT_END_OF_FILE;
  823. yyrestart( yyin );
  824. }
  825. else
  826. {
  827. ret_val = EOB_ACT_LAST_MATCH;
  828. YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
  829. YY_BUFFER_EOF_PENDING;
  830. }
  831. }
  832. else
  833. ret_val = EOB_ACT_CONTINUE_SCAN;
  834. if (((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
  835. /* Extend the array by 50%, plus the number we really need. */
  836. int new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
  837. YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc(
  838. (void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf, (yy_size_t) new_size );
  839. if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
  840. YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
  841. /* "- 2" to take care of EOB's */
  842. YY_CURRENT_BUFFER_LVALUE->yy_buf_size = (int) (new_size - 2);
  843. }
  844. (yy_n_chars) += number_to_move;
  845. YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
  846. YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
  847. (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
  848. return ret_val;
  849. }
  850. /* yy_get_previous_state - get the state just before the EOB char was reached */
  851. static yy_state_type yy_get_previous_state (void)
  852. {
  853. yy_state_type yy_current_state;
  854. char *yy_cp;
  855. yy_current_state = (yy_start);
  856. for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
  857. {
  858. YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
  859. if ( yy_accept[yy_current_state] )
  860. {
  861. (yy_last_accepting_state) = yy_current_state;
  862. (yy_last_accepting_cpos) = yy_cp;
  863. }
  864. while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
  865. {
  866. yy_current_state = (int) yy_def[yy_current_state];
  867. if ( yy_current_state >= 12 )
  868. yy_c = yy_meta[yy_c];
  869. }
  870. yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
  871. }
  872. return yy_current_state;
  873. }
  874. /* yy_try_NUL_trans - try to make a transition on the NUL character
  875. *
  876. * synopsis
  877. * next_state = yy_try_NUL_trans( current_state );
  878. */
  879. static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
  880. {
  881. int yy_is_jam;
  882. char *yy_cp = (yy_c_buf_p);
  883. YY_CHAR yy_c = 1;
  884. if ( yy_accept[yy_current_state] )
  885. {
  886. (yy_last_accepting_state) = yy_current_state;
  887. (yy_last_accepting_cpos) = yy_cp;
  888. }
  889. while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
  890. {
  891. yy_current_state = (int) yy_def[yy_current_state];
  892. if ( yy_current_state >= 12 )
  893. yy_c = yy_meta[yy_c];
  894. }
  895. yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
  896. yy_is_jam = (yy_current_state == 11);
  897. return yy_is_jam ? 0 : yy_current_state;
  898. }
  899. #ifndef YY_NO_UNPUT
  900. #endif
  901. #ifndef YY_NO_INPUT
  902. #ifdef __cplusplus
  903. static int yyinput (void)
  904. #else
  905. static int input (void)
  906. #endif
  907. {
  908. int c;
  909. *(yy_c_buf_p) = (yy_hold_char);
  910. if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
  911. {
  912. /* yy_c_buf_p now points to the character we want to return.
  913. * If this occurs *before* the EOB characters, then it's a
  914. * valid NUL; if not, then we've hit the end of the buffer.
  915. */
  916. if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
  917. /* This was really a NUL. */
  918. *(yy_c_buf_p) = '\0';
  919. else
  920. { /* need more input */
  921. int offset = (int) ((yy_c_buf_p) - (yytext_ptr));
  922. ++(yy_c_buf_p);
  923. switch ( yy_get_next_buffer( ) )
  924. {
  925. case EOB_ACT_LAST_MATCH:
  926. /* This happens because yy_g_n_b()
  927. * sees that we've accumulated a
  928. * token and flags that we need to
  929. * try matching the token before
  930. * proceeding. But for input(),
  931. * there's no matching to consider.
  932. * So convert the EOB_ACT_LAST_MATCH
  933. * to EOB_ACT_END_OF_FILE.
  934. */
  935. /* Reset buffer status. */
  936. yyrestart( yyin );
  937. /*FALLTHROUGH*/
  938. case EOB_ACT_END_OF_FILE:
  939. {
  940. if ( yywrap( ) )
  941. return 0;
  942. if ( ! (yy_did_buffer_switch_on_eof) )
  943. YY_NEW_FILE;
  944. #ifdef __cplusplus
  945. return yyinput();
  946. #else
  947. return input();
  948. #endif
  949. }
  950. case EOB_ACT_CONTINUE_SCAN:
  951. (yy_c_buf_p) = (yytext_ptr) + offset;
  952. break;
  953. }
  954. }
  955. }
  956. c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
  957. *(yy_c_buf_p) = '\0'; /* preserve yytext */
  958. (yy_hold_char) = *++(yy_c_buf_p);
  959. return c;
  960. }
  961. #endif /* ifndef YY_NO_INPUT */
  962. /** Immediately switch to a different input stream.
  963. * @param input_file A readable stream.
  964. *
  965. * @note This function does not reset the start condition to @c INITIAL .
  966. */
  967. void yyrestart (FILE * input_file )
  968. {
  969. if ( ! YY_CURRENT_BUFFER ){
  970. yyensure_buffer_stack ();
  971. YY_CURRENT_BUFFER_LVALUE =
  972. yy_create_buffer( yyin, YY_BUF_SIZE );
  973. }
  974. yy_init_buffer( YY_CURRENT_BUFFER, input_file );
  975. yy_load_buffer_state( );
  976. }
  977. /** Switch to a different input buffer.
  978. * @param new_buffer The new input buffer.
  979. *
  980. */
  981. void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer )
  982. {
  983. /* TODO. We should be able to replace this entire function body
  984. * with
  985. * yypop_buffer_state();
  986. * yypush_buffer_state(new_buffer);
  987. */
  988. yyensure_buffer_stack ();
  989. if ( YY_CURRENT_BUFFER == new_buffer )
  990. return;
  991. if ( YY_CURRENT_BUFFER )
  992. {
  993. /* Flush out information for old buffer. */
  994. *(yy_c_buf_p) = (yy_hold_char);
  995. YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
  996. YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
  997. }
  998. YY_CURRENT_BUFFER_LVALUE = new_buffer;
  999. yy_load_buffer_state( );
  1000. /* We don't actually know whether we did this switch during
  1001. * EOF (yywrap()) processing, but the only time this flag
  1002. * is looked at is after yywrap() is called, so it's safe
  1003. * to go ahead and always set it.
  1004. */
  1005. (yy_did_buffer_switch_on_eof) = 1;
  1006. }
  1007. static void yy_load_buffer_state (void)
  1008. {
  1009. (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
  1010. (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
  1011. yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
  1012. (yy_hold_char) = *(yy_c_buf_p);
  1013. }
  1014. /** Allocate and initialize an input buffer state.
  1015. * @param file A readable stream.
  1016. * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
  1017. *
  1018. * @return the allocated buffer state.
  1019. */
  1020. YY_BUFFER_STATE yy_create_buffer (FILE * file, int size )
  1021. {
  1022. YY_BUFFER_STATE b;
  1023. b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) );
  1024. if ( ! b )
  1025. YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
  1026. b->yy_buf_size = size;
  1027. /* yy_ch_buf has to be 2 characters longer than the size given because
  1028. * we need to put in 2 end-of-buffer characters.
  1029. */
  1030. b->yy_ch_buf = (char *) yyalloc( (yy_size_t) (b->yy_buf_size + 2) );
  1031. if ( ! b->yy_ch_buf )
  1032. YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
  1033. b->yy_is_our_buffer = 1;
  1034. yy_init_buffer( b, file );
  1035. return b;
  1036. }
  1037. /** Destroy the buffer.
  1038. * @param b a buffer created with yy_create_buffer()
  1039. *
  1040. */
  1041. void yy_delete_buffer (YY_BUFFER_STATE b )
  1042. {
  1043. if ( ! b )
  1044. return;
  1045. if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
  1046. YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
  1047. if ( b->yy_is_our_buffer )
  1048. yyfree( (void *) b->yy_ch_buf );
  1049. yyfree( (void *) b );
  1050. }
  1051. /* Initializes or reinitializes a buffer.
  1052. * This function is sometimes called more than once on the same buffer,
  1053. * such as during a yyrestart() or at EOF.
  1054. */
  1055. static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file )
  1056. {
  1057. int oerrno = errno;
  1058. yy_flush_buffer( b );
  1059. b->yy_input_file = file;
  1060. b->yy_fill_buffer = 1;
  1061. /* If b is the current buffer, then yy_init_buffer was _probably_
  1062. * called from yyrestart() or through yy_get_next_buffer.
  1063. * In that case, we don't want to reset the lineno or column.
  1064. */
  1065. if (b != YY_CURRENT_BUFFER){
  1066. b->yy_bs_lineno = 1;
  1067. b->yy_bs_column = 0;
  1068. }
  1069. b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
  1070. errno = oerrno;
  1071. }
  1072. /** Discard all buffered characters. On the next scan, YY_INPUT will be called.
  1073. * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
  1074. *
  1075. */
  1076. void yy_flush_buffer (YY_BUFFER_STATE b )
  1077. {
  1078. if ( ! b )
  1079. return;
  1080. b->yy_n_chars = 0;
  1081. /* We always need two end-of-buffer characters. The first causes
  1082. * a transition to the end-of-buffer state. The second causes
  1083. * a jam in that state.
  1084. */
  1085. b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
  1086. b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
  1087. b->yy_buf_pos = &b->yy_ch_buf[0];
  1088. b->yy_at_bol = 1;
  1089. b->yy_buffer_status = YY_BUFFER_NEW;
  1090. if ( b == YY_CURRENT_BUFFER )
  1091. yy_load_buffer_state( );
  1092. }
  1093. /** Pushes the new state onto the stack. The new state becomes
  1094. * the current state. This function will allocate the stack
  1095. * if necessary.
  1096. * @param new_buffer The new state.
  1097. *
  1098. */
  1099. void yypush_buffer_state (YY_BUFFER_STATE new_buffer )
  1100. {
  1101. if (new_buffer == NULL)
  1102. return;
  1103. yyensure_buffer_stack();
  1104. /* This block is copied from yy_switch_to_buffer. */
  1105. if ( YY_CURRENT_BUFFER )
  1106. {
  1107. /* Flush out information for old buffer. */
  1108. *(yy_c_buf_p) = (yy_hold_char);
  1109. YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
  1110. YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
  1111. }
  1112. /* Only push if top exists. Otherwise, replace top. */
  1113. if (YY_CURRENT_BUFFER)
  1114. (yy_buffer_stack_top)++;
  1115. YY_CURRENT_BUFFER_LVALUE = new_buffer;
  1116. /* copied from yy_switch_to_buffer. */
  1117. yy_load_buffer_state( );
  1118. (yy_did_buffer_switch_on_eof) = 1;
  1119. }
  1120. /** Removes and deletes the top of the stack, if present.
  1121. * The next element becomes the new top.
  1122. *
  1123. */
  1124. void yypop_buffer_state (void)
  1125. {
  1126. if (!YY_CURRENT_BUFFER)
  1127. return;
  1128. yy_delete_buffer(YY_CURRENT_BUFFER );
  1129. YY_CURRENT_BUFFER_LVALUE = NULL;
  1130. if ((yy_buffer_stack_top) > 0)
  1131. --(yy_buffer_stack_top);
  1132. if (YY_CURRENT_BUFFER) {
  1133. yy_load_buffer_state( );
  1134. (yy_did_buffer_switch_on_eof) = 1;
  1135. }
  1136. }
  1137. /* Allocates the stack if it does not exist.
  1138. * Guarantees space for at least one push.
  1139. */
  1140. static void yyensure_buffer_stack (void)
  1141. {
  1142. yy_size_t num_to_alloc;
  1143. if (!(yy_buffer_stack)) {
  1144. /* First allocation is just for 2 elements, since we don't know if this
  1145. * scanner will even need a stack. We use 2 instead of 1 to avoid an
  1146. * immediate realloc on the next call.
  1147. */
  1148. num_to_alloc = 1; /* After all that talk, this was set to 1 anyways... */
  1149. (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
  1150. (num_to_alloc * sizeof(struct yy_buffer_state*)
  1151. );
  1152. if ( ! (yy_buffer_stack) )
  1153. YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
  1154. memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
  1155. (yy_buffer_stack_max) = num_to_alloc;
  1156. (yy_buffer_stack_top) = 0;
  1157. return;
  1158. }
  1159. if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
  1160. /* Increase the buffer to prepare for a possible push. */
  1161. yy_size_t grow_size = 8 /* arbitrary grow size */;
  1162. num_to_alloc = (yy_buffer_stack_max) + grow_size;
  1163. (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
  1164. ((yy_buffer_stack),
  1165. num_to_alloc * sizeof(struct yy_buffer_state*)
  1166. );
  1167. if ( ! (yy_buffer_stack) )
  1168. YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
  1169. /* zero only the new slots.*/
  1170. memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
  1171. (yy_buffer_stack_max) = num_to_alloc;
  1172. }
  1173. }
  1174. /** Setup the input buffer state to scan directly from a user-specified character buffer.
  1175. * @param base the character buffer
  1176. * @param size the size in bytes of the character buffer
  1177. *
  1178. * @return the newly allocated buffer state object.
  1179. */
  1180. YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size )
  1181. {
  1182. YY_BUFFER_STATE b;
  1183. if ( size < 2 ||
  1184. base[size-2] != YY_END_OF_BUFFER_CHAR ||
  1185. base[size-1] != YY_END_OF_BUFFER_CHAR )
  1186. /* They forgot to leave room for the EOB's. */
  1187. return NULL;
  1188. b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) );
  1189. if ( ! b )
  1190. YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
  1191. b->yy_buf_size = (int) (size - 2); /* "- 2" to take care of EOB's */
  1192. b->yy_buf_pos = b->yy_ch_buf = base;
  1193. b->yy_is_our_buffer = 0;
  1194. b->yy_input_file = NULL;
  1195. b->yy_n_chars = b->yy_buf_size;
  1196. b->yy_is_interactive = 0;
  1197. b->yy_at_bol = 1;
  1198. b->yy_fill_buffer = 0;
  1199. b->yy_buffer_status = YY_BUFFER_NEW;
  1200. yy_switch_to_buffer( b );
  1201. return b;
  1202. }
  1203. /** Setup the input buffer state to scan a string. The next call to yylex() will
  1204. * scan from a @e copy of @a str.
  1205. * @param yystr a NUL-terminated string to scan
  1206. *
  1207. * @return the newly allocated buffer state object.
  1208. * @note If you want to scan bytes that may contain NUL values, then use
  1209. * yy_scan_bytes() instead.
  1210. */
  1211. YY_BUFFER_STATE yy_scan_string (const char * yystr )
  1212. {
  1213. return yy_scan_bytes( yystr, (int) strlen(yystr) );
  1214. }
  1215. /** Setup the input buffer state to scan the given bytes. The next call to yylex() will
  1216. * scan from a @e copy of @a bytes.
  1217. * @param yybytes the byte buffer to scan
  1218. * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
  1219. *
  1220. * @return the newly allocated buffer state object.
  1221. */
  1222. YY_BUFFER_STATE yy_scan_bytes (const char * yybytes, int _yybytes_len )
  1223. {
  1224. YY_BUFFER_STATE b;
  1225. char *buf;
  1226. yy_size_t n;
  1227. int i;
  1228. /* Get memory for full buffer, including space for trailing EOB's. */
  1229. n = (yy_size_t) (_yybytes_len + 2);
  1230. buf = (char *) yyalloc( n );
  1231. if ( ! buf )
  1232. YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
  1233. for ( i = 0; i < _yybytes_len; ++i )
  1234. buf[i] = yybytes[i];
  1235. buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
  1236. b = yy_scan_buffer( buf, n );
  1237. if ( ! b )
  1238. YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
  1239. /* It's okay to grow etc. this buffer, and we should throw it
  1240. * away when we're done.
  1241. */
  1242. b->yy_is_our_buffer = 1;
  1243. return b;
  1244. }
  1245. #ifndef YY_EXIT_FAILURE
  1246. #define YY_EXIT_FAILURE 2
  1247. #endif
  1248. static void yynoreturn yy_fatal_error (const char* msg )
  1249. {
  1250. fprintf( stderr, "%s\n", msg );
  1251. exit( YY_EXIT_FAILURE );
  1252. }
  1253. /* Redefine yyless() so it works in section 3 code. */
  1254. #undef yyless
  1255. #define yyless(n) \
  1256. do \
  1257. { \
  1258. /* Undo effects of setting up yytext. */ \
  1259. int yyless_macro_arg = (n); \
  1260. YY_LESS_LINENO(yyless_macro_arg);\
  1261. yytext[yyleng] = (yy_hold_char); \
  1262. (yy_c_buf_p) = yytext + yyless_macro_arg; \
  1263. (yy_hold_char) = *(yy_c_buf_p); \
  1264. *(yy_c_buf_p) = '\0'; \
  1265. yyleng = yyless_macro_arg; \
  1266. } \
  1267. while ( 0 )
  1268. /* Accessor methods (get/set functions) to struct members. */
  1269. /** Get the current line number.
  1270. *
  1271. */
  1272. int yyget_lineno (void)
  1273. {
  1274. return yylineno;
  1275. }
  1276. /** Get the input stream.
  1277. *
  1278. */
  1279. FILE *yyget_in (void)
  1280. {
  1281. return yyin;
  1282. }
  1283. /** Get the output stream.
  1284. *
  1285. */
  1286. FILE *yyget_out (void)
  1287. {
  1288. return yyout;
  1289. }
  1290. /** Get the length of the current token.
  1291. *
  1292. */
  1293. int yyget_leng (void)
  1294. {
  1295. return yyleng;
  1296. }
  1297. /** Get the current token.
  1298. *
  1299. */
  1300. char *yyget_text (void)
  1301. {
  1302. return yytext;
  1303. }
  1304. /** Set the current line number.
  1305. * @param _line_number line number
  1306. *
  1307. */
  1308. void yyset_lineno (int _line_number )
  1309. {
  1310. yylineno = _line_number;
  1311. }
  1312. /** Set the input stream. This does not discard the current
  1313. * input buffer.
  1314. * @param _in_str A readable stream.
  1315. *
  1316. * @see yy_switch_to_buffer
  1317. */
  1318. void yyset_in (FILE * _in_str )
  1319. {
  1320. yyin = _in_str ;
  1321. }
  1322. void yyset_out (FILE * _out_str )
  1323. {
  1324. yyout = _out_str ;
  1325. }
  1326. int yyget_debug (void)
  1327. {
  1328. return yy_flex_debug;
  1329. }
  1330. void yyset_debug (int _bdebug )
  1331. {
  1332. yy_flex_debug = _bdebug ;
  1333. }
  1334. static int yy_init_globals (void)
  1335. {
  1336. /* Initialization is the same as for the non-reentrant scanner.
  1337. * This function is called from yylex_destroy(), so don't allocate here.
  1338. */
  1339. (yy_buffer_stack) = NULL;
  1340. (yy_buffer_stack_top) = 0;
  1341. (yy_buffer_stack_max) = 0;
  1342. (yy_c_buf_p) = NULL;
  1343. (yy_init) = 0;
  1344. (yy_start) = 0;
  1345. /* Defined in main.c */
  1346. #ifdef YY_STDINIT
  1347. yyin = stdin;
  1348. yyout = stdout;
  1349. #else
  1350. yyin = NULL;
  1351. yyout = NULL;
  1352. #endif
  1353. /* For future reference: Set errno on error, since we are called by
  1354. * yylex_init()
  1355. */
  1356. return 0;
  1357. }
  1358. /* yylex_destroy is for both reentrant and non-reentrant scanners. */
  1359. int yylex_destroy (void)
  1360. {
  1361. /* Pop the buffer stack, destroying each element. */
  1362. while(YY_CURRENT_BUFFER){
  1363. yy_delete_buffer( YY_CURRENT_BUFFER );
  1364. YY_CURRENT_BUFFER_LVALUE = NULL;
  1365. yypop_buffer_state();
  1366. }
  1367. /* Destroy the stack itself. */
  1368. yyfree((yy_buffer_stack) );
  1369. (yy_buffer_stack) = NULL;
  1370. /* Reset the globals. This is important in a non-reentrant scanner so the next time
  1371. * yylex() is called, initialization will occur. */
  1372. yy_init_globals( );
  1373. return 0;
  1374. }
  1375. /*
  1376. * Internal utility routines.
  1377. */
  1378. #ifndef yytext_ptr
  1379. static void yy_flex_strncpy (char* s1, const char * s2, int n )
  1380. {
  1381. int i;
  1382. for ( i = 0; i < n; ++i )
  1383. s1[i] = s2[i];
  1384. }
  1385. #endif
  1386. #ifdef YY_NEED_STRLEN
  1387. static int yy_flex_strlen (const char * s )
  1388. {
  1389. int n;
  1390. for ( n = 0; s[n]; ++n )
  1391. ;
  1392. return n;
  1393. }
  1394. #endif
  1395. void *yyalloc (yy_size_t size )
  1396. {
  1397. return malloc(size);
  1398. }
  1399. void *yyrealloc (void * ptr, yy_size_t size )
  1400. {
  1401. /* The cast to (char *) in the following accommodates both
  1402. * implementations that use char* generic pointers, and those
  1403. * that use void* generic pointers. It works with the latter
  1404. * because both ANSI C and C++ allow castless assignment from
  1405. * any pointer type to void*, and deal with argument conversions
  1406. * as though doing an assignment.
  1407. */
  1408. return realloc(ptr, size);
  1409. }
  1410. void yyfree (void * ptr )
  1411. {
  1412. free( (char *) ptr ); /* see yyrealloc() for (char *) cast */
  1413. }
  1414. #define YYTABLES_NAME "yytables"
  1415. #line 26 "eval.l"