lex.yy.c

Description du code

lex.yy.c est un fichier du projet Compilateur LSD010.
Ce fichier est situé dans /var/www/bin/sniplets/lsd010/.

Projet Compilateur LSD010 :

Compilateur LSD010 développé dans le cadre du cours de syntaxe et sémantiqueref 1

Code source ou contenu du fichier

  1. #line 3 "lex.yy.c"
  2.  
  3. #define YY_INT_ALIGNED short int
  4.  
  5. /* A lexical scanner generated by flex */
  6.  
  7. #define FLEX_SCANNER
  8. #define YY_FLEX_MAJOR_VERSION 2
  9. #define YY_FLEX_MINOR_VERSION 5
  10. #define YY_FLEX_SUBMINOR_VERSION 35
  11. #if YY_FLEX_SUBMINOR_VERSION > 0
  12. #define FLEX_BETA
  13. #endif
  14.  
  15. /* First, we deal with platform-specific or compiler-specific issues. */
  16.  
  17. /* begin standard C headers. */
  18. #include <stdio.h>
  19. #include <string.h>
  20. #include <errno.h>
  21. #include <stdlib.h>
  22.  
  23. /* end standard C headers. */
  24.  
  25. /* flex integer type definitions */
  26.  
  27. #ifndef FLEXINT_H
  28. #define FLEXINT_H
  29.  
  30. /* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
  31.  
  32. #if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
  33.  
  34. /* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
  35.  * if you want the limit (max/min) macros for int types.
  36.  */
  37. #ifndef __STDC_LIMIT_MACROS
  38. #define __STDC_LIMIT_MACROS 1
  39. #endif
  40.  
  41. #include <inttypes.h>
  42. typedef int8_t flex_int8_t;
  43. typedef uint8_t flex_uint8_t;
  44. typedef int16_t flex_int16_t;
  45. typedef uint16_t flex_uint16_t;
  46. typedef int32_t flex_int32_t;
  47. typedef uint32_t flex_uint32_t;
  48. #else
  49. typedef signed char flex_int8_t;
  50. typedef short int flex_int16_t;
  51. typedef int flex_int32_t;
  52. typedef unsigned char flex_uint8_t;
  53. typedef unsigned short int flex_uint16_t;
  54. typedef unsigned int flex_uint32_t;
  55.  
  56. /* Limits of integral types. */
  57. #ifndef INT8_MIN
  58. #define INT8_MIN (-128)
  59. #endif
  60. #ifndef INT16_MIN
  61. #define INT16_MIN (-32767-1)
  62. #endif
  63. #ifndef INT32_MIN
  64. #define INT32_MIN (-2147483647-1)
  65. #endif
  66. #ifndef INT8_MAX
  67. #define INT8_MAX (127)
  68. #endif
  69. #ifndef INT16_MAX
  70. #define INT16_MAX (32767)
  71. #endif
  72. #ifndef INT32_MAX
  73. #define INT32_MAX (2147483647)
  74. #endif
  75. #ifndef UINT8_MAX
  76. #define UINT8_MAX (255U)
  77. #endif
  78. #ifndef UINT16_MAX
  79. #define UINT16_MAX (65535U)
  80. #endif
  81. #ifndef UINT32_MAX
  82. #define UINT32_MAX (4294967295U)
  83. #endif
  84.  
  85. #endif /* ! C99 */
  86.  
  87. #endif /* ! FLEXINT_H */
  88.  
  89. #ifdef __cplusplus
  90.  
  91. /* The "const" storage-class-modifier is valid. */
  92. #define YY_USE_CONST
  93.  
  94. #else /* ! __cplusplus */
  95.  
  96. /* C99 requires __STDC__ to be defined as 1. */
  97. #if defined (__STDC__)
  98.  
  99. #define YY_USE_CONST
  100.  
  101. #endif /* defined (__STDC__) */
  102. #endif /* ! __cplusplus */
  103.  
  104. #ifdef YY_USE_CONST
  105. #define yyconst const
  106. #else
  107. #define yyconst
  108. #endif
  109.  
  110. /* Returned upon end-of-file. */
  111. #define YY_NULL 0
  112.  
  113. /* Promotes a possibly negative, possibly signed char to an unsigned
  114.  * integer for use as an array index. If the signed char is negative,
  115.  * we want to instead treat it as an 8-bit unsigned char, hence the
  116.  * double cast.
  117.  */
  118. #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
  119.  
  120. /* Enter a start condition. This macro really ought to take a parameter,
  121.  * but we do it the disgusting crufty way forced on us by the ()-less
  122.  * definition of BEGIN.
  123.  */
  124. #define BEGIN (yy_start) = 1 + 2 *
  125.  
  126. /* Translate the current start state into a value that can be later handed
  127.  * to BEGIN to return to the state. The YYSTATE alias is for lex
  128.  * compatibility.
  129.  */
  130. #define YY_START (((yy_start) - 1) / 2)
  131. #define YYSTATE YY_START
  132.  
  133. /* Action number for EOF rule of a given start state. */
  134. #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
  135.  
  136. /* Special action meaning "start processing a new file". */
  137. #define YY_NEW_FILE yyrestart(yyin )
  138.  
  139. #define YY_END_OF_BUFFER_CHAR 0
  140.  
  141. /* Size of default input buffer. */
  142. #ifndef YY_BUF_SIZE
  143. #ifdef __ia64__
  144. /* On IA-64, the buffer size is 16k, not 8k.
  145.  * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
  146.  * Ditto for the __ia64__ case accordingly.
  147.  */
  148. #define YY_BUF_SIZE 32768
  149. #else
  150. #define YY_BUF_SIZE 16384
  151. #endif /* __ia64__ */
  152. #endif
  153.  
  154. /* The state buf must be large enough to hold one state per character in the main buffer.
  155.  */
  156. #define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
  157.  
  158. #ifndef YY_TYPEDEF_YY_BUFFER_STATE
  159. #define YY_TYPEDEF_YY_BUFFER_STATE
  160. typedef struct yy_buffer_state *YY_BUFFER_STATE;
  161. #endif
  162.  
  163. extern int yyleng;
  164.  
  165. extern FILE *yyin, *yyout;
  166.  
  167. #define EOB_ACT_CONTINUE_SCAN 0
  168. #define EOB_ACT_END_OF_FILE 1
  169. #define EOB_ACT_LAST_MATCH 2
  170.  
  171. /* Note: We specifically omit the test for yy_rule_can_match_eol because it requires
  172.   * access to the local variable yy_act. Since yyless() is a macro, it would break
  173.   * existing scanners that call yyless() from OUTSIDE yylex.
  174.   * One obvious solution it to make yy_act a global. I tried that, and saw
  175.   * a 5% performance hit in a non-yylineno scanner, because yy_act is
  176.   * normally declared as a register variable-- so it is not worth it.
  177.   */
  178. #define YY_LESS_LINENO(n) \
  179.   do { \
  180.   int yyl;\
  181.   for ( yyl = n; yyl < yyleng; ++yyl )\
  182.   if ( yytext[yyl] == '\n' )\
  183.   --yylineno;\
  184.   }while(0)
  185.  
  186. /* Return all but the first "n" matched characters back to the input stream. */
  187. #define yyless(n) \
  188. do \
  189. { \
  190. /* Undo effects of setting up yytext. */ \
  191.   int yyless_macro_arg = (n); \
  192.   YY_LESS_LINENO(yyless_macro_arg);\
  193. *yy_cp = (yy_hold_char); \
  194. YY_RESTORE_YY_MORE_OFFSET \
  195. (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
  196. YY_DO_BEFORE_ACTION; /* set up yytext again */ \
  197. } \
  198. while ( 0 )
  199.  
  200. #define unput(c) yyunput( c, (yytext_ptr) )
  201.  
  202. #ifndef YY_TYPEDEF_YY_SIZE_T
  203. #define YY_TYPEDEF_YY_SIZE_T
  204. typedef size_t yy_size_t;
  205. #endif
  206.  
  207. #ifndef YY_STRUCT_YY_BUFFER_STATE
  208. #define YY_STRUCT_YY_BUFFER_STATE
  209. struct yy_buffer_state
  210. {
  211. FILE *yy_input_file;
  212.  
  213. char *yy_ch_buf; /* input buffer */
  214. char *yy_buf_pos; /* current position in input buffer */
  215.  
  216. /* Size of input buffer in bytes, not including room for EOB
  217. * characters.
  218. */
  219. yy_size_t yy_buf_size;
  220.  
  221. /* Number of characters read into yy_ch_buf, not including EOB
  222. * characters.
  223. */
  224. int yy_n_chars;
  225.  
  226. /* Whether we "own" the buffer - i.e., we know we created it,
  227. * and can realloc() it to grow it, and should free() it to
  228. * delete it.
  229. */
  230. int yy_is_our_buffer;
  231.  
  232. /* Whether this is an "interactive" input source; if so, and
  233. * if we're using stdio for input, then we want to use getc()
  234. * instead of fread(), to make sure we stop fetching input after
  235. * each newline.
  236. */
  237. int yy_is_interactive;
  238.  
  239. /* Whether we're considered to be at the beginning of a line.
  240. * If so, '^' rules will be active on the next match, otherwise
  241. * not.
  242. */
  243. int yy_at_bol;
  244.  
  245. int yy_bs_lineno; /**< The line count. */
  246. int yy_bs_column; /**< The column count. */
  247.  
  248. /* Whether to try to fill the input buffer when we reach the
  249. * end of it.
  250. */
  251. int yy_fill_buffer;
  252.  
  253. int yy_buffer_status;
  254.  
  255. #define YY_BUFFER_NEW 0
  256. #define YY_BUFFER_NORMAL 1
  257. /* When an EOF's been seen but there's still some text to process
  258. * then we mark the buffer as YY_EOF_PENDING, to indicate that we
  259. * shouldn't try reading from the input source any more. We might
  260. * still have a bunch of tokens to match, though, because of
  261. * possible backing-up.
  262. *
  263. * When we actually see the EOF, we change the status to "new"
  264. * (via yyrestart()), so that the user can continue scanning by
  265. * just pointing yyin at a new input file.
  266. */
  267. #define YY_BUFFER_EOF_PENDING 2
  268.  
  269. };
  270. #endif /* !YY_STRUCT_YY_BUFFER_STATE */
  271.  
  272. /* Stack of input buffers. */
  273. static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
  274. static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
  275. static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
  276.  
  277. /* We provide macros for accessing buffer states in case in the
  278.  * future we want to put the buffer states in a more general
  279.  * "scanner state".
  280.  *
  281.  * Returns the top of the stack, or NULL.
  282.  */
  283. #define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
  284.   ? (yy_buffer_stack)[(yy_buffer_stack_top)] \
  285.   : NULL)
  286.  
  287. /* Same as previous macro, but useful when we know that the buffer stack is not
  288.  * NULL or when we need an lvalue. For internal use only.
  289.  */
  290. #define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
  291.  
  292. /* yy_hold_char holds the character lost when yytext is formed. */
  293. static char yy_hold_char;
  294. static int yy_n_chars; /* number of characters read into yy_ch_buf */
  295. int yyleng;
  296.  
  297. /* Points to current character in buffer. */
  298. static char *yy_c_buf_p = (char *) 0;
  299. static int yy_init = 0; /* whether we need to initialize */
  300. static int yy_start = 0; /* start state number */
  301.  
  302. /* Flag which is used to allow yywrap()'s to do buffer switches
  303.  * instead of setting up a fresh yyin. A bit of a hack ...
  304.  */
  305. static int yy_did_buffer_switch_on_eof;
  306.  
  307. void yyrestart (FILE *input_file );
  308. void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer );
  309. YY_BUFFER_STATE yy_create_buffer (FILE *file,int size );
  310. void yy_delete_buffer (YY_BUFFER_STATE b );
  311. void yy_flush_buffer (YY_BUFFER_STATE b );
  312. void yypush_buffer_state (YY_BUFFER_STATE new_buffer );
  313. void yypop_buffer_state (void );
  314.  
  315. static void yyensure_buffer_stack (void );
  316. static void yy_load_buffer_state (void );
  317. static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file );
  318.  
  319. #define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER )
  320.  
  321. YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size );
  322. YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str );
  323. YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,int len );
  324.  
  325. void *yyalloc (yy_size_t );
  326. void *yyrealloc (void *,yy_size_t );
  327. void yyfree (void * );
  328.  
  329. #define yy_new_buffer yy_create_buffer
  330.  
  331. #define yy_set_interactive(is_interactive) \
  332. { \
  333. if ( ! YY_CURRENT_BUFFER ){ \
  334.   yyensure_buffer_stack (); \
  335. YY_CURRENT_BUFFER_LVALUE = \
  336.   yy_create_buffer(yyin,YY_BUF_SIZE ); \
  337. } \
  338. YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
  339. }
  340.  
  341. #define yy_set_bol(at_bol) \
  342. { \
  343. if ( ! YY_CURRENT_BUFFER ){\
  344.   yyensure_buffer_stack (); \
  345. YY_CURRENT_BUFFER_LVALUE = \
  346.   yy_create_buffer(yyin,YY_BUF_SIZE ); \
  347. } \
  348. YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
  349. }
  350.  
  351. #define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
  352.  
  353. /* Begin user sect3 */
  354.  
  355. #define yywrap(n) 1
  356. #define YY_SKIP_YYWRAP
  357.  
  358. typedef unsigned char YY_CHAR;
  359.  
  360. FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
  361.  
  362. typedef int yy_state_type;
  363.  
  364. extern int yylineno;
  365.  
  366. int yylineno = 1;
  367.  
  368. extern char *yytext;
  369. #define yytext_ptr yytext
  370.  
  371. static yy_state_type yy_get_previous_state (void );
  372. static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
  373. static int yy_get_next_buffer (void );
  374. static void yy_fatal_error (yyconst char msg[] );
  375.  
  376. /* Done after the current pattern has been matched and before the
  377.  * corresponding action - sets up yytext.
  378.  */
  379. #define YY_DO_BEFORE_ACTION \
  380. (yytext_ptr) = yy_bp; \
  381. yyleng = (size_t) (yy_cp - yy_bp); \
  382. (yy_hold_char) = *yy_cp; \
  383. *yy_cp = '\0'; \
  384. (yy_c_buf_p) = yy_cp;
  385.  
  386. #define YY_NUM_RULES 54
  387. #define YY_END_OF_BUFFER 55
  388. /* This struct is not used in this scanner,
  389.   but its presence is necessary. */
  390. struct yy_trans_info
  391. {
  392. flex_int32_t yy_verify;
  393. flex_int32_t yy_nxt;
  394. };
  395. static yyconst flex_int16_t yy_accept[125] =
  396. { 0,
  397. 0, 0, 0, 0, 0, 0, 55, 53, 42, 43,
  398. 8, 6, 17, 20, 14, 12, 24, 13, 19, 53,
  399. 44, 44, 25, 26, 11, 3, 45, 22, 23, 45,
  400. 45, 45, 45, 45, 45, 45, 45, 45, 45, 45,
  401. 45, 18, 7, 21, 52, 51, 50, 49, 50, 42,
  402. 4, 47, 46, 44, 10, 9, 45, 45, 45, 45,
  403. 45, 45, 45, 38, 45, 45, 45, 45, 45, 45,
  404. 45, 45, 45, 45, 5, 48, 45, 15, 45, 45,
  405. 37, 31, 45, 45, 16, 35, 45, 45, 45, 30,
  406. 45, 45, 45, 45, 39, 45, 45, 45, 45, 34,
  407.  
  408. 45, 27, 29, 45, 45, 45, 28, 45, 45, 45,
  409. 45, 40, 33, 45, 45, 45, 45, 36, 1, 2,
  410. 45, 32, 41, 0
  411. } ;
  412.  
  413. static yyconst flex_int32_t yy_ec[256] =
  414. { 0,
  415. 1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
  416. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  417. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  418. 1, 2, 4, 1, 1, 1, 1, 5, 1, 6,
  419. 7, 8, 9, 10, 11, 12, 13, 14, 15, 15,
  420. 15, 15, 15, 15, 15, 15, 15, 16, 17, 18,
  421. 19, 1, 1, 1, 20, 20, 20, 20, 20, 20,
  422. 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
  423. 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
  424. 21, 1, 22, 1, 1, 1, 23, 24, 25, 26,
  425.  
  426. 27, 28, 29, 30, 31, 20, 32, 33, 34, 35,
  427. 36, 37, 20, 38, 39, 40, 41, 42, 43, 20,
  428. 44, 20, 45, 46, 47, 1, 1, 1, 1, 1,
  429. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  430. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  431. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  432. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  433. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  434. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  435. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  436.  
  437. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  438. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  439. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  440. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  441. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  442. 1, 1, 1, 1, 1
  443. } ;
  444.  
  445. static yyconst flex_int32_t yy_meta[48] =
  446. { 0,
  447. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  448. 1, 1, 1, 2, 2, 1, 1, 1, 1, 2,
  449. 1, 1, 2, 2, 2, 2, 2, 2, 2, 2,
  450. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  451. 2, 2, 2, 2, 1, 1, 1
  452. } ;
  453.  
  454. static yyconst flex_int16_t yy_base[128] =
  455. { 0,
  456. 0, 0, 133, 132, 45, 46, 134, 137, 131, 137,
  457. 137, 127, 137, 137, 137, 137, 137, 137, 137, 42,
  458. 137, 37, 137, 137, 112, 111, 0, 137, 137, 93,
  459. 97, 94, 33, 99, 29, 89, 83, 96, 84, 35,
  460. 29, 137, 75, 137, 137, 137, 137, 137, 107, 117,
  461. 137, 137, 137, 46, 137, 137, 0, 82, 75, 77,
  462. 82, 76, 73, 0, 72, 84, 84, 69, 39, 67,
  463. 69, 75, 74, 73, 137, 137, 70, 0, 75, 62,
  464. 0, 0, 36, 66, 0, 0, 73, 57, 70, 0,
  465. 70, 62, 54, 66, 0, 65, 62, 50, 52, 0,
  466.  
  467. 50, 0, 0, 60, 59, 62, 0, 57, 55, 37,
  468. 41, 0, 0, 39, 35, 47, 26, 0, 0, 0,
  469. 34, 0, 0, 137, 79, 81, 63
  470. } ;
  471.  
  472. static yyconst flex_int16_t yy_def[128] =
  473. { 0,
  474. 124, 1, 125, 125, 126, 126, 124, 124, 124, 124,
  475. 124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  476. 124, 124, 124, 124, 124, 124, 127, 124, 124, 127,
  477. 127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  478. 127, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  479. 124, 124, 124, 124, 124, 124, 127, 127, 127, 127,
  480. 127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  481. 127, 127, 127, 127, 124, 124, 127, 127, 127, 127,
  482. 127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  483. 127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  484.  
  485. 127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  486. 127, 127, 127, 127, 127, 127, 127, 127, 127, 127,
  487. 127, 127, 127, 0, 124, 124, 124
  488. } ;
  489.  
  490. static yyconst flex_int16_t yy_nxt[185] =
  491. { 0,
  492. 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
  493. 18, 19, 20, 21, 22, 23, 24, 25, 26, 27,
  494. 28, 29, 27, 30, 27, 31, 32, 33, 34, 27,
  495. 35, 27, 27, 36, 27, 27, 37, 38, 27, 39,
  496. 27, 40, 41, 27, 42, 43, 44, 48, 48, 52,
  497. 54, 54, 49, 49, 53, 61, 64, 71, 73, 54,
  498. 54, 87, 97, 65, 57, 123, 74, 66, 62, 122,
  499. 72, 121, 120, 119, 98, 118, 117, 116, 88, 45,
  500. 45, 47, 47, 115, 114, 113, 112, 111, 110, 109,
  501. 108, 107, 106, 105, 104, 103, 102, 101, 100, 99,
  502.  
  503. 96, 95, 94, 93, 92, 91, 90, 89, 86, 85,
  504. 84, 83, 82, 81, 80, 79, 78, 77, 50, 76,
  505. 75, 70, 69, 68, 67, 63, 60, 59, 58, 56,
  506. 55, 51, 50, 124, 46, 46, 7, 124, 124, 124,
  507. 124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  508. 124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  509. 124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  510. 124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  511. 124, 124, 124, 124
  512. } ;
  513.  
  514. static yyconst flex_int16_t yy_chk[185] =
  515. { 0,
  516. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  517. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  518. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  519. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  520. 1, 1, 1, 1, 1, 1, 1, 5, 6, 20,
  521. 22, 22, 5, 6, 20, 33, 35, 40, 41, 54,
  522. 54, 69, 83, 35, 127, 121, 41, 35, 33, 117,
  523. 40, 116, 115, 114, 83, 111, 110, 109, 69, 125,
  524. 125, 126, 126, 108, 106, 105, 104, 101, 99, 98,
  525. 97, 96, 94, 93, 92, 91, 89, 88, 87, 84,
  526.  
  527. 80, 79, 77, 74, 73, 72, 71, 70, 68, 67,
  528. 66, 65, 63, 62, 61, 60, 59, 58, 50, 49,
  529. 43, 39, 38, 37, 36, 34, 32, 31, 30, 26,
  530. 25, 12, 9, 7, 4, 3, 124, 124, 124, 124,
  531. 124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  532. 124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  533. 124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  534. 124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
  535. 124, 124, 124, 124
  536. } ;
  537.  
  538. /* Table of booleans, true if rule could match eol. */
  539. static yyconst flex_int32_t yy_rule_can_match_eol[55] =
  540. { 0,
  541. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  542. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  543. 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, };
  544.  
  545. static yy_state_type yy_last_accepting_state;
  546. static char *yy_last_accepting_cpos;
  547.  
  548. extern int yy_flex_debug;
  549. int yy_flex_debug = 0;
  550.  
  551. /* The intent behind this definition is that it'll catch
  552.  * any uses of REJECT which flex missed.
  553.  */
  554. #define REJECT reject_used_but_not_detected
  555. #define yymore() yymore_used_but_not_detected
  556. #define YY_MORE_ADJ 0
  557. #define YY_RESTORE_YY_MORE_OFFSET
  558. char *yytext;
  559. #line 1 "lsd10.l"
  560. #line 2 "lsd10.l"
  561. /*
  562.  * lsd10.l : lexical parsing file for Lex
  563.  * @see http://www.gaudry.be/langages-flex.html
  564.  * Part of the compiler Project for LSD10 language
  565.  */
  566. #include <stdio.h>
  567. #include <stdlib.h>
  568. #include <string.h>
  569.  
  570. #include "y.tab.h"
  571. /*
  572. #include "ast.h"
  573. */
  574.  
  575. #include "common.h"
  576. /**
  577.  * Count of lines read
  578.  */
  579. int lexLinesCount=0;
  580. /**
  581.  * Count of chars read
  582.  */
  583. int lexTotalCharsCount=0;
  584. extern AstNode *rootNode;
  585.  
  586. /*
  587.  * internal business
  588. *************************************************************
  589. */
  590. extern DebugInfo *psnBeforeToken;
  591. extern DebugInfo *psnAfterToken;
  592. int processToken(int tokenType);
  593. void incrementNumChar();
  594. void addLineRead();
  595.  
  596. /*
  597.  * Lex overriding
  598. *************************************************************
  599. */
  600. int yyTempColumn=1;
  601. //define YY_USER_ACTION yylloc.first_line=yylloc.last_line=yylineno;yylloc.first_column=yylloc.last_column=yyTempColumn+yyleng-1;yyTempColumn+=yyleng;
  602.  
  603. /*nbr 0|[-][1-9][0-9]*|[1-9][0-9]* */
  604. #line 606 "lex.yy.c"
  605.  
  606. #define INITIAL 0
  607. #define COMMENT_LINE 1
  608. #define COMMENT_BLOC 2
  609.  
  610. #ifndef YY_NO_UNISTD_H
  611. /* Special case for "unistd.h", since it is non-ANSI. We include it way
  612.  * down here because we want the user's section 1 to have been scanned first.
  613.  * The user has a chance to override it with an option.
  614.  */
  615. #include <unistd.h>
  616. #endif
  617.  
  618. #ifndef YY_EXTRA_TYPE
  619. #define YY_EXTRA_TYPE void *
  620. #endif
  621.  
  622. static int yy_init_globals (void );
  623.  
  624. /* Accessor methods to globals.
  625.   These are made visible to non-reentrant scanners for convenience. */
  626.  
  627. int yylex_destroy (void );
  628.  
  629. int yyget_debug (void );
  630.  
  631. void yyset_debug (int debug_flag );
  632.  
  633. YY_EXTRA_TYPE yyget_extra (void );
  634.  
  635. void yyset_extra (YY_EXTRA_TYPE user_defined );
  636.  
  637. FILE *yyget_in (void );
  638.  
  639. void yyset_in (FILE * in_str );
  640.  
  641. FILE *yyget_out (void );
  642.  
  643. void yyset_out (FILE * out_str );
  644.  
  645. int yyget_leng (void );
  646.  
  647. char *yyget_text (void );
  648.  
  649. int yyget_lineno (void );
  650.  
  651. void yyset_lineno (int line_number );
  652.  
  653. /* Macros after this point can all be overridden by user definitions in
  654.  * section 1.
  655.  */
  656.  
  657. #ifndef YY_SKIP_YYWRAP
  658. #ifdef __cplusplus
  659. extern "C" int yywrap (void );
  660. #else
  661. extern int yywrap (void );
  662. #endif
  663. #endif
  664.  
  665. static void yyunput (int c,char *buf_ptr );
  666.  
  667. #ifndef yytext_ptr
  668. static void yy_flex_strncpy (char *,yyconst char *,int );
  669. #endif
  670.  
  671. #ifdef YY_NEED_STRLEN
  672. static int yy_flex_strlen (yyconst char * );
  673. #endif
  674.  
  675. #ifndef YY_NO_INPUT
  676.  
  677. #ifdef __cplusplus
  678. static int yyinput (void );
  679. #else
  680. static int input (void );
  681. #endif
  682.  
  683. #endif
  684.  
  685. /* Amount of stuff to slurp up with each read. */
  686. #ifndef YY_READ_BUF_SIZE
  687. #ifdef __ia64__
  688. /* On IA-64, the buffer size is 16k, not 8k */
  689. #define YY_READ_BUF_SIZE 16384
  690. #else
  691. #define YY_READ_BUF_SIZE 8192
  692. #endif /* __ia64__ */
  693. #endif
  694.  
  695. /* Copy whatever the last rule matched to the standard output. */
  696. #ifndef ECHO
  697. /* This used to be an fputs(), but since the string might contain NUL's,
  698.  * we now use fwrite().
  699.  */
  700. #define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0)
  701. #endif
  702.  
  703. /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
  704.  * is returned in "result".
  705.  */
  706. #ifndef YY_INPUT
  707. #define YY_INPUT(buf,result,max_size) \
  708. if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
  709. { \
  710. int c = '*'; \
  711. size_t n; \
  712. for ( n = 0; n < max_size && \
  713. (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
  714. buf[n] = (char) c; \
  715. if ( c == '\n' ) \
  716. buf[n++] = (char) c; \
  717. if ( c == EOF && ferror( yyin ) ) \
  718. YY_FATAL_ERROR( "input in flex scanner failed" ); \
  719. result = n; \
  720. } \
  721. else \
  722. { \
  723. errno=0; \
  724. while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
  725. { \
  726. if( errno != EINTR) \
  727. { \
  728. YY_FATAL_ERROR( "input in flex scanner failed" ); \
  729. break; \
  730. } \
  731. errno=0; \
  732. clearerr(yyin); \
  733. } \
  734. }\
  735. \
  736.  
  737. #endif
  738.  
  739. /* No semi-colon after return; correct usage is to write "yyterminate();" -
  740.  * we don't want an extra ';' after the "return" because that will cause
  741.  * some compilers to complain about unreachable statements.
  742.  */
  743. #ifndef yyterminate
  744. #define yyterminate() return YY_NULL
  745. #endif
  746.  
  747. /* Number of entries by which start-condition stack grows. */
  748. #ifndef YY_START_STACK_INCR
  749. #define YY_START_STACK_INCR 25
  750. #endif
  751.  
  752. /* Report a fatal error. */
  753. #ifndef YY_FATAL_ERROR
  754. #define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
  755. #endif
  756.  
  757. /* end tables serialization structures and prototypes */
  758.  
  759. /* Default declaration of generated scanner - a define so the user can
  760.  * easily add parameters.
  761.  */
  762. #ifndef YY_DECL
  763. #define YY_DECL_IS_OURS 1
  764.  
  765. extern int yylex (void);
  766.  
  767. #define YY_DECL int yylex (void)
  768. #endif /* !YY_DECL */
  769.  
  770. /* Code executed at the beginning of each rule, after yytext and yyleng
  771.  * have been set up.
  772.  */
  773. #ifndef YY_USER_ACTION
  774. #define YY_USER_ACTION
  775. #endif
  776.  
  777. /* Code executed at the end of each rule. */
  778. #ifndef YY_BREAK
  779. #define YY_BREAK break;
  780. #endif
  781.  
  782. #define YY_RULE_SETUP \
  783. YY_USER_ACTION
  784.  
  785. /** The main scanner function which does all the work.
  786.  */
  787. YY_DECL
  788. {
  789. register yy_state_type yy_current_state;
  790. register char *yy_cp, *yy_bp;
  791. register int yy_act;
  792.  
  793. #line 54 "lsd10.l"
  794.  
  795.  
  796. //we specify that we begin with the rules of the state INITIAL
  797. BEGIN INITIAL;
  798.  
  799. #line 801 "lex.yy.c"
  800.  
  801. if ( !(yy_init) )
  802. {
  803. (yy_init) = 1;
  804.  
  805. #ifdef YY_USER_INIT
  806. YY_USER_INIT;
  807. #endif
  808.  
  809. if ( ! (yy_start) )
  810. (yy_start) = 1; /* first start state */
  811.  
  812. if ( ! yyin )
  813. yyin = stdin;
  814.  
  815. if ( ! yyout )
  816. yyout = stdout;
  817.  
  818. if ( ! YY_CURRENT_BUFFER ) {
  819. yyensure_buffer_stack ();
  820. YY_CURRENT_BUFFER_LVALUE =
  821. yy_create_buffer(yyin,YY_BUF_SIZE );
  822. }
  823.  
  824. yy_load_buffer_state( );
  825. }
  826.  
  827. while ( 1 ) /* loops until end-of-file is reached */
  828. {
  829. yy_cp = (yy_c_buf_p);
  830.  
  831. /* Support of yytext. */
  832. *yy_cp = (yy_hold_char);
  833.  
  834. /* yy_bp points to the position in yy_ch_buf of the start of
  835. * the current run.
  836. */
  837. yy_bp = yy_cp;
  838.  
  839. yy_current_state = (yy_start);
  840. yy_match:
  841. do
  842. {
  843. register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
  844. if ( yy_accept[yy_current_state] )
  845. {
  846. (yy_last_accepting_state) = yy_current_state;
  847. (yy_last_accepting_cpos) = yy_cp;
  848. }
  849. while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
  850. {
  851. yy_current_state = (int) yy_def[yy_current_state];
  852. if ( yy_current_state >= 125 )
  853. yy_c = yy_meta[(unsigned int) yy_c];
  854. }
  855. yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
  856. ++yy_cp;
  857. }
  858. while ( yy_base[yy_current_state] != 137 );
  859.  
  860. yy_find_action:
  861. yy_act = yy_accept[yy_current_state];
  862. if ( yy_act == 0 )
  863. { /* have to back up */
  864. yy_cp = (yy_last_accepting_cpos);
  865. yy_current_state = (yy_last_accepting_state);
  866. yy_act = yy_accept[yy_current_state];
  867. }
  868.  
  869. YY_DO_BEFORE_ACTION;
  870.  
  871. if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] )
  872. {
  873. int yyl;
  874. for ( yyl = 0; yyl < yyleng; ++yyl )
  875. if ( yytext[yyl] == '\n' )
  876.  
  877. yylineno++;
  878. ;
  879. }
  880.  
  881. do_action: /* This label is used only to access EOF actions. */
  882.  
  883. switch ( yy_act )
  884. { /* beginning of action switch */
  885. case 0: /* must back up */
  886. /* undo the effects of YY_DO_BEFORE_ACTION */
  887. *yy_cp = (yy_hold_char);
  888. yy_cp = (yy_last_accepting_cpos);
  889. yy_current_state = (yy_last_accepting_state);
  890. goto yy_find_action;
  891.  
  892. case 1:
  893. YY_RULE_SETUP
  894. #line 59 "lsd10.l"
  895. {
  896. incrementNumChar();
  897. return processToken(LEXICAL_BOOLEAN_TYPE);}
  898. YY_BREAK
  899. case 2:
  900. YY_RULE_SETUP
  901. #line 62 "lsd10.l"
  902. {
  903. incrementNumChar();
  904. return processToken(LEXICAL_INTEGER_TYPE);}
  905. YY_BREAK
  906. case 3:
  907. YY_RULE_SETUP
  908. #line 66 "lsd10.l"
  909. {
  910. incrementNumChar();
  911. return processToken(LEXICAL_AFFECTATION); }
  912. YY_BREAK
  913. case 4:
  914. YY_RULE_SETUP
  915. #line 70 "lsd10.l"
  916. {
  917. incrementNumChar();
  918. return processToken(LEXICAL_AND); }
  919. YY_BREAK
  920. case 5:
  921. YY_RULE_SETUP
  922. #line 73 "lsd10.l"
  923. {
  924. incrementNumChar();
  925. return processToken(LEXICAL_OR); }
  926. YY_BREAK
  927. case 6:
  928. YY_RULE_SETUP
  929. #line 76 "lsd10.l"
  930. {
  931. incrementNumChar();
  932. return processToken(LEXICAL_ANDLAZY); }
  933. YY_BREAK
  934. case 7:
  935. YY_RULE_SETUP
  936. #line 79 "lsd10.l"
  937. {
  938. incrementNumChar();
  939. return processToken(LEXICAL_ORLAZY); }
  940. YY_BREAK
  941. case 8:
  942. YY_RULE_SETUP
  943. #line 82 "lsd10.l"
  944. {
  945. incrementNumChar();
  946. return processToken(LEXICAL_NOT); }
  947. YY_BREAK
  948. case 9:
  949. YY_RULE_SETUP
  950. #line 85 "lsd10.l"
  951. {
  952. incrementNumChar();
  953. return processToken(LEXICAL_EQUALS); }
  954. YY_BREAK
  955. case 10:
  956. YY_RULE_SETUP
  957. #line 88 "lsd10.l"
  958. {
  959. incrementNumChar();
  960. return processToken(LEXICAL_LESS_EQUALS); }
  961. YY_BREAK
  962. case 11:
  963. YY_RULE_SETUP
  964. #line 91 "lsd10.l"
  965. {
  966. incrementNumChar();
  967. return processToken(LEXICAL_LESS); }
  968. YY_BREAK
  969. case 12:
  970. YY_RULE_SETUP
  971. #line 95 "lsd10.l"
  972. {
  973. incrementNumChar();
  974. return processToken(LEXICAL_PLUS); }
  975. YY_BREAK
  976. case 13:
  977. YY_RULE_SETUP
  978. #line 98 "lsd10.l"
  979. {
  980. incrementNumChar();
  981. return processToken(LEXICAL_MINUS); }
  982. YY_BREAK
  983. case 14:
  984. YY_RULE_SETUP
  985. #line 101 "lsd10.l"
  986. {
  987. incrementNumChar();
  988. return processToken(LEXICAL_MULT); }
  989. YY_BREAK
  990. case 15:
  991. YY_RULE_SETUP
  992. #line 104 "lsd10.l"
  993. {
  994. incrementNumChar();
  995. return processToken(LEXICAL_DIV); }
  996. YY_BREAK
  997. case 16:
  998. YY_RULE_SETUP
  999. #line 107 "lsd10.l"
  1000. {
  1001. incrementNumChar();
  1002. return processToken(LEXICAL_MOD); }
  1003. YY_BREAK
  1004. case 17:
  1005. YY_RULE_SETUP
  1006. #line 111 "lsd10.l"
  1007. {
  1008. incrementNumChar();
  1009. return processToken(L_PARENTHESIS); }
  1010. YY_BREAK
  1011. case 18:
  1012. YY_RULE_SETUP
  1013. #line 114 "lsd10.l"
  1014. {
  1015. incrementNumChar();
  1016. return processToken(LSQUI_BRACKET); }
  1017. YY_BREAK
  1018. case 19:
  1019. YY_RULE_SETUP
  1020. #line 117 "lsd10.l"
  1021. {
  1022. incrementNumChar();
  1023. return processToken(POINT); }
  1024. YY_BREAK
  1025. case 20:
  1026. YY_RULE_SETUP
  1027. #line 120 "lsd10.l"
  1028. {
  1029. incrementNumChar();
  1030. return processToken(R_PARENTHESIS); }
  1031. YY_BREAK
  1032. case 21:
  1033. YY_RULE_SETUP
  1034. #line 123 "lsd10.l"
  1035. {
  1036. incrementNumChar();
  1037. return processToken(RSQUI_BRACKET); }
  1038. YY_BREAK
  1039. case 22:
  1040. YY_RULE_SETUP
  1041. #line 126 "lsd10.l"
  1042. {
  1043. incrementNumChar();
  1044. return processToken(LSQUA_BRACKET); }
  1045. YY_BREAK
  1046. case 23:
  1047. YY_RULE_SETUP
  1048. #line 129 "lsd10.l"
  1049. {
  1050. incrementNumChar();
  1051. return processToken(RSQUA_BRACKET); }
  1052. YY_BREAK
  1053. case 24:
  1054. YY_RULE_SETUP
  1055. #line 132 "lsd10.l"
  1056. {
  1057. incrementNumChar();
  1058. return processToken(COMMA); }
  1059. YY_BREAK
  1060. case 25:
  1061. YY_RULE_SETUP
  1062. #line 135 "lsd10.l"
  1063. {
  1064. incrementNumChar();
  1065. return processToken(COLON); }
  1066. YY_BREAK
  1067. case 26:
  1068. YY_RULE_SETUP
  1069. #line 138 "lsd10.l"
  1070. {
  1071. incrementNumChar();
  1072. return processToken(SEMICOLON); }
  1073. YY_BREAK
  1074. case 27:
  1075. YY_RULE_SETUP
  1076. #line 142 "lsd10.l"
  1077. {
  1078. incrementNumChar();
  1079. return processToken(LEXICAL_TRUE_VAL); }
  1080. YY_BREAK
  1081. case 28:
  1082. YY_RULE_SETUP
  1083. #line 145 "lsd10.l"
  1084. {
  1085. return processToken(LEXICAL_FALSE_VAL); }
  1086. YY_BREAK
  1087. case 29:
  1088. YY_RULE_SETUP
  1089. #line 147 "lsd10.l"
  1090. {
  1091. incrementNumChar();
  1092. return processToken(LEXICAL_VOID_TYPE); }
  1093. YY_BREAK
  1094. case 30:
  1095. YY_RULE_SETUP
  1096. #line 151 "lsd10.l"
  1097. {
  1098. incrementNumChar();
  1099. return processToken(LEXICAL_VAR); }
  1100. YY_BREAK
  1101. case 31:
  1102. YY_RULE_SETUP
  1103. #line 154 "lsd10.l"
  1104. {
  1105. return processToken(LEXICAL_GET_OPS); }
  1106. YY_BREAK
  1107. case 32:
  1108. YY_RULE_SETUP
  1109. #line 156 "lsd10.l"
  1110. {
  1111. incrementNumChar();
  1112. return processToken(LEXICAL_ISEMPTY_OPS); }
  1113. YY_BREAK
  1114. case 33:
  1115. YY_RULE_SETUP
  1116. #line 159 "lsd10.l"
  1117. {
  1118. incrementNumChar();
  1119. return processToken(LEXICAL_WRITE_OPS); }
  1120. YY_BREAK
  1121. case 34:
  1122. YY_RULE_SETUP
  1123. #line 162 "lsd10.l"
  1124. {
  1125. incrementNumChar();
  1126. return processToken(LEXICAL_READ_OPS); }
  1127. YY_BREAK
  1128. case 35:
  1129. YY_RULE_SETUP
  1130. #line 165 "lsd10.l"
  1131. {
  1132. incrementNumChar();
  1133. return processToken(LEXICAL_PUT_OPS); }
  1134. YY_BREAK
  1135. case 36:
  1136. YY_RULE_SETUP
  1137. #line 168 "lsd10.l"
  1138. {
  1139. incrementNumChar();
  1140. return processToken(LEXICAL_RETURN_STMT); }
  1141. YY_BREAK
  1142. case 37:
  1143. YY_RULE_SETUP
  1144. #line 172 "lsd10.l"
  1145. {
  1146. incrementNumChar();
  1147. return processToken(LEXICAL_FLEXICAL_OR_STMT); }
  1148. YY_BREAK
  1149. case 38:
  1150. YY_RULE_SETUP
  1151. #line 175 "lsd10.l"
  1152. {
  1153. incrementNumChar();
  1154. return processToken(LEXICAL_IF_STMT); }
  1155. YY_BREAK
  1156. case 39:
  1157. YY_RULE_SETUP
  1158. #line 178 "lsd10.l"
  1159. {
  1160. incrementNumChar();
  1161. return processToken(LEXICAL_ELSE_STMT); }
  1162. YY_BREAK
  1163. case 40:
  1164. YY_RULE_SETUP
  1165. #line 181 "lsd10.l"
  1166. {
  1167. incrementNumChar();
  1168. return processToken(LEXICAL_WHILE_STMT); }
  1169. YY_BREAK
  1170. case 41:
  1171. YY_RULE_SETUP
  1172. #line 184 "lsd10.l"
  1173. {
  1174. incrementNumChar();
  1175. return processToken(LEXICAL_INSTACK_TYPE); }
  1176. YY_BREAK
  1177. case 42:
  1178. YY_RULE_SETUP
  1179. #line 188 "lsd10.l"
  1180. {
  1181. incrementNumChar();
  1182. }
  1183. YY_BREAK
  1184. case 43:
  1185. /* rule 43 can match eol */
  1186. YY_RULE_SETUP
  1187. #line 191 "lsd10.l"
  1188. {
  1189. addLineRead();
  1190. }
  1191. YY_BREAK
  1192. case 44:
  1193. YY_RULE_SETUP
  1194. #line 195 "lsd10.l"
  1195. {
  1196. yylval.text=yytext;
  1197. yylval.nval=atoi(yytext);
  1198. incrementNumChar();
  1199. return processToken(NUMBER);
  1200. }
  1201. YY_BREAK
  1202. case 45:
  1203. YY_RULE_SETUP
  1204. #line 201 "lsd10.l"
  1205. {
  1206. incrementNumChar();
  1207.  
  1208. yylval.text=(char*)calloc(strlen(yytext)+1,sizeof(char));
  1209. strcpy(yylval.text,yytext);
  1210.  
  1211. return processToken(ID);
  1212. }
  1213. YY_BREAK
  1214. case 46:
  1215. YY_RULE_SETUP
  1216. #line 210 "lsd10.l"
  1217. {
  1218. BEGIN(COMMENT_LINE);
  1219. incrementNumChar();
  1220. }
  1221. YY_BREAK
  1222. case 47:
  1223. YY_RULE_SETUP
  1224. #line 214 "lsd10.l"
  1225. {
  1226. BEGIN(COMMENT_BLOC);
  1227. incrementNumChar();
  1228. }
  1229. YY_BREAK
  1230. case 48:
  1231. YY_RULE_SETUP
  1232. #line 219 "lsd10.l"
  1233. {
  1234. BEGIN(INITIAL);
  1235. incrementNumChar();
  1236. }
  1237. YY_BREAK
  1238. case 49:
  1239. /* rule 49 can match eol */
  1240. YY_RULE_SETUP
  1241. #line 224 "lsd10.l"
  1242. {
  1243. addLineRead();
  1244. }
  1245. YY_BREAK
  1246. case 50:
  1247. YY_RULE_SETUP
  1248. #line 227 "lsd10.l"
  1249. {
  1250. incrementNumChar();/*Ignore comment*/}
  1251. YY_BREAK
  1252. case 51:
  1253. /* rule 51 can match eol */
  1254. YY_RULE_SETUP
  1255. #line 229 "lsd10.l"
  1256. {
  1257. BEGIN(INITIAL);
  1258. addLineRead();
  1259. }
  1260. YY_BREAK
  1261. case 52:
  1262. YY_RULE_SETUP
  1263. #line 233 "lsd10.l"
  1264. {
  1265. incrementNumChar();/*Ignore comment*/}
  1266. YY_BREAK
  1267. case 53:
  1268. YY_RULE_SETUP
  1269. #line 236 "lsd10.l"
  1270. {
  1271. char errorStr[1024];//todo: minimize length
  1272. sprintf(errorStr, "Error : invalid '%s' On parsed file, Line %d col %d\n",yytext, yylloc.first_line, yylloc.first_column);
  1273. yyerror(errorStr);
  1274. }
  1275. YY_BREAK
  1276. case 54:
  1277. YY_RULE_SETUP
  1278. #line 242 "lsd10.l"
  1279. ECHO;
  1280. YY_BREAK
  1281. #line 1283 "lex.yy.c"
  1282. case YY_STATE_EOF(INITIAL):
  1283. case YY_STATE_EOF(COMMENT_LINE):
  1284. case YY_STATE_EOF(COMMENT_BLOC):
  1285. yyterminate();
  1286.  
  1287. case YY_END_OF_BUFFER:
  1288. {
  1289. /* Amount of text matched not including the EOB char. */
  1290. int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
  1291.  
  1292. /* Undo the effects of YY_DO_BEFORE_ACTION. */
  1293. *yy_cp = (yy_hold_char);
  1294. YY_RESTORE_YY_MORE_OFFSET
  1295.  
  1296. if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
  1297. {
  1298. /* We're scanning a new file or input source. It's
  1299. * possible that this happened because the user
  1300. * just pointed yyin at a new source and called
  1301. * yylex(). If so, then we have to assure
  1302. * consistency between YY_CURRENT_BUFFER and our
  1303. * globals. Here is the right place to do so, because
  1304. * this is the first action (other than possibly a
  1305. * back-up) that will match for the new input source.
  1306. */
  1307. (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
  1308. YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
  1309. YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
  1310. }
  1311.  
  1312. /* Note that here we test for yy_c_buf_p "<=" to the position
  1313. * of the first EOB in the buffer, since yy_c_buf_p will
  1314. * already have been incremented past the NUL character
  1315. * (since all states make transitions on EOB to the
  1316. * end-of-buffer state). Contrast this with the test
  1317. * in input().
  1318. */
  1319. if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
  1320. { /* This was really a NUL. */
  1321. yy_state_type yy_next_state;
  1322.  
  1323. (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
  1324.  
  1325. yy_current_state = yy_get_previous_state( );
  1326.  
  1327. /* Okay, we're now positioned to make the NUL
  1328. * transition. We couldn't have
  1329. * yy_get_previous_state() go ahead and do it
  1330. * for us because it doesn't know how to deal
  1331. * with the possibility of jamming (and we don't
  1332. * want to build jamming into it because then it
  1333. * will run more slowly).
  1334. */
  1335.  
  1336. yy_next_state = yy_try_NUL_trans( yy_current_state );
  1337.  
  1338. yy_bp = (yytext_ptr) + YY_MORE_ADJ;
  1339.  
  1340. if ( yy_next_state )
  1341. {
  1342. /* Consume the NUL. */
  1343. yy_cp = ++(yy_c_buf_p);
  1344. yy_current_state = yy_next_state;
  1345. goto yy_match;
  1346. }
  1347.  
  1348. else
  1349. {
  1350. yy_cp = (yy_c_buf_p);
  1351. goto yy_find_action;
  1352. }
  1353. }
  1354.  
  1355. else switch ( yy_get_next_buffer( ) )
  1356. {
  1357. case EOB_ACT_END_OF_FILE:
  1358. {
  1359. (yy_did_buffer_switch_on_eof) = 0;
  1360.  
  1361. if ( yywrap( ) )
  1362. {
  1363. /* Note: because we've taken care in
  1364. * yy_get_next_buffer() to have set up
  1365. * yytext, we can now set up
  1366. * yy_c_buf_p so that if some total
  1367. * hoser (like flex itself) wants to
  1368. * call the scanner after we return the
  1369. * YY_NULL, it'll still work - another
  1370. * YY_NULL will get returned.
  1371. */
  1372. (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
  1373.  
  1374. yy_act = YY_STATE_EOF(YY_START);
  1375. goto do_action;
  1376. }
  1377.  
  1378. else
  1379. {
  1380. if ( ! (yy_did_buffer_switch_on_eof) )
  1381. YY_NEW_FILE;
  1382. }
  1383. break;
  1384. }
  1385.  
  1386. case EOB_ACT_CONTINUE_SCAN:
  1387. (yy_c_buf_p) =
  1388. (yytext_ptr) + yy_amount_of_matched_text;
  1389.  
  1390. yy_current_state = yy_get_previous_state( );
  1391.  
  1392. yy_cp = (yy_c_buf_p);
  1393. yy_bp = (yytext_ptr) + YY_MORE_ADJ;
  1394. goto yy_match;
  1395.  
  1396. case EOB_ACT_LAST_MATCH:
  1397. (yy_c_buf_p) =
  1398. &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
  1399.  
  1400. yy_current_state = yy_get_previous_state( );
  1401.  
  1402. yy_cp = (yy_c_buf_p);
  1403. yy_bp = (yytext_ptr) + YY_MORE_ADJ;
  1404. goto yy_find_action;
  1405. }
  1406. break;
  1407. }
  1408.  
  1409. default:
  1410. YY_FATAL_ERROR(
  1411. "fatal flex scanner internal error--no action found" );
  1412. } /* end of action switch */
  1413. } /* end of scanning one token */
  1414. } /* end of yylex */
  1415.  
  1416. /* yy_get_next_buffer - try to read in a new buffer
  1417.  *
  1418.  * Returns a code representing an action:
  1419.  * EOB_ACT_LAST_MATCH -
  1420.  * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
  1421.  * EOB_ACT_END_OF_FILE - end of file
  1422.  */
  1423. static int yy_get_next_buffer (void)
  1424. {
  1425. register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
  1426. register char *source = (yytext_ptr);
  1427. register int number_to_move, i;
  1428. int ret_val;
  1429.  
  1430. if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
  1431. YY_FATAL_ERROR(
  1432. "fatal flex scanner internal error--end of buffer missed" );
  1433.  
  1434. if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
  1435. { /* Don't try to fill the buffer, so this is an EOF. */
  1436. if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
  1437. {
  1438. /* We matched a single character, the EOB, so
  1439. * treat this as a final EOF.
  1440. */
  1441. return EOB_ACT_END_OF_FILE;
  1442. }
  1443.  
  1444. else
  1445. {
  1446. /* We matched some text prior to the EOB, first
  1447. * process it.
  1448. */
  1449. return EOB_ACT_LAST_MATCH;
  1450. }
  1451. }
  1452.  
  1453. /* Try to read more data. */
  1454.  
  1455. /* First move last chars to start of buffer. */
  1456. number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1;
  1457.  
  1458. for ( i = 0; i < number_to_move; ++i )
  1459. *(dest++) = *(source++);
  1460.  
  1461. if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
  1462. /* don't do the read, it's not guaranteed to return an EOF,
  1463. * just force an EOF
  1464. */
  1465. YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
  1466.  
  1467. else
  1468. {
  1469. int num_to_read =
  1470. YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
  1471.  
  1472. while ( num_to_read <= 0 )
  1473. { /* Not enough room in the buffer - grow it. */
  1474.  
  1475. /* just a shorter name for the current buffer */
  1476. YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
  1477.  
  1478. int yy_c_buf_p_offset =
  1479. (int) ((yy_c_buf_p) - b->yy_ch_buf);
  1480.  
  1481. if ( b->yy_is_our_buffer )
  1482. {
  1483. int new_size = b->yy_buf_size * 2;
  1484.  
  1485. if ( new_size <= 0 )
  1486. b->yy_buf_size += b->yy_buf_size / 8;
  1487. else
  1488. b->yy_buf_size *= 2;
  1489.  
  1490. b->yy_ch_buf = (char *)
  1491. /* Include room in for 2 EOB chars. */
  1492. yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 );
  1493. }
  1494. else
  1495. /* Can't grow it, we don't own it. */
  1496. b->yy_ch_buf = 0;
  1497.  
  1498. if ( ! b->yy_ch_buf )
  1499. YY_FATAL_ERROR(
  1500. "fatal error - scanner input buffer overflow" );
  1501.  
  1502. (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
  1503.  
  1504. num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
  1505. number_to_move - 1;
  1506.  
  1507. }
  1508.  
  1509. if ( num_to_read > YY_READ_BUF_SIZE )
  1510. num_to_read = YY_READ_BUF_SIZE;
  1511.  
  1512. /* Read in more data. */
  1513. YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
  1514. (yy_n_chars), (size_t) num_to_read );
  1515.  
  1516. YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
  1517. }
  1518.  
  1519. if ( (yy_n_chars) == 0 )
  1520. {
  1521. if ( number_to_move == YY_MORE_ADJ )
  1522. {
  1523. ret_val = EOB_ACT_END_OF_FILE;
  1524. yyrestart(yyin );
  1525. }
  1526.  
  1527. else
  1528. {
  1529. ret_val = EOB_ACT_LAST_MATCH;
  1530. YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
  1531. YY_BUFFER_EOF_PENDING;
  1532. }
  1533. }
  1534.  
  1535. else
  1536. ret_val = EOB_ACT_CONTINUE_SCAN;
  1537.  
  1538. if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
  1539. /* Extend the array by 50%, plus the number we really need. */
  1540. yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
  1541. YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size );
  1542. if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
  1543. YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
  1544. }
  1545.  
  1546. (yy_n_chars) += number_to_move;
  1547. YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
  1548. YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
  1549.  
  1550. (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
  1551.  
  1552. return ret_val;
  1553. }
  1554.  
  1555. /* yy_get_previous_state - get the state just before the EOB char was reached */
  1556.  
  1557. static yy_state_type yy_get_previous_state (void)
  1558. {
  1559. register yy_state_type yy_current_state;
  1560. register char *yy_cp;
  1561.  
  1562. yy_current_state = (yy_start);
  1563.  
  1564. for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
  1565. {
  1566. register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
  1567. if ( yy_accept[yy_current_state] )
  1568. {
  1569. (yy_last_accepting_state) = yy_current_state;
  1570. (yy_last_accepting_cpos) = yy_cp;
  1571. }
  1572. while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
  1573. {
  1574. yy_current_state = (int) yy_def[yy_current_state];
  1575. if ( yy_current_state >= 125 )
  1576. yy_c = yy_meta[(unsigned int) yy_c];
  1577. }
  1578. yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
  1579. }
  1580.  
  1581. return yy_current_state;
  1582. }
  1583.  
  1584. /* yy_try_NUL_trans - try to make a transition on the NUL character
  1585.  *
  1586.  * synopsis
  1587.  * next_state = yy_try_NUL_trans( current_state );
  1588.  */
  1589. static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
  1590. {
  1591. register int yy_is_jam;
  1592. register char *yy_cp = (yy_c_buf_p);
  1593.  
  1594. register YY_CHAR yy_c = 1;
  1595. if ( yy_accept[yy_current_state] )
  1596. {
  1597. (yy_last_accepting_state) = yy_current_state;
  1598. (yy_last_accepting_cpos) = yy_cp;
  1599. }
  1600. while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
  1601. {
  1602. yy_current_state = (int) yy_def[yy_current_state];
  1603. if ( yy_current_state >= 125 )
  1604. yy_c = yy_meta[(unsigned int) yy_c];
  1605. }
  1606. yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
  1607. yy_is_jam = (yy_current_state == 124);
  1608.  
  1609. return yy_is_jam ? 0 : yy_current_state;
  1610. }
  1611.  
  1612. static void yyunput (int c, register char * yy_bp )
  1613. {
  1614. register char *yy_cp;
  1615.  
  1616. yy_cp = (yy_c_buf_p);
  1617.  
  1618. /* undo effects of setting up yytext */
  1619. *yy_cp = (yy_hold_char);
  1620.  
  1621. if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
  1622. { /* need to shift things up to make room */
  1623. /* +2 for EOB chars. */
  1624. register int number_to_move = (yy_n_chars) + 2;
  1625. register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
  1626. YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
  1627. register char *source =
  1628. &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move];
  1629.  
  1630. while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
  1631. *--dest = *--source;
  1632.  
  1633. yy_cp += (int) (dest - source);
  1634. yy_bp += (int) (dest - source);
  1635. YY_CURRENT_BUFFER_LVALUE->yy_n_chars =
  1636. (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size;
  1637.  
  1638. if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
  1639. YY_FATAL_ERROR( "flex scanner push-back overflow" );
  1640. }
  1641.  
  1642. *--yy_cp = (char) c;
  1643.  
  1644. if ( c == '\n' ){
  1645. --yylineno;
  1646. }
  1647.  
  1648. (yytext_ptr) = yy_bp;
  1649. (yy_hold_char) = *yy_cp;
  1650. (yy_c_buf_p) = yy_cp;
  1651. }
  1652.  
  1653. #ifndef YY_NO_INPUT
  1654. #ifdef __cplusplus
  1655. static int yyinput (void)
  1656. #else
  1657. static int input (void)
  1658. #endif
  1659.  
  1660. {
  1661. int c;
  1662.  
  1663. *(yy_c_buf_p) = (yy_hold_char);
  1664.  
  1665. if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
  1666. {
  1667. /* yy_c_buf_p now points to the character we want to return.
  1668. * If this occurs *before* the EOB characters, then it's a
  1669. * valid NUL; if not, then we've hit the end of the buffer.
  1670. */
  1671. if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
  1672. /* This was really a NUL. */
  1673. *(yy_c_buf_p) = '\0';
  1674.  
  1675. else
  1676. { /* need more input */
  1677. int offset = (yy_c_buf_p) - (yytext_ptr);
  1678. ++(yy_c_buf_p);
  1679.  
  1680. switch ( yy_get_next_buffer( ) )
  1681. {
  1682. case EOB_ACT_LAST_MATCH:
  1683. /* This happens because yy_g_n_b()
  1684. * sees that we've accumulated a
  1685. * token and flags that we need to
  1686. * try matching the token before
  1687. * proceeding. But for input(),
  1688. * there's no matching to consider.
  1689. * So convert the EOB_ACT_LAST_MATCH
  1690. * to EOB_ACT_END_OF_FILE.
  1691. */
  1692.  
  1693. /* Reset buffer status. */
  1694. yyrestart(yyin );
  1695.  
  1696. /*FALLTHROUGH*/
  1697.  
  1698. case EOB_ACT_END_OF_FILE:
  1699. {
  1700. if ( yywrap( ) )
  1701. return EOF;
  1702.  
  1703. if ( ! (yy_did_buffer_switch_on_eof) )
  1704. YY_NEW_FILE;
  1705. #ifdef __cplusplus
  1706. return yyinput();
  1707. #else
  1708. return input();
  1709. #endif
  1710. }
  1711.  
  1712. case EOB_ACT_CONTINUE_SCAN:
  1713. (yy_c_buf_p) = (yytext_ptr) + offset;
  1714. break;
  1715. }
  1716. }
  1717. }
  1718.  
  1719. c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
  1720. *(yy_c_buf_p) = '\0'; /* preserve yytext */
  1721. (yy_hold_char) = *++(yy_c_buf_p);
  1722.  
  1723. if ( c == '\n' )
  1724.  
  1725. yylineno++;
  1726. ;
  1727.  
  1728. return c;
  1729. }
  1730. #endif /* ifndef YY_NO_INPUT */
  1731.  
  1732. /** Immediately switch to a different input stream.
  1733.  * @param input_file A readable stream.
  1734.  *
  1735.  * @note This function does not reset the start condition to @c INITIAL .
  1736.  */
  1737. void yyrestart (FILE * input_file )
  1738. {
  1739.  
  1740. if ( ! YY_CURRENT_BUFFER ){
  1741. yyensure_buffer_stack ();
  1742. YY_CURRENT_BUFFER_LVALUE =
  1743. yy_create_buffer(yyin,YY_BUF_SIZE );
  1744. }
  1745.  
  1746. yy_init_buffer(YY_CURRENT_BUFFER,input_file );
  1747. yy_load_buffer_state( );
  1748. }
  1749.  
  1750. /** Switch to a different input buffer.
  1751.  * @param new_buffer The new input buffer.
  1752.  *
  1753.  */
  1754. void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer )
  1755. {
  1756.  
  1757. /* TODO. We should be able to replace this entire function body
  1758. * with
  1759. * yypop_buffer_state();
  1760. * yypush_buffer_state(new_buffer);
  1761.   */
  1762. yyensure_buffer_stack ();
  1763. if ( YY_CURRENT_BUFFER == new_buffer )
  1764. return;
  1765.  
  1766. if ( YY_CURRENT_BUFFER )
  1767. {
  1768. /* Flush out information for old buffer. */
  1769. *(yy_c_buf_p) = (yy_hold_char);
  1770. YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
  1771. YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
  1772. }
  1773.  
  1774. YY_CURRENT_BUFFER_LVALUE = new_buffer;
  1775. yy_load_buffer_state( );
  1776.  
  1777. /* We don't actually know whether we did this switch during
  1778. * EOF (yywrap()) processing, but the only time this flag
  1779. * is looked at is after yywrap() is called, so it's safe
  1780. * to go ahead and always set it.
  1781. */
  1782. (yy_did_buffer_switch_on_eof) = 1;
  1783. }
  1784.  
  1785. static void yy_load_buffer_state (void)
  1786. {
  1787. (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
  1788. (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
  1789. yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
  1790. (yy_hold_char) = *(yy_c_buf_p);
  1791. }
  1792.  
  1793. /** Allocate and initialize an input buffer state.
  1794.  * @param file A readable stream.
  1795.  * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
  1796.  *
  1797.  * @return the allocated buffer state.
  1798.  */
  1799. YY_BUFFER_STATE yy_create_buffer (FILE * file, int size )
  1800. {
  1801. YY_BUFFER_STATE b;
  1802.  
  1803. b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) );
  1804. if ( ! b )
  1805. YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
  1806.  
  1807. b->yy_buf_size = size;
  1808.  
  1809. /* yy_ch_buf has to be 2 characters longer than the size given because
  1810. * we need to put in 2 end-of-buffer characters.
  1811. */
  1812. b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 );
  1813. if ( ! b->yy_ch_buf )
  1814. YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
  1815.  
  1816. b->yy_is_our_buffer = 1;
  1817.  
  1818. yy_init_buffer(b,file );
  1819.  
  1820. return b;
  1821. }
  1822.  
  1823. /** Destroy the buffer.
  1824.  * @param b a buffer created with yy_create_buffer()
  1825.  *
  1826.  */
  1827. void yy_delete_buffer (YY_BUFFER_STATE b )
  1828. {
  1829.  
  1830. if ( ! b )
  1831. return;
  1832.  
  1833. if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
  1834. YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
  1835.  
  1836. if ( b->yy_is_our_buffer )
  1837. yyfree((void *) b->yy_ch_buf );
  1838.  
  1839. yyfree((void *) b );
  1840. }
  1841.  
  1842. #ifndef __cplusplus
  1843. extern int isatty (int );
  1844. #endif /* __cplusplus */
  1845.  
  1846. /* Initializes or reinitializes a buffer.
  1847.  * This function is sometimes called more than once on the same buffer,
  1848.  * such as during a yyrestart() or at EOF.
  1849.  */
  1850. static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file )
  1851.  
  1852. {
  1853. int oerrno = errno;
  1854.  
  1855. yy_flush_buffer(b );
  1856.  
  1857. b->yy_input_file = file;
  1858. b->yy_fill_buffer = 1;
  1859.  
  1860. /* If b is the current buffer, then yy_init_buffer was _probably_
  1861.   * called from yyrestart() or through yy_get_next_buffer.
  1862.   * In that case, we don't want to reset the lineno or column.
  1863.   */
  1864. if (b != YY_CURRENT_BUFFER){
  1865. b->yy_bs_lineno = 1;
  1866. b->yy_bs_column = 0;
  1867. }
  1868.  
  1869. b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
  1870.  
  1871. errno = oerrno;
  1872. }
  1873.  
  1874. /** Discard all buffered characters. On the next scan, YY_INPUT will be called.
  1875.  * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
  1876.  *
  1877.  */
  1878. void yy_flush_buffer (YY_BUFFER_STATE b )
  1879. {
  1880. if ( ! b )
  1881. return;
  1882.  
  1883. b->yy_n_chars = 0;
  1884.  
  1885. /* We always need two end-of-buffer characters. The first causes
  1886. * a transition to the end-of-buffer state. The second causes
  1887. * a jam in that state.
  1888. */
  1889. b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
  1890. b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
  1891.  
  1892. b->yy_buf_pos = &b->yy_ch_buf[0];
  1893.  
  1894. b->yy_at_bol = 1;
  1895. b->yy_buffer_status = YY_BUFFER_NEW;
  1896.  
  1897. if ( b == YY_CURRENT_BUFFER )
  1898. yy_load_buffer_state( );
  1899. }
  1900.  
  1901. /** Pushes the new state onto the stack. The new state becomes
  1902.  * the current state. This function will allocate the stack
  1903.  * if necessary.
  1904.  * @param new_buffer The new state.
  1905.  *
  1906.  */
  1907. void yypush_buffer_state (YY_BUFFER_STATE new_buffer )
  1908. {
  1909. if (new_buffer == NULL)
  1910. return;
  1911.  
  1912. yyensure_buffer_stack();
  1913.  
  1914. /* This block is copied from yy_switch_to_buffer. */
  1915. if ( YY_CURRENT_BUFFER )
  1916. {
  1917. /* Flush out information for old buffer. */
  1918. *(yy_c_buf_p) = (yy_hold_char);
  1919. YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
  1920. YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
  1921. }
  1922.  
  1923. /* Only push if top exists. Otherwise, replace top. */
  1924. if (YY_CURRENT_BUFFER)
  1925. (yy_buffer_stack_top)++;
  1926. YY_CURRENT_BUFFER_LVALUE = new_buffer;
  1927.  
  1928. /* copied from yy_switch_to_buffer. */
  1929. yy_load_buffer_state( );
  1930. (yy_did_buffer_switch_on_eof) = 1;
  1931. }
  1932.  
  1933. /** Removes and deletes the top of the stack, if present.
  1934.  * The next element becomes the new top.
  1935.  *
  1936.  */
  1937. void yypop_buffer_state (void)
  1938. {
  1939. if (!YY_CURRENT_BUFFER)
  1940. return;
  1941.  
  1942. yy_delete_buffer(YY_CURRENT_BUFFER );
  1943. YY_CURRENT_BUFFER_LVALUE = NULL;
  1944. if ((yy_buffer_stack_top) > 0)
  1945. --(yy_buffer_stack_top);
  1946.  
  1947. if (YY_CURRENT_BUFFER) {
  1948. yy_load_buffer_state( );
  1949. (yy_did_buffer_switch_on_eof) = 1;
  1950. }
  1951. }
  1952.  
  1953. /* Allocates the stack if it does not exist.
  1954.  * Guarantees space for at least one push.
  1955.  */
  1956. static void yyensure_buffer_stack (void)
  1957. {
  1958. int num_to_alloc;
  1959.  
  1960. if (!(yy_buffer_stack)) {
  1961.  
  1962. /* First allocation is just for 2 elements, since we don't know if this
  1963. * scanner will even need a stack. We use 2 instead of 1 to avoid an
  1964. * immediate realloc on the next call.
  1965.   */
  1966. num_to_alloc = 1;
  1967. (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
  1968. (num_to_alloc * sizeof(struct yy_buffer_state*)
  1969. );
  1970. if ( ! (yy_buffer_stack) )
  1971. YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
  1972.  
  1973. memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
  1974.  
  1975. (yy_buffer_stack_max) = num_to_alloc;
  1976. (yy_buffer_stack_top) = 0;
  1977. return;
  1978. }
  1979.  
  1980. if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
  1981.  
  1982. /* Increase the buffer to prepare for a possible push. */
  1983. int grow_size = 8 /* arbitrary grow size */;
  1984.  
  1985. num_to_alloc = (yy_buffer_stack_max) + grow_size;
  1986. (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
  1987. ((yy_buffer_stack),
  1988. num_to_alloc * sizeof(struct yy_buffer_state*)
  1989. );
  1990. if ( ! (yy_buffer_stack) )
  1991. YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
  1992.  
  1993. /* zero only the new slots.*/
  1994. memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
  1995. (yy_buffer_stack_max) = num_to_alloc;
  1996. }
  1997. }
  1998.  
  1999. /** Setup the input buffer state to scan directly from a user-specified character buffer.
  2000.  * @param base the character buffer
  2001.  * @param size the size in bytes of the character buffer
  2002.  *
  2003.  * @return the newly allocated buffer state object.
  2004.  */
  2005. YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size )
  2006. {
  2007. YY_BUFFER_STATE b;
  2008.  
  2009. if ( size < 2 ||
  2010. base[size-2] != YY_END_OF_BUFFER_CHAR ||
  2011. base[size-1] != YY_END_OF_BUFFER_CHAR )
  2012. /* They forgot to leave room for the EOB's. */
  2013. return 0;
  2014.  
  2015. b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) );
  2016. if ( ! b )
  2017. YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
  2018.  
  2019. b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
  2020. b->yy_buf_pos = b->yy_ch_buf = base;
  2021. b->yy_is_our_buffer = 0;
  2022. b->yy_input_file = 0;
  2023. b->yy_n_chars = b->yy_buf_size;
  2024. b->yy_is_interactive = 0;
  2025. b->yy_at_bol = 1;
  2026. b->yy_fill_buffer = 0;
  2027. b->yy_buffer_status = YY_BUFFER_NEW;
  2028.  
  2029. yy_switch_to_buffer(b );
  2030.  
  2031. return b;
  2032. }
  2033.  
  2034. /** Setup the input buffer state to scan a string. The next call to yylex() will
  2035.  * scan from a @e copy of @a str.
  2036.  * @param yystr a NUL-terminated string to scan
  2037.  *
  2038.  * @return the newly allocated buffer state object.
  2039.  * @note If you want to scan bytes that may contain NUL values, then use
  2040.  * yy_scan_bytes() instead.
  2041.  */
  2042. YY_BUFFER_STATE yy_scan_string (yyconst char * yystr )
  2043. {
  2044.  
  2045. return yy_scan_bytes(yystr,strlen(yystr) );
  2046. }
  2047.  
  2048. /** Setup the input buffer state to scan the given bytes. The next call to yylex() will
  2049.  * scan from a @e copy of @a bytes.
  2050.  * @param yybytes the byte buffer to scan
  2051.  * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
  2052.  *
  2053.  * @return the newly allocated buffer state object.
  2054.  */
  2055. YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, int _yybytes_len )
  2056. {
  2057. YY_BUFFER_STATE b;
  2058. char *buf;
  2059. yy_size_t n;
  2060. int i;
  2061.  
  2062. /* Get memory for full buffer, including space for trailing EOB's. */
  2063. n = _yybytes_len + 2;
  2064. buf = (char *) yyalloc(n );
  2065. if ( ! buf )
  2066. YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
  2067.  
  2068. for ( i = 0; i < _yybytes_len; ++i )
  2069. buf[i] = yybytes[i];
  2070.  
  2071. buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
  2072.  
  2073. b = yy_scan_buffer(buf,n );
  2074. if ( ! b )
  2075. YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
  2076.  
  2077. /* It's okay to grow etc. this buffer, and we should throw it
  2078. * away when we're done.
  2079. */
  2080. b->yy_is_our_buffer = 1;
  2081.  
  2082. return b;
  2083. }
  2084.  
  2085. #ifndef YY_EXIT_FAILURE
  2086. #define YY_EXIT_FAILURE 2
  2087. #endif
  2088.  
  2089. static void yy_fatal_error (yyconst char* msg )
  2090. {
  2091. (void) fprintf( stderr, "%s\n", msg );
  2092. exit( YY_EXIT_FAILURE );
  2093. }
  2094.  
  2095. /* Redefine yyless() so it works in section 3 code. */
  2096.  
  2097. #undef yyless
  2098. #define yyless(n) \
  2099. do \
  2100. { \
  2101. /* Undo effects of setting up yytext. */ \
  2102.   int yyless_macro_arg = (n); \
  2103.   YY_LESS_LINENO(yyless_macro_arg);\
  2104. yytext[yyleng] = (yy_hold_char); \
  2105. (yy_c_buf_p) = yytext + yyless_macro_arg; \
  2106. (yy_hold_char) = *(yy_c_buf_p); \
  2107. *(yy_c_buf_p) = '\0'; \
  2108. yyleng = yyless_macro_arg; \
  2109. } \
  2110. while ( 0 )
  2111.  
  2112. /* Accessor methods (get/set functions) to struct members. */
  2113.  
  2114. /** Get the current line number.
  2115.  *
  2116.  */
  2117. int yyget_lineno (void)
  2118. {
  2119.  
  2120. return yylineno;
  2121. }
  2122.  
  2123. /** Get the input stream.
  2124.  *
  2125.  */
  2126. FILE *yyget_in (void)
  2127. {
  2128. return yyin;
  2129. }
  2130.  
  2131. /** Get the output stream.
  2132.  *
  2133.  */
  2134. FILE *yyget_out (void)
  2135. {
  2136. return yyout;
  2137. }
  2138.  
  2139. /** Get the length of the current token.
  2140.  *
  2141.  */
  2142. int yyget_leng (void)
  2143. {
  2144. return yyleng;
  2145. }
  2146.  
  2147. /** Get the current token.
  2148.  *
  2149.  */
  2150.  
  2151. char *yyget_text (void)
  2152. {
  2153. return yytext;
  2154. }
  2155.  
  2156. /** Set the current line number.
  2157.  * @param line_number
  2158.  *
  2159.  */
  2160. void yyset_lineno (int line_number )
  2161. {
  2162.  
  2163. yylineno = line_number;
  2164. }
  2165.  
  2166. /** Set the input stream. This does not discard the current
  2167.  * input buffer.
  2168.  * @param in_str A readable stream.
  2169.  *
  2170.  * @see yy_switch_to_buffer
  2171.  */
  2172. void yyset_in (FILE * in_str )
  2173. {
  2174. yyin = in_str ;
  2175. }
  2176.  
  2177. void yyset_out (FILE * out_str )
  2178. {
  2179. yyout = out_str ;
  2180. }
  2181.  
  2182. int yyget_debug (void)
  2183. {
  2184. return yy_flex_debug;
  2185. }
  2186.  
  2187. void yyset_debug (int bdebug )
  2188. {
  2189. yy_flex_debug = bdebug ;
  2190. }
  2191.  
  2192. static int yy_init_globals (void)
  2193. {
  2194. /* Initialization is the same as for the non-reentrant scanner.
  2195.   * This function is called from yylex_destroy(), so don't allocate here.
  2196.   */
  2197.  
  2198. /* We do not touch yylineno unless the option is enabled. */
  2199. yylineno = 1;
  2200.  
  2201. (yy_buffer_stack) = 0;
  2202. (yy_buffer_stack_top) = 0;
  2203. (yy_buffer_stack_max) = 0;
  2204. (yy_c_buf_p) = (char *) 0;
  2205. (yy_init) = 0;
  2206. (yy_start) = 0;
  2207.  
  2208. /* Defined in main.c */
  2209. #ifdef YY_STDINIT
  2210. yyin = stdin;
  2211. yyout = stdout;
  2212. #else
  2213. yyin = (FILE *) 0;
  2214. yyout = (FILE *) 0;
  2215. #endif
  2216.  
  2217. /* For future reference: Set errno on error, since we are called by
  2218.   * yylex_init()
  2219.   */
  2220. return 0;
  2221. }
  2222.  
  2223. /* yylex_destroy is for both reentrant and non-reentrant scanners. */
  2224. int yylex_destroy (void)
  2225. {
  2226.  
  2227. /* Pop the buffer stack, destroying each element. */
  2228. while(YY_CURRENT_BUFFER){
  2229. yy_delete_buffer(YY_CURRENT_BUFFER );
  2230. YY_CURRENT_BUFFER_LVALUE = NULL;
  2231. yypop_buffer_state();
  2232. }
  2233.  
  2234. /* Destroy the stack itself. */
  2235. yyfree((yy_buffer_stack) );
  2236. (yy_buffer_stack) = NULL;
  2237.  
  2238. /* Reset the globals. This is important in a non-reentrant scanner so the next time
  2239.   * yylex() is called, initialization will occur. */
  2240. yy_init_globals( );
  2241.  
  2242. return 0;
  2243. }
  2244.  
  2245. /*
  2246.  * Internal utility routines.
  2247.  */
  2248.  
  2249. #ifndef yytext_ptr
  2250. static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
  2251. {
  2252. register int i;
  2253. for ( i = 0; i < n; ++i )
  2254. s1[i] = s2[i];
  2255. }
  2256. #endif
  2257.  
  2258. #ifdef YY_NEED_STRLEN
  2259. static int yy_flex_strlen (yyconst char * s )
  2260. {
  2261. register int n;
  2262. for ( n = 0; s[n]; ++n )
  2263. ;
  2264.  
  2265. return n;
  2266. }
  2267. #endif
  2268.  
  2269. void *yyalloc (yy_size_t size )
  2270. {
  2271. return (void *) malloc( size );
  2272. }
  2273.  
  2274. void *yyrealloc (void * ptr, yy_size_t size )
  2275. {
  2276. /* The cast to (char *) in the following accommodates both
  2277. * implementations that use char* generic pointers, and those
  2278. * that use void* generic pointers. It works with the latter
  2279. * because both ANSI C and C++ allow castless assignment from
  2280. * any pointer type to void*, and deal with argument conversions
  2281. * as though doing an assignment.
  2282. */
  2283. return (void *) realloc( (char *) ptr, size );
  2284. }
  2285.  
  2286. void yyfree (void * ptr )
  2287. {
  2288. free( (char *) ptr ); /* see yyrealloc() for (char *) cast */
  2289. }
  2290.  
  2291. #define YYTABLES_NAME "yytables"
  2292.  
  2293. #line 242 "lsd10.l"
  2294.  
  2295.  
  2296. int processToken(int tokenType)
  2297. {
  2298. yylloc.first_line=yylloc.last_line=yylineno;
  2299. yylloc.first_column=yylloc.last_column=yyTempColumn+yyleng-1;
  2300. yyTempColumn+=yyleng;
  2301. #if(VERBOSE_LEVEL<=DEB_L)
  2302. ";%15s %15s detected(%d) line %d char %d\n",
  2303. typeToString(tokenType),
  2304. yytext,
  2305. tokenType,
  2306. (yylloc).first_line,
  2307. (yylloc).first_column
  2308. );
  2309. #endif
  2310. return tokenType;
  2311. }
  2312. void incrementNumChar()
  2313. {
  2314. //// if(lexLinesCount<1)
  2315. //// {
  2316. //// addLineRead();
  2317. //// }
  2318. //// #if(VERBOSE_LEVEL<=DEB_L)
  2319. //// if(YY_START==INITIAL)
  2320. //// {
  2321. //// ECHO;
  2322. //// }
  2323. //// #endif
  2324. // lexCharsCountBeforeToken+=yyleng;
  2325. //// lexCharsCountBeforeToken=lexCharsTempPsn-yyleng;
  2326. //// lexCharsTempPsn+=yyleng;
  2327. lexTotalCharsCount+=yyleng;
  2328. //printf("%s => line %d, bt=%d,tmp=%d, t=%d\n", yytext, lexLinesCount, lexCharsCountBeforeToken,lexCharsTempPsn,lexTotalCharsCount);
  2329. }
  2330. void addLineRead()
  2331. {
  2332. // #if(VERBOSE_LEVEL<=DEB_L)
  2333. // printf("\n;\t");
  2334. // #endif
  2335. // ++lexLinesCount;
  2336. // lexLinesCountBeforeToken = yylineno;
  2337. // lexCharsCountBeforeToken = 0;
  2338. yyTempColumn=1;
  2339. // if(psnBeforeToken!=NULL)
  2340. // {
  2341. ++lexLinesCount;
  2342. // lexLinesCountBeforeToken = yylineno;
  2343. // lexCharsCountBeforeToken = 0;
  2344. // //lexCharsTempPsn = 0;
  2345. // //psnBeforeToken->line = ;
  2346. // psnAfterToken->line++;
  2347. //// printf(
  2348. //// ";\t%s detected line %d(%d, %d) char %d\n",
  2349. //// yytext,
  2350. //// lexLinesCount,
  2351. //// yylineno,
  2352. //// psnAfterToken->line,
  2353. //// lexTotalCharsCount-yyleng//lexCharsCountBeforeToken
  2354. //// );
  2355. // }
  2356. }
  2357. //int main()
  2358. //{
  2359. // #if(VERBOSE_LEVEL<=DEB_L)
  2360. // print("\n;\t");
  2361. // #endif
  2362. // yylex();
  2363. // return 0;
  2364. //}

