Context Navigation

parser.yy @ 4c6ba5a

ADTast-experimental

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

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

Download in other formats:

Original Format