forked from bminor/bash
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathparse.hh
2476 lines (2235 loc) · 66.5 KB
/
parse.hh
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
// A Bison parser, made by GNU Bison 3.8.2.
// Skeleton interface for Bison LALR(1) parsers in C++
// Copyright (C) 2002-2015, 2018-2021 Free Software Foundation, Inc.
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
// As a special exception, you may create a larger work that contains
// part or all of the Bison parser skeleton and distribute that work
// under terms of your choice, so long as that work isn't itself a
// parser generator using the skeleton or a modified version thereof
// as a parser skeleton. Alternatively, if you modify or redistribute
// the parser skeleton itself, you may (at your option) remove this
// special exception, which will cause the skeleton and the resulting
// Bison output files to be licensed under the GNU General Public
// License without this special exception.
// This special exception was added by the Free Software Foundation in
// version 2.2 of Bison.
/**
** \file y.tab.h
** Define the bash::parser class.
*/
// C++ LALR(1) parser skeleton written by Akim Demaille.
// DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
// especially those whose name start with YY_ or yy_. They are
// private implementation details that can be changed or removed.
#ifndef YY_YY__BASHCPP_PARSE_HH_INCLUDED
# define YY_YY__BASHCPP_PARSE_HH_INCLUDED
# include <cstdlib> // std::abort
# include <iostream>
# include <stdexcept>
# include <string>
# include <vector>
#if defined __cplusplus
# define YY_CPLUSPLUS __cplusplus
#else
# define YY_CPLUSPLUS 199711L
#endif
// Support move semantics when possible.
#if 201103L <= YY_CPLUSPLUS
# define YY_MOVE std::move
# define YY_MOVE_OR_COPY move
# define YY_MOVE_REF(Type) Type&&
# define YY_RVREF(Type) Type&&
# define YY_COPY(Type) Type
#else
# define YY_MOVE
# define YY_MOVE_OR_COPY copy
# define YY_MOVE_REF(Type) Type&
# define YY_RVREF(Type) const Type&
# define YY_COPY(Type) const Type&
#endif
// Support noexcept when possible.
#if 201103L <= YY_CPLUSPLUS
# define YY_NOEXCEPT noexcept
# define YY_NOTHROW
#else
# define YY_NOEXCEPT
# define YY_NOTHROW throw ()
#endif
// Support constexpr when possible.
#if 201703 <= YY_CPLUSPLUS
# define YY_CONSTEXPR constexpr
#else
# define YY_CONSTEXPR
#endif
#ifndef YY_ATTRIBUTE_PURE
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
# else
# define YY_ATTRIBUTE_PURE
# endif
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
# else
# define YY_ATTRIBUTE_UNUSED
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YY_USE(E) ((void) (E))
#else
# define YY_USE(E) /* empty */
#endif
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
#if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__
# if __GNUC__ * 100 + __GNUC_MINOR__ < 407
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")
# else
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# endif
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
_Pragma ("GCC diagnostic pop")
#else
# define YY_INITIAL_VALUE(Value) Value
#endif
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef YY_INITIAL_VALUE
# define YY_INITIAL_VALUE(Value) /* Nothing. */
#endif
#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
# define YY_IGNORE_USELESS_CAST_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
# define YY_IGNORE_USELESS_CAST_END \
_Pragma ("GCC diagnostic pop")
#endif
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_END
#endif
# ifndef YY_CAST
# ifdef __cplusplus
# define YY_CAST(Type, Val) static_cast<Type> (Val)
# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
# else
# define YY_CAST(Type, Val) ((Type) (Val))
# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
# endif
# endif
# ifndef YY_NULLPTR
# if defined __cplusplus
# if 201103L <= __cplusplus
# define YY_NULLPTR nullptr
# else
# define YY_NULLPTR 0
# endif
# else
# define YY_NULLPTR ((void*)0)
# endif
# endif
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#line 26 "../bashcpp/parse.yy"
namespace bash {
#line 183 "../bashcpp/parse.hh"
/// A Bison parser.
class parser
{
public:
#ifdef YYSTYPE
# ifdef __GNUC__
# pragma GCC message "bison: do not #define YYSTYPE in C++, use %define api.value.type"
# endif
typedef YYSTYPE value_type;
#else
/// A buffer to store and retrieve objects.
///
/// Sort of a variant, but does not keep track of the nature
/// of the stored data, since that knowledge is available
/// via the current parser state.
class value_type
{
public:
/// Type of *this.
typedef value_type self_type;
/// Empty construction.
value_type () YY_NOEXCEPT
: yyraw_ ()
{}
/// Construct and fill.
template <typename T>
value_type (YY_RVREF (T) t)
{
new (yyas_<T> ()) T (YY_MOVE (t));
}
#if 201103L <= YY_CPLUSPLUS
/// Non copyable.
value_type (const self_type&) = delete;
/// Non copyable.
self_type& operator= (const self_type&) = delete;
#endif
/// Destruction, allowed only if empty.
~value_type () YY_NOEXCEPT
{}
# if 201103L <= YY_CPLUSPLUS
/// Instantiate a \a T in here from \a t.
template <typename T, typename... U>
T&
emplace (U&&... u)
{
return *new (yyas_<T> ()) T (std::forward <U>(u)...);
}
# else
/// Instantiate an empty \a T in here.
template <typename T>
T&
emplace ()
{
return *new (yyas_<T> ()) T ();
}
/// Instantiate a \a T in here from \a t.
template <typename T>
T&
emplace (const T& t)
{
return *new (yyas_<T> ()) T (t);
}
# endif
/// Instantiate an empty \a T in here.
/// Obsolete, use emplace.
template <typename T>
T&
build ()
{
return emplace<T> ();
}
/// Instantiate a \a T in here from \a t.
/// Obsolete, use emplace.
template <typename T>
T&
build (const T& t)
{
return emplace<T> (t);
}
/// Accessor to a built \a T.
template <typename T>
T&
as () YY_NOEXCEPT
{
return *yyas_<T> ();
}
/// Const accessor to a built \a T (for %printer).
template <typename T>
const T&
as () const YY_NOEXCEPT
{
return *yyas_<T> ();
}
/// Swap the content with \a that, of same type.
///
/// Both variants must be built beforehand, because swapping the actual
/// data requires reading it (with as()), and this is not possible on
/// unconstructed variants: it would require some dynamic testing, which
/// should not be the variant's responsibility.
/// Swapping between built and (possibly) non-built is done with
/// self_type::move ().
template <typename T>
void
swap (self_type& that) YY_NOEXCEPT
{
std::swap (as<T> (), that.as<T> ());
}
/// Move the content of \a that to this.
///
/// Destroys \a that.
template <typename T>
void
move (self_type& that)
{
# if 201103L <= YY_CPLUSPLUS
emplace<T> (std::move (that.as<T> ()));
# else
emplace<T> ();
swap<T> (that);
# endif
that.destroy<T> ();
}
# if 201103L <= YY_CPLUSPLUS
/// Move the content of \a that to this.
template <typename T>
void
move (self_type&& that)
{
emplace<T> (std::move (that.as<T> ()));
that.destroy<T> ();
}
#endif
/// Copy the content of \a that to this.
template <typename T>
void
copy (const self_type& that)
{
emplace<T> (that.as<T> ());
}
/// Destroy the stored \a T.
template <typename T>
void
destroy ()
{
as<T> ().~T ();
}
private:
#if YY_CPLUSPLUS < 201103L
/// Non copyable.
value_type (const self_type&);
/// Non copyable.
self_type& operator= (const self_type&);
#endif
/// Accessor to raw memory as \a T.
template <typename T>
T*
yyas_ () YY_NOEXCEPT
{
void *yyp = yyraw_;
return static_cast<T*> (yyp);
}
/// Const accessor to raw memory as \a T.
template <typename T>
const T*
yyas_ () const YY_NOEXCEPT
{
const void *yyp = yyraw_;
return static_cast<const T*> (yyp);
}
/// An auxiliary type to compute the largest semantic type.
union union_type
{
// COND_CMD
// inputunit
// simple_command
// command
// shell_command
// for_command
// arith_for_command
// select_command
// case_command
// function_def
// function_body
// subshell
// comsub
// coproc
// if_command
// group_command
// arith_command
// cond_command
// elif_clause
// compound_list
// list0
// list1
// simple_list
// simple_list1
// pipeline_command
// pipeline
char dummy1[sizeof (COMMAND_PTR)];
// simple_command_element
char dummy2[sizeof (ELEMENT)];
// case_clause
// pattern_list
// case_clause_sequence
char dummy3[sizeof (PATTERN_LIST_PTR)];
// redirection
// redirection_list
char dummy4[sizeof (REDIRECT_PTR)];
// WORD
// ASSIGNMENT_WORD
// REDIR_WORD
char dummy5[sizeof (WORD_DESC_PTR)];
// ARITH_CMD
// ARITH_FOR_EXPRS
// word_list
// pattern
char dummy6[sizeof (WORD_LIST_PTR)];
// NUMBER
// list_terminator
// timespec
char dummy7[sizeof (int64_t)];
};
/// The size of the largest semantic type.
enum { size = sizeof (union_type) };
/// A buffer to store semantic values.
union
{
/// Strongest alignment constraints.
long double yyalign_me_;
/// A buffer large enough to store any of the semantic values.
char yyraw_[size];
};
};
#endif
/// Backward compatibility (Bison 3.8).
typedef value_type semantic_type;
/// Syntax errors thrown from user actions.
struct syntax_error : std::runtime_error
{
syntax_error (const std::string& m)
: std::runtime_error (m)
{}
syntax_error (const syntax_error& s)
: std::runtime_error (s.what ())
{}
~syntax_error () YY_NOEXCEPT YY_NOTHROW;
};
/// Token kinds.
struct token
{
enum token_kind_type
{
YYEMPTY = -2,
YYEOF = 0, // "end of file"
YYerror = 256, // error
YYUNDEF = 257, // "invalid token"
IF = 258, // IF
THEN = 259, // THEN
ELSE = 260, // ELSE
ELIF = 261, // ELIF
FI = 262, // FI
CASE = 263, // CASE
ESAC = 264, // ESAC
FOR = 265, // FOR
SELECT = 266, // SELECT
WHILE = 267, // WHILE
UNTIL = 268, // UNTIL
DO = 269, // DO
DONE = 270, // DONE
FUNCTION = 271, // FUNCTION
COPROC = 272, // COPROC
COND_START = 273, // COND_START
COND_END = 274, // COND_END
COND_ERROR = 275, // COND_ERROR
IN = 276, // IN
BANG = 277, // BANG
TIME = 278, // TIME
TIMEOPT = 279, // TIMEOPT
TIMEIGN = 280, // TIMEIGN
WORD = 281, // WORD
ASSIGNMENT_WORD = 282, // ASSIGNMENT_WORD
REDIR_WORD = 283, // REDIR_WORD
NUMBER = 284, // NUMBER
ARITH_CMD = 285, // ARITH_CMD
ARITH_FOR_EXPRS = 286, // ARITH_FOR_EXPRS
COND_CMD = 287, // COND_CMD
AND_AND = 288, // AND_AND
OR_OR = 289, // OR_OR
GREATER_GREATER = 290, // GREATER_GREATER
LESS_LESS = 291, // LESS_LESS
LESS_AND = 292, // LESS_AND
LESS_LESS_LESS = 293, // LESS_LESS_LESS
GREATER_AND = 294, // GREATER_AND
SEMI_SEMI = 295, // SEMI_SEMI
SEMI_AND = 296, // SEMI_AND
SEMI_SEMI_AND = 297, // SEMI_SEMI_AND
LESS_LESS_MINUS = 298, // LESS_LESS_MINUS
AND_GREATER = 299, // AND_GREATER
AND_GREATER_GREATER = 300, // AND_GREATER_GREATER
LESS_GREATER = 301, // LESS_GREATER
GREATER_BAR = 302, // GREATER_BAR
BAR_AND = 303, // BAR_AND
DOLPAREN = 304, // DOLPAREN
yacc_EOF = 305 // yacc_EOF
};
/// Backward compatibility alias (Bison 3.6).
typedef token_kind_type yytokentype;
};
/// Token kind, as returned by yylex.
typedef token::token_kind_type token_kind_type;
/// Backward compatibility alias (Bison 3.6).
typedef token_kind_type token_type;
/// Symbol kinds.
struct symbol_kind
{
enum symbol_kind_type
{
YYNTOKENS = 62, ///< Number of tokens.
S_YYEMPTY = -2,
S_YYEOF = 0, // "end of file"
S_YYerror = 1, // error
S_YYUNDEF = 2, // "invalid token"
S_IF = 3, // IF
S_THEN = 4, // THEN
S_ELSE = 5, // ELSE
S_ELIF = 6, // ELIF
S_FI = 7, // FI
S_CASE = 8, // CASE
S_ESAC = 9, // ESAC
S_FOR = 10, // FOR
S_SELECT = 11, // SELECT
S_WHILE = 12, // WHILE
S_UNTIL = 13, // UNTIL
S_DO = 14, // DO
S_DONE = 15, // DONE
S_FUNCTION = 16, // FUNCTION
S_COPROC = 17, // COPROC
S_COND_START = 18, // COND_START
S_COND_END = 19, // COND_END
S_COND_ERROR = 20, // COND_ERROR
S_IN = 21, // IN
S_BANG = 22, // BANG
S_TIME = 23, // TIME
S_TIMEOPT = 24, // TIMEOPT
S_TIMEIGN = 25, // TIMEIGN
S_WORD = 26, // WORD
S_ASSIGNMENT_WORD = 27, // ASSIGNMENT_WORD
S_REDIR_WORD = 28, // REDIR_WORD
S_NUMBER = 29, // NUMBER
S_ARITH_CMD = 30, // ARITH_CMD
S_ARITH_FOR_EXPRS = 31, // ARITH_FOR_EXPRS
S_COND_CMD = 32, // COND_CMD
S_AND_AND = 33, // AND_AND
S_OR_OR = 34, // OR_OR
S_GREATER_GREATER = 35, // GREATER_GREATER
S_LESS_LESS = 36, // LESS_LESS
S_LESS_AND = 37, // LESS_AND
S_LESS_LESS_LESS = 38, // LESS_LESS_LESS
S_GREATER_AND = 39, // GREATER_AND
S_SEMI_SEMI = 40, // SEMI_SEMI
S_SEMI_AND = 41, // SEMI_AND
S_SEMI_SEMI_AND = 42, // SEMI_SEMI_AND
S_LESS_LESS_MINUS = 43, // LESS_LESS_MINUS
S_AND_GREATER = 44, // AND_GREATER
S_AND_GREATER_GREATER = 45, // AND_GREATER_GREATER
S_LESS_GREATER = 46, // LESS_GREATER
S_GREATER_BAR = 47, // GREATER_BAR
S_BAR_AND = 48, // BAR_AND
S_DOLPAREN = 49, // DOLPAREN
S_50_ = 50, // '&'
S_51_ = 51, // ';'
S_52_n_ = 52, // '\n'
S_yacc_EOF = 53, // yacc_EOF
S_54_ = 54, // '|'
S_55_ = 55, // '>'
S_56_ = 56, // '<'
S_57_ = 57, // '-'
S_58_ = 58, // '{'
S_59_ = 59, // '}'
S_60_ = 60, // '('
S_61_ = 61, // ')'
S_YYACCEPT = 62, // $accept
S_inputunit = 63, // inputunit
S_word_list = 64, // word_list
S_redirection = 65, // redirection
S_simple_command_element = 66, // simple_command_element
S_redirection_list = 67, // redirection_list
S_simple_command = 68, // simple_command
S_command = 69, // command
S_shell_command = 70, // shell_command
S_for_command = 71, // for_command
S_arith_for_command = 72, // arith_for_command
S_select_command = 73, // select_command
S_case_command = 74, // case_command
S_function_def = 75, // function_def
S_function_body = 76, // function_body
S_subshell = 77, // subshell
S_comsub = 78, // comsub
S_coproc = 79, // coproc
S_if_command = 80, // if_command
S_group_command = 81, // group_command
S_arith_command = 82, // arith_command
S_cond_command = 83, // cond_command
S_elif_clause = 84, // elif_clause
S_case_clause = 85, // case_clause
S_pattern_list = 86, // pattern_list
S_case_clause_sequence = 87, // case_clause_sequence
S_pattern = 88, // pattern
S_compound_list = 89, // compound_list
S_list0 = 90, // list0
S_list1 = 91, // list1
S_simple_list_terminator = 92, // simple_list_terminator
S_list_terminator = 93, // list_terminator
S_newline_list = 94, // newline_list
S_simple_list = 95, // simple_list
S_simple_list1 = 96, // simple_list1
S_pipeline_command = 97, // pipeline_command
S_pipeline = 98, // pipeline
S_timespec = 99 // timespec
};
};
/// (Internal) symbol kind.
typedef symbol_kind::symbol_kind_type symbol_kind_type;
/// The number of tokens.
static const symbol_kind_type YYNTOKENS = symbol_kind::YYNTOKENS;
/// A complete symbol.
///
/// Expects its Base type to provide access to the symbol kind
/// via kind ().
///
/// Provide access to semantic value.
template <typename Base>
struct basic_symbol : Base
{
/// Alias to Base.
typedef Base super_type;
/// Default constructor.
basic_symbol () YY_NOEXCEPT
: value ()
{}
#if 201103L <= YY_CPLUSPLUS
/// Move constructor.
basic_symbol (basic_symbol&& that)
: Base (std::move (that))
, value ()
{
switch (this->kind ())
{
case symbol_kind::S_COND_CMD: // COND_CMD
case symbol_kind::S_inputunit: // inputunit
case symbol_kind::S_simple_command: // simple_command
case symbol_kind::S_command: // command
case symbol_kind::S_shell_command: // shell_command
case symbol_kind::S_for_command: // for_command
case symbol_kind::S_arith_for_command: // arith_for_command
case symbol_kind::S_select_command: // select_command
case symbol_kind::S_case_command: // case_command
case symbol_kind::S_function_def: // function_def
case symbol_kind::S_function_body: // function_body
case symbol_kind::S_subshell: // subshell
case symbol_kind::S_comsub: // comsub
case symbol_kind::S_coproc: // coproc
case symbol_kind::S_if_command: // if_command
case symbol_kind::S_group_command: // group_command
case symbol_kind::S_arith_command: // arith_command
case symbol_kind::S_cond_command: // cond_command
case symbol_kind::S_elif_clause: // elif_clause
case symbol_kind::S_compound_list: // compound_list
case symbol_kind::S_list0: // list0
case symbol_kind::S_list1: // list1
case symbol_kind::S_simple_list: // simple_list
case symbol_kind::S_simple_list1: // simple_list1
case symbol_kind::S_pipeline_command: // pipeline_command
case symbol_kind::S_pipeline: // pipeline
value.move< COMMAND_PTR > (std::move (that.value));
break;
case symbol_kind::S_simple_command_element: // simple_command_element
value.move< ELEMENT > (std::move (that.value));
break;
case symbol_kind::S_case_clause: // case_clause
case symbol_kind::S_pattern_list: // pattern_list
case symbol_kind::S_case_clause_sequence: // case_clause_sequence
value.move< PATTERN_LIST_PTR > (std::move (that.value));
break;
case symbol_kind::S_redirection: // redirection
case symbol_kind::S_redirection_list: // redirection_list
value.move< REDIRECT_PTR > (std::move (that.value));
break;
case symbol_kind::S_WORD: // WORD
case symbol_kind::S_ASSIGNMENT_WORD: // ASSIGNMENT_WORD
case symbol_kind::S_REDIR_WORD: // REDIR_WORD
value.move< WORD_DESC_PTR > (std::move (that.value));
break;
case symbol_kind::S_ARITH_CMD: // ARITH_CMD
case symbol_kind::S_ARITH_FOR_EXPRS: // ARITH_FOR_EXPRS
case symbol_kind::S_word_list: // word_list
case symbol_kind::S_pattern: // pattern
value.move< WORD_LIST_PTR > (std::move (that.value));
break;
case symbol_kind::S_NUMBER: // NUMBER
case symbol_kind::S_list_terminator: // list_terminator
case symbol_kind::S_timespec: // timespec
value.move< int64_t > (std::move (that.value));
break;
default:
break;
}
}
#endif
/// Copy constructor.
basic_symbol (const basic_symbol& that);
/// Constructors for typed symbols.
#if 201103L <= YY_CPLUSPLUS
basic_symbol (typename Base::kind_type t)
: Base (t)
{}
#else
basic_symbol (typename Base::kind_type t)
: Base (t)
{}
#endif
#if 201103L <= YY_CPLUSPLUS
basic_symbol (typename Base::kind_type t, COMMAND_PTR&& v)
: Base (t)
, value (std::move (v))
{}
#else
basic_symbol (typename Base::kind_type t, const COMMAND_PTR& v)
: Base (t)
, value (v)
{}
#endif
#if 201103L <= YY_CPLUSPLUS
basic_symbol (typename Base::kind_type t, ELEMENT&& v)
: Base (t)
, value (std::move (v))
{}
#else
basic_symbol (typename Base::kind_type t, const ELEMENT& v)
: Base (t)
, value (v)
{}
#endif
#if 201103L <= YY_CPLUSPLUS
basic_symbol (typename Base::kind_type t, PATTERN_LIST_PTR&& v)
: Base (t)
, value (std::move (v))
{}
#else
basic_symbol (typename Base::kind_type t, const PATTERN_LIST_PTR& v)
: Base (t)
, value (v)
{}
#endif
#if 201103L <= YY_CPLUSPLUS
basic_symbol (typename Base::kind_type t, REDIRECT_PTR&& v)
: Base (t)
, value (std::move (v))
{}
#else
basic_symbol (typename Base::kind_type t, const REDIRECT_PTR& v)
: Base (t)
, value (v)
{}
#endif
#if 201103L <= YY_CPLUSPLUS
basic_symbol (typename Base::kind_type t, WORD_DESC_PTR&& v)
: Base (t)
, value (std::move (v))
{}
#else
basic_symbol (typename Base::kind_type t, const WORD_DESC_PTR& v)
: Base (t)
, value (v)
{}
#endif
#if 201103L <= YY_CPLUSPLUS
basic_symbol (typename Base::kind_type t, WORD_LIST_PTR&& v)
: Base (t)
, value (std::move (v))
{}
#else
basic_symbol (typename Base::kind_type t, const WORD_LIST_PTR& v)
: Base (t)
, value (v)
{}
#endif
#if 201103L <= YY_CPLUSPLUS
basic_symbol (typename Base::kind_type t, int64_t&& v)
: Base (t)
, value (std::move (v))
{}
#else
basic_symbol (typename Base::kind_type t, const int64_t& v)
: Base (t)
, value (v)
{}
#endif
/// Destroy the symbol.
~basic_symbol ()
{
clear ();
}
/// Destroy contents, and record that is empty.
void clear () YY_NOEXCEPT
{
// User destructor.
symbol_kind_type yykind = this->kind ();
basic_symbol<Base>& yysym = *this;
(void) yysym;
switch (yykind)
{
default:
break;
}
// Value type destructor.
switch (yykind)
{
case symbol_kind::S_COND_CMD: // COND_CMD
case symbol_kind::S_inputunit: // inputunit
case symbol_kind::S_simple_command: // simple_command
case symbol_kind::S_command: // command
case symbol_kind::S_shell_command: // shell_command
case symbol_kind::S_for_command: // for_command
case symbol_kind::S_arith_for_command: // arith_for_command
case symbol_kind::S_select_command: // select_command
case symbol_kind::S_case_command: // case_command
case symbol_kind::S_function_def: // function_def
case symbol_kind::S_function_body: // function_body
case symbol_kind::S_subshell: // subshell
case symbol_kind::S_comsub: // comsub
case symbol_kind::S_coproc: // coproc
case symbol_kind::S_if_command: // if_command
case symbol_kind::S_group_command: // group_command
case symbol_kind::S_arith_command: // arith_command
case symbol_kind::S_cond_command: // cond_command
case symbol_kind::S_elif_clause: // elif_clause
case symbol_kind::S_compound_list: // compound_list
case symbol_kind::S_list0: // list0
case symbol_kind::S_list1: // list1
case symbol_kind::S_simple_list: // simple_list
case symbol_kind::S_simple_list1: // simple_list1
case symbol_kind::S_pipeline_command: // pipeline_command
case symbol_kind::S_pipeline: // pipeline
value.template destroy< COMMAND_PTR > ();
break;
case symbol_kind::S_simple_command_element: // simple_command_element
value.template destroy< ELEMENT > ();
break;
case symbol_kind::S_case_clause: // case_clause
case symbol_kind::S_pattern_list: // pattern_list
case symbol_kind::S_case_clause_sequence: // case_clause_sequence
value.template destroy< PATTERN_LIST_PTR > ();
break;
case symbol_kind::S_redirection: // redirection
case symbol_kind::S_redirection_list: // redirection_list
value.template destroy< REDIRECT_PTR > ();
break;
case symbol_kind::S_WORD: // WORD
case symbol_kind::S_ASSIGNMENT_WORD: // ASSIGNMENT_WORD
case symbol_kind::S_REDIR_WORD: // REDIR_WORD
value.template destroy< WORD_DESC_PTR > ();
break;
case symbol_kind::S_ARITH_CMD: // ARITH_CMD
case symbol_kind::S_ARITH_FOR_EXPRS: // ARITH_FOR_EXPRS
case symbol_kind::S_word_list: // word_list
case symbol_kind::S_pattern: // pattern
value.template destroy< WORD_LIST_PTR > ();
break;
case symbol_kind::S_NUMBER: // NUMBER
case symbol_kind::S_list_terminator: // list_terminator
case symbol_kind::S_timespec: // timespec
value.template destroy< int64_t > ();
break;
default:
break;
}
Base::clear ();
}
#if YYDEBUG || 0
/// The user-facing name of this symbol.
const char *name () const YY_NOEXCEPT
{
return parser::symbol_name (this->kind ());
}
#endif // #if YYDEBUG || 0
/// Backward compatibility (Bison 3.6).
symbol_kind_type type_get () const YY_NOEXCEPT;
/// Whether empty.
bool empty () const YY_NOEXCEPT;
/// Destructive move, \a s is emptied into this.
void move (basic_symbol& s);
/// The semantic value.
value_type value;
private:
#if YY_CPLUSPLUS < 201103L
/// Assignment operator.
basic_symbol& operator= (const basic_symbol& that);
#endif
};
/// Type access provider for token (enum) based symbols.
struct by_kind
{
/// The symbol kind as needed by the constructor.
typedef token_kind_type kind_type;
/// Default constructor.
by_kind () YY_NOEXCEPT;
#if 201103L <= YY_CPLUSPLUS
/// Move constructor.
by_kind (by_kind&& that) YY_NOEXCEPT;
#endif
/// Copy constructor.
by_kind (const by_kind& that) YY_NOEXCEPT;
/// Constructor from (external) token numbers.
by_kind (kind_type t) YY_NOEXCEPT;
/// Record that this symbol is empty.
void clear () YY_NOEXCEPT;
/// Steal the symbol kind from \a that.
void move (by_kind& that);
/// The (internal) type number (corresponding to \a type).
/// \a empty when empty.
symbol_kind_type kind () const YY_NOEXCEPT;
/// Backward compatibility (Bison 3.6).
symbol_kind_type type_get () const YY_NOEXCEPT;