-
Notifications
You must be signed in to change notification settings - Fork 14
/
Copy pathhh_lex.c
2217 lines (1844 loc) · 58.4 KB
/
hh_lex.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#line 3 "<stdout>"
#define YY_INT_ALIGNED short int
/* A lexical scanner generated by flex */
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#define YY_FLEX_SUBMINOR_VERSION 31
#if YY_FLEX_SUBMINOR_VERSION > 0
#define FLEX_BETA
#endif
/* First, we deal with platform-specific or compiler-specific issues. */
/* begin standard C headers. */
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
/* end standard C headers. */
/* flex integer type definitions */
#ifndef FLEXINT_H
#define FLEXINT_H
/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
#if defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L
#include <inttypes.h>
typedef int8_t flex_int8_t;
typedef uint8_t flex_uint8_t;
typedef int16_t flex_int16_t;
typedef uint16_t flex_uint16_t;
typedef int32_t flex_int32_t;
typedef uint32_t flex_uint32_t;
#else
typedef signed char flex_int8_t;
typedef short int flex_int16_t;
typedef int flex_int32_t;
typedef unsigned char flex_uint8_t;
typedef unsigned short int flex_uint16_t;
typedef unsigned int flex_uint32_t;
#endif /* ! C99 */
/* Limits of integral types. */
#ifndef INT8_MIN
#define INT8_MIN (-128)
#endif
#ifndef INT16_MIN
#define INT16_MIN (-32767-1)
#endif
#ifndef INT32_MIN
#define INT32_MIN (-2147483647-1)
#endif
#ifndef INT8_MAX
#define INT8_MAX (127)
#endif
#ifndef INT16_MAX
#define INT16_MAX (32767)
#endif
#ifndef INT32_MAX
#define INT32_MAX (2147483647)
#endif
#ifndef UINT8_MAX
#define UINT8_MAX (255U)
#endif
#ifndef UINT16_MAX
#define UINT16_MAX (65535U)
#endif
#ifndef UINT32_MAX
#define UINT32_MAX (4294967295U)
#endif
#endif /* ! FLEXINT_H */
#ifdef __cplusplus
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
#if __STDC__
#define YY_USE_CONST
#endif /* __STDC__ */
#endif /* ! __cplusplus */
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an unsigned
* integer for use as an array index. If the signed char is negative,
* we want to instead treat it as an 8-bit unsigned char, hence the
* double cast.
*/
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
/* Enter a start condition. This macro really ought to take a parameter,
* but we do it the disgusting crufty way forced on us by the ()-less
* definition of BEGIN.
*/
#define BEGIN (yy_start) = 1 + 2 *
/* Translate the current start state into a value that can be later handed
* to BEGIN to return to the state. The YYSTATE alias is for lex
* compatibility.
*/
#define YY_START (((yy_start) - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE hh_restart(hh_in )
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#define YY_BUF_SIZE 16384
#endif
#ifndef YY_TYPEDEF_YY_BUFFER_STATE
#define YY_TYPEDEF_YY_BUFFER_STATE
typedef struct yy_buffer_state *YY_BUFFER_STATE;
#endif
extern int hh_leng;
extern FILE *hh_in, *hh_out;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
#define YY_LESS_LINENO(n)
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up hh_text. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
*yy_cp = (yy_hold_char); \
YY_RESTORE_YY_MORE_OFFSET \
(yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up hh_text again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, (yytext_ptr) )
/* The following is because we cannot portably get our hands on size_t
* (without autoconf's help, which isn't available because we want
* flex-generated scanners to compile on their own).
*/
#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef unsigned int yy_size_t;
#endif
#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
{
FILE *yy_input_file;
char *yy_ch_buf; /* input buffer */
char *yy_buf_pos; /* current position in input buffer */
/* Size of input buffer in bytes, not including room for EOB
* characters.
*/
yy_size_t yy_buf_size;
/* Number of characters read into yy_ch_buf, not including EOB
* characters.
*/
int yy_n_chars;
/* Whether we "own" the buffer - i.e., we know we created it,
* and can realloc() it to grow it, and should free() it to
* delete it.
*/
int yy_is_our_buffer;
/* Whether this is an "interactive" input source; if so, and
* if we're using stdio for input, then we want to use getc()
* instead of fread(), to make sure we stop fetching input after
* each newline.
*/
int yy_is_interactive;
/* Whether we're considered to be at the beginning of a line.
* If so, '^' rules will be active on the next match, otherwise
* not.
*/
int yy_at_bol;
int yy_bs_lineno; /**< The line count. */
int yy_bs_column; /**< The column count. */
/* Whether to try to fill the input buffer when we reach the
* end of it.
*/
int yy_fill_buffer;
int yy_buffer_status;
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
/* When an EOF's been seen but there's still some text to process
* then we mark the buffer as YY_EOF_PENDING, to indicate that we
* shouldn't try reading from the input source any more. We might
* still have a bunch of tokens to match, though, because of
* possible backing-up.
*
* When we actually see the EOF, we change the status to "new"
* (via hh_restart()), so that the user can continue scanning by
* just pointing hh_in at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
#endif /* !YY_STRUCT_YY_BUFFER_STATE */
/* Stack of input buffers. */
static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
/* We provide macros for accessing buffer states in case in the
* future we want to put the buffer states in a more general
* "scanner state".
*
* Returns the top of the stack, or NULL.
*/
#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
? (yy_buffer_stack)[(yy_buffer_stack_top)] \
: NULL)
/* Same as previous macro, but useful when we know that the buffer stack is not
* NULL or when we need an lvalue. For internal use only.
*/
#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
/* yy_hold_char holds the character lost when hh_text is formed. */
static char yy_hold_char;
static int yy_n_chars; /* number of characters read into yy_ch_buf */
int hh_leng;
/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
static int yy_init = 1; /* whether we need to initialize */
static int yy_start = 0; /* start state number */
/* Flag which is used to allow hh_wrap()'s to do buffer switches
* instead of setting up a fresh hh_in. A bit of a hack ...
*/
static int yy_did_buffer_switch_on_eof;
void hh_restart (FILE *input_file );
void hh__switch_to_buffer (YY_BUFFER_STATE new_buffer );
YY_BUFFER_STATE hh__create_buffer (FILE *file,int size );
void hh__delete_buffer (YY_BUFFER_STATE b );
void hh__flush_buffer (YY_BUFFER_STATE b );
void hh_push_buffer_state (YY_BUFFER_STATE new_buffer );
void hh_pop_buffer_state (void );
static void hh_ensure_buffer_stack (void );
static void hh__load_buffer_state (void );
static void hh__init_buffer (YY_BUFFER_STATE b,FILE *file );
#define YY_FLUSH_BUFFER hh__flush_buffer(YY_CURRENT_BUFFER )
YY_BUFFER_STATE hh__scan_buffer (char *base,yy_size_t size );
YY_BUFFER_STATE hh__scan_string (yyconst char *yy_str );
YY_BUFFER_STATE hh__scan_bytes (yyconst char *bytes,int len );
void *hh_alloc (yy_size_t );
void *hh_realloc (void *,yy_size_t );
void hh_free (void * );
#define yy_new_buffer hh__create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! YY_CURRENT_BUFFER ){ \
hh_ensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
hh__create_buffer(hh_in,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! YY_CURRENT_BUFFER ){\
hh_ensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
hh__create_buffer(hh_in,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
/* Begin user sect3 */
typedef unsigned char YY_CHAR;
FILE *hh_in = (FILE *) 0, *hh_out = (FILE *) 0;
typedef int yy_state_type;
extern int hh_lineno;
int hh_lineno = 1;
extern char *hh_text;
#define yytext_ptr hh_text
static yy_state_type yy_get_previous_state (void );
static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
static int yy_get_next_buffer (void );
static void yy_fatal_error (yyconst char msg[] );
/* Done after the current pattern has been matched and before the
* corresponding action - sets up hh_text.
*/
#define YY_DO_BEFORE_ACTION \
(yytext_ptr) = yy_bp; \
hh_leng = (size_t) (yy_cp - yy_bp); \
(yy_hold_char) = *yy_cp; \
*yy_cp = '\0'; \
(yy_c_buf_p) = yy_cp;
#define YY_NUM_RULES 24
#define YY_END_OF_BUFFER 25
/* This struct is not used in this scanner,
but its presence is necessary. */
struct yy_trans_info
{
flex_int32_t yy_verify;
flex_int32_t yy_nxt;
};
static yyconst flex_int16_t yy_accept[107] =
{ 0,
0, 0, 0, 0, 0, 0, 25, 22, 11, 9,
23, 22, 23, 23, 22, 22, 16, 13, 10, 11,
22, 5, 4, 5, 5, 8, 8, 8, 22, 22,
0, 19, 0, 20, 21, 0, 0, 13, 22, 15,
0, 13, 10, 10, 10, 0, 0, 22, 22, 22,
4, 0, 0, 0, 0, 17, 0, 13, 12, 14,
0, 22, 22, 22, 22, 0, 0, 0, 18, 0,
22, 22, 22, 22, 22, 0, 0, 0, 0, 0,
22, 6, 22, 22, 22, 6, 0, 0, 0, 0,
22, 7, 22, 22, 7, 0, 0, 0, 22, 2,
22, 0, 0, 1, 3, 0
} ;
static yyconst flex_int32_t yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 1, 4, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 1, 5, 6, 7, 1, 1, 8, 9,
9, 1, 1, 1, 10, 11, 1, 12, 13, 13,
13, 13, 13, 13, 13, 14, 14, 1, 15, 1,
1, 1, 1, 1, 16, 16, 16, 16, 16, 16,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 18, 17, 17,
1, 19, 1, 1, 17, 1, 20, 20, 20, 21,
22, 23, 1, 1, 24, 1, 1, 25, 1, 26,
1, 1, 1, 1, 27, 1, 1, 1, 1, 28,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1
} ;
static yyconst flex_int32_t yy_meta[29] =
{ 0,
1, 2, 3, 2, 1, 1, 1, 4, 2, 1,
1, 5, 5, 5, 1, 5, 1, 1, 1, 5,
5, 5, 5, 1, 1, 1, 1, 1
} ;
static yyconst flex_int16_t yy_base[118] =
{ 0,
0, 27, 27, 44, 283, 29, 283, 58, 287, 287,
29, 68, 287, 259, 43, 30, 40, 65, 81, 53,
18, 287, 80, 85, 45, 287, 97, 78, 98, 0,
96, 287, 270, 99, 0, 260, 0, 96, 105, 105,
0, 107, 120, 0, 133, 124, 117, 137, 138, 142,
135, 134, 90, 129, 244, 287, 255, 144, 141, 0,
237, 154, 160, 161, 164, 221, 226, 150, 287, 211,
167, 172, 173, 178, 187, 209, 206, 206, 193, 182,
190, 193, 196, 197, 201, 287, 169, 166, 166, 157,
204, 205, 216, 209, 287, 172, 138, 109, 219, 121,
227, 90, 82, 62, 52, 287, 235, 240, 245, 250,
255, 260, 265, 270, 32, 275, 280
} ;
static yyconst flex_int16_t yy_def[118] =
{ 0,
106, 1, 107, 107, 108, 108, 106, 109, 106, 106,
110, 109, 106, 111, 12, 12, 106, 106, 112, 106,
12, 106, 106, 106, 106, 106, 106, 106, 12, 113,
110, 106, 110, 12, 113, 106, 114, 113, 12, 106,
115, 106, 112, 116, 117, 106, 106, 12, 12, 12,
106, 106, 106, 106, 106, 106, 106, 113, 12, 115,
106, 12, 12, 12, 12, 106, 106, 106, 106, 106,
12, 12, 12, 12, 12, 106, 106, 106, 106, 106,
12, 12, 12, 12, 12, 106, 106, 106, 106, 106,
12, 12, 12, 12, 106, 106, 106, 106, 12, 106,
12, 106, 106, 106, 106, 0, 106, 106, 106, 106,
106, 106, 106, 106, 106, 106, 106
} ;
static yyconst flex_int16_t yy_nxt[316] =
{ 0,
8, 9, 10, 9, 11, 12, 13, 14, 13, 15,
16, 17, 18, 18, 19, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 20, 10,
27, 10, 21, 32, 28, 29, 60, 30, 48, 49,
39, 50, 23, 23, 23, 24, 10, 33, 29, 25,
30, 40, 40, 105, 46, 38, 38, 41, 47, 23,
23, 23, 30, 104, 30, 30, 54, 41, 55, 30,
30, 30, 30, 34, 30, 35, 42, 42, 42, 30,
30, 30, 44, 104, 44, 45, 52, 45, 45, 44,
53, 105, 45, 45, 45, 51, 51, 51, 52, 54,
32, 55, 53, 29, 29, 30, 30, 58, 58, 58,
29, 54, 30, 55, 33, 59, 40, 40, 42, 42,
42, 44, 100, 44, 45, 46, 45, 45, 44, 47,
103, 45, 45, 45, 44, 52, 44, 61, 54, 53,
55, 44, 29, 29, 30, 30, 29, 29, 30, 30,
51, 51, 51, 66, 67, 58, 58, 58, 62, 29,
102, 30, 63, 64, 65, 29, 29, 30, 30, 29,
78, 30, 29, 100, 30, 79, 71, 29, 29, 30,
30, 73, 98, 29, 74, 30, 72, 97, 96, 75,
81, 95, 29, 82, 30, 29, 83, 30, 29, 84,
30, 29, 29, 30, 30, 90, 29, 85, 30, 29,
29, 30, 30, 89, 29, 91, 30, 100, 92, 93,
104, 29, 94, 30, 29, 99, 30, 88, 105, 87,
86, 101, 29, 80, 30, 22, 22, 22, 22, 22,
26, 26, 26, 26, 26, 29, 77, 76, 29, 29,
31, 31, 31, 31, 31, 36, 36, 36, 70, 36,
43, 43, 69, 43, 43, 30, 68, 56, 30, 30,
57, 57, 106, 57, 57, 44, 44, 37, 44, 44,
45, 45, 106, 45, 45, 10, 7, 106, 106, 106,
106, 106, 106, 106, 106, 106, 106, 106, 106, 106,
106, 106, 106, 106, 106, 106, 106, 106, 106, 106,
106, 106, 106, 106, 106
} ;
static yyconst flex_int16_t yy_chk[316] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
6, 6, 2, 11, 6, 16, 115, 16, 21, 21,
16, 21, 3, 3, 3, 4, 4, 11, 15, 4,
15, 17, 17, 105, 20, 15, 15, 17, 20, 4,
4, 4, 8, 104, 8, 8, 25, 17, 25, 8,
8, 8, 12, 12, 12, 12, 18, 18, 18, 12,
12, 12, 19, 103, 19, 19, 24, 19, 19, 19,
24, 102, 19, 19, 19, 23, 23, 23, 27, 28,
31, 28, 27, 29, 34, 29, 34, 38, 38, 38,
39, 53, 39, 53, 31, 39, 40, 40, 42, 42,
42, 43, 100, 43, 43, 46, 43, 43, 43, 46,
98, 43, 43, 43, 45, 52, 45, 47, 47, 52,
47, 45, 48, 49, 48, 49, 59, 50, 59, 50,
51, 51, 51, 54, 54, 58, 58, 58, 48, 62,
97, 62, 49, 49, 50, 63, 64, 63, 64, 65,
68, 65, 71, 96, 71, 68, 62, 72, 73, 72,
73, 64, 90, 74, 65, 74, 63, 89, 88, 65,
71, 87, 75, 72, 75, 81, 73, 81, 82, 74,
82, 83, 84, 83, 84, 80, 85, 75, 85, 91,
92, 91, 92, 79, 94, 81, 94, 93, 83, 84,
99, 93, 85, 93, 99, 91, 99, 78, 101, 77,
76, 94, 101, 70, 101, 107, 107, 107, 107, 107,
108, 108, 108, 108, 108, 109, 67, 66, 109, 109,
110, 110, 110, 110, 110, 111, 111, 111, 61, 111,
112, 112, 57, 112, 112, 113, 55, 36, 113, 113,
114, 114, 33, 114, 114, 116, 116, 14, 116, 116,
117, 117, 7, 117, 117, 5, 106, 106, 106, 106,
106, 106, 106, 106, 106, 106, 106, 106, 106, 106,
106, 106, 106, 106, 106, 106, 106, 106, 106, 106,
106, 106, 106, 106, 106
} ;
static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;
extern int hh__flex_debug;
int hh__flex_debug = 0;
/* The intent behind this definition is that it'll catch
* any uses of REJECT which flex missed.
*/
#define REJECT reject_used_but_not_detected
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *hh_text;
#line 1 "/home/cessu/projects/hedgehog-2/o/../hh/hh_lex.l"
#line 2 "/home/cessu/projects/hedgehog-2/o/../hh/hh_lex.l"
/* This file is part of Hedgehog LISP.
* See file LICENSE for pertinent copyright notices.
*
* Author: Kenneth Oksanen <[email protected]>
*/
/* This file implements a lexer for HogLisp.
*/
#define HH_COMPILER 1
#include "hh_common.h"
#include "hh_ast.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* This is like normal atoi, but returns unsigned value and checks for
overflow. */
static hh_signed_word_t hh_atoi(char *s)
{
hh_signed_word_t r = 0;
int is_negative = 0;
if (*s == '-') {
is_negative = 1;
s++;
}
while (*s >= '0' && *s <= '9') {
if (is_negative) {
if (r <= -214748365 || (r == -214748364 && *s == '9'))
hh_fatal(NULL, "Too large integer constant");
r = 10 * r - (*s++ - '0');
} else {
if (r >= 214748365 || (r == 214748364 && *s >= '8'))
hh_fatal(NULL, "Too large integer constant");
r = 10 * r + (*s++ - '0');
}
}
return r;
}
/* Checked conversion from hex value to unsigned long. */
static hh_word_t hh_htoi(char *s)
{
hh_word_t r = 0;
unsigned int i;
while (1) {
if (*s >= '0' && *s <= '9')
i = *s - '0';
else if (*s >= 'a' && *s <= 'f')
i = 10 + *s - 'a';
else if (*s >= 'A' && *s <= 'F')
i = 10 + *s - 'A';
else
return r;
if (r >= 0x10000000UL)
hh_fatal(NULL, "Too large hexadecimal constant");
r = (r << 4) | i;
s++;
}
HH_NOTREACHED;
}
/* Checked conversion from octal value to unsigned long. */
static hh_word_t hh_otoi(char *s)
{
hh_word_t r = 0;
while (*s >= '0' && *s <= '7') {
if (r >= 0x20000000UL)
hh_fatal(NULL, "Too large octal constant");
r = (r << 3) | (*s++ - '0');
}
return r;
}
/* Mangle away escape characters in strings, return the new length. */
static unsigned int hh_mangle(char *s)
{
char *to = s, *from = s;
int temp;
while (1) {
if (*from == '\"')
return to - s;
if (*from == '\\') {
switch (*++from) {
case '\\': *to++ = '\\'; ++from; break;
case '\'': *to++ = '\''; ++from; break;
case '"': *to++ = '"'; ++from; break;
case 'a': *to++ = '\a'; ++from; break;
case 'b': *to++ = '\b'; ++from; break;
case 't': *to++ = '\t'; ++from; break;
case 'n': *to++ = '\n'; ++from; break;
case 'v': *to++ = '\v'; ++from; break;
case 'f': *to++ = '\f'; ++from; break;
case 'r': *to++ = '\r'; ++from; break;
case '0': case '1': case '2': case '3':
case '4': case '5': case '6': case '7':
/* Octal. Up to three digits. */
temp = *from++ - '0';
if (*from >= '0' && *from <= '7') {
temp = temp * 8 + *from++ - '0';
if (*from >= '0' && *from <= '7')
temp = temp * 8 + *from++ - '0';
}
*to++ = temp & 0xff;
break;
case 'x':
case 'X':
/* Hexadecimal. Any number of digits. Value is limited to 0-255. */
temp = 0;
for (++from; ; ++from) {
if (*from >= '0' && *from <= '9')
temp = temp * 16 + *from - '0';
else if (*from >= 'a' && *from <= 'f')
temp = temp * 16 + *from - 'a' + 10;
else if (*from >= 'A' && *from <= 'F')
temp = temp * 16 + *from - 'A' + 10;
else
break;
}
*to++ = temp & 0xff;
break;
default:
hh_fatal(NULL, "Unknown escape sequence: \\%c (0x%02x)", *from, *from);
}
} else
*to++ = *from++;
}
HH_NOTREACHED;
}
static enum {
HH_DEFINE, HH_IFDEF, HH_IFNDEF
} hh_directive_kind;
typedef struct hh_directive_t {
struct hh_directive_t *next;
char *name;
} hh_directive_t;
static hh_directive_t *hh_directives = NULL;
static int hh_directive_is_defined(const char *name)
{
hh_directive_t *d;
for (d = hh_directives; d != NULL; d = d->next)
if (strcmp(d->name, name) == 0)
return 1;
return 0;
}
void hh_directive_define(const char *name)
{
hh_directive_t *d;
if (hh_directive_is_defined(name))
return;
d = malloc(sizeof(hh_directive_t));
if (d == NULL) {
fprintf(stderr, "Out of memory when defining macro directives.\n");
exit(1);
}
d->name = malloc(strlen(name) + 1);
if (d->name == NULL) {
fprintf(stderr, "Out of memory when defining macro directives.\n");
exit(1);
}
strcpy(d->name, name);
d->next = hh_directives;
hh_directives = d;
}
typedef enum {
/* The current input is parsed. */
HH_INPUT_ACTIVE,
/* The current input might be parsed in an #else branch. */
HH_INPUT_SUPPRESSED,
/* The current input won't be parsed within the current #ifdef .. #endif. */
HH_INPUT_INACTIVE,
} hh_ifdef_input_t;
#define HH_IFDEF_STACK_DEPTH 32
static hh_ifdef_input_t hh_ifdef_stack[HH_IFDEF_STACK_DEPTH];
static int hh_ifdef_level = 0;
static int hh_ifdef_push(const char *name, int inverted)
{
hh_ifdef_input_t input;
if (hh_ifdef_level == HH_IFDEF_STACK_DEPTH)
hh_fatal(NULL, "Too many nested #ifdef's");
if (hh_ifdef_level == 0
|| hh_ifdef_stack[hh_ifdef_level - 1] == HH_INPUT_ACTIVE)
input = HH_INPUT_ACTIVE;
else
input = HH_INPUT_INACTIVE;
if (input == HH_INPUT_ACTIVE)
if ((inverted && hh_directive_is_defined(name))
|| (!inverted && !hh_directive_is_defined(name)))
input = HH_INPUT_SUPPRESSED;
hh_ifdef_stack[hh_ifdef_level] = input;
hh_ifdef_level++;
return input == HH_INPUT_ACTIVE;
}
static int hh_ifdef_toggle(void)
{
if (hh_ifdef_level == 0)
hh_fatal(NULL, "Stray #else");
switch (hh_ifdef_stack[hh_ifdef_level - 1]) {
case HH_INPUT_ACTIVE:
hh_ifdef_stack[hh_ifdef_level - 1] = HH_INPUT_SUPPRESSED;
return 0;
case HH_INPUT_SUPPRESSED:
hh_ifdef_stack[hh_ifdef_level - 1] = HH_INPUT_ACTIVE;
return 1;
case HH_INPUT_INACTIVE:
return 0;
}
HH_NOTREACHED;
return 0;
}
static int hh_ifdef_pop(void)
{
if (hh_ifdef_level == 0)
hh_fatal(NULL, "Stray #endif");
hh_ifdef_level--;
return hh_ifdef_level == 0
|| hh_ifdef_stack[hh_ifdef_level - 1] == HH_INPUT_ACTIVE;
}
#line 809 "<stdout>"
#define INITIAL 0
#define MACRO_TOKEN 1
#define MACRO_OMIT 2
#ifndef YY_NO_UNISTD_H
/* Special case for "unistd.h", since it is non-ANSI. We include it way
* down here because we want the user's section 1 to have been scanned first.
* The user has a chance to override it with an option.
*/
#include <unistd.h>
#endif
#ifndef YY_EXTRA_TYPE
#define YY_EXTRA_TYPE void *
#endif
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int hh_wrap (void );
#else
extern int hh_wrap (void );
#endif
#endif
static void yyunput (int c,char *buf_ptr );
#ifndef yytext_ptr
static void yy_flex_strncpy (char *,yyconst char *,int );
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * );
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void );
#else
static int input (void );
#endif
#endif
/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#define YY_READ_BUF_SIZE 8192
#endif
/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
*/
#define ECHO (void) fwrite( hh_text, hh_leng, 1, hh_out )
#endif
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
* is returned in "result".
*/
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
{ \
int c = '*'; \
size_t n; \
for ( n = 0; n < max_size && \
(c = getc( hh_in )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
if ( c == EOF && ferror( hh_in ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else \
{ \
errno=0; \
while ( (result = fread(buf, 1, max_size, hh_in))==0 && ferror(hh_in)) \
{ \
if( errno != EINTR) \
{ \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
break; \
} \
errno=0; \
clearerr(hh_in); \
} \
}\
\
#endif
/* No semi-colon after return; correct usage is to write "yyterminate();" -
* we don't want an extra ';' after the "return" because that will cause
* some compilers to complain about unreachable statements.
*/
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif
/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif
/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif
/* end tables serialization structures and prototypes */
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
#define YY_DECL_IS_OURS 1
extern int hh_lex (void);
#define YY_DECL int hh_lex (void)
#endif /* !YY_DECL */
/* Code executed at the beginning of each rule, after hh_text and hh_leng
* have been set up.
*/
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif
/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK break;
#endif
#define YY_RULE_SETUP \
if ( hh_leng > 0 ) \
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \
(hh_text[hh_leng - 1] == '\n'); \
YY_USER_ACTION
/** The main scanner function which does all the work.
*/
YY_DECL
{
register yy_state_type yy_current_state;
register char *yy_cp, *yy_bp;
register int yy_act;
#line 267 "/home/cessu/projects/hedgehog-2/o/../hh/hh_lex.l"
#line 968 "<stdout>"
if ( (yy_init) )
{
(yy_init) = 0;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! (yy_start) )
(yy_start) = 1; /* first start state */
if ( ! hh_in )
hh_in = stdin;
if ( ! hh_out )
hh_out = stdout;
if ( ! YY_CURRENT_BUFFER ) {
hh_ensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
hh__create_buffer(hh_in,YY_BUF_SIZE );
}
hh__load_buffer_state( );
}
while ( 1 ) /* loops until end-of-file is reached */
{
yy_cp = (yy_c_buf_p);
/* Support of hh_text. */
*yy_cp = (yy_hold_char);