Structure et Fichiers du projet

Afficher/masquer...


Répertoires contenus dans /var/www/bin/sniplets/lsd010/project/source/ 
IcôneNomTailleModification
Pas de sous-répertoires.
IcôneNomTailleModification
| _ Répertoire parent0 octets1711332409 25/03/2024 03:06:49
Fichiers contenus dans /var/www/bin/sniplets/lsd010/project/source/ 
IcôneNomTailleModificationAction
IcôneNomTailleModificationAction
Afficher le fichier .o|.ographVizHelper.o4.72 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .c|.cast.c27.73 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .h|.hconst.h4.01 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .c|.cy.tab.c84.53 Ko31/10/2018 18:32:39-refusé-
Afficher le fichier .y|.ylsd10.y22.88 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .o|.olex.yy.o18.88 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .c|.cscopeStack.c3.69 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .h|.hgraphVizHelper.h573 octets31/10/2018 18:32:37-refusé-
Afficher le fichier .h|.hsymbolsTableDataRepresentation.h1.31 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .o|.osymbolsTable.o5.2 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .h|.hcommon.h1.08 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .c|.cscopeHelper.c4.09 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .o|.ohashCode.o1.45 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .h|.hconsole.h2.21 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .o|.oconsole.o12.23 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .|lsd10lsd1075.26 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .h|.hhashCode.h1020 octets31/10/2018 18:32:37-refusé-
Afficher le fichier .h|.hsymbolsTable.h2.65 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .h|.hpcode.h417 octets31/10/2018 18:32:38-refusé-
Afficher le fichier .o|.oast.o11.45 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .h|.hscopeStack.h2.2 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .c|.cgraphVizHelper.c6.11 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .l|.llsd10.l6.46 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .h|.hy.tab.h4.69 Ko31/10/2018 18:32:39-refusé-
Afficher le fichier .output|.outputy.output81.69 Ko31/10/2018 18:32:39-refusé-
Afficher le fichier .o|.oy.tab.o24.45 Ko31/10/2018 18:32:39-refusé-
Afficher le fichier .c|.clex.yy.c57.93 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .h|.hast.h2.39 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .o|.oscopeStack.o1.34 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .o|.oscopeHelper.o2.59 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .h|.hastDataRepresentation.h1.87 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .c|.csymbolsTable.c14.91 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .c|.cpcode.c23.45 Ko31/10/2018 18:32:38-refusé-
Afficher le fichier .c|.chashCode.c3.94 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .c|.cconsole.c18.01 Ko31/10/2018 18:32:37-refusé-
Afficher le fichier .h|.hscopeHelper.h719 octets31/10/2018 18:32:38-refusé-

