Context Navigation

parser.yy @ 569b118

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

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

Download in other formats:

Original Format