Context Navigation

parser.yy @ b1ad41f

ADTast-experimental

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

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

Download in other formats:

Original Format