-
Notifications
You must be signed in to change notification settings - Fork 5
/
phase3.cpp
1862 lines (1710 loc) · 58.9 KB
/
phase3.cpp
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
/*
January, 2016. Sample class-based version.
#define LEMON_SUPER as the name of a class which overrides lemon_base<TokenType>.
The parser will be implemented in terms of that.
add a %code section to instantiate it.
*/
/*
** 2000-05-29
**
** The author disclaims copyright to this source code. In place of
** a legal notice, here is a blessing:
**
** May you do good and not evil.
** May you find forgiveness for yourself and forgive others.
** May you share freely, never taking more than you give.
**
*************************************************************************
** Driver template for the LEMON parser generator.
**
** The "lemon" program processes an LALR(1) input grammar file, then uses
** this template to construct a parser. The "lemon" program inserts text
** at each "%%" line. Also, any "P-a-r-s-e" identifer prefix (without the
** interstitial "-" characters) contained in this template is changed into
** the value of the %name directive from the grammar. Otherwise, the content
** of this template is copied straight through into the generate parser
** source file.
**
** The following is the concatenation of all %include directives from the
** input grammar file:
*/
#include <cstdio>
#include <cstring>
#include <cassert>
#include <type_traits>
#include <new>
#include <memory>
#include <algorithm>
namespace {
// use std::allocator etc?
// this is here so you can do something like Parse(void *, int, my_token &&) or (... const my_token &)
template<class T> struct yy_fix_type {
typedef typename std::remove_const<typename std::remove_reference<T>::type>::type type;
};
template<>
struct yy_fix_type<void> {
typedef struct {} type;
};
template<class T, class... Args>
typename yy_fix_type<T>::type &yy_constructor(void *vp, Args&&... args ) {
typedef typename yy_fix_type<T>::type TT;
TT *tmp = ::new(vp) TT(std::forward<Args>(args)...);
return *tmp;
}
template<class T>
typename yy_fix_type<T>::type &yy_cast(void *vp) {
typedef typename yy_fix_type<T>::type TT;
return *(TT *)vp;
}
template<class T>
void yy_destructor(void *vp) {
typedef typename yy_fix_type<T>::type TT;
((TT *)vp)->~TT();
}
template<class T>
void yy_destructor(T &t) {
t.~T();
}
template<class T>
void yy_move(void *dest, void *src) {
typedef typename yy_fix_type<T>::type TT;
TT &tmp = yy_cast<TT>(src);
yy_constructor<TT>(dest, std::move(tmp));
yy_destructor(tmp);
}
// this is to destruct references in the event of an exception.
// only the LHS needs to be deleted -- other items remain on the
// shift/reduce stack in a valid state
// (as long as the destructor) doesn't throw!
template<class T>
struct yy_auto_deleter {
yy_auto_deleter(T &t) : ref(t), enaged(true)
{}
yy_auto_deleter(const yy_auto_deleter &) = delete;
yy_auto_deleter(yy_auto_deleter &&) = delete;
yy_auto_deleter &operator=(const yy_auto_deleter &) = delete;
yy_auto_deleter &operator=(yy_auto_deleter &&) = delete;
~yy_auto_deleter() {
if (enaged) yy_destructor(ref);
}
void cancel() { enaged = false; }
private:
T& ref;
bool enaged=false;
};
template<class T>
class yy_storage {
private:
typedef typename yy_fix_type<T>::type TT;
public:
typedef typename std::conditional<
std::is_trivial<TT>::value,
TT,
typename std::aligned_storage<sizeof(TT),alignof(TT)>::type
>::type type;
};
}
/************ Begin %include sections from the grammar ************************/
#line 7 "phase3.lemon"
#include "phase3_parser.h"
#include "command.h"
#define LEMON_SUPER phase3
#line 142 "phase3.cpp"
/**************** End of %include directives **********************************/
/* These constants specify the various numeric values for terminal symbols
** in a format understandable to "makeheaders". This section is blank unless
** "lemon" is run with the "-m" command-line option.
***************** Begin makeheaders token definitions *************************/
/**************** End makeheaders token definitions ***************************/
/* The next sections is a series of control #defines.
** various aspects of the generated parser.
** YYCODETYPE is the data type used to store the integer codes
** that represent terminal and non-terminal symbols.
** "unsigned char" is used if there are fewer than
** 256 symbols. Larger types otherwise.
** YYNOCODE is a number of type YYCODETYPE that is not used for
** any terminal or nonterminal symbol.
** YYFALLBACK If defined, this indicates that one or more tokens
** (also known as: "terminal symbols") have fall-back
** values which should be used if the original symbol
** would not parse. This permits keywords to sometimes
** be used as identifiers, for example.
** YYACTIONTYPE is the data type used for "action codes" - numbers
** that indicate what to do in response to the next
** token.
** ParseTOKENTYPE is the data type used for minor type for terminal
** symbols. Background: A "minor type" is a semantic
** value associated with a terminal or non-terminal
** symbols. For example, for an "ID" terminal symbol,
** the minor type might be the name of the identifier.
** Each non-terminal can have a different minor type.
** Terminal symbols all have the same minor type, though.
** This macros defines the minor type for terminal
** symbols.
** YYMINORTYPE is the data type used for all minor types.
** This is typically a union of many types, one of
** which is ParseTOKENTYPE. The entry in the union
** for terminal symbols is called "yy0".
** YYSTACKDEPTH is the maximum depth of the parser's stack. If
** zero the stack is dynamically sized using realloc()
** YYERRORSYMBOL is the code number of the error symbol. If not
** defined, then do no error processing.
** YYNSTATE the combined number of states.
** YYNRULE the number of rules in the grammar
** YY_MAX_SHIFT Maximum value for shift actions
** YY_MIN_SHIFTREDUCE Minimum value for shift-reduce actions
** YY_MAX_SHIFTREDUCE Maximum value for shift-reduce actions
** YY_MIN_REDUCE Maximum value for reduce actions
** YY_ERROR_ACTION The yy_action[] code for syntax error
** YY_ACCEPT_ACTION The yy_action[] code for accept
** YY_NO_ACTION The yy_action[] code for no-op
*/
#ifndef INTERFACE
# define INTERFACE 1
#endif
/************* Begin control #defines *****************************************/
#define YYCODETYPE unsigned char
#define YYNOCODE 37
#define YYACTIONTYPE unsigned char
#define ParseTOKENTYPE std::string
typedef union {
int yyinit;
yy_storage<ParseTOKENTYPE>::type yy0;
yy_storage<void>::type yy7;
yy_storage<command_ptr>::type yy17;
yy_storage<command_ptr_vector>::type yy35;
yy_storage<if_command::clause_vector_type>::type yy62;
} YYMINORTYPE;
#ifndef YYSTACKDEPTH
#define YYSTACKDEPTH 100
#endif
#define ParseARG_SDECL
#define ParseARG_PDECL
#define ParseARG_FETCH
#define ParseARG_STORE
#define YYNSTATE 35
#define YYNRULE 36
#define YY_MAX_SHIFT 34
#define YY_MIN_SHIFTREDUCE 61
#define YY_MAX_SHIFTREDUCE 96
#define YY_MIN_REDUCE 97
#define YY_MAX_REDUCE 132
#define YY_ERROR_ACTION 133
#define YY_ACCEPT_ACTION 134
#define YY_NO_ACTION 135
/************* End control #defines *******************************************/
namespace {
/* Define the yytestcase() macro to be a no-op if is not already defined
** otherwise.
**
** Applications can choose to define yytestcase() in the %include section
** to a macro that can assist in verifying code coverage. For production
** code the yytestcase() macro should be turned off. But it is useful
** for testing.
*/
#ifndef yytestcase
# define yytestcase(X)
#endif
/* Next are the tables used to determine what action to take based on the
** current state and lookahead token. These tables are used to implement
** functions that take a state number and lookahead value and return an
** action integer.
**
** Suppose the action integer is N. Then the action is determined as
** follows
**
** 0 <= N <= YY_MAX_SHIFT Shift N. That is, push the lookahead
** token onto the stack and goto state N.
**
** N between YY_MIN_SHIFTREDUCE Shift to an arbitrary state then
** and YY_MAX_SHIFTREDUCE reduce by rule N-YY_MIN_SHIFTREDUCE.
**
** N between YY_MIN_REDUCE Reduce by rule N-YY_MIN_REDUCE
** and YY_MAX_REDUCE
**
** N == YY_ERROR_ACTION A syntax error has occurred.
**
** N == YY_ACCEPT_ACTION The parser accepts its input.
**
** N == YY_NO_ACTION No such action. Denotes unused
** slots in the yy_action[] table.
**
** The action table is constructed as a single large table named yy_action[].
** Given state S and lookahead X, the action is computed as either:
**
** (A) N = yy_action[ yy_shift_ofst[S] + X ]
** (B) N = yy_default[S]
**
** The (A) formula is preferred. The B formula is used instead if:
** (1) The yy_shift_ofst[S]+X value is out of range, or
** (2) yy_lookahead[yy_shift_ofst[S]+X] is not equal to X, or
** (3) yy_shift_ofst[S] equal YY_SHIFT_USE_DFLT.
** (Implementation note: YY_SHIFT_USE_DFLT is chosen so that
** YY_SHIFT_USE_DFLT+X will be out of range for all possible lookaheads X.
** Hence only tests (1) and (2) need to be evaluated.)
**
** The formulas above are for computing the action when the lookahead is
** a terminal symbol. If the lookahead is a non-terminal (as occurs after
** a reduce action) then the yy_reduce_ofst[] array is used in place of
** the yy_shift_ofst[] array and YY_REDUCE_USE_DFLT is used in place of
** YY_SHIFT_USE_DFLT.
**
** The following are the tables generated in this section:
**
** yy_action[] A single table containing all actions.
** yy_lookahead[] A table containing the lookahead for each entry in
** yy_action. Used to detect hash collisions.
** yy_shift_ofst[] For each state, the offset into yy_action for
** shifting terminals.
** yy_reduce_ofst[] For each state, the offset into yy_action for
** shifting non-terminals after a reduce.
** yy_default[] Default action for each state.
**
*********** Begin parsing tables **********************************************/
#define YY_ACTTAB_COUNT (193)
static const YYACTIONTYPE yy_action[] = {
/* 0 */ 86, 87, 66, 67, 68, 69, 70, 71, 12, 98,
/* 10 */ 21, 77, 20, 19, 18, 16, 16, 86, 87, 66,
/* 20 */ 67, 68, 69, 70, 71, 12, 97, 21, 76, 20,
/* 30 */ 19, 18, 86, 87, 66, 67, 68, 69, 70, 71,
/* 40 */ 12, 22, 21, 75, 20, 19, 18, 86, 87, 66,
/* 50 */ 67, 68, 69, 70, 71, 12, 23, 21, 74, 20,
/* 60 */ 19, 18, 117, 134, 5, 6, 86, 87, 66, 67,
/* 70 */ 68, 69, 70, 71, 12, 24, 21, 25, 20, 19,
/* 80 */ 18, 86, 87, 66, 67, 68, 69, 70, 71, 12,
/* 90 */ 7, 21, 26, 20, 19, 18, 27, 96, 66, 67,
/* 100 */ 68, 69, 70, 71, 12, 8, 21, 1, 20, 19,
/* 110 */ 18, 121, 13, 32, 2, 13, 13, 13, 13, 13,
/* 120 */ 13, 3, 31, 121, 13, 86, 87, 13, 13, 13,
/* 130 */ 13, 13, 13, 119, 15, 9, 4, 15, 15, 15,
/* 140 */ 15, 15, 15, 121, 14, 10, 73, 14, 14, 14,
/* 150 */ 14, 14, 14, 101, 11, 28, 101, 101, 101, 101,
/* 160 */ 101, 101, 99, 33, 99, 99, 33, 33, 33, 33,
/* 170 */ 33, 33, 99, 34, 99, 99, 34, 34, 34, 34,
/* 180 */ 34, 34, 30, 29, 28, 86, 87, 78, 99, 99,
/* 190 */ 99, 17, 17,
};
static const YYCODETYPE yy_lookahead[] = {
/* 0 */ 4, 5, 6, 7, 8, 9, 10, 11, 12, 24,
/* 10 */ 14, 15, 16, 17, 18, 19, 20, 4, 5, 6,
/* 20 */ 7, 8, 9, 10, 11, 12, 24, 14, 15, 16,
/* 30 */ 17, 18, 4, 5, 6, 7, 8, 9, 10, 11,
/* 40 */ 12, 24, 14, 15, 16, 17, 18, 4, 5, 6,
/* 50 */ 7, 8, 9, 10, 11, 12, 24, 14, 15, 16,
/* 60 */ 17, 18, 0, 22, 23, 26, 4, 5, 6, 7,
/* 70 */ 8, 9, 10, 11, 12, 24, 14, 24, 16, 17,
/* 80 */ 18, 4, 5, 6, 7, 8, 9, 10, 11, 12,
/* 90 */ 26, 14, 24, 16, 17, 18, 24, 5, 6, 7,
/* 100 */ 8, 9, 10, 11, 12, 26, 14, 26, 16, 17,
/* 110 */ 18, 24, 25, 34, 26, 28, 29, 30, 31, 32,
/* 120 */ 33, 26, 35, 24, 25, 4, 5, 28, 29, 30,
/* 130 */ 31, 32, 33, 24, 25, 27, 26, 28, 29, 30,
/* 140 */ 31, 32, 33, 24, 25, 27, 13, 28, 29, 30,
/* 150 */ 31, 32, 33, 25, 27, 3, 28, 29, 30, 31,
/* 160 */ 32, 33, 36, 25, 36, 36, 28, 29, 30, 31,
/* 170 */ 32, 33, 36, 25, 36, 36, 28, 29, 30, 31,
/* 180 */ 32, 33, 1, 2, 3, 4, 5, 15, 36, 36,
/* 190 */ 36, 19, 20,
};
#define YY_SHIFT_USE_DFLT (193)
#define YY_SHIFT_COUNT (34)
#define YY_SHIFT_MIN (-4)
#define YY_SHIFT_MAX (181)
static const short yy_shift_ofst[] = {
/* 0 */ 193, -4, 13, 28, 43, 62, 77, 77, 77, 92,
/* 10 */ 92, 92, 193, 181, 181, 181, 121, 121, 121, 121,
/* 20 */ 121, 121, 193, 193, 193, 193, 193, 193, 193, 193,
/* 30 */ 193, 172, 133, 152, 152,
};
#define YY_REDUCE_USE_DFLT (-16)
#define YY_REDUCE_COUNT (30)
#define YY_REDUCE_MIN (-15)
#define YY_REDUCE_MAX (148)
static const short yy_reduce_ofst[] = {
/* 0 */ 41, 87, 99, 99, 99, 109, 99, 99, 119, 128,
/* 10 */ 138, 148, 79, -15, -15, 2, 17, 32, 51, 53,
/* 20 */ 68, 72, 39, 64, 81, 88, 95, 110, 108, 118,
/* 30 */ 127,
};
static const YYACTIONTYPE yy_default[] = {
/* 0 */ 118, 133, 133, 133, 133, 133, 115, 116, 130, 133,
/* 10 */ 133, 133, 120, 133, 108, 133, 133, 133, 133, 133,
/* 20 */ 133, 133, 120, 120, 120, 120, 120, 120, 131, 131,
/* 30 */ 131, 133, 133, 100, 99,
};
/********** End of lemon-generated parsing tables *****************************/
/* The next table maps tokens (terminal symbols) into fallback tokens.
** If a construct like the following:
**
** %fallback ID X Y Z.
**
** appears in the grammar, then ID becomes a fallback token for X, Y,
** and Z. Whenever one of the tokens X, Y, or Z is input to the parser
** but it does not parse, the type of the token is changed to ID and
** the parse is retried before an error is thrown.
**
** This feature can be used, for example, to cause some keywords in a language
** to revert to identifiers if they keyword does not apply in the context where
** it appears.
*/
#ifdef YYFALLBACK
const YYCODETYPE yyFallback[] = {
};
#endif /* YYFALLBACK */
/* The following structure represents a single element of the
** parser's stack. Information stored includes:
**
** + The state number for the parser at this level of the stack.
**
** + The value of the token stored at this level of the stack.
** (In other words, the "major" token.)
**
** + The semantic value stored at this level of the stack. This is
** the information used by the action routines in the grammar.
** It is sometimes called the "minor" token.
**
** After the "shift" half of a SHIFTREDUCE action, the stateno field
** actually contains the reduce action for the second half of the
** SHIFTREDUCE.
*/
struct yyStackEntry {
YYACTIONTYPE stateno; /* The state-number, or reduce action in SHIFTREDUCE */
YYCODETYPE major; /* The major token value. This is the code
** number for the token at this stack level */
YYMINORTYPE minor; /* The user-supplied minor token value. This
** is the value of the token */
};
/* The state of the parser is completely contained in an instance of
** the following structure */
#ifndef LEMON_SUPER
#error "LEMON_SUPER must be defined."
#endif
/* outside the class so the templates above are still accessible */
void yy_destructor(YYCODETYPE yymajor, YYMINORTYPE *yypminor);
void yy_move(YYCODETYPE yymajor, YYMINORTYPE *yyDest, YYMINORTYPE *yySource);
class yypParser : public LEMON_SUPER {
public:
//using LEMON_SUPER::LEMON_SUPER;
template<class ...Args>
yypParser(Args&&... args);
virtual ~yypParser() override final;
virtual void parse(int, ParseTOKENTYPE &&) override final;
#ifndef NDEBUG
virtual void trace(FILE *, const char *) final override;
#endif
virtual void reset() final override;
virtual bool will_accept() const final override;
/*
** Return the peak depth of the stack for a parser.
*/
#ifdef YYTRACKMAXSTACKDEPTH
int yypParser::stack_peak(){
return yyhwm;
}
#endif
const yyStackEntry *begin() const { return yystack; }
const yyStackEntry *end() const { return yytos + 1; }
protected:
private:
yyStackEntry *yytos; /* Pointer to top element of the stack */
#ifdef YYTRACKMAXSTACKDEPTH
int yyhwm = 0; /* Maximum value of yyidx */
#endif
#ifndef YYNOERRORRECOVERY
int yyerrcnt = -1; /* Shifts left before out of the error */
#endif
#if YYSTACKDEPTH<=0
int yystksz = 0; /* Current side of the stack */
yyStackEntry *yystack = nullptr; /* The parser's stack */
yyStackEntry yystk0; /* First stack entry */
int yyGrowStack();
#else
yyStackEntry yystack[YYSTACKDEPTH]; /* The parser's stack */
yyStackEntry *yystackEnd; /* Last entry in the stack */
#endif
void yy_accept();
void yy_parse_failed();
void yy_syntax_error(int yymajor, ParseTOKENTYPE &yyminor);
void yy_transfer(yyStackEntry *yySource, yyStackEntry *yyDest);
void yy_pop_parser_stack();
unsigned yy_find_shift_action(int stateno, YYCODETYPE iLookAhead) const;
int yy_find_reduce_action(int stateno, YYCODETYPE iLookAhead) const;
void yy_shift(int yyNewState, int yyMajor, ParseTOKENTYPE &&yypMinor);
void yy_reduce(unsigned int yyruleno);
void yyStackOverflow();
#ifndef NDEBUG
void yyTraceShift(int yyNewState) const;
#else
# define yyTraceShift(X)
#endif
#ifndef NDEBUG
FILE *yyTraceFILE = 0;
const char *yyTracePrompt = 0;
#endif /* NDEBUG */
int yyidx() const {
return (int)(yytos - yystack);
}
};
#ifndef NDEBUG
/*
** Turn parser tracing on by giving a stream to which to write the trace
** and a prompt to preface each trace message. Tracing is turned off
** by making either argument NULL
**
** Inputs:
** <ul>
** <li> A FILE* to which trace output should be written.
** If NULL, then tracing is turned off.
** <li> A prefix string written at the beginning of every
** line of trace output. If NULL, then tracing is
** turned off.
** </ul>
**
** Outputs:
** None.
*/
void yypParser::trace(FILE *TraceFILE, const char *zTracePrompt){
yyTraceFILE = TraceFILE;
yyTracePrompt = zTracePrompt;
if( yyTraceFILE==0 ) yyTracePrompt = 0;
else if( yyTracePrompt==0 ) yyTraceFILE = 0;
}
#endif /* NDEBUG */
#ifndef NDEBUG
/* For tracing shifts, the names of all terminals and nonterminals
** are required. The following table supplies these names */
const char *const yyTokenName[] = {
"$", "PIPE_PIPE", "AMP_AMP", "PIPE",
"SEMI", "NL", "COMMAND", "EVALUATE",
"BREAK", "CONTINUE", "EXIT", "ERROR",
"LPAREN", "RPAREN", "BEGIN", "END",
"LOOP", "FOR", "IF", "ELSE_IF",
"ELSE", "error", "start", "command_list",
"sep", "command", "compound_list", "opt_nl",
"term", "if_command", "begin_command", "paren_command",
"loop_command", "for_command", "paren_list", "else_command",
};
#endif /* NDEBUG */
#ifndef NDEBUG
/* For tracing reduce actions, the names of all rules are required.
*/
const char *const yyRuleName[] = {
/* 0 */ "command_list ::= command_list command sep",
/* 1 */ "compound_list ::= compound_list command sep",
/* 2 */ "command ::= command PIPE_PIPE opt_nl command",
/* 3 */ "command ::= command AMP_AMP opt_nl command",
/* 4 */ "command ::= command PIPE opt_nl command",
/* 5 */ "term ::= COMMAND",
/* 6 */ "term ::= EVALUATE",
/* 7 */ "term ::= BREAK",
/* 8 */ "term ::= CONTINUE",
/* 9 */ "term ::= EXIT",
/* 10 */ "term ::= ERROR",
/* 11 */ "paren_list ::= compound_list command",
/* 12 */ "paren_command ::= LPAREN paren_list RPAREN",
/* 13 */ "begin_command ::= BEGIN sep compound_list END",
/* 14 */ "loop_command ::= LOOP sep compound_list END",
/* 15 */ "for_command ::= FOR sep compound_list END",
/* 16 */ "if_command ::= IF sep compound_list END",
/* 17 */ "if_command ::= IF sep compound_list else_command END",
/* 18 */ "else_command ::= ELSE_IF|ELSE sep compound_list",
/* 19 */ "else_command ::= else_command ELSE_IF|ELSE sep compound_list",
/* 20 */ "start ::= command_list",
/* 21 */ "command_list ::=",
/* 22 */ "command_list ::= command_list sep",
/* 23 */ "compound_list ::=",
/* 24 */ "compound_list ::= compound_list sep",
/* 25 */ "sep ::= SEMI",
/* 26 */ "sep ::= NL",
/* 27 */ "command ::= term",
/* 28 */ "term ::= if_command",
/* 29 */ "term ::= begin_command",
/* 30 */ "term ::= paren_command",
/* 31 */ "term ::= loop_command",
/* 32 */ "term ::= for_command",
/* 33 */ "paren_list ::= compound_list",
/* 34 */ "opt_nl ::=",
/* 35 */ "opt_nl ::= opt_nl NL",
};
#endif /* NDEBUG */
#if YYSTACKDEPTH<=0
/*
** Try to increase the size of the parser stack. Return the number
** of errors. Return 0 on success.
*/
int yypParser::yyGrowStack(){
int newSize;
yyStackEntry *pNew;
yyStackEntry *pOld = yystack;
int oldSize = yystksz;
newSize = oldSize*2 + 100;
pNew = (yyStackEntry *)calloc(newSize, sizeof(pNew[0]));
if( pNew ){
yystack = pNew;
for (int i = 0; i < oldSize; ++i) {
pNew[i].stateno = pOld[i].stateno;
pNew[i].major = pOld[i].major;
yy_move(pOld[i].major, &pNew[i].minor, &pOld[i].minor);
}
if (pOld != &yystk0) free(pOld);
#ifndef NDEBUG
if( yyTraceFILE ){
fprintf(yyTraceFILE,"%sStack grows from %d to %d entries.\n",
yyTracePrompt, yystksz, newSize);
}
#endif
yystksz = newSize;
}
return pNew==0;
}
#endif
/* The following function deletes the "minor type" or semantic value
** associated with a symbol. The symbol can be either a terminal
** or nonterminal. "yymajor" is the symbol code, and "yypminor" is
** a pointer to the value to be deleted. The code used to do the
** deletions is derived from the %destructor and/or %token_destructor
** directives of the input grammar.
*/
void yy_destructor(
YYCODETYPE yymajor, /* Type code for object to destroy */
YYMINORTYPE *yypminor /* The object to be destroyed */
){
switch( yymajor ){
/* Here is inserted the actions which take place when a
** terminal or non-terminal is destroyed. This can happen
** when the symbol is popped from the stack during a
** reduce or during error processing or when a parser is
** being destroyed before it is finished parsing.
**
** Note: during a reduce, the only symbols destroyed are those
** which appear on the RHS of the rule, but which are *not* used
** inside the C code.
*/
/********* Begin destructor definitions ***************************************/
case 1: /* PIPE_PIPE */
case 2: /* AMP_AMP */
case 3: /* PIPE */
case 4: /* SEMI */
case 5: /* NL */
case 6: /* COMMAND */
case 7: /* EVALUATE */
case 8: /* BREAK */
case 9: /* CONTINUE */
case 10: /* EXIT */
case 11: /* ERROR */
case 12: /* LPAREN */
case 13: /* RPAREN */
case 14: /* BEGIN */
case 15: /* END */
case 16: /* LOOP */
case 17: /* FOR */
case 18: /* IF */
case 19: /* ELSE_IF */
case 20: /* ELSE */
yy_destructor<std::string>(std::addressof(yypminor->yy0));
break;
case 0: /* $ */
case 22: /* start */
case 23: /* command_list */
yy_destructor<void>(std::addressof(yypminor->yy7));
break;
case 24: /* sep */
case 25: /* command */
case 27: /* opt_nl */
case 28: /* term */
case 29: /* if_command */
case 30: /* begin_command */
case 31: /* paren_command */
case 32: /* loop_command */
case 33: /* for_command */
yy_destructor<command_ptr>(std::addressof(yypminor->yy17));
break;
case 26: /* compound_list */
case 34: /* paren_list */
yy_destructor< command_ptr_vector >(std::addressof(yypminor->yy35));
break;
case 35: /* else_command */
yy_destructor< if_command::clause_vector_type >(std::addressof(yypminor->yy62));
break;
/********* End destructor definitions *****************************************/
default: break; /* If no destructor action specified: do nothing */
}
}
/*
* moves an object (such as when growing the stack).
* Source is constructed.
* Destination is also destructed.
*
*/
void yy_move(
YYCODETYPE yymajor, /* Type code for object to move */
YYMINORTYPE *yyDest, /* */
YYMINORTYPE *yySource /* */
){
switch( yymajor ){
/********* Begin move definitions ***************************************/
case 1: /* PIPE_PIPE */
case 2: /* AMP_AMP */
case 3: /* PIPE */
case 4: /* SEMI */
case 5: /* NL */
case 6: /* COMMAND */
case 7: /* EVALUATE */
case 8: /* BREAK */
case 9: /* CONTINUE */
case 10: /* EXIT */
case 11: /* ERROR */
case 12: /* LPAREN */
case 13: /* RPAREN */
case 14: /* BEGIN */
case 15: /* END */
case 16: /* LOOP */
case 17: /* FOR */
case 18: /* IF */
case 19: /* ELSE_IF */
case 20: /* ELSE */
yy_move<std::string>(std::addressof(yyDest->yy0), std::addressof(yySource->yy0));
break;
case 0: /* $ */
case 22: /* start */
case 23: /* command_list */
yy_move<void>(std::addressof(yyDest->yy7), std::addressof(yySource->yy7));
break;
case 24: /* sep */
case 25: /* command */
case 27: /* opt_nl */
case 28: /* term */
case 29: /* if_command */
case 30: /* begin_command */
case 31: /* paren_command */
case 32: /* loop_command */
case 33: /* for_command */
yy_move<command_ptr>(std::addressof(yyDest->yy17), std::addressof(yySource->yy17));
break;
case 26: /* compound_list */
case 34: /* paren_list */
yy_move< command_ptr_vector >(std::addressof(yyDest->yy35), std::addressof(yySource->yy35));
break;
case 35: /* else_command */
yy_move< if_command::clause_vector_type >(std::addressof(yyDest->yy62), std::addressof(yySource->yy62));
break;
/********* End move definitions *****************************************/
default: break; /* If no move action specified: do nothing */
//yyDest.minor = yySource.minor;
}
}
/*
** Pop the parser's stack once.
**
** If there is a destructor routine associated with the token which
** is popped from the stack, then call it.
*/
void yypParser::yy_pop_parser_stack(){
yyStackEntry *yymsp;
assert( yytos!=0 );
assert( yytos > yystack );
yymsp = yytos--;
#ifndef NDEBUG
if( yyTraceFILE ){
fprintf(yyTraceFILE,"%sPopping %s\n",
yyTracePrompt,
yyTokenName[yymsp->major]);
}
#endif
yy_destructor(yymsp->major, &yymsp->minor);
}
template<class ...Args>
yypParser::yypParser(Args&&... args) : LEMON_SUPER(std::forward<Args>(args)...)
{
#if YYSTACKDEPTH<=0
if( yyGrowStack() ){
yystack = &yystk0;
yystksz = 1;
}
#else
std::memset(yystack, 0, sizeof(yystack));
#endif
yytos = yystack;
yystack[0].stateno = 0;
yystack[0].major = 0;
#if YYSTACKDEPTH>0
yystackEnd = &yystack[YYSTACKDEPTH-1];
#endif
}
void yypParser::reset() {
while( yytos>yystack ) yy_pop_parser_stack();
#ifndef YYNOERRORRECOVERY
yyerrcnt = -1;
#endif
yytos = yystack;
yystack[0].stateno = 0;
yystack[0].major = 0;
LEMON_SUPER::reset();
}
/*
** Deallocate and destroy a parser. Destructors are called for
** all stack elements before shutting the parser down.
**
** If the YYPARSEFREENEVERNULL macro exists (for example because it
** is defined in a %include section of the input grammar) then it is
** assumed that the input pointer is never NULL.
*/
yypParser::~yypParser() {
while( yytos>yystack ) yy_pop_parser_stack();
#if YYSTACKDEPTH<=0
if( yystack!=&yystk0 ) free(yystack);
#endif
}
/*
** Find the appropriate action for a parser given the terminal
** look-ahead token iLookAhead.
*/
unsigned yypParser::yy_find_shift_action(
int stateno, /* Current state number */
YYCODETYPE iLookAhead /* The look-ahead token */
) const {
int i;
if( stateno>=YY_MIN_REDUCE ) return stateno;
assert( stateno <= YY_SHIFT_COUNT );
do{
i = yy_shift_ofst[stateno];
assert( iLookAhead!=YYNOCODE );
i += iLookAhead;
if( i<0 || i>=YY_ACTTAB_COUNT || yy_lookahead[i]!=iLookAhead ){
#ifdef YYFALLBACK
YYCODETYPE iFallback; /* Fallback token */
if( iLookAhead<sizeof(yyFallback)/sizeof(yyFallback[0])
&& (iFallback = yyFallback[iLookAhead])!=0 ){
#ifndef NDEBUG
if( yyTraceFILE ){
fprintf(yyTraceFILE, "%sFALLBACK %s => %s\n",
yyTracePrompt, yyTokenName[iLookAhead], yyTokenName[iFallback]);
}
#endif
assert( yyFallback[iFallback]==0 ); /* Fallback loop must terminate */
iLookAhead = iFallback;
continue;
}
#endif
#ifdef YYWILDCARD
{
int j = i - iLookAhead + YYWILDCARD;
if(
#if YY_SHIFT_MIN+YYWILDCARD<0
j>=0 &&
#endif
#if YY_SHIFT_MAX+YYWILDCARD>=YY_ACTTAB_COUNT
j<YY_ACTTAB_COUNT &&
#endif
yy_lookahead[j]==YYWILDCARD && iLookAhead>0
){
#ifndef NDEBUG
if( yyTraceFILE ){
fprintf(yyTraceFILE, "%sWILDCARD %s => %s\n",
yyTracePrompt, yyTokenName[iLookAhead],
yyTokenName[YYWILDCARD]);
}
#endif /* NDEBUG */
return yy_action[j];
}
}
#endif /* YYWILDCARD */
return yy_default[stateno];
}else{
return yy_action[i];
}
}while(1);
}
/*
** Find the appropriate action for a parser given the non-terminal
** look-ahead token iLookAhead.
*/
int yypParser::yy_find_reduce_action(
int stateno, /* Current state number */
YYCODETYPE iLookAhead /* The look-ahead token */
) const {
int i;
#ifdef YYERRORSYMBOL
if( stateno>YY_REDUCE_COUNT ){
return yy_default[stateno];
}
#else
assert( stateno<=YY_REDUCE_COUNT );
#endif
i = yy_reduce_ofst[stateno];
assert( i!=YY_REDUCE_USE_DFLT );
assert( iLookAhead!=YYNOCODE );
i += iLookAhead;
#ifdef YYERRORSYMBOL
if( i<0 || i>=YY_ACTTAB_COUNT || yy_lookahead[i]!=iLookAhead ){
return yy_default[stateno];
}
#else
assert( i>=0 && i<YY_ACTTAB_COUNT );
assert( yy_lookahead[i]==iLookAhead );
#endif
return yy_action[i];
}
/*
** The following routine is called if the stack overflows.
*/
void yypParser::yyStackOverflow(){
#ifndef NDEBUG
if( yyTraceFILE ){
fprintf(yyTraceFILE,"%sStack Overflow!\n",yyTracePrompt);
}
#endif
while( yytos>yystack ) yy_pop_parser_stack();
/* Here code is inserted which will execute if the parser
** stack every overflows */
/******** Begin %stack_overflow code ******************************************/
/******** End %stack_overflow code ********************************************/
LEMON_SUPER::stack_overflow();
}
/*
** Print tracing information for a SHIFT action
*/
#ifndef NDEBUG
void yypParser::yyTraceShift(int yyNewState) const {
if( yyTraceFILE ){
if( yyNewState<YYNSTATE ){
fprintf(yyTraceFILE,"%sShift '%s', go to state %d\n",
yyTracePrompt,yyTokenName[yytos->major],
yyNewState);
}else{
fprintf(yyTraceFILE,"%sShift '%s'\n",
yyTracePrompt,yyTokenName[yytos->major]);
}
}
}
#endif
/*
** Perform a shift action.
*/
void yypParser::yy_shift(
int yyNewState, /* The new state to shift in */
int yyMajor, /* The major token to shift in */
ParseTOKENTYPE &&yyMinor /* The minor token to shift in */
){
yytos++;
#ifdef YYTRACKMAXSTACKDEPTH
if( yyidx()>yyhwm ){
yyhwm++;
assert(yyhwm == yyidx());
}
#endif
#if YYSTACKDEPTH>0
if( yytos>yystackEnd ){
yytos--;
yyStackOverflow();
return;
}
#else
if( yytos>=&yystack[yystksz] ){
if( yyGrowStack() ){
yytos--;
yyStackOverflow();
return;
}
}
#endif