Context Navigation

parser.yy @ 36e120a

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

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

Download in other formats:

Original Format