Context Navigation

parser.yy @ 836cf647

ADTast-experimentalpthread-emulation

Last change on this file since 836cf647 was ed9a1ae, checked in by Thierry Delisle <tdelisle@…>, 22 months ago
Cfa now distinguishes between thread and _Thread_local.
Property mode set to `100644`
File size: 160.8 KB

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

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

Download in other formats:

Original Format