Context Navigation

parser.yy @ 86b8d16

ADTast-experimentalpthread-emulationqualifiedEnum

Last change on this file since 86b8d16 was 86b8d16, checked in by Peter A. Buhr <pabuhr@…>, 2 years ago
formatting, remove for/else shift/reduce conflict
Property mode set to `100644`
File size: 149.3 KB

Line
1	//
2	// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3	//
4	// The contents of this file are covered under the licence agreement in the
5	// file "LICENCE" distributed with Cforall.
6	//
7	// parser.yy --
8	//
9	// Author : Peter A. Buhr
10	// Created On : Sat Sep 1 20:22:55 2001
11	// Last Modified By : Peter A. Buhr
12	// Last Modified On : Wed May 4 17:22:48 2022
13	// Update Count : 5279
14	//
15
16	// This grammar is based on the ANSI99/11 C grammar, specifically parts of EXPRESSION and STATEMENTS, and on the C
17	// grammar by James A. Roskind, specifically parts of DECLARATIONS and EXTERNAL DEFINITIONS. While parts have been
18	// copied, important changes have been made in all sections; these changes are sufficient to constitute a new grammar.
19	// In particular, this grammar attempts to be more syntactically precise, i.e., it parses less incorrect language syntax
20	// that must be subsequently rejected by semantic checks. Nevertheless, there are still several semantic checks
21	// required and many are noted in the grammar. Finally, the grammar is extended with GCC and CFA language extensions.
22
23	// Acknowledgments to Richard Bilson, Glen Ditchfield, and Rodolfo Gabriel Esteves who all helped when I got stuck with
24	// the grammar.
25
26	// The root language for this grammar is ANSI99/11 C. All of ANSI99/11 is parsed, except for:
27	//
28	// designation with '=' (use ':' instead)
29	//
30	// This incompatibility is discussed in detail before the "designation" grammar rule. Most of the syntactic extensions
31	// from ANSI90 to ANSI11 C are marked with the comment "C99/C11".
32
33	// This grammar also has two levels of extensions. The first extensions cover most of the GCC C extensions. All of the
34	// syntactic extensions for GCC C are marked with the comment "GCC". The second extensions are for Cforall (CFA), which
35	// fixes several of C's outstanding problems and extends C with many modern language concepts. All of the syntactic
36	// extensions for CFA C are marked with the comment "CFA".
37
38	%{
39	#define YYDEBUG_LEXER_TEXT( yylval ) // lexer loads this up each time
40	#define YYDEBUG 1 // get the pretty debugging code to compile
41	#define YYERROR_VERBOSE // more information in syntax errors
42
43	#undef __GNUC_MINOR__
44
45	#include <cstdio>
46	#include <stack>
47	using namespace std;
48
49	#include "SynTree/Declaration.h"
50	#include "ParseNode.h"
51	#include "TypedefTable.h"
52	#include "TypeData.h"
53	#include "SynTree/LinkageSpec.h"
54	#include "Common/SemanticError.h" // error_str
55	#include "Common/utility.h" // for maybeMoveBuild, maybeBuild, CodeLo...
56
57	extern DeclarationNode * parseTree;
58	extern LinkageSpec::Spec linkage;
59	extern TypedefTable typedefTable;
60
61	stack<LinkageSpec::Spec> linkageStack;
62
63	bool appendStr( string & to, string & from ) {
64	// 1. Multiple strings are concatenated into a single string but not combined internally. The reason is that
65	// "\x12" "3" is treated as 2 characters versus 1 because "escape sequences are converted into single members of
66	// the execution character set just prior to adjacent string literal concatenation" (C11, Section 6.4.5-8). It is
67	// easier to let the C compiler handle this case.
68	//
69	// 2. String encodings are transformed into canonical form (one encoding at start) so the encoding can be found
70	// without searching the string, e.g.: "abc" L"def" L"ghi" => L"abc" "def" "ghi". Multiple encodings must match,
71	// e.g., u"a" U"b" L"c" is disallowed.
72
73	if ( from[0] != '"' ) { // encoding ?
74	if ( to[0] != '"' ) { // encoding ?
75	if ( to[0] != from[0] \|\| to[1] != from[1] ) { // different encodings ?
76	yyerror( "non-matching string encodings for string-literal concatenation" );
77	return false; // parse error, must call YYERROR in action
78	} else if ( from[1] == '8' ) {
79	from.erase( 0, 1 ); // remove 2nd encoding
80	} // if
81	} else {
82	if ( from[1] == '8' ) { // move encoding to start
83	to = "u8" + to;
84	from.erase( 0, 1 ); // remove 2nd encoding
85	} else {
86	to = from[0] + to;
87	} // if
88	} // if
89	from.erase( 0, 1 ); // remove 2nd encoding
90	} // if
91	to += " " + from; // concatenated into single string
92	return true;
93	} // appendStr
94
95	DeclarationNode * distAttr( DeclarationNode * specifier, DeclarationNode * declList ) {
96	// distribute declaration_specifier across all declared variables, e.g., static, const, __attribute__.
97	DeclarationNode * cur = declList, * cl = (new DeclarationNode)->addType( specifier );
98	for ( cur = dynamic_cast<DeclarationNode >( cur->get_next() ); cur != nullptr; cur = dynamic_cast<DeclarationNode >( cur->get_next() ) ) {
99	cl->cloneBaseType( cur );
100	} // for
101	declList->addType( cl );
102	return declList;
103	} // distAttr
104
105	void distExt( DeclarationNode * declaration ) {
106	// distribute EXTENSION across all declarations
107	for ( DeclarationNode iter = declaration; iter != nullptr; iter = (DeclarationNode )iter->get_next() ) {
108	iter->set_extension( true );
109	} // for
110	} // distExt
111
112	void distInl( DeclarationNode * declaration ) {
113	// distribute INLINE across all declarations
114	for ( DeclarationNode iter = declaration; iter != nullptr; iter = (DeclarationNode )iter->get_next() ) {
115	iter->set_inLine( true );
116	} // for
117	} // distInl
118
119	void distQual( DeclarationNode * declaration, DeclarationNode * qualifiers ) {
120	// distribute qualifiers across all non-variable declarations in a distribution statemement
121	for ( DeclarationNode * iter = declaration; iter != nullptr; iter = (DeclarationNode *)iter->get_next() ) {
122	// SKULLDUGGERY: Distributions are parsed inside out, so qualifiers are added to declarations inside out. Since
123	// addQualifiers appends to the back of the list, the forall clauses are in the wrong order (right to left). To
124	// get the qualifiers in the correct order and still use addQualifiers (otherwise, 90% of addQualifiers has to
125	// be copied to add to front), the appropriate forall pointers are interchanged before calling addQualifiers.
126	DeclarationNode * clone = qualifiers->clone();
127	if ( qualifiers->type ) { // forall clause ? (handles SC)
128	if ( iter->type->kind == TypeData::Aggregate ) { // struct/union ?
129	swap( clone->type->forall, iter->type->aggregate.params );
130	iter->addQualifiers( clone );
131	} else if ( iter->type->kind == TypeData::AggregateInst && iter->type->aggInst.aggregate->aggregate.body ) { // struct/union ?
132	// Create temporary node to hold aggregate, call addQualifiers as above, then put nodes back together.
133	DeclarationNode newnode;
134	swap( newnode.type, iter->type->aggInst.aggregate );
135	swap( clone->type->forall, newnode.type->aggregate.params );
136	newnode.addQualifiers( clone );
137	swap( newnode.type, iter->type->aggInst.aggregate );
138	} else if ( iter->type->kind == TypeData::Function ) { // routines ?
139	swap( clone->type->forall, iter->type->forall );
140	iter->addQualifiers( clone );
141	} // if
142	} else { // just SC qualifiers
143	iter->addQualifiers( clone );
144	} // if
145	} // for
146	delete qualifiers;
147	} // distQual
148
149	// There is an ambiguity for inline generic-routine return-types and generic routines.
150	// forall( otype T ) struct S { int i; } bar( T ) {}
151	// Does the forall bind to the struct or the routine, and how would it be possible to explicitly specify the binding.
152	// forall( otype T ) struct S { int T; } forall( otype W ) bar( W ) {}
153	// Currently, the forall is associated with the routine, and the generic type has to be separately defined:
154	// forall( otype T ) struct S { int T; };
155	// forall( otype W ) bar( W ) {}
156
157	void rebindForall( DeclarationNode * declSpec, DeclarationNode * funcDecl ) {
158	if ( declSpec->type->kind == TypeData::Aggregate ) { // ignore aggregate definition
159	funcDecl->type->forall = declSpec->type->aggregate.params; // move forall from aggregate to function type
160	declSpec->type->aggregate.params = nullptr;
161	} // if
162	} // rebindForall
163
164	string * build_postfix_name( string * name ) {
165	name = string("__postfix_func_") + name;
166	return name;
167	} // build_postfix_name
168
169	DeclarationNode * fieldDecl( DeclarationNode * typeSpec, DeclarationNode * fieldList ) {
170	if ( ! fieldList ) { // field declarator ?
171	if ( ! ( typeSpec->type && (typeSpec->type->kind == TypeData::Aggregate \|\| typeSpec->type->kind == TypeData::Enum) ) ) {
172	stringstream ss;
173	typeSpec->type->print( ss );
174	SemanticWarning( yylloc, Warning::SuperfluousDecl, ss.str().c_str() );
175	return nullptr;
176	} // if
177	fieldList = DeclarationNode::newName( nullptr );
178	} // if
179	return distAttr( typeSpec, fieldList ); // mark all fields in list
180	} // fieldDecl
181
182	ForCtrl * forCtrl( ExpressionNode * type, string * index, ExpressionNode * start, enum OperKinds compop, ExpressionNode * comp, ExpressionNode * inc ) {
183	ConstantExpr * constant = dynamic_cast<ConstantExpr *>(type->expr.get());
184	if ( constant && (constant->get_constant()->get_value() == "0" \|\| constant->get_constant()->get_value() == "1") ) {
185	type = new ExpressionNode( new CastExpr( maybeMoveBuild<Expression>(type), new BasicType( Type::Qualifiers(), BasicType::SignedInt ) ) );
186	} // if
187	// type = new ExpressionNode( build_func( new ExpressionNode( build_varref( new string( "__for_control_index_constraints__" ) ) ), type ) );
188	return new ForCtrl(
189	distAttr( DeclarationNode::newTypeof( type, true ), DeclarationNode::newName( index )->addInitializer( new InitializerNode( start ) ) ),
190	// NULL comp/inc => leave blank
191	comp ? new ExpressionNode( build_binary_val( compop, new ExpressionNode( build_varref( new string( *index ) ) ), comp ) ) : 0,
192	inc ? new ExpressionNode( build_binary_val( compop == OperKinds::LThan \|\| compop == OperKinds::LEThan ? // choose += or -= for upto/downto
193	OperKinds::PlusAssn : OperKinds::MinusAssn, new ExpressionNode( build_varref( new string( *index ) ) ), inc ) ) : 0 );
194	} // forCtrl
195
196	ForCtrl * forCtrl( ExpressionNode * type, ExpressionNode * index, ExpressionNode * start, enum OperKinds compop, ExpressionNode * comp, ExpressionNode * inc ) {
197	if ( NameExpr * identifier = dynamic_cast<NameExpr *>(index->expr.get()) ) {
198	return forCtrl( type, new string( identifier->name ), start, compop, comp, inc );
199	} else if ( CommaExpr * commaExpr = dynamic_cast<CommaExpr *>(index->expr.get()) ) {
200	if ( NameExpr * identifier = dynamic_cast<NameExpr *>(commaExpr->arg1 ) ) {
201	return forCtrl( type, new string( identifier->name ), start, compop, comp, inc );
202	} else {
203	SemanticError( yylloc, "Expression disallowed. Only loop-index name allowed." ); return nullptr;
204	} // if
205	} else {
206	SemanticError( yylloc, "Expression disallowed. Only loop-index name allowed." ); return nullptr;
207	} // if
208	} // forCtrl
209
210	bool forall = false; // aggregate have one or more forall qualifiers ?
211
212	// https://www.gnu.org/software/bison/manual/bison.html#Location-Type
213	#define YYLLOC_DEFAULT(Cur, Rhs, N) \
214	if ( N ) { \
215	(Cur).first_line = YYRHSLOC( Rhs, 1 ).first_line; \
216	(Cur).first_column = YYRHSLOC( Rhs, 1 ).first_column; \
217	(Cur).last_line = YYRHSLOC( Rhs, N ).last_line; \
218	(Cur).last_column = YYRHSLOC( Rhs, N ).last_column; \
219	(Cur).filename = YYRHSLOC( Rhs, 1 ).filename; \
220	} else { \
221	(Cur).first_line = (Cur).last_line = YYRHSLOC( Rhs, 0 ).last_line; \
222	(Cur).first_column = (Cur).last_column = YYRHSLOC( Rhs, 0 ).last_column; \
223	(Cur).filename = YYRHSLOC( Rhs, 0 ).filename; \
224	}
225	%}
226
227	%define parse.error verbose
228
229	// Types declaration for productions
230	%union {
231	Token tok;
232	ParseNode * pn;
233	ExpressionNode * en;
234	DeclarationNode * decl;
235	AggregateDecl::Aggregate aggKey;
236	TypeDecl::Kind tclass;
237	StatementNode * sn;
238	WaitForStmt * wfs;
239	Expression * constant;
240	CondCtl * ifctl;
241	ForCtrl * fctl;
242	enum OperKinds compop;
243	LabelNode * label;
244	InitializerNode * in;
245	OperKinds op;
246	std::string * str;
247	bool flag;
248	CatchStmt::Kind catch_kind;
249	GenericExpr * genexpr;
250	}
251
252	//*********************** TERMINAL TOKENS ******************************
253
254	// keywords
255	%token TYPEDEF
256	%token EXTERN STATIC AUTO REGISTER
257	%token THREADLOCAL // C11
258	%token INLINE FORTRAN // C99, extension ISO/IEC 9899:1999 Section J.5.9(1)
259	%token NORETURN // C11
260	%token CONST VOLATILE
261	%token RESTRICT // C99
262	%token ATOMIC // C11
263	%token FORALL MUTEX VIRTUAL VTABLE COERCE // CFA
264	%token VOID CHAR SHORT INT LONG FLOAT DOUBLE SIGNED UNSIGNED
265	%token BOOL COMPLEX IMAGINARY // C99
266	%token INT128 UINT128 uuFLOAT80 uuFLOAT128 // GCC
267	%token uFLOAT16 uFLOAT32 uFLOAT32X uFLOAT64 uFLOAT64X uFLOAT128 // GCC
268	%token DECIMAL32 DECIMAL64 DECIMAL128 // GCC
269	%token ZERO_T ONE_T // CFA
270	%token SIZEOF TYPEOF VALIST AUTO_TYPE // GCC
271	%token OFFSETOF BASETYPEOF TYPEID // CFA
272	%token ENUM STRUCT UNION
273	%token EXCEPTION // CFA
274	%token GENERATOR COROUTINE MONITOR THREAD // CFA
275	%token OTYPE FTYPE DTYPE TTYPE TRAIT // CFA
276	// %token RESUME // CFA
277	%token LABEL // GCC
278	%token SUSPEND // CFA
279	%token ATTRIBUTE EXTENSION // GCC
280	%token IF ELSE SWITCH CASE DEFAULT DO WHILE FOR BREAK CONTINUE GOTO RETURN
281	%token CHOOSE FALLTHRU FALLTHROUGH WITH WHEN WAITFOR // CFA
282	%token DISABLE ENABLE TRY THROW THROWRESUME AT // CFA
283	%token ASM // C99, extension ISO/IEC 9899:1999 Section J.5.10(1)
284	%token ALIGNAS ALIGNOF GENERIC STATICASSERT // C11
285
286	// names and constants: lexer differentiates between identifier and typedef names
287	%token<tok> IDENTIFIER QUOTED_IDENTIFIER TYPEDIMname TYPEDEFname TYPEGENname
288	%token<tok> TIMEOUT WOR CATCH RECOVER CATCHRESUME FIXUP FINALLY // CFA
289	%token<tok> INTEGERconstant CHARACTERconstant STRINGliteral
290	%token<tok> DIRECTIVE
291	// Floating point constant is broken into three kinds of tokens because of the ambiguity with tuple indexing and
292	// overloading constants 0/1, e.g., x.1 is lexed as (x)(.1), where (.1) is a factional constant, but is semantically
293	// converted into the tuple index (.)(1). e.g., 3.x
294	%token<tok> FLOATING_DECIMALconstant FLOATING_FRACTIONconstant FLOATINGconstant
295
296	// multi-character operators
297	%token ARROW // ->
298	%token ICR DECR // ++ --
299	%token LS RS // << >>
300	%token LE GE EQ NE // <= >= == !=
301	%token ANDAND OROR // && \|\|
302	%token ELLIPSIS // ...
303
304	%token EXPassign MULTassign DIVassign MODassign // \= *= /= %=
305	%token PLUSassign MINUSassign // += -=
306	%token LSassign RSassign // <<= >>=
307	%token ANDassign ERassign ORassign // &= ^= \|=
308
309	%token ErangeUpEq ErangeDown ErangeDownEq // ~= -~ -~=
310	%token ATassign // @=
311
312	%type<tok> identifier identifier_at identifier_or_type_name attr_name
313	%type<tok> quasi_keyword
314	%type<constant> string_literal
315	%type<str> string_literal_list
316
317	// expressions
318	%type<en> constant
319	%type<en> tuple tuple_expression_list
320	%type<op> ptrref_operator unary_operator assignment_operator simple_assignment_operator compound_assignment_operator
321	%type<en> primary_expression postfix_expression unary_expression
322	%type<en> cast_expression_list cast_expression exponential_expression multiplicative_expression additive_expression
323	%type<en> shift_expression relational_expression equality_expression
324	%type<en> AND_expression exclusive_OR_expression inclusive_OR_expression
325	%type<en> logical_AND_expression logical_OR_expression
326	%type<en> conditional_expression constant_expression assignment_expression assignment_expression_opt
327	%type<en> comma_expression comma_expression_opt
328	%type<en> argument_expression_list_opt argument_expression_list argument_expression default_initializer_opt
329	%type<ifctl> conditional_declaration
330	%type<fctl> for_control_expression for_control_expression_list
331	%type<compop> inclexcl
332	%type<en> subrange
333	%type<decl> asm_name_opt
334	%type<en> asm_operands_opt asm_operands_list asm_operand
335	%type<label> label_list
336	%type<en> asm_clobbers_list_opt
337	%type<flag> asm_volatile_opt
338	%type<en> handler_predicate_opt
339	%type<genexpr> generic_association generic_assoc_list
340
341	// statements
342	%type<sn> statement labeled_statement compound_statement
343	%type<sn> statement_decl statement_decl_list statement_list_nodecl
344	%type<sn> selection_statement if_statement
345	%type<sn> switch_clause_list_opt switch_clause_list
346	%type<en> case_value
347	%type<sn> case_clause case_value_list case_label case_label_list
348	%type<sn> iteration_statement jump_statement
349	%type<sn> expression_statement asm_statement
350	%type<sn> with_statement
351	%type<en> with_clause_opt
352	%type<sn> exception_statement handler_clause finally_clause
353	%type<catch_kind> handler_key
354	%type<sn> mutex_statement
355	%type<en> when_clause when_clause_opt waitfor timeout
356	%type<sn> waitfor_statement
357	%type<wfs> waitfor_clause
358
359	// declarations
360	%type<decl> abstract_declarator abstract_ptr abstract_array abstract_function array_dimension multi_array_dimension
361	%type<decl> abstract_parameter_declarator abstract_parameter_ptr abstract_parameter_array abstract_parameter_function array_parameter_dimension array_parameter_1st_dimension
362	%type<decl> abstract_parameter_declaration
363
364	%type<aggKey> aggregate_key aggregate_data aggregate_control
365	%type<decl> aggregate_type aggregate_type_nobody
366
367	%type<decl> assertion assertion_list assertion_list_opt
368
369	%type<en> bit_subrange_size_opt bit_subrange_size
370
371	%type<decl> basic_declaration_specifier basic_type_name basic_type_specifier direct_type indirect_type
372	%type<decl> vtable vtable_opt default_opt
373
374	%type<decl> trait_declaration trait_declaration_list trait_declaring_list trait_specifier
375
376	%type<decl> declaration declaration_list declaration_list_opt declaration_qualifier_list
377	%type<decl> declaration_specifier declaration_specifier_nobody declarator declaring_list
378
379	%type<decl> elaborated_type elaborated_type_nobody
380
381	%type<decl> enumerator_list enum_type enum_type_nobody
382	%type<in> enumerator_value_opt
383
384	%type<decl> external_definition external_definition_list external_definition_list_opt
385
386	%type<decl> exception_declaration
387
388	%type<decl> field_declaration_list_opt field_declaration field_declaring_list_opt field_declarator field_abstract_list_opt field_abstract
389	%type<en> field field_name_list field_name fraction_constants_opt
390
391	%type<decl> external_function_definition function_definition function_array function_declarator function_no_ptr function_ptr
392
393	%type<decl> identifier_parameter_declarator identifier_parameter_ptr identifier_parameter_array identifier_parameter_function
394	%type<decl> identifier_list
395
396	%type<decl> cfa_abstract_array cfa_abstract_declarator_no_tuple cfa_abstract_declarator_tuple
397	%type<decl> cfa_abstract_function cfa_abstract_parameter_declaration cfa_abstract_parameter_list
398	%type<decl> cfa_abstract_ptr cfa_abstract_tuple
399
400	%type<decl> cfa_array_parameter_1st_dimension
401
402	%type<decl> cfa_trait_declaring_list cfa_declaration cfa_field_declaring_list cfa_field_abstract_list
403	%type<decl> cfa_function_declaration cfa_function_return cfa_function_specifier
404
405	%type<decl> cfa_identifier_parameter_array cfa_identifier_parameter_declarator_no_tuple
406	%type<decl> cfa_identifier_parameter_declarator_tuple cfa_identifier_parameter_ptr
407
408	%type<decl> cfa_parameter_declaration cfa_parameter_list cfa_parameter_ellipsis_list_opt
409
410	%type<decl> cfa_typedef_declaration cfa_variable_declaration cfa_variable_specifier
411
412	%type<decl> c_declaration static_assert
413	%type<decl> KR_function_declarator KR_function_no_ptr KR_function_ptr KR_function_array
414	%type<decl> KR_parameter_list KR_parameter_list_opt
415
416	%type<decl> parameter_declaration parameter_list parameter_type_list_opt
417
418	%type<decl> paren_identifier paren_type
419
420	%type<decl> storage_class storage_class_list
421
422	%type<decl> sue_declaration_specifier sue_declaration_specifier_nobody sue_type_specifier sue_type_specifier_nobody
423
424	%type<tclass> type_class new_type_class
425	%type<decl> type_declarator type_declarator_name type_declaring_list
426
427	%type<decl> type_declaration_specifier type_type_specifier type_name typegen_name
428	%type<decl> typedef_name typedef_declaration typedef_expression
429
430	%type<decl> variable_type_redeclarator type_ptr type_array type_function
431
432	%type<decl> type_parameter_redeclarator type_parameter_ptr type_parameter_array type_parameter_function
433
434	%type<decl> type type_no_function
435	%type<decl> type_parameter type_parameter_list type_initializer_opt
436
437	%type<en> type_parameters_opt type_list
438
439	%type<decl> type_qualifier type_qualifier_name forall type_qualifier_list_opt type_qualifier_list
440	%type<decl> type_specifier type_specifier_nobody
441
442	%type<decl> variable_declarator variable_ptr variable_array variable_function
443	%type<decl> variable_abstract_declarator variable_abstract_ptr variable_abstract_array variable_abstract_function
444
445	%type<decl> attribute_list_opt attribute_list attribute attribute_name_list attribute_name
446
447	// initializers
448	%type<in> initializer initializer_list_opt initializer_opt
449
450	// designators
451	%type<en> designator designator_list designation
452
453
454	// Handle shift/reduce conflict for dangling else by shifting the ELSE token. For example, this string is ambiguous:
455	// .---------. matches IF '(' comma_expression ')' statement . (reduce)
456	// if ( C ) S1 else S2
457	// `-----------------' matches IF '(' comma_expression ')' statement . (shift) ELSE statement */
458	// Similar issues exit with the waitfor statement.
459
460	// Order of these lines matters (low-to-high precedence). THEN is left associative over WOR/TIMEOUT/ELSE, WOR is left
461	// associative over TIMEOUT/ELSE, and TIMEOUT is left associative over ELSE.
462	%precedence THEN // rule precedence for IF/WAITFOR statement
463	%precedence WOR // token precedence for start of WOR in WAITFOR statement
464	%precedence TIMEOUT // token precedence for start of TIMEOUT in WAITFOR statement
465	%precedence CATCH // token precedence for start of TIMEOUT in WAITFOR statement
466	%precedence RECOVER // token precedence for start of TIMEOUT in WAITFOR statement
467	%precedence CATCHRESUME // token precedence for start of TIMEOUT in WAITFOR statement
468	%precedence FIXUP // token precedence for start of TIMEOUT in WAITFOR statement
469	%precedence FINALLY // token precedence for start of TIMEOUT in WAITFOR statement
470	%precedence ELSE // token precedence for start of else clause in IF/WAITFOR statement
471
472
473	// Handle shift/reduce conflict for generic type by shifting the '(' token. For example, this string is ambiguous:
474	// forall( otype T ) struct Foo { T v; };
475	// .-----. matches pointer to function returning a generic (which is impossible without a type)
476	// Foo ( *fp )( int );
477	// `---' matches start of TYPEGENname '('
478	// must be:
479	// Foo( int ) ( *fp )( int );
480	// The same problem occurs here:
481	// forall( otype T ) struct Foo { T v; } ( *fp )( int );
482	// must be:
483	// forall( otype T ) struct Foo { T v; } ( int ) ( *fp )( int );
484
485	// Order of these lines matters (low-to-high precedence).
486	%precedence TYPEGENname
487	%precedence '}'
488	%precedence '('
489
490	// %precedence RESUME
491	// %precedence '{'
492	// %precedence ')'
493
494	%locations // support location tracking for error messages
495
496	%start translation_unit // parse-tree root
497
498	%%
499	//*********************** Namespace Management ******************************
500
501	// The C grammar is not context free because it relies on the distinct terminal symbols "identifier" and "TYPEDEFname",
502	// which are lexically identical.
503	//
504	// typedef int foo; // identifier foo must now be scanned as TYPEDEFname
505	// foo f; // to allow it to appear in this context
506	//
507	// While it may be possible to write a purely context-free grammar, such a grammar would obscure the relationship
508	// between syntactic and semantic constructs. Cforall compounds this problem by introducing type names local to the
509	// scope of a declaration (for instance, those introduced through "forall" qualifiers), and by introducing "type
510	// generators" -- parameterized types. This latter type name creates a third class of identifiers, "TYPEGENname", which
511	// must be distinguished by the lexical scanner.
512	//
513	// Since the scanner cannot distinguish among the different classes of identifiers without some context information,
514	// there is a type table (typedefTable), which holds type names and identifiers that override type names, for each named
515	// scope. During parsing, semantic actions update the type table by adding new identifiers in the current scope. For
516	// each context that introduces a name scope, a new level is created in the type table and that level is popped on
517	// exiting the scope. Since type names can be local to a particular declaration, each declaration is itself a scope.
518	// This requires distinguishing between type names that are local to the current declaration scope and those that
519	// persist past the end of the declaration (i.e., names defined in "typedef" or "otype" declarations).
520	//
521	// The non-terminals "push" and "pop" denote the opening and closing of named scopes. Every push has a matching pop in
522	// the production rule. There are multiple lists of declarations, where each declaration is a named scope, so pop/push
523	// around the list separator.
524	//
525	// int f( forall(T) T (f1) T , forall( S ) S (f2)( S ) );
526	// push pop push pop
527
528	push:
529	{ typedefTable.enterScope(); }
530	;
531
532	pop:
533	{ typedefTable.leaveScope(); }
534	;
535
536	//*********************** CONSTANTS ******************************
537
538	constant:
539	// ENUMERATIONconstant is not included here; it is treated as a variable with type "enumeration constant".
540	INTEGERconstant { $$ = new ExpressionNode( build_constantInteger( *$1 ) ); }
541	\| FLOATING_DECIMALconstant { $$ = new ExpressionNode( build_constantFloat( *$1 ) ); }
542	\| FLOATING_FRACTIONconstant { $$ = new ExpressionNode( build_constantFloat( *$1 ) ); }
543	\| FLOATINGconstant { $$ = new ExpressionNode( build_constantFloat( *$1 ) ); }
544	\| CHARACTERconstant { $$ = new ExpressionNode( build_constantChar( *$1 ) ); }
545	;
546
547	quasi_keyword: // CFA
548	TIMEOUT
549	\| WOR
550	\| CATCH
551	\| RECOVER
552	\| CATCHRESUME
553	\| FIXUP
554	\| FINALLY
555	;
556
557	identifier:
558	IDENTIFIER
559	\| quasi_keyword
560	;
561
562	identifier_at:
563	identifier
564	\| '@' // CFA
565	{ Token tok = { new string( DeclarationNode::anonymous.newName() ), yylval.tok.loc }; $$ = tok; }
566	;
567
568	string_literal:
569	string_literal_list { $$ = build_constantStr( *$1 ); }
570	;
571
572	string_literal_list: // juxtaposed strings are concatenated
573	STRINGliteral { $$ = $1; } // conversion from tok to str
574	\| string_literal_list STRINGliteral
575	{
576	if ( ! appendStr( $1, $2 ) ) YYERROR; // append 2nd juxtaposed string to 1st
577	delete $2; // allocated by lexer
578	$$ = $1; // conversion from tok to str
579	}
580	;
581
582	//*********************** EXPRESSIONS ******************************
583
584	primary_expression:
585	IDENTIFIER // typedef name cannot be used as a variable name
586	{ $$ = new ExpressionNode( build_varref( $1 ) ); }
587	\| quasi_keyword
588	{ $$ = new ExpressionNode( build_varref( $1 ) ); }
589	\| TYPEDIMname // CFA, generic length argument
590	// { $$ = new ExpressionNode( new TypeExpr( maybeMoveBuildType( DeclarationNode::newFromTypedef( $1 ) ) ) ); }
591	// { $$ = new ExpressionNode( build_varref( $1 ) ); }
592	{ $$ = new ExpressionNode( build_dimensionref( $1 ) ); }
593	\| tuple
594	\| '(' comma_expression ')'
595	{ $$ = $2; }
596	\| '(' compound_statement ')' // GCC, lambda expression
597	{ $$ = new ExpressionNode( new StmtExpr( dynamic_cast<CompoundStmt *>(maybeMoveBuild<Statement>($2) ) ) ); }
598	\| type_name '.' identifier // CFA, nested type
599	{ SemanticError( yylloc, "Qualified name is currently unimplemented." ); $$ = nullptr; }
600	\| type_name '.' '[' field_name_list ']' // CFA, nested type / tuple field selector
601	{ SemanticError( yylloc, "Qualified name is currently unimplemented." ); $$ = nullptr; }
602	\| GENERIC '(' assignment_expression ',' generic_assoc_list ')' // C11
603	{
604	// add the missing control expression to the GenericExpr and return it
605	$5->control = maybeMoveBuild<Expression>( $3 );
606	$$ = new ExpressionNode( $5 );
607	}
608	// \| RESUME '(' comma_expression ')'
609	// { SemanticError( yylloc, "Resume expression is currently unimplemented." ); $$ = nullptr; }
610	// \| RESUME '(' comma_expression ')' compound_statement
611	// { SemanticError( yylloc, "Resume expression is currently unimplemented." ); $$ = nullptr; }
612	\| IDENTIFIER IDENTIFIER // syntax error
613	{
614	SemanticError( yylloc, ::toString( "Adjacent identifiers are not meaningful in an expression. "
615	"Possible problem is identifier \"", *$1.str,
616	"\" is a misspelled typename or an incorrectly specified type name, "
617	"e.g., missing generic parameter or missing struct/union/enum before typename." ) );
618	$$ = nullptr;
619	}
620	\| IDENTIFIER direct_type // syntax error
621	{
622	SemanticError( yylloc, ::toString( "Identifier \"", *$1.str, "\" cannot appear before a type. "
623	"Possible problem is misspelled storage or CV qualifier." ) );
624	$$ = nullptr;
625	}
626	;
627
628	generic_assoc_list: // C11
629	generic_association
630	\| generic_assoc_list ',' generic_association
631	{
632	// steal the association node from the singleton and delete the wrapper
633	$1->associations.splice($1->associations.end(), $3->associations);
634	delete $3;
635	$$ = $1;
636	}
637	;
638
639	generic_association: // C11
640	type_no_function ':' assignment_expression
641	{
642	// create a GenericExpr wrapper with one association pair
643	$$ = new GenericExpr( nullptr, { { maybeMoveBuildType($1), maybeMoveBuild<Expression>( $3 ) } } );
644	}
645	\| DEFAULT ':' assignment_expression
646	{ $$ = new GenericExpr( nullptr, { { maybeMoveBuild<Expression>( $3 ) } } ); }
647	;
648
649	postfix_expression:
650	primary_expression
651	\| postfix_expression '[' assignment_expression ',' tuple_expression_list ']'
652	// Historic, transitional: Disallow commas in subscripts.
653	// Switching to this behaviour may help check if a C compatibilty case uses comma-exprs in subscripts.
654	// Current: Commas in subscripts make tuples.
655	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Index, $1, new ExpressionNode( build_tuple( (ExpressionNode *)($3->set_last( $5 ) ) )) ) ); }
656	\| postfix_expression '[' assignment_expression ']'
657	// CFA, comma_expression disallowed in this context because it results in a common user error: subscripting a
658	// matrix with x[i,j] instead of x[i][j]. While this change is not backwards compatible, there seems to be
659	// little advantage to this feature and many disadvantages. It is possible to write x[(i,j)] in CFA, which is
660	// equivalent to the old x[i,j].
661	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Index, $1, $3 ) ); }
662	\| constant '[' assignment_expression ']' // 3[a], 'a'[a], 3.5[a]
663	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Index, $1, $3 ) ); }
664	\| string_literal '[' assignment_expression ']' // "abc"[3], 3["abc"]
665	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Index, new ExpressionNode( $1 ), $3 ) ); }
666	\| postfix_expression '{' argument_expression_list_opt '}' // CFA, constructor call
667	{
668	Token fn;
669	fn.str = new std::string( "?{}" ); // location undefined - use location of '{'?
670	$$ = new ExpressionNode( new ConstructorExpr( build_func( new ExpressionNode( build_varref( fn ) ), (ExpressionNode *)( $1 )->set_last( $3 ) ) ) );
671	}
672	\| postfix_expression '(' argument_expression_list_opt ')'
673	{ $$ = new ExpressionNode( build_func( $1, $3 ) ); }
674	\| postfix_expression '`' identifier // CFA, postfix call
675	{ $$ = new ExpressionNode( build_func( new ExpressionNode( build_varref( build_postfix_name( $3 ) ) ), $1 ) ); }
676	\| constant '`' identifier // CFA, postfix call
677	{ $$ = new ExpressionNode( build_func( new ExpressionNode( build_varref( build_postfix_name( $3 ) ) ), $1 ) ); }
678	\| string_literal '`' identifier // CFA, postfix call
679	{ $$ = new ExpressionNode( build_func( new ExpressionNode( build_varref( build_postfix_name( $3 ) ) ), new ExpressionNode( $1 ) ) ); }
680	\| postfix_expression '.' identifier
681	{ $$ = new ExpressionNode( build_fieldSel( $1, build_varref( $3 ) ) ); }
682	\| postfix_expression '.' INTEGERconstant // CFA, tuple index
683	{ $$ = new ExpressionNode( build_fieldSel( $1, build_constantInteger( *$3 ) ) ); }
684	\| postfix_expression FLOATING_FRACTIONconstant // CFA, tuple index
685	{ $$ = new ExpressionNode( build_fieldSel( $1, build_field_name_FLOATING_FRACTIONconstant( *$2 ) ) ); }
686	\| postfix_expression '.' '[' field_name_list ']' // CFA, tuple field selector
687	{ $$ = new ExpressionNode( build_fieldSel( $1, build_tuple( $4 ) ) ); }
688	\| postfix_expression '.' aggregate_control
689	{ $$ = new ExpressionNode( build_keyword_cast( $3, $1 ) ); }
690	\| postfix_expression ARROW identifier
691	{ $$ = new ExpressionNode( build_pfieldSel( $1, build_varref( $3 ) ) ); }
692	\| postfix_expression ARROW INTEGERconstant // CFA, tuple index
693	{ $$ = new ExpressionNode( build_pfieldSel( $1, build_constantInteger( *$3 ) ) ); }
694	\| postfix_expression ARROW '[' field_name_list ']' // CFA, tuple field selector
695	{ $$ = new ExpressionNode( build_pfieldSel( $1, build_tuple( $4 ) ) ); }
696	\| postfix_expression ICR
697	{ $$ = new ExpressionNode( build_unary_ptr( OperKinds::IncrPost, $1 ) ); }
698	\| postfix_expression DECR
699	{ $$ = new ExpressionNode( build_unary_ptr( OperKinds::DecrPost, $1 ) ); }
700	\| '(' type_no_function ')' '{' initializer_list_opt comma_opt '}' // C99, compound-literal
701	{ $$ = new ExpressionNode( build_compoundLiteral( $2, new InitializerNode( $5, true ) ) ); }
702	\| '(' type_no_function ')' '@' '{' initializer_list_opt comma_opt '}' // CFA, explicit C compound-literal
703	{ $$ = new ExpressionNode( build_compoundLiteral( $2, (new InitializerNode( $6, true ))->set_maybeConstructed( false ) ) ); }
704	\| '^' primary_expression '{' argument_expression_list_opt '}' // CFA, destructor call
705	{
706	Token fn;
707	fn.str = new string( "^?{}" ); // location undefined
708	$$ = new ExpressionNode( build_func( new ExpressionNode( build_varref( fn ) ), (ExpressionNode *)( $2 )->set_last( $4 ) ) );
709	}
710	;
711
712	argument_expression_list_opt:
713	// empty
714	{ $$ = nullptr; }
715	\| argument_expression_list
716	;
717
718	argument_expression_list:
719	argument_expression
720	\| argument_expression_list_opt ',' argument_expression
721	{ $$ = (ExpressionNode *)($1->set_last( $3 )); }
722	;
723
724	argument_expression:
725	'@' // CFA, default parameter
726	{ SemanticError( yylloc, "Default parameter for argument is currently unimplemented." ); $$ = nullptr; }
727	// { $$ = new ExpressionNode( build_constantInteger( *new string( "2" ) ) ); }
728	\| assignment_expression
729	;
730
731	field_name_list: // CFA, tuple field selector
732	field
733	\| field_name_list ',' field { $$ = (ExpressionNode *)($1->set_last( $3 )); }
734	;
735
736	field: // CFA, tuple field selector
737	field_name
738	\| FLOATING_DECIMALconstant field
739	{ $$ = new ExpressionNode( build_fieldSel( new ExpressionNode( build_field_name_FLOATING_DECIMALconstant( *$1 ) ), maybeMoveBuild<Expression>( $2 ) ) ); }
740	\| FLOATING_DECIMALconstant '[' field_name_list ']'
741	{ $$ = new ExpressionNode( build_fieldSel( new ExpressionNode( build_field_name_FLOATING_DECIMALconstant( *$1 ) ), build_tuple( $3 ) ) ); }
742	\| field_name '.' field
743	{ $$ = new ExpressionNode( build_fieldSel( $1, maybeMoveBuild<Expression>( $3 ) ) ); }
744	\| field_name '.' '[' field_name_list ']'
745	{ $$ = new ExpressionNode( build_fieldSel( $1, build_tuple( $4 ) ) ); }
746	\| field_name ARROW field
747	{ $$ = new ExpressionNode( build_pfieldSel( $1, maybeMoveBuild<Expression>( $3 ) ) ); }
748	\| field_name ARROW '[' field_name_list ']'
749	{ $$ = new ExpressionNode( build_pfieldSel( $1, build_tuple( $4 ) ) ); }
750	;
751
752	field_name:
753	INTEGERconstant fraction_constants_opt
754	{ $$ = new ExpressionNode( build_field_name_fraction_constants( build_constantInteger( *$1 ), $2 ) ); }
755	\| FLOATINGconstant fraction_constants_opt
756	{ $$ = new ExpressionNode( build_field_name_fraction_constants( build_field_name_FLOATINGconstant( *$1 ), $2 ) ); }
757	\| identifier_at fraction_constants_opt // CFA, allow anonymous fields
758	{
759	$$ = new ExpressionNode( build_field_name_fraction_constants( build_varref( $1 ), $2 ) );
760	}
761	;
762
763	fraction_constants_opt:
764	// empty
765	{ $$ = nullptr; }
766	\| fraction_constants_opt FLOATING_FRACTIONconstant
767	{
768	Expression * constant = build_field_name_FLOATING_FRACTIONconstant( *$2 );
769	$$ = $1 != nullptr ? new ExpressionNode( build_fieldSel( $1, constant ) ) : new ExpressionNode( constant );
770	}
771	;
772
773	unary_expression:
774	postfix_expression
775	// first location where constant/string can have operator applied: sizeof 3/sizeof "abc" still requires
776	// semantics checks, e.g., ++3, 3--, *3, &&3
777	\| constant
778	\| string_literal
779	{ $$ = new ExpressionNode( $1 ); }
780	\| EXTENSION cast_expression // GCC
781	{ $$ = $2->set_extension( true ); }
782	// '*' ('&') is separated from unary_operator because of shift/reduce conflict in:
783	// { * X; } // dereference X
784	// { * int X; } // CFA declaration of pointer to int
785	\| ptrref_operator cast_expression // CFA
786	{
787	switch ( $1 ) {
788	case OperKinds::AddressOf:
789	$$ = new ExpressionNode( new AddressExpr( maybeMoveBuild<Expression>( $2 ) ) );
790	break;
791	case OperKinds::PointTo:
792	$$ = new ExpressionNode( build_unary_val( $1, $2 ) );
793	break;
794	case OperKinds::And:
795	$$ = new ExpressionNode( new AddressExpr( new AddressExpr( maybeMoveBuild<Expression>( $2 ) ) ) );
796	break;
797	default:
798	assert( false );
799	}
800	}
801	\| unary_operator cast_expression
802	{ $$ = new ExpressionNode( build_unary_val( $1, $2 ) ); }
803	\| ICR unary_expression
804	{ $$ = new ExpressionNode( build_unary_ptr( OperKinds::Incr, $2 ) ); }
805	\| DECR unary_expression
806	{ $$ = new ExpressionNode( build_unary_ptr( OperKinds::Decr, $2 ) ); }
807	\| SIZEOF unary_expression
808	{ $$ = new ExpressionNode( new SizeofExpr( maybeMoveBuild<Expression>( $2 ) ) ); }
809	\| SIZEOF '(' type_no_function ')'
810	{ $$ = new ExpressionNode( new SizeofExpr( maybeMoveBuildType( $3 ) ) ); }
811	\| ALIGNOF unary_expression // GCC, variable alignment
812	{ $$ = new ExpressionNode( new AlignofExpr( maybeMoveBuild<Expression>( $2 ) ) ); }
813	\| ALIGNOF '(' type_no_function ')' // GCC, type alignment
814	{ $$ = new ExpressionNode( new AlignofExpr( maybeMoveBuildType( $3 ) ) ); }
815	\| OFFSETOF '(' type_no_function ',' identifier ')'
816	{ $$ = new ExpressionNode( build_offsetOf( $3, build_varref( $5 ) ) ); }
817	\| TYPEID '(' type_no_function ')'
818	{
819	SemanticError( yylloc, "typeid name is currently unimplemented." ); $$ = nullptr;
820	// $$ = new ExpressionNode( build_offsetOf( $3, build_varref( $5 ) ) );
821	}
822	;
823
824	ptrref_operator:
825	'*' { $$ = OperKinds::PointTo; }
826	\| '&' { $$ = OperKinds::AddressOf; }
827	// GCC, address of label must be handled by semantic check for ref,ref,label
828	\| ANDAND { $$ = OperKinds::And; }
829	;
830
831	unary_operator:
832	'+' { $$ = OperKinds::UnPlus; }
833	\| '-' { $$ = OperKinds::UnMinus; }
834	\| '!' { $$ = OperKinds::Neg; }
835	\| '~' { $$ = OperKinds::BitNeg; }
836	;
837
838	cast_expression:
839	unary_expression
840	\| '(' type_no_function ')' cast_expression
841	{ $$ = new ExpressionNode( build_cast( $2, $4 ) ); }
842	\| '(' aggregate_control '&' ')' cast_expression // CFA
843	{ $$ = new ExpressionNode( build_keyword_cast( $2, $5 ) ); }
844	\| '(' aggregate_control '*' ')' cast_expression // CFA
845	{ $$ = new ExpressionNode( build_keyword_cast( $2, $5 ) ); }
846	\| '(' VIRTUAL ')' cast_expression // CFA
847	{ $$ = new ExpressionNode( new VirtualCastExpr( maybeMoveBuild<Expression>( $4 ), maybeMoveBuildType( nullptr ) ) ); }
848	\| '(' VIRTUAL type_no_function ')' cast_expression // CFA
849	{ $$ = new ExpressionNode( new VirtualCastExpr( maybeMoveBuild<Expression>( $5 ), maybeMoveBuildType( $3 ) ) ); }
850	\| '(' RETURN type_no_function ')' cast_expression // CFA
851	{ SemanticError( yylloc, "Return cast is currently unimplemented." ); $$ = nullptr; }
852	\| '(' COERCE type_no_function ')' cast_expression // CFA
853	{ SemanticError( yylloc, "Coerce cast is currently unimplemented." ); $$ = nullptr; }
854	\| '(' qualifier_cast_list ')' cast_expression // CFA
855	{ SemanticError( yylloc, "Qualifier cast is currently unimplemented." ); $$ = nullptr; }
856	// \| '(' type_no_function ')' tuple
857	// { $$ = new ExpressionNode( build_cast( $2, $4 ) ); }
858	;
859
860	qualifier_cast_list:
861	cast_modifier type_qualifier_name
862	\| cast_modifier MUTEX
863	\| qualifier_cast_list cast_modifier type_qualifier_name
864	\| qualifier_cast_list cast_modifier MUTEX
865	;
866
867	cast_modifier:
868	'-'
869	\| '+'
870	;
871
872	exponential_expression:
873	cast_expression
874	\| exponential_expression '\\' cast_expression
875	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Exp, $1, $3 ) ); }
876	;
877
878	multiplicative_expression:
879	exponential_expression
880	\| multiplicative_expression '*' exponential_expression
881	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Mul, $1, $3 ) ); }
882	\| multiplicative_expression '/' exponential_expression
883	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Div, $1, $3 ) ); }
884	\| multiplicative_expression '%' exponential_expression
885	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Mod, $1, $3 ) ); }
886	;
887
888	additive_expression:
889	multiplicative_expression
890	\| additive_expression '+' multiplicative_expression
891	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Plus, $1, $3 ) ); }
892	\| additive_expression '-' multiplicative_expression
893	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Minus, $1, $3 ) ); }
894	;
895
896	shift_expression:
897	additive_expression
898	\| shift_expression LS additive_expression
899	{ $$ = new ExpressionNode( build_binary_val( OperKinds::LShift, $1, $3 ) ); }
900	\| shift_expression RS additive_expression
901	{ $$ = new ExpressionNode( build_binary_val( OperKinds::RShift, $1, $3 ) ); }
902	;
903
904	relational_expression:
905	shift_expression
906	\| relational_expression '<' shift_expression
907	{ $$ = new ExpressionNode( build_binary_val( OperKinds::LThan, $1, $3 ) ); }
908	\| relational_expression '>' shift_expression
909	{ $$ = new ExpressionNode( build_binary_val( OperKinds::GThan, $1, $3 ) ); }
910	\| relational_expression LE shift_expression
911	{ $$ = new ExpressionNode( build_binary_val( OperKinds::LEThan, $1, $3 ) ); }
912	\| relational_expression GE shift_expression
913	{ $$ = new ExpressionNode( build_binary_val( OperKinds::GEThan, $1, $3 ) ); }
914	;
915
916	equality_expression:
917	relational_expression
918	\| equality_expression EQ relational_expression
919	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Eq, $1, $3 ) ); }
920	\| equality_expression NE relational_expression
921	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Neq, $1, $3 ) ); }
922	;
923
924	AND_expression:
925	equality_expression
926	\| AND_expression '&' equality_expression
927	{ $$ = new ExpressionNode( build_binary_val( OperKinds::BitAnd, $1, $3 ) ); }
928	;
929
930	exclusive_OR_expression:
931	AND_expression
932	\| exclusive_OR_expression '^' AND_expression
933	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Xor, $1, $3 ) ); }
934	;
935
936	inclusive_OR_expression:
937	exclusive_OR_expression
938	\| inclusive_OR_expression '\|' exclusive_OR_expression
939	{ $$ = new ExpressionNode( build_binary_val( OperKinds::BitOr, $1, $3 ) ); }
940	;
941
942	logical_AND_expression:
943	inclusive_OR_expression
944	\| logical_AND_expression ANDAND inclusive_OR_expression
945	{ $$ = new ExpressionNode( build_and_or( $1, $3, true ) ); }
946	;
947
948	logical_OR_expression:
949	logical_AND_expression
950	\| logical_OR_expression OROR logical_AND_expression
951	{ $$ = new ExpressionNode( build_and_or( $1, $3, false ) ); }
952	;
953
954	conditional_expression:
955	logical_OR_expression
956	\| logical_OR_expression '?' comma_expression ':' conditional_expression
957	{ $$ = new ExpressionNode( build_cond( $1, $3, $5 ) ); }
958	// FIX ME: computes $1 twice
959	\| logical_OR_expression '?' /* empty */ ':' conditional_expression // GCC, omitted first operand
960	{ $$ = new ExpressionNode( build_cond( $1, $1, $4 ) ); }
961	;
962
963	constant_expression:
964	conditional_expression
965	;
966
967	assignment_expression:
968	// CFA, assignment is separated from assignment_operator to ensure no assignment operations for tuples
969	conditional_expression
970	\| unary_expression assignment_operator assignment_expression
971	{
972	// if ( $2 == OperKinds::AtAssn ) {
973	// SemanticError( yylloc, "C @= assignment is currently unimplemented." ); $$ = nullptr;
974	// } else {
975	$$ = new ExpressionNode( build_binary_val( $2, $1, $3 ) );
976	// } // if
977	}
978	\| unary_expression '=' '{' initializer_list_opt comma_opt '}'
979	{ SemanticError( yylloc, "Initializer assignment is currently unimplemented." ); $$ = nullptr; }
980	;
981
982	assignment_expression_opt:
983	// empty
984	{ $$ = nullptr; }
985	\| assignment_expression
986	;
987
988	assignment_operator:
989	simple_assignment_operator
990	\| compound_assignment_operator
991	;
992
993	simple_assignment_operator:
994	'=' { $$ = OperKinds::Assign; }
995	\| ATassign { $$ = OperKinds::AtAssn; } // CFA
996	;
997
998	compound_assignment_operator:
999	EXPassign { $$ = OperKinds::ExpAssn; }
1000	\| MULTassign { $$ = OperKinds::MulAssn; }
1001	\| DIVassign { $$ = OperKinds::DivAssn; }
1002	\| MODassign { $$ = OperKinds::ModAssn; }
1003	\| PLUSassign { $$ = OperKinds::PlusAssn; }
1004	\| MINUSassign { $$ = OperKinds::MinusAssn; }
1005	\| LSassign { $$ = OperKinds::LSAssn; }
1006	\| RSassign { $$ = OperKinds::RSAssn; }
1007	\| ANDassign { $$ = OperKinds::AndAssn; }
1008	\| ERassign { $$ = OperKinds::ERAssn; }
1009	\| ORassign { $$ = OperKinds::OrAssn; }
1010	;
1011
1012	tuple: // CFA, tuple
1013	// CFA, one assignment_expression is factored out of comma_expression to eliminate a shift/reduce conflict with
1014	// comma_expression in cfa_identifier_parameter_array and cfa_abstract_array
1015	// '[' ']'
1016	// { $$ = new ExpressionNode( build_tuple() ); }
1017	// \| '[' push assignment_expression pop ']'
1018	// { $$ = new ExpressionNode( build_tuple( $3 ) ); }
1019	'[' ',' tuple_expression_list ']'
1020	{ $$ = new ExpressionNode( build_tuple( (ExpressionNode *)(new ExpressionNode( nullptr ) )->set_last( $3 ) ) ); }
1021	\| '[' push assignment_expression pop ',' tuple_expression_list ']'
1022	{ $$ = new ExpressionNode( build_tuple( (ExpressionNode *)($3->set_last( $6 ) ) )); }
1023	;
1024
1025	tuple_expression_list:
1026	assignment_expression
1027	\| '@' // CFA
1028	{ SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
1029	\| tuple_expression_list ',' assignment_expression
1030	{ $$ = (ExpressionNode *)($1->set_last( $3 )); }
1031	\| tuple_expression_list ',' '@'
1032	{ SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
1033	;
1034
1035	comma_expression:
1036	assignment_expression
1037	\| comma_expression ',' assignment_expression
1038	{ $$ = new ExpressionNode( new CommaExpr( maybeMoveBuild<Expression>( $1 ), maybeMoveBuild<Expression>( $3 ) ) ); }
1039	;
1040
1041	comma_expression_opt:
1042	// empty
1043	{ $$ = nullptr; }
1044	\| comma_expression
1045	;
1046
1047	//************************* STATEMENTS *****************************
1048
1049	statement:
1050	labeled_statement
1051	\| compound_statement
1052	\| expression_statement
1053	\| selection_statement
1054	\| iteration_statement
1055	\| jump_statement
1056	\| with_statement
1057	\| mutex_statement
1058	\| waitfor_statement
1059	\| exception_statement
1060	\| enable_disable_statement
1061	{ SemanticError( yylloc, "enable/disable statement is currently unimplemented." ); $$ = nullptr; }
1062	\| asm_statement
1063	\| DIRECTIVE
1064	{ $$ = new StatementNode( build_directive( $1 ) ); }
1065	;
1066
1067	labeled_statement:
1068	// labels cannot be identifiers 0 or 1
1069	identifier_or_type_name ':' attribute_list_opt statement
1070	{ $$ = $4->add_label( $1, $3 ); }
1071	\| identifier_or_type_name ':' attribute_list_opt error // syntax error
1072	{
1073	SemanticError( yylloc, ::toString( "Label \"", *$1.str, "\" must be associated with a statement, "
1074	"where a declaration, case, or default is not a statement. "
1075	"Move the label or terminate with a semi-colon." ) );
1076	$$ = nullptr;
1077	}
1078	;
1079
1080	compound_statement:
1081	'{' '}'
1082	{ $$ = new StatementNode( build_compound( (StatementNode *)0 ) ); }
1083	\| '{' push
1084	local_label_declaration_opt // GCC, local labels appear at start of block
1085	statement_decl_list // C99, intermix declarations and statements
1086	pop '}'
1087	{ $$ = new StatementNode( build_compound( $4 ) ); }
1088	;
1089
1090	statement_decl_list: // C99
1091	statement_decl
1092	\| statement_decl_list statement_decl
1093	{ assert( $1 ); $1->set_last( $2 ); $$ = $1; }
1094	;
1095
1096	statement_decl:
1097	declaration // CFA, new & old style declarations
1098	{ $$ = new StatementNode( $1 ); }
1099	\| EXTENSION declaration // GCC
1100	{ distExt( $2 ); $$ = new StatementNode( $2 ); }
1101	\| function_definition
1102	{ $$ = new StatementNode( $1 ); }
1103	\| EXTENSION function_definition // GCC
1104	{ distExt( $2 ); $$ = new StatementNode( $2 ); }
1105	\| statement
1106	;
1107
1108	statement_list_nodecl:
1109	statement
1110	\| statement_list_nodecl statement
1111	{ assert( $1 ); $1->set_last( $2 ); $$ = $1; }
1112	\| statement_list_nodecl error // syntax error
1113	{ SemanticError( yylloc, "Declarations only allowed at the start of the switch body, i.e., after the '{'." ); $$ = nullptr; }
1114	;
1115
1116	expression_statement:
1117	comma_expression_opt ';'
1118	{ $$ = new StatementNode( build_expr( $1 ) ); }
1119	\| MUTEX '(' ')' comma_expression ';'
1120	{ $$ = new StatementNode( build_mutex( nullptr, new StatementNode( build_expr( $4 ) ) ) ); }
1121	;
1122
1123	selection_statement:
1124	// pop causes a S/R conflict without separating the IF statement into a non-terminal even after resolving
1125	// the inherent S/R conflict with THEN/ELSE.
1126	push if_statement pop
1127	{ $$ = $2; }
1128	\| SWITCH '(' comma_expression ')' case_clause
1129	{ $$ = new StatementNode( build_switch( true, $3, $5 ) ); }
1130	\| SWITCH '(' comma_expression ')' '{' push declaration_list_opt switch_clause_list_opt pop '}' // CFA
1131	{
1132	StatementNode *sw = new StatementNode( build_switch( true, $3, $8 ) );
1133	// The semantics of the declaration list is changed to include associated initialization, which is performed
1134	// before the transfer to the appropriate case clause by hoisting the declarations into a compound
1135	// statement around the switch. Statements after the initial declaration list can never be executed, and
1136	// therefore, are removed from the grammar even though C allows it. The change also applies to choose
1137	// statement.
1138	$$ = $7 ? new StatementNode( build_compound( (StatementNode *)((new StatementNode( $7 ))->set_last( sw )) ) ) : sw;
1139	}
1140	\| SWITCH '(' comma_expression ')' '{' error '}' // CFA, syntax error
1141	{ SemanticError( yylloc, "Only declarations can appear before the list of case clauses." ); $$ = nullptr; }
1142	\| CHOOSE '(' comma_expression ')' case_clause // CFA
1143	{ $$ = new StatementNode( build_switch( false, $3, $5 ) ); }
1144	\| CHOOSE '(' comma_expression ')' '{' push declaration_list_opt switch_clause_list_opt pop '}' // CFA
1145	{
1146	StatementNode *sw = new StatementNode( build_switch( false, $3, $8 ) );
1147	$$ = $7 ? new StatementNode( build_compound( (StatementNode *)((new StatementNode( $7 ))->set_last( sw )) ) ) : sw;
1148	}
1149	\| CHOOSE '(' comma_expression ')' '{' error '}' // CFA, syntax error
1150	{ SemanticError( yylloc, "Only declarations can appear before the list of case clauses." ); $$ = nullptr; }
1151	;
1152
1153	if_statement:
1154	IF '(' conditional_declaration ')' statement %prec THEN
1155	// explicitly deal with the shift/reduce conflict on if/else
1156	{ $$ = new StatementNode( build_if( $3, maybe_build_compound( $5 ), nullptr ) ); }
1157	\| IF '(' conditional_declaration ')' statement ELSE statement
1158	{ $$ = new StatementNode( build_if( $3, maybe_build_compound( $5 ), maybe_build_compound( $7 ) ) ); }
1159	;
1160
1161	conditional_declaration:
1162	comma_expression
1163	{ $$ = new CondCtl( nullptr, $1 ); }
1164	\| c_declaration // no semi-colon
1165	{ $$ = new CondCtl( $1, nullptr ); }
1166	\| cfa_declaration // no semi-colon
1167	{ $$ = new CondCtl( $1, nullptr ); }
1168	\| declaration comma_expression // semi-colon separated
1169	{ $$ = new CondCtl( $1, $2 ); }
1170	;
1171
1172	// CASE and DEFAULT clauses are only allowed in the SWITCH statement, precluding Duff's device. In addition, a case
1173	// clause allows a list of values and subranges.
1174
1175	case_value: // CFA
1176	constant_expression { $$ = $1; }
1177	\| constant_expression ELLIPSIS constant_expression // GCC, subrange
1178	{ $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild<Expression>( $1 ), maybeMoveBuild<Expression>( $3 ) ) ); }
1179	\| subrange // CFA, subrange
1180	;
1181
1182	case_value_list: // CFA
1183	case_value { $$ = new StatementNode( build_case( $1 ) ); }
1184	// convert case list, e.g., "case 1, 3, 5:" into "case 1: case 3: case 5"
1185	\| case_value_list ',' case_value { $$ = (StatementNode *)($1->set_last( new StatementNode( build_case( $3 ) ) ) ); }
1186	;
1187
1188	case_label: // CFA
1189	CASE error // syntax error
1190	{ SemanticError( yylloc, "Missing case list after case." ); $$ = nullptr; }
1191	\| CASE case_value_list ':' { $$ = $2; }
1192	\| CASE case_value_list error // syntax error
1193	{ SemanticError( yylloc, "Missing colon after case list." ); $$ = nullptr; }
1194	\| DEFAULT ':' { $$ = new StatementNode( build_default() ); }
1195	// A semantic check is required to ensure only one default clause per switch/choose statement.
1196	\| DEFAULT error // syntax error
1197	{ SemanticError( yylloc, "Missing colon after default." ); $$ = nullptr; }
1198	;
1199
1200	case_label_list: // CFA
1201	case_label
1202	\| case_label_list case_label { $$ = (StatementNode *)( $1->set_last( $2 )); }
1203	;
1204
1205	case_clause: // CFA
1206	case_label_list statement { $$ = $1->append_last_case( maybe_build_compound( $2 ) ); }
1207	;
1208
1209	switch_clause_list_opt: // CFA
1210	// empty
1211	{ $$ = nullptr; }
1212	\| switch_clause_list
1213	;
1214
1215	switch_clause_list: // CFA
1216	case_label_list statement_list_nodecl
1217	{ $$ = $1->append_last_case( new StatementNode( build_compound( $2 ) ) ); }
1218	\| switch_clause_list case_label_list statement_list_nodecl
1219	{ $$ = (StatementNode *)( $1->set_last( $2->append_last_case( new StatementNode( build_compound( $3 ) ) ) ) ); }
1220	;
1221
1222	iteration_statement:
1223	WHILE '(' ')' statement %prec THEN // CFA => while ( 1 )
1224	{ $$ = new StatementNode( build_while( new CondCtl( nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ), maybe_build_compound( $4 ) ) ); }
1225	\| WHILE '(' ')' statement ELSE statement // CFA
1226	{
1227	$$ = new StatementNode( build_while( new CondCtl( nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ), maybe_build_compound( $4 ) ) );
1228	SemanticWarning( yylloc, Warning::SuperfluousElse );
1229	}
1230	\| WHILE '(' conditional_declaration ')' statement %prec THEN
1231	{ $$ = new StatementNode( build_while( $3, maybe_build_compound( $5 ) ) ); }
1232	\| WHILE '(' conditional_declaration ')' statement ELSE statement // CFA
1233	{ $$ = new StatementNode( build_while( $3, maybe_build_compound( $5 ), $7 ) ); }
1234	\| DO statement WHILE '(' ')' ';' // CFA => do while( 1 )
1235	{ $$ = new StatementNode( build_do_while( new ExpressionNode( build_constantInteger( *new string( "1" ) ) ), maybe_build_compound( $2 ) ) ); }
1236	\| DO statement WHILE '(' ')' ELSE statement // CFA
1237	{
1238	$$ = new StatementNode( build_do_while( new ExpressionNode( build_constantInteger( *new string( "1" ) ) ), maybe_build_compound( $2 ) ) );
1239	SemanticWarning( yylloc, Warning::SuperfluousElse );
1240	}
1241	\| DO statement WHILE '(' comma_expression ')' ';'
1242	{ $$ = new StatementNode( build_do_while( $5, maybe_build_compound( $2 ) ) ); }
1243	\| DO statement WHILE '(' comma_expression ')' ELSE statement // CFA
1244	{ $$ = new StatementNode( build_do_while( $5, maybe_build_compound( $2 ), $8 ) ); }
1245	\| FOR '(' ')' statement %prec THEN // CFA => for ( ;; )
1246	{ $$ = new StatementNode( build_for( new ForCtrl( (ExpressionNode * )nullptr, (ExpressionNode * )nullptr, (ExpressionNode * )nullptr ), maybe_build_compound( $4 ) ) ); }
1247	\| FOR '(' ')' statement ELSE statement // CFA
1248	{
1249	$$ = new StatementNode( build_for( new ForCtrl( (ExpressionNode * )nullptr, (ExpressionNode * )nullptr, (ExpressionNode * )nullptr ), maybe_build_compound( $4 ) ) );
1250	SemanticWarning( yylloc, Warning::SuperfluousElse );
1251	}
1252	\| FOR '(' for_control_expression_list ')' statement %prec THEN
1253	{ $$ = new StatementNode( build_for( $3, maybe_build_compound( $5 ) ) ); }
1254	\| FOR '(' for_control_expression_list ')' statement ELSE statement // CFA
1255	{ $$ = new StatementNode( build_for( $3, maybe_build_compound( $5 ), $7 ) ); }
1256	;
1257
1258	for_control_expression_list:
1259	for_control_expression
1260	\| for_control_expression_list ':' for_control_expression
1261	// ForCtrl + ForCtrl:
1262	// init + init => multiple declaration statements that are hoisted
1263	// condition + condition => (expression) && (expression)
1264	// change + change => (expression), (expression)
1265	{
1266	$1->init->set_last( $3->init );
1267	if ( $1->condition ) {
1268	if ( $3->condition ) {
1269	$1->condition->expr.reset( new LogicalExpr( $1->condition->expr.release(), $3->condition->expr.release(), true ) );
1270	} // if
1271	} else $1->condition = $3->condition;
1272	if ( $1->change ) {
1273	if ( $3->change ) {
1274	$1->change->expr.reset( new CommaExpr( $1->change->expr.release(), $3->change->expr.release() ) );
1275	} // if
1276	} else $1->change = $3->change;
1277	$$ = $1;
1278	}
1279	;
1280
1281	for_control_expression:
1282	';' comma_expression_opt ';' comma_expression_opt
1283	{ $$ = new ForCtrl( (ExpressionNode * )nullptr, $2, $4 ); }
1284	\| comma_expression ';' comma_expression_opt ';' comma_expression_opt
1285	{ $$ = new ForCtrl( $1, $3, $5 ); }
1286	\| declaration comma_expression_opt ';' comma_expression_opt // C99, declaration has ';'
1287	{ $$ = new ForCtrl( $1, $2, $4 ); }
1288
1289	\| comma_expression // CFA
1290	{ $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1291	OperKinds::LThan, $1->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1292	\| '=' comma_expression // CFA
1293	{ $$ = forCtrl( $2, new string( DeclarationNode::anonymous.newName() ), new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1294	OperKinds::LEThan, $2->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1295	\| comma_expression inclexcl comma_expression // CFA
1296	{ $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), $1->clone(), $2, $3, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1297	\| comma_expression inclexcl comma_expression '~' comma_expression // CFA
1298	{ $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), $1->clone(), $2, $3, $5 ); }
1299	\| comma_expression ';' // CFA
1300	{ $$ = forCtrl( new ExpressionNode( build_constantInteger( *new string( "0u" ) ) ), $1, nullptr, OperKinds::LThan, nullptr, nullptr ); }
1301	\| comma_expression ';' comma_expression // CFA
1302	{ $$ = forCtrl( $3, $1, new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1303	OperKinds::LThan, $3->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1304	\| comma_expression ';' '=' comma_expression // CFA
1305	{ $$ = forCtrl( $4, $1, new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1306	OperKinds::LEThan, $4->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1307	\| comma_expression ';' comma_expression inclexcl comma_expression // CFA
1308	{ $$ = forCtrl( $3, $1, $3->clone(), $4, $5, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1309	\| comma_expression ';' comma_expression inclexcl comma_expression '~' comma_expression // CFA
1310	{ $$ = forCtrl( $3, $1, $3->clone(), $4, $5, $7 ); }
1311
1312	\| comma_expression ';' TYPEDEFname // CFA, array type
1313	{
1314	SemanticError( yylloc, "Array interator is currently unimplemented." ); $$ = nullptr;
1315	$$ = forCtrl( new ExpressionNode( build_varref( $3 ) ), $1, nullptr, OperKinds::Range, nullptr, nullptr );
1316	}
1317
1318	// There is a S/R conflicit if ~ and -~ are factored out.
1319	\| comma_expression ';' comma_expression '~' '@' // CFA
1320	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::LThan, nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1321	\| comma_expression ';' comma_expression ErangeDown '@' // CFA
1322	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::GThan, nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1323	\| comma_expression ';' comma_expression '~' '@' '~' comma_expression // CFA
1324	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::LThan, nullptr, $7 ); }
1325	\| comma_expression ';' comma_expression ErangeDown '@' '~' comma_expression // CFA
1326	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::GThan, nullptr, $7 ); }
1327	\| comma_expression ';' comma_expression '~' '@' '~' '@' // CFA
1328	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::LThan, nullptr, nullptr ); }
1329	;
1330
1331	inclexcl:
1332	'~'
1333	{ $$ = OperKinds::LThan; }
1334	\| ErangeUpEq
1335	{ $$ = OperKinds::LEThan; }
1336	\| ErangeDown
1337	{ $$ = OperKinds::GThan; }
1338	\| ErangeDownEq
1339	{ $$ = OperKinds::GEThan; }
1340	;
1341
1342	jump_statement:
1343	GOTO identifier_or_type_name ';'
1344	{ $$ = new StatementNode( build_branch( $2, BranchStmt::Goto ) ); }
1345	\| GOTO '*' comma_expression ';' // GCC, computed goto
1346	// The syntax for the GCC computed goto violates normal expression precedence, e.g., goto i+3; => goto (i+3);
1347	// whereas normal operator precedence yields goto (*i)+3;
1348	{ $$ = new StatementNode( build_computedgoto( $3 ) ); }
1349	// A semantic check is required to ensure fallthru appears only in the body of a choose statement.
1350	\| fall_through_name ';' // CFA
1351	{ $$ = new StatementNode( build_branch( BranchStmt::FallThrough ) ); }
1352	\| fall_through_name identifier_or_type_name ';' // CFA
1353	{ $$ = new StatementNode( build_branch( $2, BranchStmt::FallThrough ) ); }
1354	\| fall_through_name DEFAULT ';' // CFA
1355	{ $$ = new StatementNode( build_branch( BranchStmt::FallThroughDefault ) ); }
1356	\| CONTINUE ';'
1357	// A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1358	{ $$ = new StatementNode( build_branch( BranchStmt::Continue ) ); }
1359	\| CONTINUE identifier_or_type_name ';' // CFA, multi-level continue
1360	// A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1361	// the target of the transfer appears only at the start of an iteration statement.
1362	{ $$ = new StatementNode( build_branch( $2, BranchStmt::Continue ) ); }
1363	\| BREAK ';'
1364	// A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1365	{ $$ = new StatementNode( build_branch( BranchStmt::Break ) ); }
1366	\| BREAK identifier_or_type_name ';' // CFA, multi-level exit
1367	// A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1368	// the target of the transfer appears only at the start of an iteration statement.
1369	{ $$ = new StatementNode( build_branch( $2, BranchStmt::Break ) ); }
1370	\| RETURN comma_expression_opt ';'
1371	{ $$ = new StatementNode( build_return( $2 ) ); }
1372	\| RETURN '{' initializer_list_opt comma_opt '}' ';'
1373	{ SemanticError( yylloc, "Initializer return is currently unimplemented." ); $$ = nullptr; }
1374	\| SUSPEND ';'
1375	{ $$ = new StatementNode( build_suspend( nullptr ) ); }
1376	\| SUSPEND compound_statement
1377	{ $$ = new StatementNode( build_suspend( $2 ) ); }
1378	\| SUSPEND COROUTINE ';'
1379	{ $$ = new StatementNode( build_suspend( nullptr, SuspendStmt::Coroutine ) ); }
1380	\| SUSPEND COROUTINE compound_statement
1381	{ $$ = new StatementNode( build_suspend( $3, SuspendStmt::Coroutine ) ); }
1382	\| SUSPEND GENERATOR ';'
1383	{ $$ = new StatementNode( build_suspend( nullptr, SuspendStmt::Generator ) ); }
1384	\| SUSPEND GENERATOR compound_statement
1385	{ $$ = new StatementNode( build_suspend( $3, SuspendStmt::Generator ) ); }
1386	\| THROW assignment_expression_opt ';' // handles rethrow
1387	{ $$ = new StatementNode( build_throw( $2 ) ); }
1388	\| THROWRESUME assignment_expression_opt ';' // handles reresume
1389	{ $$ = new StatementNode( build_resume( $2 ) ); }
1390	\| THROWRESUME assignment_expression_opt AT assignment_expression ';' // handles reresume
1391	{ $$ = new StatementNode( build_resume_at( $2, $4 ) ); }
1392	;
1393
1394	fall_through_name: // CFA
1395	FALLTHRU
1396	\| FALLTHROUGH
1397	;
1398
1399	with_statement:
1400	WITH '(' tuple_expression_list ')' statement
1401	{ $$ = new StatementNode( build_with( $3, $5 ) ); }
1402	;
1403
1404	// If MUTEX becomes a general qualifier, there are shift/reduce conflicts, so change syntax to "with mutex".
1405	mutex_statement:
1406	MUTEX '(' argument_expression_list ')' statement
1407	{ $$ = new StatementNode( build_mutex( $3, $5 ) ); }
1408	;
1409
1410	when_clause:
1411	WHEN '(' comma_expression ')' { $$ = $3; }
1412	;
1413
1414	when_clause_opt:
1415	// empty
1416	{ $$ = nullptr; }
1417	\| when_clause
1418	;
1419
1420	waitfor:
1421	WAITFOR '(' cast_expression ')'
1422	{ $$ = $3; }
1423	// \| WAITFOR '(' cast_expression ',' argument_expression_list_opt ')'
1424	// { $$ = (ExpressionNode *)$3->set_last( $5 ); }
1425	\| WAITFOR '(' cast_expression_list ':' argument_expression_list_opt ')'
1426	{ $$ = (ExpressionNode *)($3->set_last( $5 )); }
1427	;
1428
1429	cast_expression_list:
1430	cast_expression
1431	\| cast_expression_list ',' cast_expression
1432	// { $$ = (ExpressionNode *)($1->set_last( $3 )); }
1433	{ SemanticError( yylloc, "List of mutex member is currently unimplemented." ); $$ = nullptr; }
1434	;
1435
1436	timeout:
1437	TIMEOUT '(' comma_expression ')' { $$ = $3; }
1438	;
1439
1440	waitfor_clause:
1441	when_clause_opt waitfor statement %prec THEN
1442	{ $$ = build_waitfor( $2, maybe_build_compound( $3 ), $1 ); }
1443	\| when_clause_opt waitfor statement WOR waitfor_clause
1444	{ $$ = build_waitfor( $2, maybe_build_compound( $3 ), $1, $5 ); }
1445	\| when_clause_opt timeout statement %prec THEN
1446	{ $$ = build_waitfor_timeout( $2, maybe_build_compound( $3 ), $1 ); }
1447	\| when_clause_opt ELSE statement
1448	{ $$ = build_waitfor_timeout( nullptr, maybe_build_compound( $3 ), $1 ); }
1449	// "else" must be conditional after timeout or timeout is never triggered (i.e., it is meaningless)
1450	\| when_clause_opt timeout statement WOR ELSE statement // syntax error
1451	{ SemanticError( yylloc, "else clause must be conditional after timeout or timeout never triggered." ); $$ = nullptr; }
1452	\| when_clause_opt timeout statement WOR when_clause ELSE statement
1453	{ $$ = build_waitfor_timeout( $2, maybe_build_compound( $3 ), $1, maybe_build_compound( $7 ), $5 ); }
1454	;
1455
1456	waitfor_statement:
1457	when_clause_opt waitfor statement %prec THEN
1458	{ $$ = new StatementNode( build_waitfor( $2, $3, $1 ) ); }
1459	\| when_clause_opt waitfor statement WOR waitfor_clause
1460	{ $$ = new StatementNode( build_waitfor( $2, $3, $1, $5 ) ); }
1461	;
1462
1463	exception_statement:
1464	TRY compound_statement handler_clause %prec THEN
1465	{ $$ = new StatementNode( build_try( $2, $3, 0 ) ); }
1466	\| TRY compound_statement finally_clause
1467	{ $$ = new StatementNode( build_try( $2, 0, $3 ) ); }
1468	\| TRY compound_statement handler_clause finally_clause
1469	{ $$ = new StatementNode( build_try( $2, $3, $4 ) ); }
1470	;
1471
1472	handler_clause:
1473	handler_key '(' push exception_declaration pop handler_predicate_opt ')' compound_statement
1474	{ $$ = new StatementNode( build_catch( $1, $4, $6, $8 ) ); }
1475	\| handler_clause handler_key '(' push exception_declaration pop handler_predicate_opt ')' compound_statement
1476	{ $$ = (StatementNode *)$1->set_last( new StatementNode( build_catch( $2, $5, $7, $9 ) ) ); }
1477	;
1478
1479	handler_predicate_opt:
1480	// empty
1481	{ $$ = nullptr; }
1482	\| ';' conditional_expression { $$ = $2; }
1483	;
1484
1485	handler_key:
1486	CATCH { $$ = CatchStmt::Terminate; }
1487	\| RECOVER { $$ = CatchStmt::Terminate; }
1488	\| CATCHRESUME { $$ = CatchStmt::Resume; }
1489	\| FIXUP { $$ = CatchStmt::Resume; }
1490	;
1491
1492	finally_clause:
1493	FINALLY compound_statement { $$ = new StatementNode( build_finally( $2 ) ); }
1494	;
1495
1496	exception_declaration:
1497	// No SUE declaration in parameter list.
1498	type_specifier_nobody
1499	\| type_specifier_nobody declarator
1500	{ $$ = $2->addType( $1 ); }
1501	\| type_specifier_nobody variable_abstract_declarator
1502	{ $$ = $2->addType( $1 ); }
1503	\| cfa_abstract_declarator_tuple identifier // CFA
1504	{ $$ = $1->addName( $2 ); }
1505	\| cfa_abstract_declarator_tuple // CFA
1506	;
1507
1508	enable_disable_statement:
1509	enable_disable_key identifier_list compound_statement
1510	;
1511
1512	enable_disable_key:
1513	ENABLE
1514	\| DISABLE
1515	;
1516
1517	asm_statement:
1518	ASM asm_volatile_opt '(' string_literal ')' ';'
1519	{ $$ = new StatementNode( build_asm( $2, $4, 0 ) ); }
1520	\| ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ')' ';' // remaining GCC
1521	{ $$ = new StatementNode( build_asm( $2, $4, $6 ) ); }
1522	\| ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ')' ';'
1523	{ $$ = new StatementNode( build_asm( $2, $4, $6, $8 ) ); }
1524	\| ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ':' asm_clobbers_list_opt ')' ';'
1525	{ $$ = new StatementNode( build_asm( $2, $4, $6, $8, $10 ) ); }
1526	\| ASM asm_volatile_opt GOTO '(' string_literal ':' ':' asm_operands_opt ':' asm_clobbers_list_opt ':' label_list ')' ';'
1527	{ $$ = new StatementNode( build_asm( $2, $5, 0, $8, $10, $12 ) ); }
1528	;
1529
1530	asm_volatile_opt: // GCC
1531	// empty
1532	{ $$ = false; }
1533	\| VOLATILE
1534	{ $$ = true; }
1535	;
1536
1537	asm_operands_opt: // GCC
1538	// empty
1539	{ $$ = nullptr; } // use default argument
1540	\| asm_operands_list
1541	;
1542
1543	asm_operands_list: // GCC
1544	asm_operand
1545	\| asm_operands_list ',' asm_operand
1546	{ $$ = (ExpressionNode *)($1->set_last( $3 )); }
1547	;
1548
1549	asm_operand: // GCC
1550	string_literal '(' constant_expression ')'
1551	{ $$ = new ExpressionNode( new AsmExpr( nullptr, $1, maybeMoveBuild<Expression>( $3 ) ) ); }
1552	\| '[' IDENTIFIER ']' string_literal '(' constant_expression ')'
1553	{ $$ = new ExpressionNode( new AsmExpr( $2, $4, maybeMoveBuild<Expression>( $6 ) ) ); }
1554	;
1555
1556	asm_clobbers_list_opt: // GCC
1557	// empty
1558	{ $$ = nullptr; } // use default argument
1559	\| string_literal
1560	{ $$ = new ExpressionNode( $1 ); }
1561	\| asm_clobbers_list_opt ',' string_literal
1562	{ $$ = (ExpressionNode *)($1->set_last( new ExpressionNode( $3 ) )); }
1563	;
1564
1565	label_list:
1566	identifier
1567	{
1568	$$ = new LabelNode(); $$->labels.push_back( *$1 );
1569	delete $1; // allocated by lexer
1570	}
1571	\| label_list ',' identifier
1572	{
1573	$$ = $1; $1->labels.push_back( *$3 );
1574	delete $3; // allocated by lexer
1575	}
1576	;
1577
1578	//***************************** DECLARATIONS *******************************
1579
1580	declaration_list_opt: // used at beginning of switch statement
1581	// empty
1582	{ $$ = nullptr; }
1583	\| declaration_list
1584	;
1585
1586	declaration_list:
1587	declaration
1588	\| declaration_list declaration
1589	{ $$ = $1->appendList( $2 ); }
1590	;
1591
1592	KR_parameter_list_opt: // used to declare parameter types in K&R style functions
1593	// empty
1594	{ $$ = nullptr; }
1595	\| KR_parameter_list
1596	;
1597
1598	KR_parameter_list:
1599	push c_declaration pop ';'
1600	{ $$ = $2; }
1601	\| KR_parameter_list push c_declaration pop ';'
1602	{ $$ = $1->appendList( $3 ); }
1603	;
1604
1605	local_label_declaration_opt: // GCC, local label
1606	// empty
1607	\| local_label_declaration_list
1608	;
1609
1610	local_label_declaration_list: // GCC, local label
1611	LABEL local_label_list ';'
1612	\| local_label_declaration_list LABEL local_label_list ';'
1613	;
1614
1615	local_label_list: // GCC, local label
1616	identifier_or_type_name
1617	\| local_label_list ',' identifier_or_type_name
1618	;
1619
1620	declaration: // old & new style declarations
1621	c_declaration ';'
1622	\| cfa_declaration ';' // CFA
1623	\| static_assert // C11
1624	;
1625
1626	static_assert:
1627	STATICASSERT '(' constant_expression ',' string_literal ')' ';' // C11
1628	{ $$ = DeclarationNode::newStaticAssert( $3, $5 ); }
1629	\| STATICASSERT '(' constant_expression ')' ';' // CFA
1630	{ $$ = DeclarationNode::newStaticAssert( $3, build_constantStr( *new string( "\"\"" ) ) ); }
1631
1632	// C declaration syntax is notoriously confusing and error prone. Cforall provides its own type, variable and function
1633	// declarations. CFA declarations use the same declaration tokens as in C; however, CFA places declaration modifiers to
1634	// the left of the base type, while C declarations place modifiers to the right of the base type. CFA declaration
1635	// modifiers are interpreted from left to right and the entire type specification is distributed across all variables in
1636	// the declaration list (as in Pascal). ANSI C and the new CFA declarations may appear together in the same program
1637	// block, but cannot be mixed within a specific declaration.
1638	//
1639	// CFA C
1640	// [10] int x; int x[10]; // array of 10 integers
1641	// [10] * char y; char *y[10]; // array of 10 pointers to char
1642
1643	cfa_declaration: // CFA
1644	cfa_variable_declaration
1645	\| cfa_typedef_declaration
1646	\| cfa_function_declaration
1647	\| type_declaring_list
1648	{ SemanticError( yylloc, "otype declaration is currently unimplemented." ); $$ = nullptr; }
1649	\| trait_specifier
1650	;
1651
1652	cfa_variable_declaration: // CFA
1653	cfa_variable_specifier initializer_opt
1654	{ $$ = $1->addInitializer( $2 ); }
1655	\| declaration_qualifier_list cfa_variable_specifier initializer_opt
1656	// declaration_qualifier_list also includes type_qualifier_list, so a semantic check is necessary to preclude
1657	// them as a type_qualifier cannot appear in that context.
1658	{ $$ = $2->addQualifiers( $1 )->addInitializer( $3 ); }
1659	\| cfa_variable_declaration pop ',' push identifier_or_type_name initializer_opt
1660	{ $$ = $1->appendList( $1->cloneType( $5 )->addInitializer( $6 ) ); }
1661	;
1662
1663	cfa_variable_specifier: // CFA
1664	// A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1665	// storage-class
1666	cfa_abstract_declarator_no_tuple identifier_or_type_name asm_name_opt
1667	{ $$ = $1->addName( $2 )->addAsmName( $3 ); }
1668	\| cfa_abstract_tuple identifier_or_type_name asm_name_opt
1669	{ $$ = $1->addName( $2 )->addAsmName( $3 ); }
1670	\| type_qualifier_list cfa_abstract_tuple identifier_or_type_name asm_name_opt
1671	{ $$ = $2->addQualifiers( $1 )->addName( $3 )->addAsmName( $4 ); }
1672	;
1673
1674	cfa_function_declaration: // CFA
1675	cfa_function_specifier
1676	\| type_qualifier_list cfa_function_specifier
1677	{ $$ = $2->addQualifiers( $1 ); }
1678	\| declaration_qualifier_list cfa_function_specifier
1679	{ $$ = $2->addQualifiers( $1 ); }
1680	\| declaration_qualifier_list type_qualifier_list cfa_function_specifier
1681	{ $$ = $3->addQualifiers( $1 )->addQualifiers( $2 ); }
1682	\| cfa_function_declaration ',' identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')'
1683	{
1684	// Append the return type at the start (left-hand-side) to each identifier in the list.
1685	DeclarationNode * ret = new DeclarationNode;
1686	ret->type = maybeClone( $1->type->base );
1687	$$ = $1->appendList( DeclarationNode::newFunction( $3, ret, $6, nullptr ) );
1688	}
1689	;
1690
1691	cfa_function_specifier: // CFA
1692	// '[' ']' identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' // S/R conflict
1693	// {
1694	// $$ = DeclarationNode::newFunction( $3, DeclarationNode::newTuple( 0 ), $6, 0, true );
1695	// }
1696	// '[' ']' identifier '(' push cfa_parameter_ellipsis_list_opt pop ')'
1697	// {
1698	// typedefTable.setNextIdentifier( *$5 );
1699	// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1700	// }
1701	// \| '[' ']' TYPEDEFname '(' push cfa_parameter_ellipsis_list_opt pop ')'
1702	// {
1703	// typedefTable.setNextIdentifier( *$5 );
1704	// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1705	// }
1706	// \| '[' ']' typegen_name
1707	// identifier_or_type_name must be broken apart because of the sequence:
1708	//
1709	// '[' ']' identifier_or_type_name '(' cfa_parameter_ellipsis_list_opt ')'
1710	// '[' ']' type_specifier
1711	//
1712	// type_specifier can resolve to just TYPEDEFname (e.g., typedef int T; int f( T );). Therefore this must be
1713	// flattened to allow lookahead to the '(' without having to reduce identifier_or_type_name.
1714	cfa_abstract_tuple identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' attribute_list_opt
1715	// To obtain LR(1 ), this rule must be factored out from function return type (see cfa_abstract_declarator).
1716	{ $$ = DeclarationNode::newFunction( $2, $1, $5, 0 )->addQualifiers( $8 ); }
1717	\| cfa_function_return identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' attribute_list_opt
1718	{ $$ = DeclarationNode::newFunction( $2, $1, $5, 0 )->addQualifiers( $8 ); }
1719	;
1720
1721	cfa_function_return: // CFA
1722	'[' push cfa_parameter_list pop ']'
1723	{ $$ = DeclarationNode::newTuple( $3 ); }
1724	\| '[' push cfa_parameter_list pop ',' push cfa_abstract_parameter_list pop ']'
1725	// To obtain LR(1 ), the last cfa_abstract_parameter_list is added into this flattened rule to lookahead to the ']'.
1726	{ $$ = DeclarationNode::newTuple( $3->appendList( $7 ) ); }
1727	;
1728
1729	cfa_typedef_declaration: // CFA
1730	TYPEDEF cfa_variable_specifier
1731	{
1732	typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "1" );
1733	$$ = $2->addTypedef();
1734	}
1735	\| TYPEDEF cfa_function_specifier
1736	{
1737	typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "2" );
1738	$$ = $2->addTypedef();
1739	}
1740	\| cfa_typedef_declaration pop ',' push identifier
1741	{
1742	typedefTable.addToEnclosingScope( *$5, TYPEDEFname, "3" );
1743	$$ = $1->appendList( $1->cloneType( $5 ) );
1744	}
1745	;
1746
1747	// Traditionally typedef is part of storage-class specifier for syntactic convenience only. Here, it is factored out as
1748	// a separate form of declaration, which syntactically precludes storage-class specifiers and initialization.
1749
1750	typedef_declaration:
1751	TYPEDEF type_specifier declarator
1752	{
1753	typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "4" );
1754	$$ = $3->addType( $2 )->addTypedef();
1755	}
1756	\| typedef_declaration pop ',' push declarator
1757	{
1758	typedefTable.addToEnclosingScope( *$5->name, TYPEDEFname, "5" );
1759	$$ = $1->appendList( $1->cloneBaseType( $5 )->addTypedef() );
1760	}
1761	\| type_qualifier_list TYPEDEF type_specifier declarator // remaining OBSOLESCENT (see 2 )
1762	{
1763	typedefTable.addToEnclosingScope( *$4->name, TYPEDEFname, "6" );
1764	$$ = $4->addType( $3 )->addQualifiers( $1 )->addTypedef();
1765	}
1766	\| type_specifier TYPEDEF declarator
1767	{
1768	typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "7" );
1769	$$ = $3->addType( $1 )->addTypedef();
1770	}
1771	\| type_specifier TYPEDEF type_qualifier_list declarator
1772	{
1773	typedefTable.addToEnclosingScope( *$4->name, TYPEDEFname, "8" );
1774	$$ = $4->addQualifiers( $1 )->addTypedef()->addType( $1 );
1775	}
1776	;
1777
1778	typedef_expression:
1779	// deprecated GCC, naming expression type: typedef name = exp; gives a name to the type of an expression
1780	TYPEDEF identifier '=' assignment_expression
1781	{
1782	SemanticError( yylloc, "Typedef expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
1783	}
1784	\| typedef_expression pop ',' push identifier '=' assignment_expression
1785	{
1786	SemanticError( yylloc, "Typedef expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
1787	}
1788	;
1789
1790	c_declaration:
1791	declaration_specifier declaring_list
1792	{ $$ = distAttr( $1, $2 ); }
1793	\| typedef_declaration
1794	\| typedef_expression // deprecated GCC, naming expression type
1795	\| sue_declaration_specifier
1796	;
1797
1798	declaring_list:
1799	// A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1800	// storage-class
1801	declarator asm_name_opt initializer_opt
1802	{ $$ = $1->addAsmName( $2 )->addInitializer( $3 ); }
1803	\| declaring_list ',' attribute_list_opt declarator asm_name_opt initializer_opt
1804	{ $$ = $1->appendList( $4->addQualifiers( $3 )->addAsmName( $5 )->addInitializer( $6 ) ); }
1805	;
1806
1807	declaration_specifier: // type specifier + storage class
1808	basic_declaration_specifier
1809	\| sue_declaration_specifier
1810	\| type_declaration_specifier
1811	;
1812
1813	declaration_specifier_nobody: // type specifier + storage class - {...}
1814	// Preclude SUE declarations in restricted scopes:
1815	//
1816	// int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
1817	//
1818	// because it is impossible to call f due to name equivalence.
1819	basic_declaration_specifier
1820	\| sue_declaration_specifier_nobody
1821	\| type_declaration_specifier
1822	;
1823
1824	type_specifier: // type specifier
1825	basic_type_specifier
1826	\| sue_type_specifier
1827	\| type_type_specifier
1828	;
1829
1830	type_specifier_nobody: // type specifier - {...}
1831	// Preclude SUE declarations in restricted scopes:
1832	//
1833	// int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
1834	//
1835	// because it is impossible to call f due to name equivalence.
1836	basic_type_specifier
1837	\| sue_type_specifier_nobody
1838	\| type_type_specifier
1839	;
1840
1841	type_qualifier_list_opt: // GCC, used in asm_statement
1842	// empty
1843	{ $$ = nullptr; }
1844	\| type_qualifier_list
1845	;
1846
1847	type_qualifier_list:
1848	// A semantic check is necessary to ensure a type qualifier is appropriate for the kind of declaration.
1849	//
1850	// ISO/IEC 9899:1999 Section 6.7.3(4 ) : If the same qualifier appears more than once in the same
1851	// specifier-qualifier-list, either directly or via one or more typedefs, the behavior is the same as if it
1852	// appeared only once.
1853	type_qualifier
1854	\| type_qualifier_list type_qualifier
1855	{ $$ = $1->addQualifiers( $2 ); }
1856	;
1857
1858	type_qualifier:
1859	type_qualifier_name
1860	\| attribute // trick handles most atrribute locations
1861	;
1862
1863	type_qualifier_name:
1864	CONST
1865	{ $$ = DeclarationNode::newTypeQualifier( Type::Const ); }
1866	\| RESTRICT
1867	{ $$ = DeclarationNode::newTypeQualifier( Type::Restrict ); }
1868	\| VOLATILE
1869	{ $$ = DeclarationNode::newTypeQualifier( Type::Volatile ); }
1870	\| ATOMIC
1871	{ $$ = DeclarationNode::newTypeQualifier( Type::Atomic ); }
1872	\| forall
1873	;
1874
1875	forall:
1876	FORALL '(' type_parameter_list ')' // CFA
1877	{ $$ = DeclarationNode::newForall( $3 ); }
1878	;
1879
1880	declaration_qualifier_list:
1881	storage_class_list
1882	\| type_qualifier_list storage_class_list // remaining OBSOLESCENT (see 2 )
1883	{ $$ = $1->addQualifiers( $2 ); }
1884	\| declaration_qualifier_list type_qualifier_list storage_class_list
1885	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1886	;
1887
1888	storage_class_list:
1889	// A semantic check is necessary to ensure a storage class is appropriate for the kind of declaration and that
1890	// only one of each is specified, except for inline, which can appear with the others.
1891	//
1892	// ISO/IEC 9899:1999 Section 6.7.1(2) : At most, one storage-class specifier may be given in the declaration
1893	// specifiers in a declaration.
1894	storage_class
1895	\| storage_class_list storage_class
1896	{ $$ = $1->addQualifiers( $2 ); }
1897	;
1898
1899	storage_class:
1900	EXTERN
1901	{ $$ = DeclarationNode::newStorageClass( Type::Extern ); }
1902	\| STATIC
1903	{ $$ = DeclarationNode::newStorageClass( Type::Static ); }
1904	\| AUTO
1905	{ $$ = DeclarationNode::newStorageClass( Type::Auto ); }
1906	\| REGISTER
1907	{ $$ = DeclarationNode::newStorageClass( Type::Register ); }
1908	\| THREADLOCAL // C11
1909	{ $$ = DeclarationNode::newStorageClass( Type::Threadlocal ); }
1910	// Put function specifiers here to simplify parsing rules, but separate them semantically.
1911	\| INLINE // C99
1912	{ $$ = DeclarationNode::newFuncSpecifier( Type::Inline ); }
1913	\| FORTRAN // C99
1914	{ $$ = DeclarationNode::newFuncSpecifier( Type::Fortran ); }
1915	\| NORETURN // C11
1916	{ $$ = DeclarationNode::newFuncSpecifier( Type::Noreturn ); }
1917	;
1918
1919	basic_type_name:
1920	VOID
1921	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Void ); }
1922	\| BOOL // C99
1923	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Bool ); }
1924	\| CHAR
1925	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Char ); }
1926	\| INT
1927	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Int ); }
1928	\| INT128
1929	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Int128 ); }
1930	\| UINT128
1931	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Int128 )->addType( DeclarationNode::newSignedNess( DeclarationNode::Unsigned ) ); }
1932	\| FLOAT
1933	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Float ); }
1934	\| DOUBLE
1935	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Double ); }
1936	\| uuFLOAT80
1937	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uuFloat80 ); }
1938	\| uuFLOAT128
1939	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uuFloat128 ); }
1940	\| uFLOAT16
1941	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat16 ); }
1942	\| uFLOAT32
1943	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat32 ); }
1944	\| uFLOAT32X
1945	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat32x ); }
1946	\| uFLOAT64
1947	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat64 ); }
1948	\| uFLOAT64X
1949	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat64x ); }
1950	\| uFLOAT128
1951	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat128 ); }
1952	\| DECIMAL32
1953	{ SemanticError( yylloc, "_Decimal32 is currently unimplemented." ); $$ = nullptr; }
1954	\| DECIMAL64
1955	{ SemanticError( yylloc, "_Decimal64 is currently unimplemented." ); $$ = nullptr; }
1956	\| DECIMAL128
1957	{ SemanticError( yylloc, "_Decimal128 is currently unimplemented." ); $$ = nullptr; }
1958	\| COMPLEX // C99
1959	{ $$ = DeclarationNode::newComplexType( DeclarationNode::Complex ); }
1960	\| IMAGINARY // C99
1961	{ $$ = DeclarationNode::newComplexType( DeclarationNode::Imaginary ); }
1962	\| SIGNED
1963	{ $$ = DeclarationNode::newSignedNess( DeclarationNode::Signed ); }
1964	\| UNSIGNED
1965	{ $$ = DeclarationNode::newSignedNess( DeclarationNode::Unsigned ); }
1966	\| SHORT
1967	{ $$ = DeclarationNode::newLength( DeclarationNode::Short ); }
1968	\| LONG
1969	{ $$ = DeclarationNode::newLength( DeclarationNode::Long ); }
1970	\| VALIST // GCC, __builtin_va_list
1971	{ $$ = DeclarationNode::newBuiltinType( DeclarationNode::Valist ); }
1972	\| AUTO_TYPE
1973	{ $$ = DeclarationNode::newBuiltinType( DeclarationNode::AutoType ); }
1974	\| vtable
1975	;
1976
1977	vtable_opt:
1978	// empty
1979	{ $$ = nullptr; }
1980	\| vtable
1981	;
1982
1983	vtable:
1984	VTABLE '(' type_name ')' default_opt
1985	{ $$ = DeclarationNode::newVtableType( $3 ); }
1986	// { SemanticError( yylloc, "vtable is currently unimplemented." ); $$ = nullptr; }
1987	;
1988
1989	default_opt:
1990	// empty
1991	{ $$ = nullptr; }
1992	\| DEFAULT
1993	{ SemanticError( yylloc, "vtable default is currently unimplemented." ); $$ = nullptr; }
1994	;
1995
1996	basic_declaration_specifier:
1997	// A semantic check is necessary for conflicting storage classes.
1998	basic_type_specifier
1999	\| declaration_qualifier_list basic_type_specifier
2000	{ $$ = $2->addQualifiers( $1 ); }
2001	\| basic_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2002	{ $$ = $1->addQualifiers( $2 ); }
2003	\| basic_declaration_specifier storage_class type_qualifier_list
2004	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2005	\| basic_declaration_specifier storage_class basic_type_specifier
2006	{ $$ = $3->addQualifiers( $2 )->addType( $1 ); }
2007	;
2008
2009	basic_type_specifier:
2010	direct_type
2011	// Cannot have type modifiers, e.g., short, long, etc.
2012	\| type_qualifier_list_opt indirect_type type_qualifier_list_opt
2013	{ $$ = $2->addQualifiers( $1 )->addQualifiers( $3 ); }
2014	;
2015
2016	direct_type:
2017	basic_type_name
2018	\| type_qualifier_list basic_type_name
2019	{ $$ = $2->addQualifiers( $1 ); }
2020	\| direct_type type_qualifier
2021	{ $$ = $1->addQualifiers( $2 ); }
2022	\| direct_type basic_type_name
2023	{ $$ = $1->addType( $2 ); }
2024	;
2025
2026	indirect_type:
2027	TYPEOF '(' type ')' // GCC: typeof( x ) y;
2028	{ $$ = $3; }
2029	\| TYPEOF '(' comma_expression ')' // GCC: typeof( a+b ) y;
2030	{ $$ = DeclarationNode::newTypeof( $3 ); }
2031	\| BASETYPEOF '(' type ')' // CFA: basetypeof( x ) y;
2032	{ $$ = DeclarationNode::newTypeof( new ExpressionNode( new TypeExpr( maybeMoveBuildType( $3 ) ) ), true ); }
2033	\| BASETYPEOF '(' comma_expression ')' // CFA: basetypeof( a+b ) y;
2034	{ $$ = DeclarationNode::newTypeof( $3, true ); }
2035	\| ZERO_T // CFA
2036	{ $$ = DeclarationNode::newBuiltinType( DeclarationNode::Zero ); }
2037	\| ONE_T // CFA
2038	{ $$ = DeclarationNode::newBuiltinType( DeclarationNode::One ); }
2039	;
2040
2041	sue_declaration_specifier: // struct, union, enum + storage class + type specifier
2042	sue_type_specifier
2043	\| declaration_qualifier_list sue_type_specifier
2044	{ $$ = $2->addQualifiers( $1 ); }
2045	\| sue_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2046	{ $$ = $1->addQualifiers( $2 ); }
2047	\| sue_declaration_specifier storage_class type_qualifier_list
2048	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2049	;
2050
2051	sue_type_specifier: // struct, union, enum + type specifier
2052	elaborated_type
2053	\| type_qualifier_list
2054	{ if ( $1->type != nullptr && $1->type->forall ) forall = true; } // remember generic type
2055	elaborated_type
2056	{ $$ = $3->addQualifiers( $1 ); }
2057	\| sue_type_specifier type_qualifier
2058	{
2059	if ( $2->type != nullptr && $2->type->forall ) forall = true; // remember generic type
2060	$$ = $1->addQualifiers( $2 );
2061	}
2062	;
2063
2064	sue_declaration_specifier_nobody: // struct, union, enum - {...} + storage class + type specifier
2065	sue_type_specifier_nobody
2066	\| declaration_qualifier_list sue_type_specifier_nobody
2067	{ $$ = $2->addQualifiers( $1 ); }
2068	\| sue_declaration_specifier_nobody storage_class // remaining OBSOLESCENT (see 2)
2069	{ $$ = $1->addQualifiers( $2 ); }
2070	\| sue_declaration_specifier_nobody storage_class type_qualifier_list
2071	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2072	;
2073
2074	sue_type_specifier_nobody: // struct, union, enum - {...} + type specifier
2075	elaborated_type_nobody
2076	\| type_qualifier_list elaborated_type_nobody
2077	{ $$ = $2->addQualifiers( $1 ); }
2078	\| sue_type_specifier_nobody type_qualifier
2079	{ $$ = $1->addQualifiers( $2 ); }
2080	;
2081
2082	type_declaration_specifier:
2083	type_type_specifier
2084	\| declaration_qualifier_list type_type_specifier
2085	{ $$ = $2->addQualifiers( $1 ); }
2086	\| type_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2087	{ $$ = $1->addQualifiers( $2 ); }
2088	\| type_declaration_specifier storage_class type_qualifier_list
2089	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2090	;
2091
2092	type_type_specifier: // typedef types
2093	type_name
2094	\| type_qualifier_list type_name
2095	{ $$ = $2->addQualifiers( $1 ); }
2096	\| type_type_specifier type_qualifier
2097	{ $$ = $1->addQualifiers( $2 ); }
2098	;
2099
2100	type_name:
2101	TYPEDEFname
2102	{ $$ = DeclarationNode::newFromTypedef( $1 ); }
2103	\| '.' TYPEDEFname
2104	{ $$ = DeclarationNode::newQualifiedType( DeclarationNode::newFromGlobalScope(), DeclarationNode::newFromTypedef( $2 ) ); }
2105	\| type_name '.' TYPEDEFname
2106	{ $$ = DeclarationNode::newQualifiedType( $1, DeclarationNode::newFromTypedef( $3 ) ); }
2107	\| typegen_name
2108	\| '.' typegen_name
2109	{ $$ = DeclarationNode::newQualifiedType( DeclarationNode::newFromGlobalScope(), $2 ); }
2110	\| type_name '.' typegen_name
2111	{ $$ = DeclarationNode::newQualifiedType( $1, $3 ); }
2112	;
2113
2114	typegen_name: // CFA
2115	TYPEGENname
2116	{ $$ = DeclarationNode::newFromTypeGen( $1, nullptr ); }
2117	\| TYPEGENname '(' ')'
2118	{ $$ = DeclarationNode::newFromTypeGen( $1, nullptr ); }
2119	\| TYPEGENname '(' type_list ')'
2120	{ $$ = DeclarationNode::newFromTypeGen( $1, $3 ); }
2121	;
2122
2123	elaborated_type: // struct, union, enum
2124	aggregate_type
2125	\| enum_type
2126	;
2127
2128	elaborated_type_nobody: // struct, union, enum - {...}
2129	aggregate_type_nobody
2130	\| enum_type_nobody
2131	;
2132
2133	aggregate_type: // struct, union
2134	aggregate_key attribute_list_opt
2135	{ forall = false; } // reset
2136	'{' field_declaration_list_opt '}' type_parameters_opt
2137	{ $$ = DeclarationNode::newAggregate( $1, nullptr, $7, $5, true )->addQualifiers( $2 ); }
2138	\| aggregate_key attribute_list_opt identifier
2139	{
2140	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2141	forall = false; // reset
2142	}
2143	'{' field_declaration_list_opt '}' type_parameters_opt
2144	{ $$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 ); }
2145	\| aggregate_key attribute_list_opt TYPEDEFname // unqualified type name
2146	{
2147	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2148	forall = false; // reset
2149	}
2150	'{' field_declaration_list_opt '}' type_parameters_opt
2151	{
2152	DeclarationNode::newFromTypedef( $3 );
2153	$$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2154	}
2155	\| aggregate_key attribute_list_opt TYPEGENname // unqualified type name
2156	{
2157	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2158	forall = false; // reset
2159	}
2160	'{' field_declaration_list_opt '}' type_parameters_opt
2161	{
2162	DeclarationNode::newFromTypeGen( $3, nullptr );
2163	$$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2164	}
2165	\| aggregate_type_nobody
2166	;
2167
2168	type_parameters_opt:
2169	// empty
2170	{ $$ = nullptr; } %prec '}'
2171	\| '(' type_list ')'
2172	{ $$ = $2; }
2173	;
2174
2175	aggregate_type_nobody: // struct, union - {...}
2176	aggregate_key attribute_list_opt identifier
2177	{
2178	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname );
2179	forall = false; // reset
2180	$$ = DeclarationNode::newAggregate( $1, $3, nullptr, nullptr, false )->addQualifiers( $2 );
2181	}
2182	\| aggregate_key attribute_list_opt type_name
2183	{
2184	forall = false; // reset
2185	// Create new generic declaration with same name as previous forward declaration, where the IDENTIFIER is
2186	// switched to a TYPEGENname. Link any generic arguments from typegen_name to new generic declaration and
2187	// delete newFromTypeGen.
2188	$$ = DeclarationNode::newAggregate( $1, $3->type->symbolic.name, $3->type->symbolic.actuals, nullptr, false )->addQualifiers( $2 );
2189	$3->type->symbolic.name = nullptr;
2190	$3->type->symbolic.actuals = nullptr;
2191	delete $3;
2192	}
2193	;
2194
2195	aggregate_key:
2196	aggregate_data
2197	\| aggregate_control
2198	;
2199
2200	aggregate_data:
2201	STRUCT vtable_opt
2202	{ $$ = AggregateDecl::Struct; }
2203	\| UNION
2204	{ $$ = AggregateDecl::Union; }
2205	\| EXCEPTION // CFA
2206	{ $$ = AggregateDecl::Exception; }
2207	// { SemanticError( yylloc, "exception aggregate is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2208	;
2209
2210	aggregate_control: // CFA
2211	MONITOR
2212	{ $$ = AggregateDecl::Monitor; }
2213	\| MUTEX STRUCT
2214	{ $$ = AggregateDecl::Monitor; }
2215	\| GENERATOR
2216	{ $$ = AggregateDecl::Generator; }
2217	\| MUTEX GENERATOR
2218	{ SemanticError( yylloc, "monitor generator is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2219	\| COROUTINE
2220	{ $$ = AggregateDecl::Coroutine; }
2221	\| MUTEX COROUTINE
2222	{ SemanticError( yylloc, "monitor coroutine is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2223	\| THREAD
2224	{ $$ = AggregateDecl::Thread; }
2225	\| MUTEX THREAD
2226	{ SemanticError( yylloc, "monitor thread is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2227	;
2228
2229	field_declaration_list_opt:
2230	// empty
2231	{ $$ = nullptr; }
2232	\| field_declaration_list_opt field_declaration
2233	{ $$ = $1 ? $1->appendList( $2 ) : $2; }
2234	;
2235
2236	field_declaration:
2237	type_specifier field_declaring_list_opt ';'
2238	{ $$ = fieldDecl( $1, $2 ); }
2239	\| EXTENSION type_specifier field_declaring_list_opt ';' // GCC
2240	{ $$ = fieldDecl( $2, $3 ); distExt( $$ ); }
2241	\| INLINE type_specifier field_abstract_list_opt ';' // CFA
2242	{
2243	if ( ! $3 ) { // field declarator ?
2244	$3 = DeclarationNode::newName( nullptr );
2245	} // if
2246	$3->inLine = true;
2247	$$ = distAttr( $2, $3 ); // mark all fields in list
2248	distInl( $3 );
2249	}
2250	\| INLINE aggregate_control ';' // CFA
2251	{ SemanticError( yylloc, "INLINE aggregate control currently unimplemented." ); $$ = nullptr; }
2252	\| typedef_declaration ';' // CFA
2253	\| cfa_field_declaring_list ';' // CFA, new style field declaration
2254	\| EXTENSION cfa_field_declaring_list ';' // GCC
2255	{ distExt( $2 ); $$ = $2; } // mark all fields in list
2256	\| INLINE cfa_field_abstract_list ';' // CFA, new style field declaration
2257	{ $$ = $2; } // mark all fields in list
2258	\| cfa_typedef_declaration ';' // CFA
2259	\| static_assert // C11
2260	;
2261
2262	field_declaring_list_opt:
2263	// empty
2264	{ $$ = nullptr; }
2265	\| field_declarator
2266	\| field_declaring_list_opt ',' attribute_list_opt field_declarator
2267	{ $$ = $1->appendList( $4->addQualifiers( $3 ) ); }
2268	;
2269
2270	field_declarator:
2271	bit_subrange_size // C special case, no field name
2272	{ $$ = DeclarationNode::newBitfield( $1 ); }
2273	\| variable_declarator bit_subrange_size_opt
2274	// A semantic check is required to ensure bit_subrange only appears on integral types.
2275	{ $$ = $1->addBitfield( $2 ); }
2276	\| variable_type_redeclarator bit_subrange_size_opt
2277	// A semantic check is required to ensure bit_subrange only appears on integral types.
2278	{ $$ = $1->addBitfield( $2 ); }
2279	;
2280
2281	field_abstract_list_opt:
2282	// empty
2283	{ $$ = nullptr; }
2284	\| field_abstract
2285	\| field_abstract_list_opt ',' attribute_list_opt field_abstract
2286	{ $$ = $1->appendList( $4->addQualifiers( $3 ) ); }
2287	;
2288
2289	field_abstract:
2290	// no bit fields
2291	variable_abstract_declarator
2292	;
2293
2294	cfa_field_declaring_list: // CFA, new style field declaration
2295	// bit-fields are handled by C declarations
2296	cfa_abstract_declarator_tuple identifier_or_type_name
2297	{ $$ = $1->addName( $2 ); }
2298	\| cfa_field_declaring_list ',' identifier_or_type_name
2299	{ $$ = $1->appendList( $1->cloneType( $3 ) ); }
2300	;
2301
2302	cfa_field_abstract_list: // CFA, new style field declaration
2303	// bit-fields are handled by C declarations
2304	cfa_abstract_declarator_tuple
2305	\| cfa_field_abstract_list ','
2306	{ $$ = $1->appendList( $1->cloneType( 0 ) ); }
2307	;
2308
2309	bit_subrange_size_opt:
2310	// empty
2311	{ $$ = nullptr; }
2312	\| bit_subrange_size
2313	;
2314
2315	bit_subrange_size:
2316	':' assignment_expression
2317	{ $$ = $2; }
2318	;
2319
2320	enum_type:
2321	ENUM attribute_list_opt '{' enumerator_list comma_opt '}'
2322	{ $$ = DeclarationNode::newEnum( nullptr, $4, true )->addQualifiers( $2 ); }
2323	\| ENUM attribute_list_opt identifier
2324	{ typedefTable.makeTypedef( *$3 ); }
2325	'{' enumerator_list comma_opt '}'
2326	{ $$ = DeclarationNode::newEnum( $3, $6, true )->addQualifiers( $2 ); }
2327	\| ENUM attribute_list_opt typedef_name // unqualified type name
2328	'{' enumerator_list comma_opt '}'
2329	{ $$ = DeclarationNode::newEnum( $3->name, $5, true )->addQualifiers( $2 ); }
2330	\| ENUM '(' cfa_abstract_parameter_declaration ')' attribute_list_opt '{' enumerator_list comma_opt '}'
2331	{
2332	if ( $3->storageClasses.val != 0 \|\| $3->type->qualifiers.val != 0 )
2333	{ SemanticError( yylloc, "storage-class and CV qualifiers are not meaningful for enumeration constants, which are const." ); }
2334
2335	$$ = DeclarationNode::newEnum( nullptr, $7, true, $3 )->addQualifiers( $5 );
2336	}
2337	\| ENUM '(' cfa_abstract_parameter_declaration ')' attribute_list_opt identifier attribute_list_opt
2338	{
2339	if ( $3->storageClasses.val != 0 \|\| $3->type->qualifiers.val != 0 ) { SemanticError( yylloc, "storage-class and CV qualifiers are not meaningful for enumeration constants, which are const." ); }
2340	typedefTable.makeTypedef( *$6 );
2341	}
2342	'{' enumerator_list comma_opt '}'
2343	{
2344	$$ = DeclarationNode::newEnum( $6, $10, true, $3 )->addQualifiers( $5 )->addQualifiers( $7 );
2345	}
2346	\| ENUM '(' cfa_abstract_parameter_declaration ')' attribute_list_opt typedef_name attribute_list_opt '{' enumerator_list comma_opt '}'
2347	{
2348	if ( $3->storageClasses.val != 0 \|\| $3->type->qualifiers.val != 0 ) { SemanticError( yylloc, "storage-class and CV qualifiers are not meaningful for enumeration constants, which are const." ); }
2349	typedefTable.makeTypedef( *$6->name );
2350	$$ = DeclarationNode::newEnum( $6->name, $9, true, $3 )->addQualifiers( $5 )->addQualifiers( $7 );
2351	}
2352	\| enum_type_nobody
2353	;
2354
2355	enum_type_nobody: // enum - {...}
2356	ENUM attribute_list_opt identifier
2357	{ typedefTable.makeTypedef( *$3 ); $$ = DeclarationNode::newEnum( $3, 0, false )->addQualifiers( $2 ); }
2358	\| ENUM attribute_list_opt type_name // qualified type name
2359	{ typedefTable.makeTypedef( *$3->type->symbolic.name ); $$ = DeclarationNode::newEnum( $3->type->symbolic.name, 0, false )->addQualifiers( $2 ); }
2360	;
2361
2362	enumerator_list:
2363	identifier_or_type_name enumerator_value_opt
2364	{ $$ = DeclarationNode::newEnumValueGeneric( $1, $2 ); }
2365	\| INLINE type_name
2366	{ $$ = DeclarationNode::newEnumValueGeneric( new string("inline"), nullptr ); }
2367	\| enumerator_list ',' identifier_or_type_name enumerator_value_opt
2368	{ $$ = $1->appendList( DeclarationNode::newEnumValueGeneric( $3, $4 ) ); }
2369	\| enumerator_list ',' INLINE type_name enumerator_value_opt
2370	{ $$ = $1->appendList( DeclarationNode::newEnumValueGeneric( new string("inline"), nullptr ) ); }
2371	;
2372
2373	enumerator_value_opt:
2374	// empty
2375	{ $$ = nullptr; }
2376	// \| '=' constant_expression
2377	// { $$ = $2; }
2378	\| simple_assignment_operator initializer
2379	{ $$ = $1 == OperKinds::Assign ? $2 : $2->set_maybeConstructed( false ); }
2380	;
2381
2382	cfa_parameter_ellipsis_list_opt: // CFA, abstract + real
2383	// empty
2384	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Void ); }
2385	\| ELLIPSIS
2386	{ $$ = nullptr; }
2387	\| cfa_abstract_parameter_list
2388	\| cfa_parameter_list
2389	\| cfa_parameter_list pop ',' push cfa_abstract_parameter_list
2390	{ $$ = $1->appendList( $5 ); }
2391	\| cfa_abstract_parameter_list pop ',' push ELLIPSIS
2392	{ $$ = $1->addVarArgs(); }
2393	\| cfa_parameter_list pop ',' push ELLIPSIS
2394	{ $$ = $1->addVarArgs(); }
2395	;
2396
2397	cfa_parameter_list: // CFA
2398	// To obtain LR(1) between cfa_parameter_list and cfa_abstract_tuple, the last cfa_abstract_parameter_list is
2399	// factored out from cfa_parameter_list, flattening the rules to get lookahead to the ']'.
2400	cfa_parameter_declaration
2401	\| cfa_abstract_parameter_list pop ',' push cfa_parameter_declaration
2402	{ $$ = $1->appendList( $5 ); }
2403	\| cfa_parameter_list pop ',' push cfa_parameter_declaration
2404	{ $$ = $1->appendList( $5 ); }
2405	\| cfa_parameter_list pop ',' push cfa_abstract_parameter_list pop ',' push cfa_parameter_declaration
2406	{ $$ = $1->appendList( $5 )->appendList( $9 ); }
2407	;
2408
2409	cfa_abstract_parameter_list: // CFA, new & old style abstract
2410	cfa_abstract_parameter_declaration
2411	\| cfa_abstract_parameter_list pop ',' push cfa_abstract_parameter_declaration
2412	{ $$ = $1->appendList( $5 ); }
2413	;
2414
2415	parameter_type_list_opt:
2416	// empty
2417	{ $$ = nullptr; }
2418	\| ELLIPSIS
2419	{ $$ = nullptr; }
2420	\| parameter_list
2421	\| parameter_list pop ',' push ELLIPSIS
2422	{ $$ = $1->addVarArgs(); }
2423	;
2424
2425	parameter_list: // abstract + real
2426	abstract_parameter_declaration
2427	\| parameter_declaration
2428	\| parameter_list pop ',' push abstract_parameter_declaration
2429	{ $$ = $1->appendList( $5 ); }
2430	\| parameter_list pop ',' push parameter_declaration
2431	{ $$ = $1->appendList( $5 ); }
2432	;
2433
2434	// Provides optional identifier names (abstract_declarator/variable_declarator), no initialization, different semantics
2435	// for typedef name by using type_parameter_redeclarator instead of typedef_redeclarator, and function prototypes.
2436
2437	cfa_parameter_declaration: // CFA, new & old style parameter declaration
2438	parameter_declaration
2439	\| cfa_identifier_parameter_declarator_no_tuple identifier_or_type_name default_initializer_opt
2440	{ $$ = $1->addName( $2 ); }
2441	\| cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2442	// To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2443	{ $$ = $1->addName( $2 ); }
2444	\| type_qualifier_list cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2445	{ $$ = $2->addName( $3 )->addQualifiers( $1 ); }
2446	\| cfa_function_specifier
2447	;
2448
2449	cfa_abstract_parameter_declaration: // CFA, new & old style parameter declaration
2450	abstract_parameter_declaration
2451	\| cfa_identifier_parameter_declarator_no_tuple
2452	\| cfa_abstract_tuple
2453	// To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2454	\| type_qualifier_list cfa_abstract_tuple
2455	{ $$ = $2->addQualifiers( $1 ); }
2456	\| cfa_abstract_function
2457	;
2458
2459	parameter_declaration:
2460	// No SUE declaration in parameter list.
2461	declaration_specifier_nobody identifier_parameter_declarator default_initializer_opt
2462	{ $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2463	\| declaration_specifier_nobody type_parameter_redeclarator default_initializer_opt
2464	{ $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2465	;
2466
2467	abstract_parameter_declaration:
2468	declaration_specifier_nobody default_initializer_opt
2469	{ $$ = $1->addInitializer( $2 ? new InitializerNode( $2 ) : nullptr ); }
2470	\| declaration_specifier_nobody abstract_parameter_declarator default_initializer_opt
2471	{ $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2472	;
2473
2474	// ISO/IEC 9899:1999 Section 6.9.1(6) : "An identifier declared as a typedef name shall not be redeclared as a
2475	// parameter." Because the scope of the K&R-style parameter-list sees the typedef first, the following is based only on
2476	// identifiers. The ANSI-style parameter-list can redefine a typedef name.
2477
2478	identifier_list: // K&R-style parameter list => no types
2479	identifier
2480	{ $$ = DeclarationNode::newName( $1 ); }
2481	\| identifier_list ',' identifier
2482	{ $$ = $1->appendList( DeclarationNode::newName( $3 ) ); }
2483	;
2484
2485	identifier_or_type_name:
2486	identifier
2487	\| TYPEDEFname
2488	\| TYPEGENname
2489	;
2490
2491	type_no_function: // sizeof, alignof, cast (constructor)
2492	cfa_abstract_declarator_tuple // CFA
2493	\| type_specifier
2494	\| type_specifier abstract_declarator
2495	{ $$ = $2->addType( $1 ); }
2496	;
2497
2498	type: // typeof, assertion
2499	type_no_function
2500	\| cfa_abstract_function // CFA
2501	;
2502
2503	initializer_opt:
2504	// empty
2505	{ $$ = nullptr; }
2506	\| simple_assignment_operator initializer { $$ = $1 == OperKinds::Assign ? $2 : $2->set_maybeConstructed( false ); }
2507	\| '=' VOID { $$ = new InitializerNode( true ); }
2508	\| '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $2, true ); }
2509	;
2510
2511	initializer:
2512	assignment_expression { $$ = new InitializerNode( $1 ); }
2513	\| '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $2, true ); }
2514	;
2515
2516	initializer_list_opt:
2517	// empty
2518	{ $$ = nullptr; }
2519	\| initializer
2520	\| designation initializer { $$ = $2->set_designators( $1 ); }
2521	\| initializer_list_opt ',' initializer { $$ = (InitializerNode *)( $1->set_last( $3 ) ); }
2522	\| initializer_list_opt ',' designation initializer { $$ = (InitializerNode *)($1->set_last( $4->set_designators( $3 ) )); }
2523	;
2524
2525	// There is an unreconcileable parsing problem between C99 and CFA with respect to designators. The problem is use of
2526	// '=' to separator the designator from the initializer value, as in:
2527	//
2528	// int x[10] = { [1] = 3 };
2529	//
2530	// The string "[1] = 3" can be parsed as a designator assignment or a tuple assignment. To disambiguate this case, CFA
2531	// changes the syntax from "=" to ":" as the separator between the designator and initializer. GCC does uses ":" for
2532	// field selection. The optional use of the "=" in GCC, or in this case ":", cannot be supported either due to
2533	// shift/reduce conflicts
2534
2535	designation:
2536	designator_list ':' // C99, CFA uses ":" instead of "="
2537	\| identifier_at ':' // GCC, field name
2538	{ $$ = new ExpressionNode( build_varref( $1 ) ); }
2539	;
2540
2541	designator_list: // C99
2542	designator
2543	\| designator_list designator
2544	{ $$ = (ExpressionNode *)($1->set_last( $2 )); }
2545	//\| designator_list designator { $$ = new ExpressionNode( $1, $2 ); }
2546	;
2547
2548	designator:
2549	'.' identifier_at // C99, field name
2550	{ $$ = new ExpressionNode( build_varref( $2 ) ); }
2551	\| '[' push assignment_expression pop ']' // C99, single array element
2552	// assignment_expression used instead of constant_expression because of shift/reduce conflicts with tuple.
2553	{ $$ = $3; }
2554	\| '[' push subrange pop ']' // CFA, multiple array elements
2555	{ $$ = $3; }
2556	\| '[' push constant_expression ELLIPSIS constant_expression pop ']' // GCC, multiple array elements
2557	{ $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild<Expression>( $3 ), maybeMoveBuild<Expression>( $5 ) ) ); }
2558	\| '.' '[' push field_name_list pop ']' // CFA, tuple field selector
2559	{ $$ = $4; }
2560	;
2561
2562	// The CFA type system is based on parametric polymorphism, the ability to declare functions with type parameters,
2563	// rather than an object-oriented type system. This required four groups of extensions:
2564	//
2565	// Overloading: function, data, and operator identifiers may be overloaded.
2566	//
2567	// Type declarations: "otype" is used to generate new types for declaring objects. Similarly, "dtype" is used for object
2568	// and incomplete types, and "ftype" is used for function types. Type declarations with initializers provide
2569	// definitions of new types. Type declarations with storage class "extern" provide opaque types.
2570	//
2571	// Polymorphic functions: A forall clause declares a type parameter. The corresponding argument is inferred at the call
2572	// site. A polymorphic function is not a template; it is a function, with an address and a type.
2573	//
2574	// Specifications and Assertions: Specifications are collections of declarations parameterized by one or more
2575	// types. They serve many of the purposes of abstract classes, and specification hierarchies resemble subclass
2576	// hierarchies. Unlike classes, they can define relationships between types. Assertions declare that a type or
2577	// types provide the operations declared by a specification. Assertions are normally used to declare requirements
2578	// on type arguments of polymorphic functions.
2579
2580	type_parameter_list: // CFA
2581	type_parameter
2582	\| type_parameter_list ',' type_parameter
2583	{ $$ = $1->appendList( $3 ); }
2584	;
2585
2586	type_initializer_opt: // CFA
2587	// empty
2588	{ $$ = nullptr; }
2589	\| '=' type
2590	{ $$ = $2; }
2591	;
2592
2593	type_parameter: // CFA
2594	type_class identifier_or_type_name
2595	{
2596	typedefTable.addToScope( *$2, TYPEDEFname, "9" );
2597	if ( $1 == TypeDecl::Otype ) { SemanticError( yylloc, "otype keyword is deprecated, use T " ); }
2598	if ( $1 == TypeDecl::Dtype ) { SemanticError( yylloc, "dtype keyword is deprecated, use T &" ); }
2599	if ( $1 == TypeDecl::Ttype ) { SemanticError( yylloc, "ttype keyword is deprecated, use T ..." ); }
2600	}
2601	type_initializer_opt assertion_list_opt
2602	{ $$ = DeclarationNode::newTypeParam( $1, $2 )->addTypeInitializer( $4 )->addAssertions( $5 ); }
2603	\| identifier_or_type_name new_type_class
2604	{ typedefTable.addToScope( *$1, TYPEDEFname, "9" ); }
2605	type_initializer_opt assertion_list_opt
2606	{ $$ = DeclarationNode::newTypeParam( $2, $1 )->addTypeInitializer( $4 )->addAssertions( $5 ); }
2607	\| '[' identifier_or_type_name ']'
2608	{
2609	typedefTable.addToScope( *$2, TYPEDIMname, "9" );
2610	$$ = DeclarationNode::newTypeParam( TypeDecl::Dimension, $2 );
2611	}
2612	// \| type_specifier identifier_parameter_declarator
2613	\| assertion_list
2614	{ $$ = DeclarationNode::newTypeParam( TypeDecl::Dtype, new string( DeclarationNode::anonymous.newName() ) )->addAssertions( $1 ); }
2615	;
2616
2617	new_type_class: // CFA
2618	// empty
2619	{ $$ = TypeDecl::Otype; }
2620	\| '&'
2621	{ $$ = TypeDecl::Dtype; }
2622	\| '*'
2623	{ $$ = TypeDecl::DStype; } // dtype + sized
2624	// \| '(' '*' ')'
2625	// { $$ = TypeDecl::Ftype; }
2626	\| ELLIPSIS
2627	{ $$ = TypeDecl::Ttype; }
2628	;
2629
2630	type_class: // CFA
2631	OTYPE
2632	{ $$ = TypeDecl::Otype; }
2633	\| DTYPE
2634	{ $$ = TypeDecl::Dtype; }
2635	\| FTYPE
2636	{ $$ = TypeDecl::Ftype; }
2637	\| TTYPE
2638	{ $$ = TypeDecl::Ttype; }
2639	;
2640
2641	assertion_list_opt: // CFA
2642	// empty
2643	{ $$ = nullptr; }
2644	\| assertion_list
2645	;
2646
2647	assertion_list: // CFA
2648	assertion
2649	\| assertion_list assertion
2650	{ $$ = $1->appendList( $2 ); }
2651	;
2652
2653	assertion: // CFA
2654	'\|' identifier_or_type_name '(' type_list ')'
2655	{ $$ = DeclarationNode::newTraitUse( $2, $4 ); }
2656	\| '\|' '{' push trait_declaration_list pop '}'
2657	{ $$ = $4; }
2658	// \| '\|' '(' push type_parameter_list pop ')' '{' push trait_declaration_list pop '}' '(' type_list ')'
2659	// { SemanticError( yylloc, "Generic data-type assertion is currently unimplemented." ); $$ = nullptr; }
2660	;
2661
2662	type_list: // CFA
2663	type
2664	{ $$ = new ExpressionNode( new TypeExpr( maybeMoveBuildType( $1 ) ) ); }
2665	\| assignment_expression
2666	\| type_list ',' type
2667	{ $$ = (ExpressionNode *)($1->set_last( new ExpressionNode( new TypeExpr( maybeMoveBuildType( $3 ) ) ) )); }
2668	\| type_list ',' assignment_expression
2669	{ $$ = (ExpressionNode *)( $1->set_last( $3 )); }
2670	;
2671
2672	type_declaring_list: // CFA
2673	OTYPE type_declarator
2674	{ $$ = $2; }
2675	\| storage_class_list OTYPE type_declarator
2676	{ $$ = $3->addQualifiers( $1 ); }
2677	\| type_declaring_list ',' type_declarator
2678	{ $$ = $1->appendList( $3->copySpecifiers( $1 ) ); }
2679	;
2680
2681	type_declarator: // CFA
2682	type_declarator_name assertion_list_opt
2683	{ $$ = $1->addAssertions( $2 ); }
2684	\| type_declarator_name assertion_list_opt '=' type
2685	{ $$ = $1->addAssertions( $2 )->addType( $4 ); }
2686	;
2687
2688	type_declarator_name: // CFA
2689	identifier_or_type_name
2690	{
2691	typedefTable.addToEnclosingScope( *$1, TYPEDEFname, "10" );
2692	$$ = DeclarationNode::newTypeDecl( $1, 0 );
2693	}
2694	\| identifier_or_type_name '(' type_parameter_list ')'
2695	{
2696	typedefTable.addToEnclosingScope( *$1, TYPEGENname, "11" );
2697	$$ = DeclarationNode::newTypeDecl( $1, $3 );
2698	}
2699	;
2700
2701	trait_specifier: // CFA
2702	TRAIT identifier_or_type_name '(' type_parameter_list ')' '{' '}'
2703	{ $$ = DeclarationNode::newTrait( $2, $4, 0 ); }
2704	\| TRAIT identifier_or_type_name '(' type_parameter_list ')' '{' push trait_declaration_list pop '}'
2705	{ $$ = DeclarationNode::newTrait( $2, $4, $8 ); }
2706	;
2707
2708	trait_declaration_list: // CFA
2709	trait_declaration
2710	\| trait_declaration_list pop push trait_declaration
2711	{ $$ = $1->appendList( $4 ); }
2712	;
2713
2714	trait_declaration: // CFA
2715	cfa_trait_declaring_list ';'
2716	\| trait_declaring_list ';'
2717	;
2718
2719	cfa_trait_declaring_list: // CFA
2720	cfa_variable_specifier
2721	\| cfa_function_specifier
2722	\| cfa_trait_declaring_list pop ',' push identifier_or_type_name
2723	{ $$ = $1->appendList( $1->cloneType( $5 ) ); }
2724	;
2725
2726	trait_declaring_list: // CFA
2727	type_specifier declarator
2728	{ $$ = $2->addType( $1 ); }
2729	\| trait_declaring_list pop ',' push declarator
2730	{ $$ = $1->appendList( $1->cloneBaseType( $5 ) ); }
2731	;
2732
2733	//*************************** EXTERNAL DEFINITIONS ***************************
2734
2735	translation_unit:
2736	// empty, input file
2737	\| external_definition_list
2738	{ parseTree = parseTree ? parseTree->appendList( $1 ) : $1; }
2739	;
2740
2741	external_definition_list:
2742	push external_definition pop
2743	{ $$ = $2; }
2744	\| external_definition_list push external_definition pop
2745	{ $$ = $1 ? $1->appendList( $3 ) : $3; }
2746	;
2747
2748	external_definition_list_opt:
2749	// empty
2750	{ $$ = nullptr; }
2751	\| external_definition_list
2752	;
2753
2754	up:
2755	{ typedefTable.up( forall ); forall = false; }
2756	;
2757
2758	down:
2759	{ typedefTable.down(); }
2760	;
2761
2762	external_definition:
2763	DIRECTIVE
2764	{ $$ = DeclarationNode::newDirectiveStmt( new StatementNode( build_directive( $1 ) ) ); }
2765	\| declaration
2766	\| external_function_definition
2767	\| EXTENSION external_definition // GCC, multiple __extension__ allowed, meaning unknown
2768	{
2769	distExt( $2 ); // mark all fields in list
2770	$$ = $2;
2771	}
2772	\| ASM '(' string_literal ')' ';' // GCC, global assembler statement
2773	{ $$ = DeclarationNode::newAsmStmt( new StatementNode( build_asm( false, $3, 0 ) ) ); }
2774	\| EXTERN STRINGliteral
2775	{
2776	linkageStack.push( linkage ); // handle nested extern "C"/"Cforall"
2777	linkage = LinkageSpec::update( yylloc, linkage, $2 );
2778	}
2779	up external_definition down
2780	{
2781	linkage = linkageStack.top();
2782	linkageStack.pop();
2783	$$ = $5;
2784	}
2785	\| EXTERN STRINGliteral // C++-style linkage specifier
2786	{
2787	linkageStack.push( linkage ); // handle nested extern "C"/"Cforall"
2788	linkage = LinkageSpec::update( yylloc, linkage, $2 );
2789	}
2790	'{' up external_definition_list_opt down '}'
2791	{
2792	linkage = linkageStack.top();
2793	linkageStack.pop();
2794	$$ = $6;
2795	}
2796	\| type_qualifier_list
2797	{
2798	if ( $1->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
2799	if ( $1->type->forall ) forall = true; // remember generic type
2800	}
2801	'{' up external_definition_list_opt down '}' // CFA, namespace
2802	{
2803	distQual( $5, $1 );
2804	forall = false;
2805	$$ = $5;
2806	}
2807	\| declaration_qualifier_list
2808	{
2809	if ( $1->type && $1->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
2810	if ( $1->type && $1->type->forall ) forall = true; // remember generic type
2811	}
2812	'{' up external_definition_list_opt down '}' // CFA, namespace
2813	{
2814	distQual( $5, $1 );
2815	forall = false;
2816	$$ = $5;
2817	}
2818	\| declaration_qualifier_list type_qualifier_list
2819	{
2820	if ( ($1->type && $1->type->qualifiers.val) \|\| $2->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
2821	if ( ($1->type && $1->type->forall) \|\| $2->type->forall ) forall = true; // remember generic type
2822	}
2823	'{' up external_definition_list_opt down '}' // CFA, namespace
2824	{
2825	distQual( $6, $1->addQualifiers( $2 ) );
2826	forall = false;
2827	$$ = $6;
2828	}
2829	;
2830
2831	external_function_definition:
2832	function_definition
2833	// These rules are a concession to the "implicit int" type_specifier because there is a significant amount of
2834	// legacy code with global functions missing the type-specifier for the return type, and assuming "int".
2835	// Parsing is possible because function_definition does not appear in the context of an expression (nested
2836	// functions preclude this concession, i.e., all nested function must have a return type). A function prototype
2837	// declaration must still have a type_specifier. OBSOLESCENT (see 1)
2838	\| function_declarator compound_statement
2839	{ $$ = $1->addFunctionBody( $2 ); }
2840	\| KR_function_declarator KR_parameter_list_opt compound_statement
2841	{ $$ = $1->addOldDeclList( $2 )->addFunctionBody( $3 ); }
2842	;
2843
2844	with_clause_opt:
2845	// empty
2846	{ $$ = nullptr; forall = false; }
2847	\| WITH '(' tuple_expression_list ')'
2848	{ $$ = $3; forall = false; }
2849	;
2850
2851	function_definition:
2852	cfa_function_declaration with_clause_opt compound_statement // CFA
2853	{
2854	// Add the function body to the last identifier in the function definition list, i.e., foo3:
2855	// [const double] foo1(), foo2( int ), foo3( double ) { return 3.0; }
2856	$1->get_last()->addFunctionBody( $3, $2 );
2857	$$ = $1;
2858	}
2859	\| declaration_specifier function_declarator with_clause_opt compound_statement
2860	{
2861	rebindForall( $1, $2 );
2862	$$ = $2->addFunctionBody( $4, $3 )->addType( $1 );
2863	}
2864	\| declaration_specifier variable_type_redeclarator with_clause_opt compound_statement
2865	{
2866	rebindForall( $1, $2 );
2867	$$ = $2->addFunctionBody( $4, $3 )->addType( $1 );
2868	}
2869	// handles default int return type, OBSOLESCENT (see 1)
2870	\| type_qualifier_list function_declarator with_clause_opt compound_statement
2871	{ $$ = $2->addFunctionBody( $4, $3 )->addQualifiers( $1 ); }
2872	// handles default int return type, OBSOLESCENT (see 1)
2873	\| declaration_qualifier_list function_declarator with_clause_opt compound_statement
2874	{ $$ = $2->addFunctionBody( $4, $3 )->addQualifiers( $1 ); }
2875	// handles default int return type, OBSOLESCENT (see 1)
2876	\| declaration_qualifier_list type_qualifier_list function_declarator with_clause_opt compound_statement
2877	{ $$ = $3->addFunctionBody( $5, $4 )->addQualifiers( $2 )->addQualifiers( $1 ); }
2878
2879	// Old-style K&R function definition, OBSOLESCENT (see 4)
2880	\| declaration_specifier KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2881	{
2882	rebindForall( $1, $2 );
2883	$$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addType( $1 );
2884	}
2885	// handles default int return type, OBSOLESCENT (see 1)
2886	\| type_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2887	{ $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addQualifiers( $1 ); }
2888	// handles default int return type, OBSOLESCENT (see 1)
2889	\| declaration_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2890	{ $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addQualifiers( $1 ); }
2891	// handles default int return type, OBSOLESCENT (see 1)
2892	\| declaration_qualifier_list type_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2893	{ $$ = $3->addOldDeclList( $4 )->addFunctionBody( $6, $5 )->addQualifiers( $2 )->addQualifiers( $1 ); }
2894	;
2895
2896	declarator:
2897	variable_declarator
2898	\| variable_type_redeclarator
2899	\| function_declarator
2900	;
2901
2902	subrange:
2903	constant_expression '~' constant_expression // CFA, integer subrange
2904	{ $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild<Expression>( $1 ), maybeMoveBuild<Expression>( $3 ) ) ); }
2905	;
2906
2907	asm_name_opt: // GCC
2908	// empty
2909	{ $$ = nullptr; }
2910	\| ASM '(' string_literal ')' attribute_list_opt
2911	{
2912	DeclarationNode * name = new DeclarationNode();
2913	name->asmName = $3;
2914	$$ = name->addQualifiers( $5 );
2915	}
2916	;
2917
2918	attribute_list_opt: // GCC
2919	// empty
2920	{ $$ = nullptr; }
2921	\| attribute_list
2922	;
2923
2924	attribute_list: // GCC
2925	attribute
2926	\| attribute_list attribute
2927	{ $$ = $2->addQualifiers( $1 ); }
2928	;
2929
2930	attribute: // GCC
2931	ATTRIBUTE '(' '(' attribute_name_list ')' ')'
2932	{ $$ = $4; }
2933	;
2934
2935	attribute_name_list: // GCC
2936	attribute_name
2937	\| attribute_name_list ',' attribute_name
2938	{ $$ = $3->addQualifiers( $1 ); }
2939	;
2940
2941	attribute_name: // GCC
2942	// empty
2943	{ $$ = nullptr; }
2944	\| attr_name
2945	{ $$ = DeclarationNode::newAttribute( $1 ); }
2946	\| attr_name '(' argument_expression_list_opt ')'
2947	{ $$ = DeclarationNode::newAttribute( $1, $3 ); }
2948	;
2949
2950	attr_name: // GCC
2951	IDENTIFIER
2952	\| quasi_keyword
2953	\| TYPEDEFname
2954	\| TYPEGENname
2955	\| FALLTHROUGH
2956	{ $$ = Token{ new string( "fallthrough" ), { nullptr, -1 } }; }
2957	\| CONST
2958	{ $$ = Token{ new string( "__const__" ), { nullptr, -1 } }; }
2959	;
2960
2961	// ============================================================================
2962	// The following sections are a series of grammar patterns used to parse declarators. Multiple patterns are necessary
2963	// because the type of an identifier in wrapped around the identifier in the same form as its usage in an expression, as
2964	// in:
2965	//
2966	// int (*f())[10] { ... };
2967	// ... (*f())[3] += 1; // definition mimics usage
2968	//
2969	// Because these patterns are highly recursive, changes at a lower level in the recursion require copying some or all of
2970	// the pattern. Each of these patterns has some subtle variation to ensure correct syntax in a particular context.
2971	// ============================================================================
2972
2973	// ----------------------------------------------------------------------------
2974	// The set of valid declarators before a compound statement for defining a function is less than the set of declarators
2975	// to define a variable or function prototype, e.g.:
2976	//
2977	// valid declaration invalid definition
2978	// ----------------- ------------------
2979	// int f; int f {}
2980	// int f; int f {}
2981	// int f[10]; int f[10] {}
2982	// int (f)(int); int (f)(int) {}
2983	//
2984	// To preclude this syntactic anomaly requires separating the grammar rules for variable and function declarators, hence
2985	// variable_declarator and function_declarator.
2986	// ----------------------------------------------------------------------------
2987
2988	// This pattern parses a declaration of a variable that is not redefining a typedef name. The pattern precludes
2989	// declaring an array of functions versus a pointer to an array of functions.
2990
2991	paren_identifier:
2992	identifier_at
2993	{ $$ = DeclarationNode::newName( $1 ); }
2994	\| '(' paren_identifier ')' // redundant parenthesis
2995	{ $$ = $2; }
2996	;
2997
2998	variable_declarator:
2999	paren_identifier attribute_list_opt
3000	{ $$ = $1->addQualifiers( $2 ); }
3001	\| variable_ptr
3002	\| variable_array attribute_list_opt
3003	{ $$ = $1->addQualifiers( $2 ); }
3004	\| variable_function attribute_list_opt
3005	{ $$ = $1->addQualifiers( $2 ); }
3006	;
3007
3008	variable_ptr:
3009	ptrref_operator variable_declarator
3010	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3011	\| ptrref_operator type_qualifier_list variable_declarator
3012	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3013	\| '(' variable_ptr ')' attribute_list_opt // redundant parenthesis
3014	{ $$ = $2->addQualifiers( $4 ); }
3015	\| '(' attribute_list variable_ptr ')' attribute_list_opt // redundant parenthesis
3016	{ $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3017	;
3018
3019	variable_array:
3020	paren_identifier array_dimension
3021	{ $$ = $1->addArray( $2 ); }
3022	\| '(' variable_ptr ')' array_dimension
3023	{ $$ = $2->addArray( $4 ); }
3024	\| '(' attribute_list variable_ptr ')' array_dimension
3025	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3026	\| '(' variable_array ')' multi_array_dimension // redundant parenthesis
3027	{ $$ = $2->addArray( $4 ); }
3028	\| '(' attribute_list variable_array ')' multi_array_dimension // redundant parenthesis
3029	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3030	\| '(' variable_array ')' // redundant parenthesis
3031	{ $$ = $2; }
3032	\| '(' attribute_list variable_array ')' // redundant parenthesis
3033	{ $$ = $3->addQualifiers( $2 ); }
3034	;
3035
3036	variable_function:
3037	'(' variable_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3038	{ $$ = $2->addParamList( $6 ); }
3039	\| '(' attribute_list variable_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3040	{ $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3041	\| '(' variable_function ')' // redundant parenthesis
3042	{ $$ = $2; }
3043	\| '(' attribute_list variable_function ')' // redundant parenthesis
3044	{ $$ = $3->addQualifiers( $2 ); }
3045	;
3046
3047	// This pattern parses a function declarator that is not redefining a typedef name. For non-nested functions, there is
3048	// no context where a function definition can redefine a typedef name, i.e., the typedef and function name cannot exist
3049	// is the same scope. The pattern precludes returning arrays and functions versus pointers to arrays and functions.
3050
3051	function_declarator:
3052	function_no_ptr attribute_list_opt
3053	{ $$ = $1->addQualifiers( $2 ); }
3054	\| function_ptr
3055	\| function_array attribute_list_opt
3056	{ $$ = $1->addQualifiers( $2 ); }
3057	;
3058
3059	function_no_ptr:
3060	paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3061	{ $$ = $1->addParamList( $4 ); }
3062	\| '(' function_ptr ')' '(' push parameter_type_list_opt pop ')'
3063	{ $$ = $2->addParamList( $6 ); }
3064	\| '(' attribute_list function_ptr ')' '(' push parameter_type_list_opt pop ')'
3065	{ $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3066	\| '(' function_no_ptr ')' // redundant parenthesis
3067	{ $$ = $2; }
3068	\| '(' attribute_list function_no_ptr ')' // redundant parenthesis
3069	{ $$ = $3->addQualifiers( $2 ); }
3070	;
3071
3072	function_ptr:
3073	ptrref_operator function_declarator
3074	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3075	\| ptrref_operator type_qualifier_list function_declarator
3076	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3077	\| '(' function_ptr ')' attribute_list_opt
3078	{ $$ = $2->addQualifiers( $4 ); }
3079	\| '(' attribute_list function_ptr ')' attribute_list_opt
3080	{ $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3081	;
3082
3083	function_array:
3084	'(' function_ptr ')' array_dimension
3085	{ $$ = $2->addArray( $4 ); }
3086	\| '(' attribute_list function_ptr ')' array_dimension
3087	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3088	\| '(' function_array ')' multi_array_dimension // redundant parenthesis
3089	{ $$ = $2->addArray( $4 ); }
3090	\| '(' attribute_list function_array ')' multi_array_dimension // redundant parenthesis
3091	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3092	\| '(' function_array ')' // redundant parenthesis
3093	{ $$ = $2; }
3094	\| '(' attribute_list function_array ')' // redundant parenthesis
3095	{ $$ = $3->addQualifiers( $2 ); }
3096	;
3097
3098	// This pattern parses an old-style K&R function declarator (OBSOLESCENT, see 4)
3099	//
3100	// f( a, b, c ) int a, *b, c[]; {}
3101	//
3102	// that is not redefining a typedef name (see function_declarator for additional comments). The pattern precludes
3103	// returning arrays and functions versus pointers to arrays and functions.
3104
3105	KR_function_declarator:
3106	KR_function_no_ptr
3107	\| KR_function_ptr
3108	\| KR_function_array
3109	;
3110
3111	KR_function_no_ptr:
3112	paren_identifier '(' identifier_list ')' // function_declarator handles empty parameter
3113	{ $$ = $1->addIdList( $3 ); }
3114	\| '(' KR_function_ptr ')' '(' push parameter_type_list_opt pop ')'
3115	{ $$ = $2->addParamList( $6 ); }
3116	\| '(' attribute_list KR_function_ptr ')' '(' push parameter_type_list_opt pop ')'
3117	{ $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3118	\| '(' KR_function_no_ptr ')' // redundant parenthesis
3119	{ $$ = $2; }
3120	\| '(' attribute_list KR_function_no_ptr ')' // redundant parenthesis
3121	{ $$ = $3->addQualifiers( $2 ); }
3122	;
3123
3124	KR_function_ptr:
3125	ptrref_operator KR_function_declarator
3126	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3127	\| ptrref_operator type_qualifier_list KR_function_declarator
3128	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3129	\| '(' KR_function_ptr ')'
3130	{ $$ = $2; }
3131	\| '(' attribute_list KR_function_ptr ')'
3132	{ $$ = $3->addQualifiers( $2 ); }
3133	;
3134
3135	KR_function_array:
3136	'(' KR_function_ptr ')' array_dimension
3137	{ $$ = $2->addArray( $4 ); }
3138	\| '(' attribute_list KR_function_ptr ')' array_dimension
3139	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3140	\| '(' KR_function_array ')' multi_array_dimension // redundant parenthesis
3141	{ $$ = $2->addArray( $4 ); }
3142	\| '(' attribute_list KR_function_array ')' multi_array_dimension // redundant parenthesis
3143	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3144	\| '(' KR_function_array ')' // redundant parenthesis
3145	{ $$ = $2; }
3146	\| '(' attribute_list KR_function_array ')' // redundant parenthesis
3147	{ $$ = $3->addQualifiers( $2 ); }
3148	;
3149
3150	// This pattern parses a declaration for a variable or function prototype that redefines a type name, e.g.:
3151	//
3152	// typedef int foo;
3153	// {
3154	// int foo; // redefine typedef name in new scope
3155	// }
3156	//
3157	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3158	// and functions versus pointers to arrays and functions.
3159
3160	paren_type:
3161	typedef_name
3162	{
3163	// hide type name in enclosing scope by variable name
3164	typedefTable.addToEnclosingScope( *$1->name, IDENTIFIER, "ID" );
3165	}
3166	\| '(' paren_type ')'
3167	{ $$ = $2; }
3168	;
3169
3170	variable_type_redeclarator:
3171	paren_type attribute_list_opt
3172	{ $$ = $1->addQualifiers( $2 ); }
3173	\| type_ptr
3174	\| type_array attribute_list_opt
3175	{ $$ = $1->addQualifiers( $2 ); }
3176	\| type_function attribute_list_opt
3177	{ $$ = $1->addQualifiers( $2 ); }
3178	;
3179
3180	type_ptr:
3181	ptrref_operator variable_type_redeclarator
3182	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3183	\| ptrref_operator type_qualifier_list variable_type_redeclarator
3184	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3185	\| '(' type_ptr ')' attribute_list_opt // redundant parenthesis
3186	{ $$ = $2->addQualifiers( $4 ); }
3187	\| '(' attribute_list type_ptr ')' attribute_list_opt // redundant parenthesis
3188	{ $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3189	;
3190
3191	type_array:
3192	paren_type array_dimension
3193	{ $$ = $1->addArray( $2 ); }
3194	\| '(' type_ptr ')' array_dimension
3195	{ $$ = $2->addArray( $4 ); }
3196	\| '(' attribute_list type_ptr ')' array_dimension
3197	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3198	\| '(' type_array ')' multi_array_dimension // redundant parenthesis
3199	{ $$ = $2->addArray( $4 ); }
3200	\| '(' attribute_list type_array ')' multi_array_dimension // redundant parenthesis
3201	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3202	\| '(' type_array ')' // redundant parenthesis
3203	{ $$ = $2; }
3204	\| '(' attribute_list type_array ')' // redundant parenthesis
3205	{ $$ = $3->addQualifiers( $2 ); }
3206	;
3207
3208	type_function:
3209	paren_type '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3210	{ $$ = $1->addParamList( $4 ); }
3211	\| '(' type_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3212	{ $$ = $2->addParamList( $6 ); }
3213	\| '(' attribute_list type_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3214	{ $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3215	\| '(' type_function ')' // redundant parenthesis
3216	{ $$ = $2; }
3217	\| '(' attribute_list type_function ')' // redundant parenthesis
3218	{ $$ = $3->addQualifiers( $2 ); }
3219	;
3220
3221	// This pattern parses a declaration for a parameter variable of a function prototype or actual that is not redefining a
3222	// typedef name and allows the C99 array options, which can only appear in a parameter list. The pattern precludes
3223	// declaring an array of functions versus a pointer to an array of functions, and returning arrays and functions versus
3224	// pointers to arrays and functions.
3225
3226	identifier_parameter_declarator:
3227	paren_identifier attribute_list_opt
3228	{ $$ = $1->addQualifiers( $2 ); }
3229	\| '&' MUTEX paren_identifier attribute_list_opt
3230	{ $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3231	\| identifier_parameter_ptr
3232	\| identifier_parameter_array attribute_list_opt
3233	{ $$ = $1->addQualifiers( $2 ); }
3234	\| identifier_parameter_function attribute_list_opt
3235	{ $$ = $1->addQualifiers( $2 ); }
3236	;
3237
3238	identifier_parameter_ptr:
3239	ptrref_operator identifier_parameter_declarator
3240	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3241	\| ptrref_operator type_qualifier_list identifier_parameter_declarator
3242	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3243	\| '(' identifier_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3244	{ $$ = $2->addQualifiers( $4 ); }
3245	;
3246
3247	identifier_parameter_array:
3248	paren_identifier array_parameter_dimension
3249	{ $$ = $1->addArray( $2 ); }
3250	\| '(' identifier_parameter_ptr ')' array_dimension
3251	{ $$ = $2->addArray( $4 ); }
3252	\| '(' identifier_parameter_array ')' multi_array_dimension // redundant parenthesis
3253	{ $$ = $2->addArray( $4 ); }
3254	\| '(' identifier_parameter_array ')' // redundant parenthesis
3255	{ $$ = $2; }
3256	;
3257
3258	identifier_parameter_function:
3259	paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3260	{ $$ = $1->addParamList( $4 ); }
3261	\| '(' identifier_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3262	{ $$ = $2->addParamList( $6 ); }
3263	\| '(' identifier_parameter_function ')' // redundant parenthesis
3264	{ $$ = $2; }
3265	;
3266
3267	// This pattern parses a declaration for a parameter variable or function prototype that is redefining a typedef name,
3268	// e.g.:
3269	//
3270	// typedef int foo;
3271	// forall( otype T ) struct foo;
3272	// int f( int foo ); // redefine typedef name in new scope
3273	//
3274	// and allows the C99 array options, which can only appear in a parameter list.
3275
3276	type_parameter_redeclarator:
3277	typedef_name attribute_list_opt
3278	{ $$ = $1->addQualifiers( $2 ); }
3279	\| '&' MUTEX typedef_name attribute_list_opt
3280	{ $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3281	\| type_parameter_ptr
3282	\| type_parameter_array attribute_list_opt
3283	{ $$ = $1->addQualifiers( $2 ); }
3284	\| type_parameter_function attribute_list_opt
3285	{ $$ = $1->addQualifiers( $2 ); }
3286	;
3287
3288	typedef_name:
3289	TYPEDEFname
3290	{ $$ = DeclarationNode::newName( $1 ); }
3291	\| TYPEGENname
3292	{ $$ = DeclarationNode::newName( $1 ); }
3293	;
3294
3295	type_parameter_ptr:
3296	ptrref_operator type_parameter_redeclarator
3297	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3298	\| ptrref_operator type_qualifier_list type_parameter_redeclarator
3299	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3300	\| '(' type_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3301	{ $$ = $2->addQualifiers( $4 ); }
3302	;
3303
3304	type_parameter_array:
3305	typedef_name array_parameter_dimension
3306	{ $$ = $1->addArray( $2 ); }
3307	\| '(' type_parameter_ptr ')' array_parameter_dimension
3308	{ $$ = $2->addArray( $4 ); }
3309	;
3310
3311	type_parameter_function:
3312	typedef_name '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3313	{ $$ = $1->addParamList( $4 ); }
3314	\| '(' type_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3315	{ $$ = $2->addParamList( $6 ); }
3316	;
3317
3318	// This pattern parses a declaration of an abstract variable or function prototype, i.e., there is no identifier to
3319	// which the type applies, e.g.:
3320	//
3321	// sizeof( int );
3322	// sizeof( int * );
3323	// sizeof( int [10] );
3324	// sizeof( int (*)() );
3325	// sizeof( int () );
3326	//
3327	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3328	// and functions versus pointers to arrays and functions.
3329
3330	abstract_declarator:
3331	abstract_ptr
3332	\| abstract_array attribute_list_opt
3333	{ $$ = $1->addQualifiers( $2 ); }
3334	\| abstract_function attribute_list_opt
3335	{ $$ = $1->addQualifiers( $2 ); }
3336	;
3337
3338	abstract_ptr:
3339	ptrref_operator
3340	{ $$ = DeclarationNode::newPointer( 0, $1 ); }
3341	\| ptrref_operator type_qualifier_list
3342	{ $$ = DeclarationNode::newPointer( $2, $1 ); }
3343	\| ptrref_operator abstract_declarator
3344	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3345	\| ptrref_operator type_qualifier_list abstract_declarator
3346	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3347	\| '(' abstract_ptr ')' attribute_list_opt
3348	{ $$ = $2->addQualifiers( $4 ); }
3349	;
3350
3351	abstract_array:
3352	array_dimension
3353	\| '(' abstract_ptr ')' array_dimension
3354	{ $$ = $2->addArray( $4 ); }
3355	\| '(' abstract_array ')' multi_array_dimension // redundant parenthesis
3356	{ $$ = $2->addArray( $4 ); }
3357	\| '(' abstract_array ')' // redundant parenthesis
3358	{ $$ = $2; }
3359	;
3360
3361	abstract_function:
3362	'(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3363	{ $$ = DeclarationNode::newFunction( nullptr, nullptr, $3, nullptr ); }
3364	\| '(' abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3365	{ $$ = $2->addParamList( $6 ); }
3366	\| '(' abstract_function ')' // redundant parenthesis
3367	{ $$ = $2; }
3368	;
3369
3370	array_dimension:
3371	// Only the first dimension can be empty.
3372	'[' ']'
3373	{ $$ = DeclarationNode::newArray( 0, 0, false ); }
3374	\| '[' ']' multi_array_dimension
3375	{ $$ = DeclarationNode::newArray( 0, 0, false )->addArray( $3 ); }
3376	\| '[' push assignment_expression pop ',' comma_expression ']'
3377	{ $$ = DeclarationNode::newArray( $3, 0, false )->addArray( DeclarationNode::newArray( $6, 0, false ) ); }
3378	// { SemanticError( yylloc, "New array dimension is currently unimplemented." ); $$ = nullptr; }
3379	\| multi_array_dimension
3380	;
3381
3382	multi_array_dimension:
3383	'[' push assignment_expression pop ']'
3384	{ $$ = DeclarationNode::newArray( $3, 0, false ); }
3385	\| '[' push '*' pop ']' // C99
3386	{ $$ = DeclarationNode::newVarArray( 0 ); }
3387	\| multi_array_dimension '[' push assignment_expression pop ']'
3388	{ $$ = $1->addArray( DeclarationNode::newArray( $4, 0, false ) ); }
3389	\| multi_array_dimension '[' push '*' pop ']' // C99
3390	{ $$ = $1->addArray( DeclarationNode::newVarArray( 0 ) ); }
3391	;
3392
3393	// This pattern parses a declaration of a parameter abstract variable or function prototype, i.e., there is no
3394	// identifier to which the type applies, e.g.:
3395	//
3396	// int f( int ); // not handled here
3397	// int f( int * ); // abstract function-prototype parameter; no parameter name specified
3398	// int f( int (*)() ); // abstract function-prototype parameter; no parameter name specified
3399	// int f( int (int) ); // abstract function-prototype parameter; no parameter name specified
3400	//
3401	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3402	// and functions versus pointers to arrays and functions. In addition, the pattern handles the
3403	// special meaning of parenthesis around a typedef name:
3404	//
3405	// ISO/IEC 9899:1999 Section 6.7.5.3(11) : "In a parameter declaration, a single typedef name in
3406	// parentheses is taken to be an abstract declarator that specifies a function with a single parameter,
3407	// not as redundant parentheses around the identifier."
3408	//
3409	// For example:
3410	//
3411	// typedef float T;
3412	// int f( int ( T [5] ) ); // see abstract_parameter_declarator
3413	// int g( int ( T ( int ) ) ); // see abstract_parameter_declarator
3414	// int f( int f1( T a[5] ) ); // see identifier_parameter_declarator
3415	// int g( int g1( T g2( int p ) ) ); // see identifier_parameter_declarator
3416	//
3417	// In essence, a '(' immediately to the left of typedef name, T, is interpreted as starting a parameter type list, and
3418	// not as redundant parentheses around a redeclaration of T. Finally, the pattern also precludes declaring an array of
3419	// functions versus a pointer to an array of functions, and returning arrays and functions versus pointers to arrays and
3420	// functions.
3421
3422	abstract_parameter_declarator:
3423	abstract_parameter_ptr
3424	\| '&' MUTEX attribute_list_opt
3425	{ $$ = DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf )->addQualifiers( $3 ); }
3426	\| abstract_parameter_array attribute_list_opt
3427	{ $$ = $1->addQualifiers( $2 ); }
3428	\| abstract_parameter_function attribute_list_opt
3429	{ $$ = $1->addQualifiers( $2 ); }
3430	;
3431
3432	abstract_parameter_ptr:
3433	ptrref_operator
3434	{ $$ = DeclarationNode::newPointer( nullptr, $1 ); }
3435	\| ptrref_operator type_qualifier_list
3436	{ $$ = DeclarationNode::newPointer( $2, $1 ); }
3437	\| ptrref_operator abstract_parameter_declarator
3438	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3439	\| ptrref_operator type_qualifier_list abstract_parameter_declarator
3440	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3441	\| '(' abstract_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3442	{ $$ = $2->addQualifiers( $4 ); }
3443	;
3444
3445	abstract_parameter_array:
3446	array_parameter_dimension
3447	\| '(' abstract_parameter_ptr ')' array_parameter_dimension
3448	{ $$ = $2->addArray( $4 ); }
3449	\| '(' abstract_parameter_array ')' multi_array_dimension // redundant parenthesis
3450	{ $$ = $2->addArray( $4 ); }
3451	\| '(' abstract_parameter_array ')' // redundant parenthesis
3452	{ $$ = $2; }
3453	;
3454
3455	abstract_parameter_function:
3456	'(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3457	{ $$ = DeclarationNode::newFunction( nullptr, nullptr, $3, nullptr ); }
3458	\| '(' abstract_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3459	{ $$ = $2->addParamList( $6 ); }
3460	\| '(' abstract_parameter_function ')' // redundant parenthesis
3461	{ $$ = $2; }
3462	;
3463
3464	array_parameter_dimension:
3465	// Only the first dimension can be empty or have qualifiers.
3466	array_parameter_1st_dimension
3467	\| array_parameter_1st_dimension multi_array_dimension
3468	{ $$ = $1->addArray( $2 ); }
3469	\| multi_array_dimension
3470	;
3471
3472	// The declaration of an array parameter has additional syntax over arrays in normal variable declarations:
3473	//
3474	// ISO/IEC 9899:1999 Section 6.7.5.2(1) : "The optional type qualifiers and the keyword static shall appear only in
3475	// a declaration of a function parameter with an array type, and then only in the outermost array type derivation."
3476
3477	array_parameter_1st_dimension:
3478	'[' ']'
3479	{ $$ = DeclarationNode::newArray( 0, 0, false ); }
3480	// multi_array_dimension handles the '[' '*' ']' case
3481	\| '[' push type_qualifier_list '*' pop ']' // remaining C99
3482	{ $$ = DeclarationNode::newVarArray( $3 ); }
3483	\| '[' push type_qualifier_list pop ']'
3484	{ $$ = DeclarationNode::newArray( 0, $3, false ); }
3485	// multi_array_dimension handles the '[' assignment_expression ']' case
3486	\| '[' push type_qualifier_list assignment_expression pop ']'
3487	{ $$ = DeclarationNode::newArray( $4, $3, false ); }
3488	\| '[' push STATIC type_qualifier_list_opt assignment_expression pop ']'
3489	{ $$ = DeclarationNode::newArray( $5, $4, true ); }
3490	\| '[' push type_qualifier_list STATIC assignment_expression pop ']'
3491	{ $$ = DeclarationNode::newArray( $5, $3, true ); }
3492	;
3493
3494	// This pattern parses a declaration of an abstract variable, but does not allow "int ()" for a function pointer.
3495	//
3496	// struct S {
3497	// int;
3498	// int *;
3499	// int [10];
3500	// int (*)();
3501	// };
3502
3503	variable_abstract_declarator:
3504	variable_abstract_ptr
3505	\| variable_abstract_array attribute_list_opt
3506	{ $$ = $1->addQualifiers( $2 ); }
3507	\| variable_abstract_function attribute_list_opt
3508	{ $$ = $1->addQualifiers( $2 ); }
3509	;
3510
3511	variable_abstract_ptr:
3512	ptrref_operator
3513	{ $$ = DeclarationNode::newPointer( 0, $1 ); }
3514	\| ptrref_operator type_qualifier_list
3515	{ $$ = DeclarationNode::newPointer( $2, $1 ); }
3516	\| ptrref_operator variable_abstract_declarator
3517	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3518	\| ptrref_operator type_qualifier_list variable_abstract_declarator
3519	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3520	\| '(' variable_abstract_ptr ')' attribute_list_opt // redundant parenthesis
3521	{ $$ = $2->addQualifiers( $4 ); }
3522	;
3523
3524	variable_abstract_array:
3525	array_dimension
3526	\| '(' variable_abstract_ptr ')' array_dimension
3527	{ $$ = $2->addArray( $4 ); }
3528	\| '(' variable_abstract_array ')' multi_array_dimension // redundant parenthesis
3529	{ $$ = $2->addArray( $4 ); }
3530	\| '(' variable_abstract_array ')' // redundant parenthesis
3531	{ $$ = $2; }
3532	;
3533
3534	variable_abstract_function:
3535	'(' variable_abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3536	{ $$ = $2->addParamList( $6 ); }
3537	\| '(' variable_abstract_function ')' // redundant parenthesis
3538	{ $$ = $2; }
3539	;
3540
3541	// This pattern parses a new-style declaration for a parameter variable or function prototype that is either an
3542	// identifier or typedef name and allows the C99 array options, which can only appear in a parameter list.
3543
3544	cfa_identifier_parameter_declarator_tuple: // CFA
3545	cfa_identifier_parameter_declarator_no_tuple
3546	\| cfa_abstract_tuple
3547	\| type_qualifier_list cfa_abstract_tuple
3548	{ $$ = $2->addQualifiers( $1 ); }
3549	;
3550
3551	cfa_identifier_parameter_declarator_no_tuple: // CFA
3552	cfa_identifier_parameter_ptr
3553	\| cfa_identifier_parameter_array
3554	;
3555
3556	cfa_identifier_parameter_ptr: // CFA
3557	// No SUE declaration in parameter list.
3558	ptrref_operator type_specifier_nobody
3559	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3560	\| type_qualifier_list ptrref_operator type_specifier_nobody
3561	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3562	\| ptrref_operator cfa_abstract_function
3563	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3564	\| type_qualifier_list ptrref_operator cfa_abstract_function
3565	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3566	\| ptrref_operator cfa_identifier_parameter_declarator_tuple
3567	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3568	\| type_qualifier_list ptrref_operator cfa_identifier_parameter_declarator_tuple
3569	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3570	;
3571
3572	cfa_identifier_parameter_array: // CFA
3573	// Only the first dimension can be empty or have qualifiers. Empty dimension must be factored out due to
3574	// shift/reduce conflict with new-style empty (void) function return type.
3575	'[' ']' type_specifier_nobody
3576	{ $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3577	\| cfa_array_parameter_1st_dimension type_specifier_nobody
3578	{ $$ = $2->addNewArray( $1 ); }
3579	\| '[' ']' multi_array_dimension type_specifier_nobody
3580	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3581	\| cfa_array_parameter_1st_dimension multi_array_dimension type_specifier_nobody
3582	{ $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
3583	\| multi_array_dimension type_specifier_nobody
3584	{ $$ = $2->addNewArray( $1 ); }
3585
3586	\| '[' ']' cfa_identifier_parameter_ptr
3587	{ $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3588	\| cfa_array_parameter_1st_dimension cfa_identifier_parameter_ptr
3589	{ $$ = $2->addNewArray( $1 ); }
3590	\| '[' ']' multi_array_dimension cfa_identifier_parameter_ptr
3591	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3592	\| cfa_array_parameter_1st_dimension multi_array_dimension cfa_identifier_parameter_ptr
3593	{ $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
3594	\| multi_array_dimension cfa_identifier_parameter_ptr
3595	{ $$ = $2->addNewArray( $1 ); }
3596	;
3597
3598	cfa_array_parameter_1st_dimension:
3599	'[' push type_qualifier_list '*' pop ']' // remaining C99
3600	{ $$ = DeclarationNode::newVarArray( $3 ); }
3601	\| '[' push type_qualifier_list assignment_expression pop ']'
3602	{ $$ = DeclarationNode::newArray( $4, $3, false ); }
3603	\| '[' push declaration_qualifier_list assignment_expression pop ']'
3604	// declaration_qualifier_list must be used because of shift/reduce conflict with
3605	// assignment_expression, so a semantic check is necessary to preclude them as a type_qualifier cannot
3606	// appear in this context.
3607	{ $$ = DeclarationNode::newArray( $4, $3, true ); }
3608	\| '[' push declaration_qualifier_list type_qualifier_list assignment_expression pop ']'
3609	{ $$ = DeclarationNode::newArray( $5, $4->addQualifiers( $3 ), true ); }
3610	;
3611
3612	// This pattern parses a new-style declaration of an abstract variable or function prototype, i.e., there is no
3613	// identifier to which the type applies, e.g.:
3614	//
3615	// [int] f( int ); // abstract variable parameter; no parameter name specified
3616	// [int] f( [int] (int) ); // abstract function-prototype parameter; no parameter name specified
3617	//
3618	// These rules need LR(3):
3619	//
3620	// cfa_abstract_tuple identifier_or_type_name
3621	// '[' cfa_parameter_list ']' identifier_or_type_name '(' cfa_parameter_ellipsis_list_opt ')'
3622	//
3623	// since a function return type can be syntactically identical to a tuple type:
3624	//
3625	// [int, int] t;
3626	// [int, int] f( int );
3627	//
3628	// Therefore, it is necessary to look at the token after identifier_or_type_name to know when to reduce
3629	// cfa_abstract_tuple. To make this LR(1), several rules have to be flattened (lengthened) to allow the necessary
3630	// lookahead. To accomplish this, cfa_abstract_declarator has an entry point without tuple, and tuple declarations are
3631	// duplicated when appearing with cfa_function_specifier.
3632
3633	cfa_abstract_declarator_tuple: // CFA
3634	cfa_abstract_tuple
3635	\| type_qualifier_list cfa_abstract_tuple
3636	{ $$ = $2->addQualifiers( $1 ); }
3637	\| cfa_abstract_declarator_no_tuple
3638	;
3639
3640	cfa_abstract_declarator_no_tuple: // CFA
3641	cfa_abstract_ptr
3642	\| cfa_abstract_array
3643	;
3644
3645	cfa_abstract_ptr: // CFA
3646	ptrref_operator type_specifier
3647	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3648	\| type_qualifier_list ptrref_operator type_specifier
3649	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3650	\| ptrref_operator cfa_abstract_function
3651	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3652	\| type_qualifier_list ptrref_operator cfa_abstract_function
3653	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3654	\| ptrref_operator cfa_abstract_declarator_tuple
3655	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3656	\| type_qualifier_list ptrref_operator cfa_abstract_declarator_tuple
3657	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3658	;
3659
3660	cfa_abstract_array: // CFA
3661	// Only the first dimension can be empty. Empty dimension must be factored out due to shift/reduce conflict with
3662	// empty (void) function return type.
3663	'[' ']' type_specifier
3664	{ $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3665	\| '[' ']' multi_array_dimension type_specifier
3666	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3667	\| multi_array_dimension type_specifier
3668	{ $$ = $2->addNewArray( $1 ); }
3669	\| '[' ']' cfa_abstract_ptr
3670	{ $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3671	\| '[' ']' multi_array_dimension cfa_abstract_ptr
3672	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3673	\| multi_array_dimension cfa_abstract_ptr
3674	{ $$ = $2->addNewArray( $1 ); }
3675	;
3676
3677	cfa_abstract_tuple: // CFA
3678	'[' push cfa_abstract_parameter_list pop ']'
3679	{ $$ = DeclarationNode::newTuple( $3 ); }
3680	\| '[' push type_specifier_nobody ELLIPSIS pop ']'
3681	{ SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
3682	\| '[' push type_specifier_nobody ELLIPSIS constant_expression pop ']'
3683	{ SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
3684	;
3685
3686	cfa_abstract_function: // CFA
3687	// '[' ']' '(' cfa_parameter_ellipsis_list_opt ')'
3688	// { $$ = DeclarationNode::newFunction( nullptr, DeclarationNode::newTuple( nullptr ), $4, nullptr ); }
3689	cfa_abstract_tuple '(' push cfa_parameter_ellipsis_list_opt pop ')'
3690	{ $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
3691	\| cfa_function_return '(' push cfa_parameter_ellipsis_list_opt pop ')'
3692	{ $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
3693	;
3694
3695	// 1) ISO/IEC 9899:1999 Section 6.7.2(2) : "At least one type specifier shall be given in the declaration specifiers in
3696	// each declaration, and in the specifier-qualifier list in each structure declaration and type name."
3697	//
3698	// 2) ISO/IEC 9899:1999 Section 6.11.5(1) : "The placement of a storage-class specifier other than at the beginning of
3699	// the declaration specifiers in a declaration is an obsolescent feature."
3700	//
3701	// 3) ISO/IEC 9899:1999 Section 6.11.6(1) : "The use of function declarators with empty parentheses (not
3702	// prototype-format parameter type declarators) is an obsolescent feature."
3703	//
3704	// 4) ISO/IEC 9899:1999 Section 6.11.7(1) : "The use of function definitions with separate parameter identifier and
3705	// declaration lists (not prototype-format parameter type and identifier declarators) is an obsolescent feature.
3706
3707	//*********************** MISCELLANEOUS ******************************
3708
3709	comma_opt: // redundant comma
3710	// empty
3711	\| ','
3712	;
3713
3714	default_initializer_opt:
3715	// empty
3716	{ $$ = nullptr; }
3717	\| '=' assignment_expression
3718	{ $$ = $2; }
3719	;
3720
3721	%%
3722
3723	// ----end of grammar----
3724
3725	// Local Variables: //
3726	// mode: c++ //
3727	// tab-width: 4 //
3728	// compile-command: "make install" //
3729	// End: //

Note: See TracBrowser for help on using the repository browser.

Download in other formats:

Original Format