Avertissement

Ce code présente une manière possible d'implémenter un compilateur, et certains choix peuvent être discutés.
Cependant, il peut donner des pistes pour démarrer, ou approcher certains concepts, et je tenterais par la suite de mettre à jour le code.

Utilisation de l'explorateur de code

  • Navigation :
    • Un clic sur une icône de répertoire ouvre ce répertoire pour en afficher les fichiers.
    • Lorsque le répertoire en cours ne contient pas de sous-répertoires il est possible de remonter vers le répertoire parent.
    • La structure de répertoires en treetable (tableau en forme d'arborescence) n'est plus possibledans cette version.
    • Un clic sur une icône de fichier ouvre ce fichier pour en afficher le code avec la coloration syntaxique adaptée en fonction du langage principal utilisé dans le fichier.
  • Affichage :
    • Il est possible de trier les répertoires ou les fichiers selon certains critères (nom, taille, date).
  • Actions :
    • Les actions possible sur les fichiers dépendent de vos droits d'utilisateur sur le site. Veuillez activer le mode utilisateur pour activer les actions.

Document créé le 07/03/2010, dernière modification le 28/10/2018
Source du document imprimé : https://www.gaudry.be/langages-lsd10-source-rf-project/source/lex.yy.c.html

L'infobrol est un site personnel dont le contenu n'engage que moi. Le texte est mis à disposition sous licence CreativeCommons(BY-NC-SA). Plus d'info sur les conditions d'utilisation et sur l'auteur.

Notes

  1. a,b LSD010 : Langage Simple et Didactique Il existe une un certain nombre d'interprétations de l'acronyme LSD (Langage Symbolique Didactique, Langage Sans Difficulté, Langage Simple et Didactique). LSD010 est la version 2010 de la suite LSD80, LSD_02, LSD03, LSD04, LSD05, LSD06, LSD07, LSD08, et LSD09.

Table des matières Haut

Références

  1. livre Langue du document :fr IHDCB332 - Théorie des langages : Syntaxe et sémantique : PY Schobbens, Syntaxe et sémantique (January 2010)

Ces références et liens indiquent des documents consultés lors de la rédaction de cette page, ou qui peuvent apporter un complément d'information, mais les auteurs de ces sources ne peuvent être tenus responsables du contenu de cette page.
L'auteur de ce site est seul responsable de la manière dont sont présentés ici les différents concepts, et des libertés qui sont prises avec les ouvrages de référence. N'oubliez pas que vous devez croiser les informations de sources multiples afin de diminuer les risques d'erreurs.

Table des matières Haut