Context Navigation

parser.yy

Last change on this file was 1a8b17a, checked in by Peter A. Buhr <pabuhr@…>, 9 days ago
add C23 attributes, require comma terminator for nullary and unary tuple (optional terminator for Nary tuples), change designator to C syntax using equal rather than colon
Property mode set to `100644`
File size: 179.3 KB

Line
1	//
2	// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3	//
4	// The contents of this file are covered under the licence agreement in the
5	// file "LICENCE" distributed with Cforall.
6	//
7	// parser.yy --
8	//
9	// Author : Peter A. Buhr
10	// Created On : Sat Sep 1 20:22:55 2001
11	// Last Modified By : Peter A. Buhr
12	// Last Modified On : Sun Oct 13 12:18:15 2024
13	// Update Count : 6845
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 C23_ATTRIBUTE
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( yylloc, nullptr ) ); }
1173	\| '[' assignment_expression ',' ']'
1174	{ $$ = new ExpressionNode( build_tuple( yylloc, $2 ) ); }
1175	\| '[' '@' comma_opt ']'
1176	{ SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
1177	\| '[' assignment_expression ',' tuple_expression_list comma_opt ']'
1178	{ $$ = new ExpressionNode( build_tuple( yylloc, $2->set_last( $4 ) ) ); }
1179	\| '[' '@' ',' tuple_expression_list comma_opt ']'
1180	{ SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
1181	;
1182
1183	tuple_expression_list:
1184	assignment_expression
1185	\| '@' // CFA
1186	{ SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
1187	\| tuple_expression_list ',' assignment_expression
1188	{ $$ = $1->set_last( $3 ); }
1189	\| tuple_expression_list ',' '@'
1190	{ SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
1191	;
1192
1193	comma_expression:
1194	assignment_expression
1195	\| comma_expression ',' assignment_expression
1196	{ $$ = new ExpressionNode( new ast::CommaExpr( yylloc, maybeMoveBuild( $1 ), maybeMoveBuild( $3 ) ) ); }
1197	;
1198
1199	comma_expression_opt:
1200	// empty
1201	{ $$ = nullptr; }
1202	\| comma_expression
1203	;
1204
1205	// ************************ STATEMENTS *****************************
1206
1207	statement:
1208	labeled_statement
1209	\| compound_statement
1210	\| expression_statement
1211	\| selection_statement
1212	\| iteration_statement
1213	\| jump_statement
1214	\| with_statement
1215	\| mutex_statement
1216	\| waitfor_statement
1217	\| waituntil_statement
1218	\| corun_statement
1219	\| cofor_statement
1220	\| exception_statement
1221	\| enable_disable_statement
1222	{ SemanticError( yylloc, "enable/disable statement is currently unimplemented." ); $$ = nullptr; }
1223	\| asm_statement
1224	\| DIRECTIVE
1225	{ $$ = new StatementNode( build_directive( yylloc, $1 ) ); }
1226	;
1227
1228	labeled_statement:
1229	// labels cannot be identifiers 0 or 1
1230	identifier_or_type_name ':' attribute_list_opt statement
1231	{ $$ = $4->add_label( yylloc, $1, $3 ); }
1232	\| identifier_or_type_name ':' attribute_list_opt error // invalid syntax rule
1233	{
1234	SemanticError( yylloc, "syntx error, label \"%s\" must be associated with a statement, "
1235	"where a declaration, case, or default is not a statement.\n"
1236	"Move the label or terminate with a semicolon.", $1.str->c_str() );
1237	$$ = nullptr;
1238	}
1239	;
1240
1241	compound_statement:
1242	'{' '}'
1243	{ $$ = new StatementNode( build_compound( yylloc, (StatementNode *)0 ) ); }
1244	\| '{' push
1245	local_label_declaration_opt // GCC, local labels appear at start of block
1246	statement_decl_list // C99, intermix declarations and statements
1247	pop '}'
1248	{ $$ = new StatementNode( build_compound( yylloc, $4 ) ); }
1249	;
1250
1251	statement_decl_list: // C99
1252	statement_decl
1253	\| statement_decl_list statement_decl
1254	{ assert( $1 ); $1->set_last( $2 ); $$ = $1; }
1255	;
1256
1257	statement_decl:
1258	declaration // CFA, new & old style declarations
1259	{ $$ = new StatementNode( $1 ); }
1260	\| EXTENSION declaration // GCC
1261	{ distExt( $2 ); $$ = new StatementNode( $2 ); }
1262	\| function_definition
1263	{ $$ = new StatementNode( $1 ); }
1264	\| EXTENSION function_definition // GCC
1265	{ distExt( $2 ); $$ = new StatementNode( $2 ); }
1266	\| statement
1267	;
1268
1269	statement_list_nodecl:
1270	statement
1271	\| statement_list_nodecl statement
1272	{ assert( $1 ); $1->set_last( $2 ); $$ = $1; }
1273	\| statement_list_nodecl error // invalid syntax rule
1274	{ SemanticError( yylloc, "illegal syntax, declarations only allowed at the start of the switch body,"
1275	" i.e., after the '{'." ); $$ = nullptr; }
1276	;
1277
1278	expression_statement:
1279	comma_expression_opt ';'
1280	{ $$ = new StatementNode( build_expr( yylloc, $1 ) ); }
1281	;
1282
1283	// "if", "switch", and "choose" require parenthesis around the conditional. See the following ambiguities without
1284	// parenthesis:
1285	//
1286	// if x + y + z; => if ( x ) + y + z or if ( x + y ) + z
1287	//
1288	// switch O { }
1289	//
1290	// O{} => object-constructor for conditional, switch body ???
1291	// O{} => O for conditional followed by switch body
1292	//
1293	// C++ has this problem, as it has the same constructor syntax.
1294	//
1295	// switch sizeof ( T ) { }
1296	//
1297	// sizeof ( T ) => sizeof of T for conditional followed by switch body
1298	// sizeof ( T ) => sizeof of compound literal (T){ }, closing parenthesis ???
1299	//
1300	// Note the two grammar rules for sizeof (alignof)
1301	//
1302	// \| SIZEOF unary_expression
1303	// \| SIZEOF '(' type_no_function ')'
1304	//
1305	// where the first DOES NOT require parenthesis! And C++ inherits this problem from C.
1306
1307	selection_statement:
1308	IF '(' conditional_declaration ')' statement %prec THEN
1309	// explicitly deal with the shift/reduce conflict on if/else
1310	{ $$ = new StatementNode( build_if( yylloc, $3, maybe_build_compound( yylloc, $5 ), nullptr ) ); }
1311	\| IF '(' conditional_declaration ')' statement ELSE statement
1312	{ $$ = new StatementNode( build_if( yylloc, $3, maybe_build_compound( yylloc, $5 ), maybe_build_compound( yylloc, $7 ) ) ); }
1313	\| SWITCH '(' comma_expression ')' case_clause
1314	{ $$ = new StatementNode( build_switch( yylloc, true, $3, $5 ) ); }
1315	\| SWITCH '(' comma_expression ')' '{' push declaration_list_opt switch_clause_list_opt pop '}' // CFA
1316	{
1317	StatementNode *sw = new StatementNode( build_switch( yylloc, true, $3, $8 ) );
1318	// The semantics of the declaration list is changed to include associated initialization, which is performed
1319	// before the transfer to the appropriate case clause by hoisting the declarations into a compound
1320	// statement around the switch. Statements after the initial declaration list can never be executed, and
1321	// therefore, are removed from the grammar even though C allows it. The change also applies to choose
1322	// statement.
1323	$$ = $7 ? new StatementNode( build_compound( yylloc, (new StatementNode( $7 ))->set_last( sw ) ) ) : sw;
1324	}
1325	\| SWITCH '(' comma_expression ')' '{' error '}' // CFA, invalid syntax rule error
1326	{ SemanticError( yylloc, "synatx error, declarations can only appear before the list of case clauses." ); $$ = nullptr; }
1327	\| CHOOSE '(' comma_expression ')' case_clause // CFA
1328	{ $$ = new StatementNode( build_switch( yylloc, false, $3, $5 ) ); }
1329	\| CHOOSE '(' comma_expression ')' '{' push declaration_list_opt switch_clause_list_opt pop '}' // CFA
1330	{
1331	StatementNode *sw = new StatementNode( build_switch( yylloc, false, $3, $8 ) );
1332	$$ = $7 ? new StatementNode( build_compound( yylloc, (new StatementNode( $7 ))->set_last( sw ) ) ) : sw;
1333	}
1334	\| CHOOSE '(' comma_expression ')' '{' error '}' // CFA, invalid syntax rule
1335	{ SemanticError( yylloc, "illegal syntax, declarations can only appear before the list of case clauses." ); $$ = nullptr; }
1336	;
1337
1338	conditional_declaration:
1339	comma_expression
1340	{ $$ = new CondCtrl( nullptr, $1 ); }
1341	\| c_declaration // no semi-colon
1342	{ $$ = new CondCtrl( $1, nullptr ); }
1343	\| cfa_declaration // no semi-colon
1344	{ $$ = new CondCtrl( $1, nullptr ); }
1345	\| declaration comma_expression // semi-colon separated
1346	{ $$ = new CondCtrl( $1, $2 ); }
1347	;
1348
1349	// CASE and DEFAULT clauses are only allowed in the SWITCH statement, precluding Duff's device. In addition, a case
1350	// clause allows a list of values and subranges.
1351
1352	case_value: // CFA
1353	constant_expression { $$ = $1; }
1354	\| constant_expression ELLIPSIS constant_expression // GCC, subrange
1355	{ $$ = new ExpressionNode( new ast::RangeExpr( yylloc, maybeMoveBuild( $1 ), maybeMoveBuild( $3 ) ) ); }
1356	\| subrange // CFA, subrange
1357	;
1358
1359	case_value_list: // CFA
1360	case_value { $$ = new ClauseNode( build_case( yylloc, $1 ) ); }
1361	// convert case list, e.g., "case 1, 3, 5:" into "case 1: case 3: case 5"
1362	\| case_value_list ',' case_value { $$ = $1->set_last( new ClauseNode( build_case( yylloc, $3 ) ) ); }
1363	;
1364
1365	case_label: // CFA
1366	CASE error // invalid syntax rule
1367	{ SemanticError( yylloc, "illegal syntax, case list missing after case." ); $$ = nullptr; }
1368	\| CASE case_value_list ':' { $$ = $2; }
1369	\| CASE case_value_list error // invalid syntax rule
1370	{ SemanticError( yylloc, "illegal syntax, colon missing after case list." ); $$ = nullptr; }
1371	\| DEFAULT ':' { $$ = new ClauseNode( build_default( yylloc ) ); }
1372	// A semantic check is required to ensure only one default clause per switch/choose statement.
1373	\| DEFAULT error // invalid syntax rule
1374	{ SemanticError( yylloc, "illegal syntax, colon missing after default." ); $$ = nullptr; }
1375	;
1376
1377	case_label_list: // CFA
1378	case_label
1379	\| case_label_list case_label { $$ = $1->set_last( $2 ); }
1380	;
1381
1382	case_clause: // CFA
1383	case_label_list statement { $$ = $1->append_last_case( maybe_build_compound( yylloc, $2 ) ); }
1384	;
1385
1386	switch_clause_list_opt: // CFA
1387	// empty
1388	{ $$ = nullptr; }
1389	\| switch_clause_list
1390	;
1391
1392	switch_clause_list: // CFA
1393	case_label_list statement_list_nodecl
1394	{ $$ = $1->append_last_case( new StatementNode( build_compound( yylloc, $2 ) ) ); }
1395	\| switch_clause_list case_label_list statement_list_nodecl
1396	{ $$ = $1->set_last( $2->append_last_case( new StatementNode( build_compound( yylloc, $3 ) ) ) ); }
1397	;
1398
1399	iteration_statement:
1400	WHILE '(' ')' statement %prec THEN // CFA => while ( 1 )
1401	{ $$ = new StatementNode( build_while( yylloc, new CondCtrl( nullptr, NEW_ONE ), maybe_build_compound( yylloc, $4 ) ) ); }
1402	\| WHILE '(' ')' statement ELSE statement // CFA
1403	{
1404	$$ = new StatementNode( build_while( yylloc, new CondCtrl( nullptr, NEW_ONE ), maybe_build_compound( yylloc, $4 ) ) );
1405	SemanticWarning( yylloc, Warning::SuperfluousElse );
1406	}
1407	\| WHILE '(' conditional_declaration ')' statement %prec THEN
1408	{ $$ = new StatementNode( build_while( yylloc, $3, maybe_build_compound( yylloc, $5 ) ) ); }
1409	\| WHILE '(' conditional_declaration ')' statement ELSE statement // CFA
1410	{ $$ = new StatementNode( build_while( yylloc, $3, maybe_build_compound( yylloc, $5 ), $7 ) ); }
1411	\| DO statement WHILE '(' ')' ';' // CFA => do while( 1 )
1412	{ $$ = new StatementNode( build_do_while( yylloc, NEW_ONE, maybe_build_compound( yylloc, $2 ) ) ); }
1413	\| DO statement WHILE '(' ')' ELSE statement // CFA
1414	{
1415	$$ = new StatementNode( build_do_while( yylloc, NEW_ONE, maybe_build_compound( yylloc, $2 ) ) );
1416	SemanticWarning( yylloc, Warning::SuperfluousElse );
1417	}
1418	\| DO statement WHILE '(' comma_expression ')' ';'
1419	{ $$ = new StatementNode( build_do_while( yylloc, $5, maybe_build_compound( yylloc, $2 ) ) ); }
1420	\| DO statement WHILE '(' comma_expression ')' ELSE statement // CFA
1421	{ $$ = new StatementNode( build_do_while( yylloc, $5, maybe_build_compound( yylloc, $2 ), $8 ) ); }
1422	\| FOR '(' ')' statement %prec THEN // CFA => for ( ;; )
1423	{ $$ = new StatementNode( build_for( yylloc, new ForCtrl( nullptr, nullptr, nullptr ), maybe_build_compound( yylloc, $4 ) ) ); }
1424	\| FOR '(' ')' statement ELSE statement // CFA
1425	{
1426	$$ = new StatementNode( build_for( yylloc, new ForCtrl( nullptr, nullptr, nullptr ), maybe_build_compound( yylloc, $4 ) ) );
1427	SemanticWarning( yylloc, Warning::SuperfluousElse );
1428	}
1429	\| FOR '(' for_control_expression_list ')' statement %prec THEN
1430	{ $$ = new StatementNode( build_for( yylloc, $3, maybe_build_compound( yylloc, $5 ) ) ); }
1431	\| FOR '(' for_control_expression_list ')' statement ELSE statement // CFA
1432	{ $$ = new StatementNode( build_for( yylloc, $3, maybe_build_compound( yylloc, $5 ), $7 ) ); }
1433	;
1434
1435	for_control_expression_list:
1436	for_control_expression
1437	\| for_control_expression_list ':' for_control_expression
1438	// ForCtrl + ForCtrl:
1439	// init + init => multiple declaration statements that are hoisted
1440	// condition + condition => (expression) && (expression)
1441	// change + change => (expression), (expression)
1442	{
1443	$1->init->set_last( $3->init );
1444	if ( $1->condition ) {
1445	if ( $3->condition ) {
1446	$1->condition->expr.reset( new ast::LogicalExpr( yylloc, $1->condition->expr.release(), $3->condition->expr.release(), ast::AndExpr ) );
1447	} // if
1448	} else $1->condition = $3->condition;
1449	if ( $1->change ) {
1450	if ( $3->change ) {
1451	$1->change->expr.reset( new ast::CommaExpr( yylloc, $1->change->expr.release(), $3->change->expr.release() ) );
1452	} // if
1453	} else $1->change = $3->change;
1454	$$ = $1;
1455	}
1456	;
1457
1458	for_control_expression:
1459	';' comma_expression_opt ';' comma_expression_opt
1460	{ $$ = new ForCtrl( nullptr, $2, $4 ); }
1461	\| comma_expression ';' comma_expression_opt ';' comma_expression_opt
1462	{
1463	$$ = new ForCtrl( $1 ? new StatementNode( new ast::ExprStmt( yylloc, maybeMoveBuild( $1 ) ) ) : nullptr, $3, $5 );
1464	}
1465	\| declaration comma_expression_opt ';' comma_expression_opt // C99, declaration has ';'
1466	{ $$ = new ForCtrl( new StatementNode( $1 ), $2, $4 ); }
1467
1468	\| '@' ';' comma_expression // CFA, empty loop-index
1469	{ $$ = new ForCtrl( nullptr, $3, nullptr ); }
1470	\| '@' ';' comma_expression ';' comma_expression // CFA, empty loop-index
1471	{ $$ = new ForCtrl( nullptr, $3, $5 ); }
1472
1473	\| comma_expression // CFA, anonymous loop-index
1474	{ $$ = forCtrl( yylloc, $1, new string( DeclarationNode::anonymous.newName() ), NEW_ZERO, OperKinds::LThan, $1->clone(), NEW_ONE ); }
1475	\| downupdowneq comma_expression // CFA, anonymous loop-index
1476	{ $$ = forCtrl( yylloc, $2, new string( DeclarationNode::anonymous.newName() ), UPDOWN( $1, NEW_ZERO, $2->clone() ), $1, UPDOWN( $1, $2->clone(), NEW_ZERO ), NEW_ONE ); }
1477
1478	\| comma_expression updowneq comma_expression // CFA, anonymous loop-index
1479	{ $$ = forCtrl( yylloc, $1, new string( DeclarationNode::anonymous.newName() ), UPDOWN( $2, $1->clone(), $3 ), $2, UPDOWN( $2, $3->clone(), $1->clone() ), NEW_ONE ); }
1480	\| '@' updowneq comma_expression // CFA, anonymous loop-index
1481	{
1482	if ( $2 == OperKinds::LThan \|\| $2 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1483	else $$ = forCtrl( yylloc, $3, new string( DeclarationNode::anonymous.newName() ), $3->clone(), $2, nullptr, NEW_ONE );
1484	}
1485	\| comma_expression updowneq '@' // CFA, anonymous loop-index
1486	{
1487	if ( $2 == OperKinds::LThan \|\| $2 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1488	else { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1489	}
1490	\| comma_expression updowneq comma_expression '~' comma_expression // CFA, anonymous loop-index
1491	{ $$ = forCtrl( yylloc, $1, new string( DeclarationNode::anonymous.newName() ), UPDOWN( $2, $1->clone(), $3 ), $2, UPDOWN( $2, $3->clone(), $1->clone() ), $5 ); }
1492	\| '@' updowneq comma_expression '~' comma_expression // CFA, anonymous loop-index
1493	{
1494	if ( $2 == OperKinds::LThan \|\| $2 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1495	else $$ = forCtrl( yylloc, $3, new string( DeclarationNode::anonymous.newName() ), $3->clone(), $2, nullptr, $5 );
1496	}
1497	\| comma_expression updowneq '@' '~' comma_expression // CFA, anonymous loop-index
1498	{
1499	if ( $2 == OperKinds::LThan \|\| $2 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1500	else { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1501	}
1502	\| comma_expression updowneq comma_expression '~' '@' // CFA, invalid syntax rule
1503	{ SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1504	\| '@' updowneq '@' // CFA, invalid syntax rule
1505	{ SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1506	\| '@' updowneq comma_expression '~' '@' // CFA, invalid syntax rule
1507	{ SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1508	\| comma_expression updowneq '@' '~' '@' // CFA, invalid syntax rule
1509	{ SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1510	\| '@' updowneq '@' '~' '@' // CFA, invalid syntax rule
1511	{ SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1512
1513	// These rules accept a comma_expression for the initialization, when only an identifier is correct. Being
1514	// permissive allows for a better error message from forCtrl.
1515	\| comma_expression ';' comma_expression // CFA
1516	{ $$ = forCtrl( yylloc, $3, $1, NEW_ZERO, OperKinds::LThan, $3->clone(), NEW_ONE ); }
1517	\| comma_expression ';' downupdowneq comma_expression // CFA
1518	{ $$ = forCtrl( yylloc, $4, $1, UPDOWN( $3, NEW_ZERO, $4->clone() ), $3, UPDOWN( $3, $4->clone(), NEW_ZERO ), NEW_ONE ); }
1519
1520	\| comma_expression ';' comma_expression updowneq comma_expression // CFA
1521	{ $$ = forCtrl( yylloc, $3, $1, UPDOWN( $4, $3->clone(), $5 ), $4, UPDOWN( $4, $5->clone(), $3->clone() ), NEW_ONE ); }
1522	\| comma_expression ';' '@' updowneq comma_expression // CFA
1523	{
1524	if ( $4 == OperKinds::LThan \|\| $4 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1525	else $$ = forCtrl( yylloc, $5, $1, $5->clone(), $4, nullptr, NEW_ONE );
1526	}
1527	\| comma_expression ';' comma_expression updowneq '@' // CFA
1528	{
1529	if ( $4 == OperKinds::GThan \|\| $4 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1530	else if ( $4 == OperKinds::LEThan ) { SemanticError( yylloc, "illegal syntax, equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1531	else $$ = forCtrl( yylloc, $3, $1, $3->clone(), $4, nullptr, NEW_ONE );
1532	}
1533	\| comma_expression ';' '@' updowneq '@' // CFA, invalid syntax rule
1534	{ SemanticError( yylloc, "illegal syntax, missing low/high value for ascending/descending range so index is uninitialized." ); $$ = nullptr; }
1535
1536	\| comma_expression ';' comma_expression updowneq comma_expression '~' comma_expression // CFA
1537	{ $$ = forCtrl( yylloc, $3, $1, UPDOWN( $4, $3->clone(), $5 ), $4, UPDOWN( $4, $5->clone(), $3->clone() ), $7 ); }
1538	\| comma_expression ';' '@' updowneq comma_expression '~' comma_expression // CFA, invalid syntax rule
1539	{
1540	if ( $4 == OperKinds::LThan \|\| $4 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1541	else $$ = forCtrl( yylloc, $5, $1, $5->clone(), $4, nullptr, $7 );
1542	}
1543	\| comma_expression ';' comma_expression updowneq '@' '~' comma_expression // CFA
1544	{
1545	if ( $4 == OperKinds::GThan \|\| $4 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1546	else if ( $4 == OperKinds::LEThan ) { SemanticError( yylloc, "illegal syntax, equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1547	else $$ = forCtrl( yylloc, $3, $1, $3->clone(), $4, nullptr, $7 );
1548	}
1549	\| comma_expression ';' comma_expression updowneq comma_expression '~' '@' // CFA
1550	{ $$ = forCtrl( yylloc, $3, $1, UPDOWN( $4, $3->clone(), $5 ), $4, UPDOWN( $4, $5->clone(), $3->clone() ), nullptr ); }
1551	\| comma_expression ';' '@' updowneq comma_expression '~' '@' // CFA, invalid syntax rule
1552	{
1553	if ( $4 == OperKinds::LThan \|\| $4 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1554	else $$ = forCtrl( yylloc, $5, $1, $5->clone(), $4, nullptr, nullptr );
1555	}
1556	\| comma_expression ';' comma_expression updowneq '@' '~' '@' // CFA
1557	{
1558	if ( $4 == OperKinds::GThan \|\| $4 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1559	else if ( $4 == OperKinds::LEThan ) { SemanticError( yylloc, "illegal syntax, equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1560	else $$ = forCtrl( yylloc, $3, $1, $3->clone(), $4, nullptr, nullptr );
1561	}
1562	\| comma_expression ';' '@' updowneq '@' '~' '@' // CFA
1563	{ SemanticError( yylloc, "illegal syntax, missing low/high value for ascending/descending range so index is uninitialized." ); $$ = nullptr; }
1564
1565	// \| '@' identifier ';' comma_expression // CFA
1566	\| declaration comma_expression // CFA
1567	{ $$ = forCtrl( yylloc, $1, NEW_ZERO, OperKinds::LThan, $2, NEW_ONE ); }
1568	\| declaration downupdowneq comma_expression // CFA
1569	{ $$ = forCtrl( yylloc, $1, UPDOWN( $2, NEW_ZERO, $3 ), $2, UPDOWN( $2, $3->clone(), NEW_ZERO ), NEW_ONE ); }
1570
1571	\| declaration comma_expression updowneq comma_expression // CFA
1572	{ $$ = forCtrl( yylloc, $1, UPDOWN( $3, $2->clone(), $4 ), $3, UPDOWN( $3, $4->clone(), $2->clone() ), NEW_ONE ); }
1573	\| declaration '@' updowneq comma_expression // CFA
1574	{
1575	if ( $3 == OperKinds::LThan \|\| $3 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1576	else $$ = forCtrl( yylloc, $1, $4, $3, nullptr, NEW_ONE );
1577	}
1578	\| declaration comma_expression updowneq '@' // CFA
1579	{
1580	if ( $3 == OperKinds::GThan \|\| $3 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1581	else if ( $3 == OperKinds::LEThan ) { SemanticError( yylloc, "illegal syntax, equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1582	else $$ = forCtrl( yylloc, $1, $2, $3, nullptr, NEW_ONE );
1583	}
1584
1585	\| declaration comma_expression updowneq comma_expression '~' comma_expression // CFA
1586	{ $$ = forCtrl( yylloc, $1, UPDOWN( $3, $2, $4 ), $3, UPDOWN( $3, $4->clone(), $2->clone() ), $6 ); }
1587	\| declaration '@' updowneq comma_expression '~' comma_expression // CFA
1588	{
1589	if ( $3 == OperKinds::LThan \|\| $3 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1590	else $$ = forCtrl( yylloc, $1, $4, $3, nullptr, $6 );
1591	}
1592	\| declaration comma_expression updowneq '@' '~' comma_expression // CFA
1593	{
1594	if ( $3 == OperKinds::GThan \|\| $3 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1595	else if ( $3 == OperKinds::LEThan ) { SemanticError( yylloc, "illegal syntax, equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1596	else $$ = forCtrl( yylloc, $1, $2, $3, nullptr, $6 );
1597	}
1598	\| declaration comma_expression updowneq comma_expression '~' '@' // CFA
1599	{ $$ = forCtrl( yylloc, $1, UPDOWN( $3, $2, $4 ), $3, UPDOWN( $3, $4->clone(), $2->clone() ), nullptr ); }
1600	\| declaration '@' updowneq comma_expression '~' '@' // CFA
1601	{
1602	if ( $3 == OperKinds::LThan \|\| $3 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1603	else $$ = forCtrl( yylloc, $1, $4, $3, nullptr, nullptr );
1604	}
1605	\| declaration comma_expression updowneq '@' '~' '@' // CFA
1606	{
1607	if ( $3 == OperKinds::GThan \|\| $3 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1608	else if ( $3 == OperKinds::LEThan ) { SemanticError( yylloc, "illegal syntax, equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1609	else $$ = forCtrl( yylloc, $1, $2, $3, nullptr, nullptr );
1610	}
1611	\| declaration '@' updowneq '@' '~' '@' // CFA, invalid syntax rule
1612	{ SemanticError( yylloc, "illegal syntax, missing low/high value for ascending/descending range so index is uninitialized." ); $$ = nullptr; }
1613
1614	\| comma_expression ';' type_type_specifier // CFA, enum type
1615	{
1616	$$ = enumRangeCtrl( $1, OperKinds::LEThan, new ExpressionNode( new ast::TypeExpr( yylloc, $3->clone()->buildType() ) ), $3 );
1617	}
1618	\| comma_expression ';' downupdowneq enum_key // CFA, enum type, reverse direction
1619	{
1620	if ( $3 == OperKinds::GThan ) {
1621	SemanticError( yylloc, "all enumeration ranges are equal (all values). Add an equal, e.g., ~=, -~=." ); $$ = nullptr;
1622	$3 = OperKinds::GEThan;
1623	} // if
1624	$$ = enumRangeCtrl( $1, $3, new ExpressionNode( new ast::TypeExpr( yylloc, $4->clone()->buildType() ) ), $4 );
1625	}
1626	;
1627
1628	enum_key:
1629	type_name
1630	{
1631	typedefTable.makeTypedef( *$1->symbolic.name, "enum_type_nobody 1" );
1632	$$ = DeclarationNode::newEnum( $1->symbolic.name, nullptr, false, false );
1633	}
1634	\| ENUM identifier
1635	{
1636	typedefTable.makeTypedef( *$2, "enum_type_nobody 2" );
1637	$$ = DeclarationNode::newEnum( $2, nullptr, false, false );
1638	}
1639	\| ENUM type_name
1640	{
1641	typedefTable.makeTypedef( *$2->symbolic.name, "enum_type_nobody 3" );
1642	$$ = DeclarationNode::newEnum( $2->symbolic.name, nullptr, false, false );
1643	}
1644	;
1645
1646	// This rule exists to handle the ambiguity with unary operator '~'. The rule is the same as updowneq minus the '~'.
1647	// Specifically, "for ( ~5 )" means the complement of 5, not loop 0..4. Hence, in this case "for ( ~= 5 )", i.e., 0..5,
1648	// it is not possible to just remove the '='. The entire '~=' must be removed.
1649	downupdowneq:
1650	ErangeUp
1651	{ $$ = OperKinds::LThan; }
1652	\| ErangeDown
1653	{ $$ = OperKinds::GThan; }
1654	\| ErangeUpEq
1655	{ $$ = OperKinds::LEThan; }
1656	\| ErangeDownEq
1657	{ $$ = OperKinds::GEThan; }
1658	;
1659
1660	updown:
1661	'~' // shorthand 0 ~ 10 => 0 +~ 10
1662	{ $$ = OperKinds::LThan; }
1663	\| ErangeUp
1664	{ $$ = OperKinds::LThan; }
1665	\| ErangeDown
1666	{ $$ = OperKinds::GThan; }
1667	;
1668
1669	updowneq:
1670	updown
1671	\| ErangeUpEq
1672	{ $$ = OperKinds::LEThan; }
1673	\| ErangeDownEq
1674	{ $$ = OperKinds::GEThan; }
1675	;
1676
1677	jump_statement:
1678	GOTO identifier_or_type_name ';'
1679	{ $$ = new StatementNode( build_branch( yylloc, $2, ast::BranchStmt::Goto ) ); }
1680	\| GOTO '*' comma_expression ';' // GCC, computed goto
1681	// The syntax for the GCC computed goto violates normal expression precedence, e.g., goto i+3; => goto (i+3);
1682	// whereas normal operator precedence yields goto (*i)+3;
1683	{ $$ = new StatementNode( build_computedgoto( $3 ) ); }
1684	// A semantic check is required to ensure fallthru appears only in the body of a choose statement.
1685	\| fall_through_name ';' // CFA
1686	{ $$ = new StatementNode( build_branch( yylloc, ast::BranchStmt::FallThrough ) ); }
1687	\| fall_through_name identifier_or_type_name ';' // CFA
1688	{ $$ = new StatementNode( build_branch( yylloc, $2, ast::BranchStmt::FallThrough ) ); }
1689	\| fall_through_name DEFAULT ';' // CFA
1690	{ $$ = new StatementNode( build_branch( yylloc, ast::BranchStmt::FallThroughDefault ) ); }
1691	\| CONTINUE ';'
1692	// A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1693	{ $$ = new StatementNode( build_branch( yylloc, ast::BranchStmt::Continue ) ); }
1694	\| CONTINUE identifier_or_type_name ';' // CFA, multi-level continue
1695	// A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1696	// the target of the transfer appears only at the start of an iteration statement.
1697	{ $$ = new StatementNode( build_branch( yylloc, $2, ast::BranchStmt::Continue ) ); }
1698	\| BREAK ';'
1699	// A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1700	{ $$ = new StatementNode( build_branch( yylloc, ast::BranchStmt::Break ) ); }
1701	\| BREAK identifier_or_type_name ';' // CFA, multi-level exit
1702	// A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1703	// the target of the transfer appears only at the start of an iteration statement.
1704	{ $$ = new StatementNode( build_branch( yylloc, $2, ast::BranchStmt::Break ) ); }
1705	\| RETURN comma_expression_opt ';'
1706	{ $$ = new StatementNode( build_return( yylloc, $2 ) ); }
1707	\| RETURN '{' initializer_list_opt comma_opt '}' ';'
1708	{ SemanticError( yylloc, "Initializer return is currently unimplemented." ); $$ = nullptr; }
1709	\| SUSPEND ';'
1710	{ $$ = new StatementNode( build_suspend( yylloc, nullptr, ast::SuspendStmt::None ) ); }
1711	\| SUSPEND compound_statement
1712	{ $$ = new StatementNode( build_suspend( yylloc, $2, ast::SuspendStmt::None ) ); }
1713	\| SUSPEND COROUTINE ';'
1714	{ $$ = new StatementNode( build_suspend( yylloc, nullptr, ast::SuspendStmt::Coroutine ) ); }
1715	\| SUSPEND COROUTINE compound_statement
1716	{ $$ = new StatementNode( build_suspend( yylloc, $3, ast::SuspendStmt::Coroutine ) ); }
1717	\| SUSPEND GENERATOR ';'
1718	{ $$ = new StatementNode( build_suspend( yylloc, nullptr, ast::SuspendStmt::Generator ) ); }
1719	\| SUSPEND GENERATOR compound_statement
1720	{ $$ = new StatementNode( build_suspend( yylloc, $3, ast::SuspendStmt::Generator ) ); }
1721	\| THROW assignment_expression_opt ';' // handles rethrow
1722	{ $$ = new StatementNode( build_throw( yylloc, $2 ) ); }
1723	\| THROWRESUME assignment_expression_opt ';' // handles reresume
1724	{ $$ = new StatementNode( build_resume( yylloc, $2 ) ); }
1725	\| THROWRESUME assignment_expression_opt AT assignment_expression ';' // handles reresume
1726	{ $$ = new StatementNode( build_resume_at( $2, $4 ) ); }
1727	;
1728
1729	fall_through_name: // CFA
1730	FALLTHRU
1731	\| FALLTHROUGH
1732	;
1733
1734	with_statement:
1735	WITH '(' type_list ')' statement // support scoped enumeration
1736	{ $$ = new StatementNode( build_with( yylloc, $3, $5 ) ); }
1737	;
1738
1739	// If MUTEX becomes a general qualifier, there are shift/reduce conflicts, so possibly change syntax to "with mutex".
1740	mutex_statement:
1741	MUTEX '(' argument_expression_list_opt ')' statement
1742	{
1743	if ( ! $3 ) { SemanticError( yylloc, "illegal syntax, mutex argument list cannot be empty." ); $$ = nullptr; }
1744	$$ = new StatementNode( build_mutex( yylloc, $3, $5 ) );
1745	}
1746	;
1747
1748	when_clause:
1749	WHEN '(' comma_expression ')' { $$ = $3; }
1750	;
1751
1752	when_clause_opt:
1753	// empty
1754	{ $$ = nullptr; }
1755	\| when_clause
1756	;
1757
1758	cast_expression_list:
1759	cast_expression
1760	\| cast_expression_list ',' cast_expression
1761	{ SemanticError( yylloc, "List of mutex member is currently unimplemented." ); $$ = nullptr; }
1762	;
1763
1764	timeout:
1765	TIMEOUT '(' comma_expression ')' { $$ = $3; }
1766	;
1767
1768	wor:
1769	OROR
1770	\| WOR
1771
1772	waitfor:
1773	WAITFOR '(' cast_expression ')'
1774	{ $$ = $3; }
1775	\| WAITFOR '(' cast_expression_list ':' argument_expression_list_opt ')'
1776	{ $$ = $3->set_last( $5 ); }
1777	;
1778
1779	wor_waitfor_clause:
1780	when_clause_opt waitfor statement %prec THEN
1781	// Called first: create header for WaitForStmt.
1782	{ $$ = build_waitfor( yylloc, new ast::WaitForStmt( yylloc ), $1, $2, maybe_build_compound( yylloc, $3 ) ); }
1783	\| wor_waitfor_clause wor when_clause_opt waitfor statement
1784	{ $$ = build_waitfor( yylloc, $1, $3, $4, maybe_build_compound( yylloc, $5 ) ); }
1785	\| wor_waitfor_clause wor when_clause_opt ELSE statement
1786	{ $$ = build_waitfor_else( yylloc, $1, $3, maybe_build_compound( yylloc, $5 ) ); }
1787	\| wor_waitfor_clause wor when_clause_opt timeout statement %prec THEN
1788	{ $$ = build_waitfor_timeout( yylloc, $1, $3, $4, maybe_build_compound( yylloc, $5 ) ); }
1789	// "else" must be conditional after timeout or timeout is never triggered (i.e., it is meaningless)
1790	\| wor_waitfor_clause wor when_clause_opt timeout statement wor ELSE statement // invalid syntax rule
1791	{ SemanticError( yylloc, "illegal syntax, else clause must be conditional after timeout or timeout never triggered." ); $$ = nullptr; }
1792	\| wor_waitfor_clause wor when_clause_opt timeout statement wor when_clause ELSE statement
1793	{ $$ = build_waitfor_else( yylloc, build_waitfor_timeout( yylloc, $1, $3, $4, maybe_build_compound( yylloc, $5 ) ), $7, maybe_build_compound( yylloc, $9 ) ); }
1794	;
1795
1796	waitfor_statement:
1797	wor_waitfor_clause %prec THEN
1798	{ $$ = new StatementNode( $1 ); }
1799	;
1800
1801	wand:
1802	ANDAND
1803	\| WAND
1804	;
1805
1806	waituntil:
1807	WAITUNTIL '(' comma_expression ')'
1808	{ $$ = $3; }
1809	;
1810
1811	waituntil_clause:
1812	when_clause_opt waituntil statement
1813	{ $$ = build_waituntil_clause( yylloc, $1, $2, maybe_build_compound( yylloc, $3 ) ); }
1814	\| '(' wor_waituntil_clause ')'
1815	{ $$ = $2; }
1816	;
1817
1818	wand_waituntil_clause:
1819	waituntil_clause %prec THEN
1820	{ $$ = $1; }
1821	\| waituntil_clause wand wand_waituntil_clause
1822	{ $$ = new ast::WaitUntilStmt::ClauseNode( ast::WaitUntilStmt::ClauseNode::Op::AND, $1, $3 ); }
1823	;
1824
1825	wor_waituntil_clause:
1826	wand_waituntil_clause
1827	{ $$ = $1; }
1828	\| wor_waituntil_clause wor wand_waituntil_clause
1829	{ $$ = new ast::WaitUntilStmt::ClauseNode( ast::WaitUntilStmt::ClauseNode::Op::OR, $1, $3 ); }
1830	\| wor_waituntil_clause wor when_clause_opt ELSE statement
1831	{ $$ = new ast::WaitUntilStmt::ClauseNode( ast::WaitUntilStmt::ClauseNode::Op::LEFT_OR, $1, build_waituntil_else( yylloc, $3, maybe_build_compound( yylloc, $5 ) ) ); }
1832	;
1833
1834	waituntil_statement:
1835	wor_waituntil_clause %prec THEN
1836	{ $$ = new StatementNode( build_waituntil_stmt( yylloc, $1 ) ); }
1837	;
1838
1839	corun_statement:
1840	CORUN statement
1841	{ $$ = new StatementNode( build_corun( yylloc, $2 ) ); }
1842	;
1843
1844	cofor_statement:
1845	COFOR '(' for_control_expression_list ')' statement
1846	{ $$ = new StatementNode( build_cofor( yylloc, $3, maybe_build_compound( yylloc, $5 ) ) ); }
1847	;
1848
1849	exception_statement:
1850	TRY compound_statement handler_clause %prec THEN
1851	{ $$ = new StatementNode( build_try( yylloc, $2, $3, nullptr ) ); }
1852	\| TRY compound_statement finally_clause
1853	{ $$ = new StatementNode( build_try( yylloc, $2, nullptr, $3 ) ); }
1854	\| TRY compound_statement handler_clause finally_clause
1855	{ $$ = new StatementNode( build_try( yylloc, $2, $3, $4 ) ); }
1856	;
1857
1858	handler_clause:
1859	handler_key '(' exception_declaration handler_predicate_opt ')' compound_statement
1860	{ $$ = new ClauseNode( build_catch( yylloc, $1, $3, $4, $6 ) ); }
1861	\| handler_clause handler_key '(' exception_declaration handler_predicate_opt ')' compound_statement
1862	{ $$ = $1->set_last( new ClauseNode( build_catch( yylloc, $2, $4, $5, $7 ) ) ); }
1863	;
1864
1865	handler_predicate_opt:
1866	// empty
1867	{ $$ = nullptr; }
1868	\| ';' conditional_expression { $$ = $2; }
1869	;
1870
1871	handler_key:
1872	CATCH { $$ = ast::Terminate; }
1873	\| RECOVER { $$ = ast::Terminate; }
1874	\| CATCHRESUME { $$ = ast::Resume; }
1875	\| FIXUP { $$ = ast::Resume; }
1876	;
1877
1878	finally_clause:
1879	FINALLY compound_statement { $$ = new ClauseNode( build_finally( yylloc, $2 ) ); }
1880	;
1881
1882	exception_declaration:
1883	// No SUE declaration in parameter list.
1884	type_specifier_nobody
1885	\| type_specifier_nobody declarator
1886	{ $$ = $2->addType( $1 ); }
1887	\| type_specifier_nobody variable_abstract_declarator
1888	{ $$ = $2->addType( $1 ); }
1889	\| cfa_abstract_declarator_tuple identifier // CFA
1890	{ $$ = $1->addName( $2 ); }
1891	\| cfa_abstract_declarator_tuple // CFA
1892	;
1893
1894	enable_disable_statement:
1895	enable_disable_key identifier_list compound_statement
1896	;
1897
1898	enable_disable_key:
1899	ENABLE
1900	\| DISABLE
1901	;
1902
1903	asm_statement:
1904	ASM asm_volatile_opt '(' string_literal ')' ';'
1905	{ $$ = new StatementNode( build_asm( yylloc, $2, $4, nullptr ) ); }
1906	\| ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ')' ';' // remaining GCC
1907	{ $$ = new StatementNode( build_asm( yylloc, $2, $4, $6 ) ); }
1908	\| ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ')' ';'
1909	{ $$ = new StatementNode( build_asm( yylloc, $2, $4, $6, $8 ) ); }
1910	\| ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ':' asm_clobbers_list_opt ')' ';'
1911	{ $$ = new StatementNode( build_asm( yylloc, $2, $4, $6, $8, $10 ) ); }
1912	\| ASM asm_volatile_opt GOTO '(' string_literal ':' ':' asm_operands_opt ':' asm_clobbers_list_opt ':' label_list ')' ';'
1913	{ $$ = new StatementNode( build_asm( yylloc, $2, $5, nullptr, $8, $10, $12 ) ); }
1914	;
1915
1916	asm_volatile_opt: // GCC
1917	// empty
1918	{ $$ = false; }
1919	\| VOLATILE
1920	{ $$ = true; }
1921	;
1922
1923	asm_operands_opt: // GCC
1924	// empty
1925	{ $$ = nullptr; } // use default argument
1926	\| asm_operands_list
1927	;
1928
1929	asm_operands_list: // GCC
1930	asm_operand
1931	\| asm_operands_list ',' asm_operand
1932	{ $$ = $1->set_last( $3 ); }
1933	;
1934
1935	asm_operand: // GCC
1936	string_literal '(' constant_expression ')'
1937	{ $$ = new ExpressionNode( new ast::AsmExpr( yylloc, "", maybeMoveBuild( $1 ), maybeMoveBuild( $3 ) ) ); }
1938	\| '[' IDENTIFIER ']' string_literal '(' constant_expression ')'
1939	{
1940	$$ = new ExpressionNode( new ast::AsmExpr( yylloc, *$2.str, maybeMoveBuild( $4 ), maybeMoveBuild( $6 ) ) );
1941	delete $2.str;
1942	}
1943	;
1944
1945	asm_clobbers_list_opt: // GCC
1946	// empty
1947	{ $$ = nullptr; } // use default argument
1948	\| string_literal
1949	{ $$ = $1; }
1950	\| asm_clobbers_list_opt ',' string_literal
1951	{ $$ = $1->set_last( $3 ); }
1952	;
1953
1954	label_list:
1955	identifier
1956	{
1957	$$ = new LabelNode(); $$->labels.emplace_back( yylloc, *$1 );
1958	delete $1; // allocated by lexer
1959	}
1960	\| label_list ',' identifier
1961	{
1962	$$ = $1; $1->labels.emplace_back( yylloc, *$3 );
1963	delete $3; // allocated by lexer
1964	}
1965	;
1966
1967	// **************************** DECLARATIONS *******************************
1968
1969	declaration_list_opt: // used at beginning of switch statement
1970	// empty
1971	{ $$ = nullptr; }
1972	\| declaration_list
1973	;
1974
1975	declaration_list:
1976	declaration
1977	\| declaration_list declaration
1978	{ $$ = $1->set_last( $2 ); }
1979	;
1980
1981	KR_parameter_list_opt: // used to declare parameter types in K&R style functions
1982	// empty
1983	{ $$ = nullptr; }
1984	\| KR_parameter_list
1985	;
1986
1987	KR_parameter_list:
1988	c_declaration ';'
1989	{ $$ = $1; }
1990	\| KR_parameter_list c_declaration ';'
1991	{ $$ = $1->set_last( $2 ); }
1992	;
1993
1994	local_label_declaration_opt: // GCC, local label
1995	// empty
1996	\| local_label_declaration_list
1997	;
1998
1999	local_label_declaration_list: // GCC, local label
2000	LABEL local_label_list ';'
2001	\| local_label_declaration_list LABEL local_label_list ';'
2002	;
2003
2004	local_label_list: // GCC, local label
2005	identifier_or_type_name
2006	\| local_label_list ',' identifier_or_type_name
2007	;
2008
2009	declaration: // old & new style declarations
2010	c_declaration ';'
2011	\| cfa_declaration ';' // CFA
2012	\| static_assert ';' // C11
2013	;
2014
2015	static_assert:
2016	STATICASSERT '(' constant_expression ',' string_literal ')' // C11
2017	{ $$ = DeclarationNode::newStaticAssert( $3, maybeMoveBuild( $5 ) ); }
2018	\| STATICASSERT '(' constant_expression ')' // CFA
2019	{ $$ = DeclarationNode::newStaticAssert( $3, build_constantStr( yylloc, *new string( "\"\"" ) ) ); }
2020
2021	// C declaration syntax is notoriously confusing and error prone. Cforall provides its own type, variable and function
2022	// declarations. CFA declarations use the same declaration tokens as in C; however, CFA places declaration modifiers to
2023	// the left of the base type, while C declarations place modifiers to the right of the base type. CFA declaration
2024	// modifiers are interpreted from left to right and the entire type specification is distributed across all variables in
2025	// the declaration list (as in Pascal). ANSI C and the new CFA declarations may appear together in the same program
2026	// block, but cannot be mixed within a specific declaration.
2027	//
2028	// CFA C
2029	// [10] int x; int x[10]; // array of 10 integers
2030	// [10] * char y; char *y[10]; // array of 10 pointers to char
2031
2032	cfa_declaration: // CFA
2033	cfa_variable_declaration
2034	\| cfa_typedef_declaration
2035	\| cfa_function_declaration
2036	\| type_declaring_list
2037	{ SemanticError( yylloc, "otype declaration is currently unimplemented." ); $$ = nullptr; }
2038	\| trait_specifier
2039	;
2040
2041	cfa_variable_declaration: // CFA
2042	cfa_variable_specifier initializer_opt
2043	{ $$ = $1->addInitializer( $2 ); }
2044	\| declaration_qualifier_list cfa_variable_specifier initializer_opt
2045	// declaration_qualifier_list also includes type_qualifier_list, so a semantic check is necessary to preclude
2046	// them as a type_qualifier cannot appear in that context.
2047	{ $$ = $2->addQualifiers( $1 )->addInitializer( $3 ); }
2048	\| cfa_variable_declaration pop ',' push identifier_or_type_name initializer_opt
2049	{ $$ = $1->set_last( $1->cloneType( $5 )->addInitializer( $6 ) ); }
2050	;
2051
2052	cfa_variable_specifier: // CFA
2053	// A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
2054	// storage-class
2055	cfa_abstract_declarator_no_tuple identifier_or_type_name asm_name_opt
2056	{ $$ = $1->addName( $2 )->addAsmName( $3 ); }
2057	\| cfa_abstract_tuple identifier_or_type_name asm_name_opt
2058	{ $$ = $1->addName( $2 )->addAsmName( $3 ); }
2059	\| type_qualifier_list cfa_abstract_tuple identifier_or_type_name asm_name_opt
2060	{ $$ = $2->addQualifiers( $1 )->addName( $3 )->addAsmName( $4 ); }
2061
2062	// [ int s, int t ]; // declare s and t
2063	// [ int, int ] f();
2064	// [] g( int );
2065	// [ int x, int y ] = f(); // declare x and y, initialize each from f
2066	// g( x + y );
2067	\| cfa_function_return asm_name_opt
2068	{ SemanticError( yylloc, "tuple-element declarations is currently unimplemented." ); $$ = nullptr; }
2069	\| type_qualifier_list cfa_function_return asm_name_opt
2070	{ SemanticError( yylloc, "tuple variable declaration is currently unimplemented." ); $$ = nullptr; }
2071	;
2072
2073	cfa_function_declaration: // CFA
2074	cfa_function_specifier
2075	\| type_qualifier_list cfa_function_specifier
2076	{ $$ = $2->addQualifiers( $1 ); }
2077	\| declaration_qualifier_list cfa_function_specifier
2078	{ $$ = $2->addQualifiers( $1 ); }
2079	\| declaration_qualifier_list type_qualifier_list cfa_function_specifier
2080	{ $$ = $3->addQualifiers( $1 )->addQualifiers( $2 ); }
2081	\| cfa_function_declaration ',' identifier_or_type_name '(' push cfa_parameter_list_ellipsis_opt pop ')'
2082	{
2083	// Append the return type at the start (left-hand-side) to each identifier in the list.
2084	DeclarationNode * ret = new DeclarationNode;
2085	ret->type = maybeCopy( $1->type->base );
2086	$$ = $1->set_last( DeclarationNode::newFunction( $3, ret, $6, nullptr ) );
2087	}
2088	;
2089
2090	cfa_function_specifier: // CFA
2091	'[' ']' identifier '(' push cfa_parameter_list_ellipsis_opt pop ')' attribute_list_opt
2092	{ $$ = DeclarationNode::newFunction( $3, DeclarationNode::newTuple( nullptr ), $6, nullptr )->addQualifiers( $9 ); }
2093	\| '[' ']' TYPEDEFname '(' push cfa_parameter_list_ellipsis_opt pop ')' attribute_list_opt
2094	{ $$ = DeclarationNode::newFunction( $3, DeclarationNode::newTuple( nullptr ), $6, nullptr )->addQualifiers( $9 ); }
2095	// \| '[' ']' TYPEGENname '(' push cfa_parameter_list_ellipsis_opt pop ')' attribute_list_opt
2096	// { $$ = DeclarationNode::newFunction( $3, DeclarationNode::newTuple( nullptr ), $6, nullptr )->addQualifiers( $9 ); }
2097
2098	// identifier_or_type_name must be broken apart because of the sequence:
2099	//
2100	// '[' ']' identifier_or_type_name '(' cfa_parameter_list_ellipsis_opt ')'
2101	// '[' ']' type_specifier
2102	//
2103	// type_specifier can resolve to just TYPEDEFname (e.g., typedef int T; int f( T );). Therefore this must be
2104	// flattened to allow lookahead to the '(' without having to reduce identifier_or_type_name.
2105	\| cfa_abstract_tuple identifier_or_type_name '(' push cfa_parameter_list_ellipsis_opt pop ')' attribute_list_opt
2106	// To obtain LR(1 ), this rule must be factored out from function return type (see cfa_abstract_declarator).
2107	{ $$ = DeclarationNode::newFunction( $2, $1, $5, nullptr )->addQualifiers( $8 ); }
2108	\| cfa_function_return identifier_or_type_name '(' push cfa_parameter_list_ellipsis_opt pop ')' attribute_list_opt
2109	{ $$ = DeclarationNode::newFunction( $2, $1, $5, nullptr )->addQualifiers( $8 ); }
2110	;
2111
2112	cfa_function_return: // CFA
2113	'[' cfa_parameter_list ']'
2114	{ $$ = DeclarationNode::newTuple( $2 ); }
2115	\| '[' cfa_parameter_list ',' cfa_abstract_parameter_list ']'
2116	// To obtain LR(1 ), the last cfa_abstract_parameter_list is added into this flattened rule to lookahead to the ']'.
2117	{ $$ = DeclarationNode::newTuple( $2->set_last( $4 ) ); }
2118	;
2119
2120	cfa_typedef_declaration: // CFA
2121	TYPEDEF cfa_variable_specifier
2122	{
2123	typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "cfa_typedef_declaration 1" );
2124	$$ = $2->addTypedef();
2125	}
2126	\| TYPEDEF cfa_function_specifier
2127	{
2128	typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "cfa_typedef_declaration 2" );
2129	$$ = $2->addTypedef();
2130	}
2131	\| cfa_typedef_declaration ',' identifier
2132	{
2133	typedefTable.addToEnclosingScope( *$3, TYPEDEFname, "cfa_typedef_declaration 3" );
2134	$$ = $1->set_last( $1->cloneType( $3 ) );
2135	}
2136	;
2137
2138	// Traditionally typedef is part of storage-class specifier for syntactic convenience only. Here, it is factored out as
2139	// a separate form of declaration, which syntactically precludes storage-class specifiers and initialization.
2140
2141	typedef_declaration:
2142	TYPEDEF type_specifier declarator
2143	{
2144	typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "typedef_declaration 1" );
2145	if ( $2->type->forall \|\| ($2->type->kind == TypeData::Aggregate && $2->type->aggregate.params) ) {
2146	SemanticError( yylloc, "forall qualifier in typedef is currently unimplemented." ); $$ = nullptr;
2147	} else $$ = $3->addType( $2 )->addTypedef(); // watchout frees $2 and $3
2148	}
2149	\| typedef_declaration ',' declarator
2150	{
2151	typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "typedef_declaration 2" );
2152	$$ = $1->set_last( $1->cloneBaseType( $3 )->addTypedef() );
2153	}
2154	\| type_qualifier_list TYPEDEF type_specifier declarator // remaining OBSOLESCENT (see 2 )
2155	{ SemanticError( yylloc, "Type qualifiers/specifiers before TYPEDEF is deprecated, move after TYPEDEF." ); $$ = nullptr; }
2156	\| type_specifier TYPEDEF declarator
2157	{ SemanticError( yylloc, "Type qualifiers/specifiers before TYPEDEF is deprecated, move after TYPEDEF." ); $$ = nullptr; }
2158	\| type_specifier TYPEDEF type_qualifier_list declarator
2159	{ SemanticError( yylloc, "Type qualifiers/specifiers before TYPEDEF is deprecated, move after TYPEDEF." ); $$ = nullptr; }
2160	;
2161
2162	typedef_expression:
2163	// deprecated GCC, naming expression type: typedef name = exp; gives a name to the type of an expression
2164	TYPEDEF identifier '=' assignment_expression
2165	{
2166	SemanticError( yylloc, "TYPEDEF expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
2167	}
2168	\| typedef_expression ',' identifier '=' assignment_expression
2169	{
2170	SemanticError( yylloc, "TYPEDEF expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
2171	}
2172	;
2173
2174	c_declaration:
2175	declaration_specifier declaring_list
2176	{ $$ = distAttr( $1, $2 ); }
2177	\| typedef_declaration
2178	\| typedef_expression // deprecated GCC, naming expression type
2179	\| sue_declaration_specifier
2180	{
2181	assert( $1->type );
2182	if ( $1->type->qualifiers.any() ) { // CV qualifiers ?
2183	SemanticError( yylloc, "illegal syntax, useless type qualifier(s) in empty declaration." ); $$ = nullptr;
2184	}
2185	// enums are never empty declarations because there must have at least one enumeration.
2186	if ( $1->type->kind == TypeData::AggregateInst && $1->storageClasses.any() ) { // storage class ?
2187	SemanticError( yylloc, "illegal syntax, useless storage qualifier(s) in empty aggregate declaration." ); $$ = nullptr;
2188	}
2189	}
2190	;
2191
2192	declaring_list:
2193	// A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
2194	// storage-class
2195	variable_declarator asm_name_opt initializer_opt
2196	{ $$ = $1->addAsmName( $2 )->addInitializer( $3 ); }
2197	\| variable_type_redeclarator asm_name_opt initializer_opt
2198	{ $$ = $1->addAsmName( $2 )->addInitializer( $3 ); }
2199
2200	\| general_function_declarator asm_name_opt
2201	{ $$ = $1->addAsmName( $2 )->addInitializer( nullptr ); }
2202	\| general_function_declarator asm_name_opt '=' VOID
2203	{ $$ = $1->addAsmName( $2 )->addInitializer( new InitializerNode( true ) ); }
2204
2205	\| declaring_list ',' attribute_list_opt declarator asm_name_opt initializer_opt
2206	{ $$ = $1->set_last( $4->addQualifiers( $3 )->addAsmName( $5 )->addInitializer( $6 ) ); }
2207	;
2208
2209	general_function_declarator:
2210	function_type_redeclarator
2211	\| function_declarator
2212	;
2213
2214	declaration_specifier: // type specifier + storage class
2215	basic_declaration_specifier
2216	\| type_declaration_specifier
2217	\| sue_declaration_specifier
2218	\| sue_declaration_specifier invalid_types // invalid syntax rule
2219	{
2220	SemanticError( yylloc, "illegal syntax, expecting ';' at end of \"%s\" declaration.",
2221	ast::AggregateDecl::aggrString( $1->type->aggregate.kind ) );
2222	$$ = nullptr;
2223	}
2224	;
2225
2226	invalid_types:
2227	aggregate_key
2228	\| basic_type_name
2229	\| indirect_type
2230	;
2231
2232	declaration_specifier_nobody: // type specifier + storage class - {...}
2233	// Preclude SUE declarations in restricted scopes:
2234	//
2235	// int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
2236	//
2237	// because it is impossible to call f due to name equivalence.
2238	basic_declaration_specifier
2239	\| sue_declaration_specifier_nobody
2240	\| type_declaration_specifier
2241	;
2242
2243	type_specifier: // type specifier
2244	basic_type_specifier
2245	\| sue_type_specifier
2246	\| type_type_specifier
2247	;
2248
2249	type_specifier_nobody: // type specifier - {...}
2250	// Preclude SUE declarations in restricted scopes:
2251	//
2252	// int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
2253	//
2254	// because it is impossible to call f due to name equivalence.
2255	basic_type_specifier
2256	\| sue_type_specifier_nobody
2257	\| type_type_specifier
2258	;
2259
2260	type_qualifier_list_opt: // GCC, used in asm_statement
2261	// empty
2262	{ $$ = nullptr; }
2263	\| type_qualifier_list
2264	;
2265
2266	type_qualifier_list:
2267	// A semantic check is necessary to ensure a type qualifier is appropriate for the kind of declaration.
2268	//
2269	// ISO/IEC 9899:1999 Section 6.7.3(4 ) : If the same qualifier appears more than once in the same
2270	// specifier-qualifier-list, either directly or via one or more typedefs, the behavior is the same as if it
2271	// appeared only once.
2272	type_qualifier
2273	\| type_qualifier_list type_qualifier
2274	{ $$ = $1->addQualifiers( $2 ); }
2275	;
2276
2277	type_qualifier:
2278	type_qualifier_name
2279	{ $$ = DeclarationNode::newFromTypeData( $1 ); }
2280	\| attribute // trick handles most attribute locations
2281	;
2282
2283	type_qualifier_name:
2284	CONST
2285	{ $$ = build_type_qualifier( ast::CV::Const ); }
2286	\| RESTRICT
2287	{ $$ = build_type_qualifier( ast::CV::Restrict ); }
2288	\| VOLATILE
2289	{ $$ = build_type_qualifier( ast::CV::Volatile ); }
2290	\| ATOMIC
2291	{ $$ = build_type_qualifier( ast::CV::Atomic ); }
2292
2293	// forall is a CV qualifier because it can appear in places where SC qualifiers are disallowed.
2294	//
2295	// void foo( forall( T ) T (*)( T ) ); // forward declaration
2296	// void bar( static int ); // static disallowed (gcc/CFA)
2297	\| forall
2298	{ $$ = build_forall( $1 ); }
2299	;
2300
2301	forall:
2302	FORALL '(' type_parameter_list ')' // CFA
2303	{ $$ = $3; }
2304	;
2305
2306	declaration_qualifier_list:
2307	storage_class_list
2308	\| type_qualifier_list storage_class_list // remaining OBSOLESCENT (see 2 )
2309	{ $$ = $1->addQualifiers( $2 ); }
2310	\| declaration_qualifier_list type_qualifier_list storage_class_list
2311	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2312	;
2313
2314	storage_class_list:
2315	// A semantic check is necessary to ensure a storage class is appropriate for the kind of declaration and that
2316	// only one of each is specified, except for inline, which can appear with the others.
2317	//
2318	// ISO/IEC 9899:1999 Section 6.7.1(2) : At most, one storage-class specifier may be given in the declaration
2319	// specifiers in a declaration.
2320	storage_class
2321	\| storage_class_list storage_class
2322	{ $$ = $1->addQualifiers( $2 ); }
2323	;
2324
2325	storage_class:
2326	EXTERN
2327	{ $$ = DeclarationNode::newStorageClass( ast::Storage::Extern ); }
2328	\| STATIC
2329	{ $$ = DeclarationNode::newStorageClass( ast::Storage::Static ); }
2330	\| AUTO
2331	{ $$ = DeclarationNode::newStorageClass( ast::Storage::Auto ); }
2332	\| REGISTER
2333	{ $$ = DeclarationNode::newStorageClass( ast::Storage::Register ); }
2334	\| THREADLOCALGCC // GCC
2335	{ $$ = DeclarationNode::newStorageClass( ast::Storage::ThreadLocalGcc ); }
2336	\| THREADLOCALC11 // C11
2337	{ $$ = DeclarationNode::newStorageClass( ast::Storage::ThreadLocalC11 ); }
2338	// Put function specifiers here to simplify parsing rules, but separate them semantically.
2339	\| INLINE // C99
2340	{ $$ = DeclarationNode::newFuncSpecifier( ast::Function::Inline ); }
2341	\| FORTRAN // C99
2342	{ $$ = DeclarationNode::newFuncSpecifier( ast::Function::Fortran ); }
2343	\| NORETURN // C11
2344	{ $$ = DeclarationNode::newFuncSpecifier( ast::Function::Noreturn ); }
2345	;
2346
2347	basic_type_name:
2348	basic_type_name_type
2349	{ $$ = DeclarationNode::newFromTypeData( $1 ); }
2350	;
2351
2352	// Just an intermediate value for conversion.
2353	basic_type_name_type:
2354	VOID
2355	{ $$ = build_basic_type( TypeData::Void ); }
2356	\| BOOL // C99
2357	{ $$ = build_basic_type( TypeData::Bool ); }
2358	\| CHAR
2359	{ $$ = build_basic_type( TypeData::Char ); }
2360	\| INT
2361	{ $$ = build_basic_type( TypeData::Int ); }
2362	\| INT128
2363	{ $$ = build_basic_type( TypeData::Int128 ); }
2364	\| UINT128
2365	{ $$ = addType( build_basic_type( TypeData::Int128 ), build_signedness( TypeData::Unsigned ) ); }
2366	\| FLOAT
2367	{ $$ = build_basic_type( TypeData::Float ); }
2368	\| DOUBLE
2369	{ $$ = build_basic_type( TypeData::Double ); }
2370	\| FLOAT80
2371	{ $$ = build_basic_type( TypeData::Float80 ); }
2372	\| uuFLOAT128
2373	{ $$ = build_basic_type( TypeData::uuFloat128 ); }
2374	\| FLOAT16
2375	{ $$ = build_basic_type( TypeData::Float16 ); }
2376	\| FLOAT32
2377	{ $$ = build_basic_type( TypeData::Float32 ); }
2378	\| FLOAT32X
2379	{ $$ = build_basic_type( TypeData::Float32x ); }
2380	\| FLOAT64
2381	{ $$ = build_basic_type( TypeData::Float64 ); }
2382	\| FLOAT64X
2383	{ $$ = build_basic_type( TypeData::Float64x ); }
2384	\| FLOAT128
2385	{ $$ = build_basic_type( TypeData::Float128 ); }
2386	// https://developer.arm.com/documentation/den0018/a/NEON-Intrinsics/Accessing-vector-types-from-C
2387	\| FLOAT128X
2388	{ $$ = build_basic_type( TypeData::Float128x ); }
2389	\| FLOAT32X4
2390	{ $$ = build_basic_type( TypeData::Float32x4 ); }
2391	\| FLOAT64X2
2392	{ $$ = build_basic_type( TypeData::Float64x2 ); }
2393	\| SVFLOAT32
2394	{ $$ = build_basic_type( TypeData::Svfloat32 ); }
2395	\| SVFLOAT64
2396	{ $$ = build_basic_type( TypeData::Svfloat64 ); }
2397	\| SVBOOL
2398	{ $$ = build_basic_type( TypeData::Svbool ); }
2399	\| DECIMAL32
2400	{ SemanticError( yylloc, "_Decimal32 is currently unimplemented." ); $$ = nullptr; }
2401	\| DECIMAL64
2402	{ SemanticError( yylloc, "_Decimal64 is currently unimplemented." ); $$ = nullptr; }
2403	\| DECIMAL128
2404	{ SemanticError( yylloc, "_Decimal128 is currently unimplemented." ); $$ = nullptr; }
2405	\| COMPLEX // C99
2406	{ $$ = build_complex_type( TypeData::Complex ); }
2407	\| IMAGINARY // C99
2408	{ $$ = build_complex_type( TypeData::Imaginary ); }
2409	\| SIGNED
2410	{ $$ = build_signedness( TypeData::Signed ); }
2411	\| UNSIGNED
2412	{ $$ = build_signedness( TypeData::Unsigned ); }
2413	\| SHORT
2414	{ $$ = build_length( TypeData::Short ); }
2415	\| LONG
2416	{ $$ = build_length( TypeData::Long ); }
2417	\| VA_LIST // GCC, __builtin_va_list
2418	{ $$ = build_builtin_type( TypeData::Valist ); }
2419	\| AUTO_TYPE
2420	{ $$ = build_builtin_type( TypeData::AutoType ); }
2421	\| vtable
2422	;
2423
2424	vtable_opt:
2425	// empty
2426	{ $$ = nullptr; }
2427	\| vtable
2428	;
2429
2430	vtable:
2431	VTABLE '(' type_name ')' default_opt
2432	{ $$ = build_vtable_type( $3 ); }
2433	;
2434
2435	default_opt:
2436	// empty
2437	{ $$ = nullptr; }
2438	\| DEFAULT
2439	{ SemanticError( yylloc, "vtable default is currently unimplemented." ); $$ = nullptr; }
2440	;
2441
2442	basic_declaration_specifier:
2443	// A semantic check is necessary for conflicting storage classes.
2444	basic_type_specifier
2445	\| declaration_qualifier_list basic_type_specifier
2446	{ $$ = $2->addQualifiers( $1 ); }
2447	\| basic_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2448	{ $$ = $1->addQualifiers( $2 ); }
2449	\| basic_declaration_specifier storage_class type_qualifier_list
2450	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2451	\| basic_declaration_specifier storage_class basic_type_specifier
2452	{ $$ = $3->addQualifiers( $2 )->addType( $1 ); }
2453	;
2454
2455	basic_type_specifier:
2456	direct_type
2457	// Cannot have type modifiers, e.g., short, long, etc.
2458	\| type_qualifier_list_opt indirect_type type_qualifier_list_opt
2459	{ $$ = $2->addQualifiers( $1 )->addQualifiers( $3 ); }
2460	;
2461
2462	direct_type:
2463	basic_type_name
2464	\| type_qualifier_list basic_type_name
2465	{ $$ = $2->addQualifiers( $1 ); }
2466	\| direct_type type_qualifier
2467	{ $$ = $1->addQualifiers( $2 ); }
2468	\| direct_type basic_type_name
2469	{ $$ = $1->addType( $2 ); }
2470	;
2471
2472	indirect_type:
2473	TYPEOF '(' type ')' // GCC: typeof( x ) y;
2474	{ $$ = $3; }
2475	\| TYPEOF '(' comma_expression ')' // GCC: typeof( a+b ) y;
2476	{ $$ = DeclarationNode::newTypeof( $3 ); }
2477	\| BASETYPEOF '(' type ')' // CFA: basetypeof( x ) y;
2478	{ $$ = DeclarationNode::newTypeof( new ExpressionNode( new ast::TypeExpr( yylloc, maybeMoveBuildType( $3 ) ) ), true ); }
2479	\| BASETYPEOF '(' comma_expression ')' // CFA: basetypeof( a+b ) y;
2480	{ $$ = DeclarationNode::newTypeof( $3, true ); }
2481	\| ZERO_T // CFA
2482	{ $$ = DeclarationNode::newFromTypeData( build_builtin_type( TypeData::Zero ) ); }
2483	\| ONE_T // CFA
2484	{ $$ = DeclarationNode::newFromTypeData( build_builtin_type( TypeData::One ) ); }
2485	;
2486
2487	sue_declaration_specifier: // struct, union, enum + storage class + type specifier
2488	sue_type_specifier
2489	\| declaration_qualifier_list sue_type_specifier
2490	{ $$ = $2->addQualifiers( $1 ); }
2491	\| sue_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2492	{ $$ = $1->addQualifiers( $2 ); }
2493	\| sue_declaration_specifier storage_class type_qualifier_list
2494	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2495	;
2496
2497	sue_type_specifier: // struct, union, enum + type specifier
2498	elaborated_type
2499	\| type_qualifier_list
2500	{ if ( $1->type != nullptr && $1->type->forall ) forall = true; } // remember generic type
2501	elaborated_type
2502	{ $$ = $3->addQualifiers( $1 ); }
2503	\| sue_type_specifier type_qualifier
2504	{
2505	if ( $2->type != nullptr && $2->type->forall ) forall = true; // remember generic type
2506	$$ = $1->addQualifiers( $2 );
2507	}
2508	;
2509
2510	sue_declaration_specifier_nobody: // struct, union, enum - {...} + storage class + type specifier
2511	sue_type_specifier_nobody
2512	\| declaration_qualifier_list sue_type_specifier_nobody
2513	{ $$ = $2->addQualifiers( $1 ); }
2514	\| sue_declaration_specifier_nobody storage_class // remaining OBSOLESCENT (see 2)
2515	{ $$ = $1->addQualifiers( $2 ); }
2516	\| sue_declaration_specifier_nobody storage_class type_qualifier_list
2517	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2518	;
2519
2520	sue_type_specifier_nobody: // struct, union, enum - {...} + type specifier
2521	elaborated_type_nobody
2522	\| type_qualifier_list elaborated_type_nobody
2523	{ $$ = $2->addQualifiers( $1 ); }
2524	\| sue_type_specifier_nobody type_qualifier
2525	{ $$ = $1->addQualifiers( $2 ); }
2526	;
2527
2528	type_declaration_specifier:
2529	type_type_specifier
2530	\| declaration_qualifier_list type_type_specifier
2531	{ $$ = $2->addQualifiers( $1 ); }
2532	\| type_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2533	{ $$ = $1->addQualifiers( $2 ); }
2534	\| type_declaration_specifier storage_class type_qualifier_list
2535	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2536	;
2537
2538	type_type_specifier: // typedef types
2539	type_name
2540	{ $$ = DeclarationNode::newFromTypeData( $1 ); }
2541	\| type_qualifier_list type_name
2542	{ $$ = DeclarationNode::newFromTypeData( $2 )->addQualifiers( $1 ); }
2543	\| type_type_specifier type_qualifier
2544	{ $$ = $1->addQualifiers( $2 ); }
2545	;
2546
2547	type_name:
2548	TYPEDEFname
2549	{ $$ = build_typedef( $1 ); }
2550	\| '.' TYPEDEFname
2551	{ $$ = build_qualified_type( build_global_scope(), build_typedef( $2 ) ); }
2552	\| type_name '.' TYPEDEFname
2553	{ $$ = build_qualified_type( $1, build_typedef( $3 ) ); }
2554	\| typegen_name
2555	\| '.' typegen_name
2556	{ $$ = build_qualified_type( build_global_scope(), $2 ); }
2557	\| type_name '.' typegen_name
2558	{ $$ = build_qualified_type( $1, $3 ); }
2559	;
2560
2561	typegen_name: // CFA
2562	TYPEGENname
2563	{ $$ = build_type_gen( $1, nullptr ); }
2564	\| TYPEGENname '(' ')'
2565	{ $$ = build_type_gen( $1, nullptr ); }
2566	\| TYPEGENname '(' type_list ')'
2567	{ $$ = build_type_gen( $1, $3 ); }
2568	;
2569
2570	elaborated_type: // struct, union, enum
2571	aggregate_type
2572	\| enum_type
2573	;
2574
2575	elaborated_type_nobody: // struct, union, enum - {...}
2576	aggregate_type_nobody
2577	\| enum_type_nobody
2578	;
2579
2580	// ************************ AGGREGATE *****************************
2581
2582	aggregate_type: // struct, union
2583	aggregate_key attribute_list_opt
2584	{ forall = false; } // reset
2585	'{' field_declaration_list_opt '}' type_parameters_opt
2586	{ $$ = DeclarationNode::newAggregate( $1, nullptr, $7, $5, true )->addQualifiers( $2 ); }
2587	\| aggregate_key attribute_list_opt identifier
2588	{
2589	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname, "aggregate_type: 1" );
2590	forall = false; // reset
2591	}
2592	'{' field_declaration_list_opt '}' type_parameters_opt
2593	{
2594	$$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2595	}
2596	\| aggregate_key attribute_list_opt TYPEDEFname // unqualified type name
2597	{
2598	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname, "aggregate_type: 2" );
2599	forall = false; // reset
2600	}
2601	'{' field_declaration_list_opt '}' type_parameters_opt
2602	{
2603	DeclarationNode::newFromTypeData( build_typedef( $3 ) );
2604	$$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2605	}
2606	\| aggregate_key attribute_list_opt TYPEGENname // unqualified type name
2607	{
2608	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname, "aggregate_type: 3" );
2609	forall = false; // reset
2610	}
2611	'{' field_declaration_list_opt '}' type_parameters_opt
2612	{
2613	DeclarationNode::newFromTypeData( build_type_gen( $3, nullptr ) );
2614	$$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2615	}
2616	\| aggregate_type_nobody
2617	;
2618
2619	type_parameters_opt:
2620	// empty
2621	{ $$ = nullptr; } %prec '}'
2622	\| '(' type_list ')'
2623	{ $$ = $2; }
2624	;
2625
2626	aggregate_type_nobody: // struct, union - {...}
2627	aggregate_key attribute_list_opt identifier
2628	{
2629	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname, "aggregate_type_nobody" );
2630	forall = false; // reset
2631	$$ = DeclarationNode::newAggregate( $1, $3, nullptr, nullptr, false )->addQualifiers( $2 );
2632	}
2633	\| aggregate_key attribute_list_opt type_name
2634	{
2635	forall = false; // reset
2636	// Create new generic declaration with same name as previous forward declaration, where the IDENTIFIER is
2637	// switched to a TYPEGENname. Link any generic arguments from typegen_name to new generic declaration and
2638	// delete newFromTypeGen.
2639	if ( $3->kind == TypeData::SymbolicInst && ! $3->symbolic.isTypedef ) {
2640	$$ = DeclarationNode::newFromTypeData( $3 )->addQualifiers( $2 );
2641	} else {
2642	$$ = DeclarationNode::newAggregate( $1, $3->symbolic.name, $3->symbolic.actuals, nullptr, false )->addQualifiers( $2 );
2643	$3->symbolic.name = nullptr; // copied to $$
2644	$3->symbolic.actuals = nullptr;
2645	delete $3;
2646	}
2647	}
2648	;
2649
2650	aggregate_key:
2651	aggregate_data
2652	\| aggregate_control
2653	;
2654
2655	aggregate_data:
2656	STRUCT vtable_opt
2657	{ $$ = ast::AggregateDecl::Struct; }
2658	\| UNION
2659	{ $$ = ast::AggregateDecl::Union; }
2660	\| EXCEPTION // CFA
2661	{ $$ = ast::AggregateDecl::Exception; }
2662	;
2663
2664	aggregate_control: // CFA
2665	MONITOR
2666	{ $$ = ast::AggregateDecl::Monitor; }
2667	\| MUTEX STRUCT
2668	{ $$ = ast::AggregateDecl::Monitor; }
2669	\| GENERATOR
2670	{ $$ = ast::AggregateDecl::Generator; }
2671	\| MUTEX GENERATOR
2672	{
2673	SemanticError( yylloc, "monitor generator is currently unimplemented." );
2674	$$ = ast::AggregateDecl::NoAggregate;
2675	}
2676	\| COROUTINE
2677	{ $$ = ast::AggregateDecl::Coroutine; }
2678	\| MUTEX COROUTINE
2679	{
2680	SemanticError( yylloc, "monitor coroutine is currently unimplemented." );
2681	$$ = ast::AggregateDecl::NoAggregate;
2682	}
2683	\| THREAD
2684	{ $$ = ast::AggregateDecl::Thread; }
2685	\| MUTEX THREAD
2686	{
2687	SemanticError( yylloc, "monitor thread is currently unimplemented." );
2688	$$ = ast::AggregateDecl::NoAggregate;
2689	}
2690	;
2691
2692	field_declaration_list_opt:
2693	// empty
2694	{ $$ = nullptr; }
2695	\| field_declaration_list_opt field_declaration
2696	{ $$ = $1 ? $1->set_last( $2 ) : $2; }
2697	;
2698
2699	field_declaration:
2700	type_specifier field_declaring_list_opt ';'
2701	{
2702	// printf( "type_specifier1 %p %s\n", $$, $$->type->aggregate.name ? $$->type->aggregate.name->c_str() : "(nil)" );
2703	$$ = fieldDecl( $1, $2 );
2704	// printf( "type_specifier2 %p %s\n", $$, $$->type->aggregate.name ? $$->type->aggregate.name->c_str() : "(nil)" );
2705	// for ( Attribute * attr: reverseIterate( $$->attributes ) ) {
2706	// printf( "\tattr %s\n", attr->name.c_str() );
2707	// } // for
2708	}
2709	\| type_specifier field_declaring_list_opt '}' // invalid syntax rule
2710	{
2711	SemanticError( yylloc, "illegal syntax, expecting ';' at end of previous declaration." );
2712	$$ = nullptr;
2713	}
2714	\| EXTENSION type_specifier field_declaring_list_opt ';' // GCC
2715	{ $$ = fieldDecl( $2, $3 ); distExt( $$ ); }
2716	\| STATIC type_specifier field_declaring_list_opt ';' // CFA
2717	{ SemanticError( yylloc, "STATIC aggregate field qualifier currently unimplemented." ); $$ = nullptr; }
2718	\| INLINE type_specifier field_abstract_list_opt ';' // CFA
2719	{
2720	if ( ! $3 ) { // field declarator ?
2721	$3 = DeclarationNode::newName( nullptr );
2722	} // if
2723	$3->inLine = true;
2724	$$ = distAttr( $2, $3 ); // mark all fields in list
2725	distInl( $3 );
2726	}
2727	\| INLINE aggregate_control ';' // CFA
2728	{ SemanticError( yylloc, "INLINE aggregate control currently unimplemented." ); $$ = nullptr; }
2729	\| typedef_declaration ';' // CFA
2730	\| cfa_field_declaring_list ';' // CFA, new style field declaration
2731	\| EXTENSION cfa_field_declaring_list ';' // GCC
2732	{ distExt( $2 ); $$ = $2; } // mark all fields in list
2733	\| INLINE cfa_field_abstract_list ';' // CFA, new style field declaration
2734	{ $$ = $2; } // mark all fields in list
2735	\| cfa_typedef_declaration ';' // CFA
2736	\| static_assert ';' // C11
2737	;
2738
2739	field_declaring_list_opt:
2740	// empty
2741	{ $$ = nullptr; }
2742	\| field_declarator
2743	\| field_declaring_list_opt ',' attribute_list_opt field_declarator
2744	{ $$ = $1->set_last( $4->addQualifiers( $3 ) ); }
2745	;
2746
2747	field_declarator:
2748	bit_subrange_size // C special case, no field name
2749	{ $$ = DeclarationNode::newBitfield( $1 ); }
2750	\| variable_declarator bit_subrange_size_opt
2751	// A semantic check is required to ensure bit_subrange only appears on integral types.
2752	{ $$ = $1->addBitfield( $2 ); }
2753	\| variable_type_redeclarator bit_subrange_size_opt
2754	// A semantic check is required to ensure bit_subrange only appears on integral types.
2755	{ $$ = $1->addBitfield( $2 ); }
2756	\| function_type_redeclarator bit_subrange_size_opt
2757	// A semantic check is required to ensure bit_subrange only appears on integral types.
2758	{ $$ = $1->addBitfield( $2 ); }
2759	;
2760
2761	field_abstract_list_opt:
2762	// empty
2763	{ $$ = nullptr; }
2764	\| field_abstract
2765	\| field_abstract_list_opt ',' attribute_list_opt field_abstract
2766	{ $$ = $1->set_last( $4->addQualifiers( $3 ) ); }
2767	;
2768
2769	field_abstract:
2770	// no bit fields
2771	variable_abstract_declarator
2772	;
2773
2774	cfa_field_declaring_list: // CFA, new style field declaration
2775	// bit-fields are handled by C declarations
2776	cfa_abstract_declarator_tuple identifier_or_type_name
2777	{ $$ = $1->addName( $2 ); }
2778	\| cfa_field_declaring_list ',' identifier_or_type_name
2779	{ $$ = $1->set_last( $1->cloneType( $3 ) ); }
2780	;
2781
2782	cfa_field_abstract_list: // CFA, new style field declaration
2783	// bit-fields are handled by C declarations
2784	cfa_abstract_declarator_tuple
2785	\| cfa_field_abstract_list ','
2786	{ $$ = $1->set_last( $1->cloneType( 0 ) ); }
2787	;
2788
2789	bit_subrange_size_opt:
2790	// empty
2791	{ $$ = nullptr; }
2792	\| bit_subrange_size
2793	;
2794
2795	bit_subrange_size:
2796	':' assignment_expression
2797	{ $$ = $2; }
2798	;
2799
2800	// ************************ ENUMERATION *****************************
2801
2802	enum_type:
2803	// anonymous, no type name
2804	ENUM attribute_list_opt hide_opt '{' enumerator_list comma_opt '}'
2805	{
2806	if ( $3 == EnumHiding::Hide ) {
2807	SemanticError( yylloc, "illegal syntax, hiding ('!') the enumerator names of an anonymous enumeration means the names are inaccessible." ); $$ = nullptr;
2808	} // if
2809	$$ = DeclarationNode::newEnum( nullptr, $5, true, false )->addQualifiers( $2 );
2810	}
2811	\| ENUM enumerator_type attribute_list_opt hide_opt '{' enumerator_list comma_opt '}'
2812	{
2813	if ( $2 && ($2->storageClasses.val != 0 \|\| $2->type->qualifiers.any()) ) {
2814	SemanticError( yylloc, "illegal syntax, storage-class and CV qualifiers are not meaningful for enumeration constants, which are const." );
2815	}
2816	if ( $4 == EnumHiding::Hide ) {
2817	SemanticError( yylloc, "illegal syntax, hiding ('!') the enumerator names of an anonymous enumeration means the names are inaccessible." ); $$ = nullptr;
2818	} // if
2819	$$ = DeclarationNode::newEnum( nullptr, $6, true, true, $2 )->addQualifiers( $3 );
2820	}
2821
2822	// named type
2823	\| ENUM attribute_list_opt identifier
2824	{ typedefTable.makeTypedef( *$3, "enum_type 1" ); }
2825	hide_opt '{' enumerator_list comma_opt '}'
2826	{ $$ = DeclarationNode::newEnum( $3, $7, true, false, nullptr, $5 )->addQualifiers( $2 ); }
2827	\| ENUM attribute_list_opt typedef_name hide_opt '{' enumerator_list comma_opt '}' // unqualified type name
2828	{ $$ = DeclarationNode::newEnum( $3->name, $6, true, false, nullptr, $4 )->addQualifiers( $2 ); }
2829	\| ENUM enumerator_type attribute_list_opt identifier attribute_list_opt
2830	{
2831	if ( $2 && ($2->storageClasses.any() \|\| $2->type->qualifiers.val != 0) ) {
2832	SemanticError( yylloc, "illegal syntax, storage-class and CV qualifiers are not meaningful for enumeration constants, which are const." );
2833	}
2834	typedefTable.makeTypedef( *$4, "enum_type 2" );
2835	}
2836	hide_opt '{' enumerator_list comma_opt '}'
2837	{ $$ = DeclarationNode::newEnum( $4, $9, true, true, $2, $7 )->addQualifiers( $3 )->addQualifiers( $5 ); }
2838	\| ENUM enumerator_type attribute_list_opt typedef_name attribute_list_opt hide_opt '{' enumerator_list comma_opt '}'
2839	{ $$ = DeclarationNode::newEnum( $4->name, $8, true, true, $2, $6 )->addQualifiers( $3 )->addQualifiers( $5 ); }
2840
2841	// forward declaration
2842	\| enum_type_nobody
2843	;
2844
2845	enumerator_type:
2846	'(' ')' // pure enumeration
2847	{ $$ = nullptr; }
2848	\| '(' cfa_abstract_parameter_declaration ')' // typed enumeration
2849	{ $$ = $2; }
2850	;
2851
2852	hide_opt:
2853	// empty
2854	{ $$ = EnumHiding::Visible; }
2855	\| '!'
2856	{ $$ = EnumHiding::Hide; }
2857	;
2858
2859	enum_type_nobody: // enum - {...}
2860	ENUM attribute_list_opt identifier
2861	{
2862	typedefTable.makeTypedef( *$3, "enum_type_nobody 1" );
2863	$$ = DeclarationNode::newEnum( $3, nullptr, false, false )->addQualifiers( $2 );
2864	}
2865	\| ENUM attribute_list_opt type_name
2866	{
2867	typedefTable.makeTypedef( *$3->symbolic.name, "enum_type_nobody 2" );
2868	$$ = DeclarationNode::newEnum( $3->symbolic.name, nullptr, false, false )->addQualifiers( $2 );
2869	}
2870	;
2871
2872	enumerator_list:
2873	// empty
2874	{ SemanticError( yylloc, "enumeration must have a minimum of one enumerator, empty enumerator list is meaningless." ); $$ = nullptr; }
2875	\| visible_hide_opt identifier_or_type_name enumerator_value_opt
2876	{ $$ = DeclarationNode::newEnumValueGeneric( $2, $3 ); }
2877	\| INLINE type_name
2878	{
2879	$$ = DeclarationNode::newEnumInLine( $2->symbolic.name );
2880	$2->symbolic.name = nullptr;
2881	delete $2;
2882	}
2883	\| enumerator_list ',' visible_hide_opt identifier_or_type_name enumerator_value_opt
2884	{ $$ = $1->set_last( DeclarationNode::newEnumValueGeneric( $4, $5 ) ); }
2885	\| enumerator_list ',' INLINE type_name
2886	{ $$ = $1->set_last( DeclarationNode::newEnumInLine( $4->symbolic.name ) ); }
2887	;
2888
2889	visible_hide_opt:
2890	hide_opt
2891	\| '^'
2892	{ $$ = EnumHiding::Visible; }
2893	;
2894
2895	enumerator_value_opt:
2896	// empty
2897	{ $$ = nullptr; }
2898	\| '=' constant_expression { $$ = new InitializerNode( $2 ); }
2899	\| '=' '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $3, true ); }
2900	// \| simple_assignment_operator initializer
2901	// { $$ = $1 == OperKinds::Assign ? $2 : $2->set_maybeConstructed( false ); }
2902	;
2903
2904	// ************************ FUNCTION PARAMETERS *****************************
2905
2906	parameter_list_ellipsis_opt:
2907	// empty
2908	{ $$ = DeclarationNode::newFromTypeData( build_basic_type( TypeData::Void ) ); }
2909	\| ELLIPSIS
2910	{ $$ = nullptr; }
2911	\| parameter_list
2912	\| parameter_list ',' ELLIPSIS
2913	{ $$ = $1->addVarArgs(); }
2914	;
2915
2916	parameter_list: // abstract + real
2917	parameter_declaration
2918	\| abstract_parameter_declaration
2919	\| parameter_list ',' parameter_declaration
2920	{ $$ = $1->set_last( $3 ); }
2921	\| parameter_list ',' abstract_parameter_declaration
2922	{ $$ = $1->set_last( $3 ); }
2923	;
2924
2925	cfa_parameter_list_ellipsis_opt: // CFA, abstract + real
2926	// empty
2927	{ $$ = DeclarationNode::newFromTypeData( build_basic_type( TypeData::Void ) ); }
2928	\| ELLIPSIS
2929	{ $$ = nullptr; }
2930	\| cfa_parameter_list
2931	\| cfa_abstract_parameter_list
2932	\| cfa_parameter_list ',' cfa_abstract_parameter_list
2933	{ $$ = $1->set_last( $3 ); }
2934	\| cfa_parameter_list ',' ELLIPSIS
2935	{ $$ = $1->addVarArgs(); }
2936	\| cfa_abstract_parameter_list ',' ELLIPSIS
2937	{ $$ = $1->addVarArgs(); }
2938	;
2939
2940	cfa_parameter_list: // CFA
2941	// To obtain LR(1) between cfa_parameter_list and cfa_abstract_tuple, the last cfa_abstract_parameter_list is
2942	// factored out from cfa_parameter_list, flattening the rules to get lookahead to the ']'.
2943	cfa_parameter_declaration
2944	\| cfa_abstract_parameter_list ',' cfa_parameter_declaration
2945	{ $$ = $1->set_last( $3 ); }
2946	\| cfa_parameter_list ',' cfa_parameter_declaration
2947	{ $$ = $1->set_last( $3 ); }
2948	\| cfa_parameter_list ',' cfa_abstract_parameter_list ',' cfa_parameter_declaration
2949	{ $$ = $1->set_last( $3 )->set_last( $5 ); }
2950	;
2951
2952	cfa_abstract_parameter_list: // CFA, new & old style abstract
2953	cfa_abstract_parameter_declaration
2954	\| cfa_abstract_parameter_list ',' cfa_abstract_parameter_declaration
2955	{ $$ = $1->set_last( $3 ); }
2956	;
2957
2958	// Provides optional identifier names (abstract_declarator/variable_declarator), no initialization, different semantics
2959	// for typedef name by using type_parameter_redeclarator instead of typedef_redeclarator, and function prototypes.
2960
2961	parameter_declaration:
2962	// No SUE declaration in parameter list.
2963	declaration_specifier_nobody identifier_parameter_declarator default_initializer_opt
2964	{ $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2965	\| declaration_specifier_nobody type_parameter_redeclarator default_initializer_opt
2966	{ $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2967	;
2968
2969	abstract_parameter_declaration:
2970	declaration_specifier_nobody default_initializer_opt
2971	{ $$ = $1->addInitializer( $2 ? new InitializerNode( $2 ) : nullptr ); }
2972	\| declaration_specifier_nobody abstract_parameter_declarator default_initializer_opt
2973	{ $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2974	;
2975
2976	cfa_parameter_declaration: // CFA, new & old style parameter declaration
2977	parameter_declaration
2978	\| cfa_identifier_parameter_declarator_no_tuple identifier_or_type_name default_initializer_opt
2979	{ $$ = $1->addName( $2 ); }
2980	\| cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2981	// To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2982	{ $$ = $1->addName( $2 ); }
2983	\| type_qualifier_list cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2984	{ $$ = $2->addName( $3 )->addQualifiers( $1 ); }
2985	\| cfa_function_specifier // int f( "int fp()" );
2986	;
2987
2988	cfa_abstract_parameter_declaration: // CFA, new & old style parameter declaration
2989	abstract_parameter_declaration
2990	\| cfa_identifier_parameter_declarator_no_tuple
2991	\| cfa_abstract_tuple
2992	// To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2993	\| type_qualifier_list cfa_abstract_tuple
2994	{ $$ = $2->addQualifiers( $1 ); }
2995	\| cfa_abstract_function // int f( "int ()" );
2996	;
2997
2998	// ISO/IEC 9899:1999 Section 6.9.1(6) : "An identifier declared as a typedef name shall not be redeclared as a
2999	// parameter." Because the scope of the K&R-style parameter-list sees the typedef first, the following is based only on
3000	// identifiers. The ANSI-style parameter-list can redefine a typedef name.
3001
3002	identifier_list: // K&R-style parameter list => no types
3003	identifier
3004	{ $$ = DeclarationNode::newName( $1 ); }
3005	\| identifier_list ',' identifier
3006	{ $$ = $1->set_last( DeclarationNode::newName( $3 ) ); }
3007	;
3008
3009	type_no_function: // sizeof, alignof, cast (constructor)
3010	cfa_abstract_declarator_tuple // CFA
3011	\| type_specifier // cannot be type_specifier_nobody, e.g., (struct S {}){} is a thing
3012	\| type_specifier abstract_declarator
3013	{ $$ = $2->addType( $1 ); }
3014	;
3015
3016	type: // typeof, assertion
3017	type_no_function
3018	\| cfa_abstract_function // CFA
3019	;
3020
3021	initializer_opt:
3022	// empty
3023	{ $$ = nullptr; }
3024	\| simple_assignment_operator initializer { $$ = $1 == OperKinds::Assign ? $2 : $2->set_maybeConstructed( false ); }
3025	\| '=' VOID { $$ = new InitializerNode( true ); }
3026	\| '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $2, true ); }
3027	;
3028
3029	initializer:
3030	assignment_expression { $$ = new InitializerNode( $1 ); }
3031	\| '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $2, true ); }
3032	;
3033
3034	initializer_list_opt:
3035	// empty
3036	{ $$ = nullptr; }
3037	\| initializer
3038	\| designation initializer { $$ = $2->set_designators( $1 ); }
3039	\| initializer_list_opt ',' initializer { $$ = $1->set_last( $3 ); }
3040	\| initializer_list_opt ',' designation initializer { $$ = $1->set_last( $4->set_designators( $3 ) ); }
3041	;
3042
3043	// There is an unreconcileable parsing problem between C99 and CFA with respect to designators. The problem is use of
3044	// '=' to separator the designator from the initializer value, as in:
3045	//
3046	// int x[10] = { [1] = 3 };
3047	//
3048	// The string "[1] = 3" can be parsed as a designator assignment or a tuple assignment. To disambiguate this case, CFA
3049	// changes the syntax from "=" to ":" as the separator between the designator and initializer. GCC does uses ":" for
3050	// field selection. The optional use of the "=" in GCC, or in this case ":", cannot be supported either due to
3051	// shift/reduce conflicts
3052
3053	designation:
3054	designator_list '=' // C99, CFA uses ":" instead of "="
3055	\| identifier_at ':' // GCC, field name, obsolete since GCC 2.5
3056	{ $$ = new ExpressionNode( build_varref( yylloc, $1 ) ); }
3057	;
3058
3059	designator_list: // C99
3060	designator
3061	\| designator_list designator
3062	{ $$ = $1->set_last( $2 ); }
3063	;
3064
3065	designator:
3066	'.' identifier_at // C99, field name
3067	{ $$ = new ExpressionNode( build_varref( yylloc, $2 ) ); }
3068	\| '[' constant_expression ']' // C99, single array element
3069	{ $$ = $2; }
3070	\| '[' subrange ']' // CFA, multiple array elements
3071	{ $$ = $2; }
3072	\| '[' constant_expression ELLIPSIS constant_expression ']' // GCC, multiple array elements
3073	{ $$ = new ExpressionNode( new ast::RangeExpr( yylloc, maybeMoveBuild( $2 ), maybeMoveBuild( $4 ) ) ); }
3074	\| '.' '[' field_name_list ']' // CFA, tuple field selector
3075	{ $$ = $3; }
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	\| C23_ATTRIBUTE
3516	{ $$ = DeclarationNode::newAttribute( $1 ); }
3517	;
3518
3519	attribute_name_list: // GCC
3520	attribute_name
3521	\| attribute_name_list ',' attribute_name
3522	{ $$ = $3->addQualifiers( $1 ); }
3523	;
3524
3525	attribute_name: // GCC
3526	// empty
3527	{ $$ = nullptr; }
3528	\| attr_name
3529	{ $$ = DeclarationNode::newAttribute( $1 ); }
3530	\| attr_name '(' argument_expression_list_opt ')'
3531	{ $$ = DeclarationNode::newAttribute( $1, $3 ); }
3532	;
3533
3534	attr_name: // GCC
3535	identifier_or_type_name
3536	\| FALLTHROUGH
3537	{ $$ = Token{ new string( "fallthrough" ), { nullptr, -1 } }; }
3538	\| CONST
3539	{ $$ = Token{ new string( "__const__" ), { nullptr, -1 } }; }
3540	;
3541
3542	// ============================================================================
3543	// The following sections are a series of grammar patterns used to parse declarators. Multiple patterns are necessary
3544	// because the type of an identifier in wrapped around the identifier in the same form as its usage in an expression, as
3545	// in:
3546	//
3547	// int (*f())[10] { ... };
3548	// ... (*f())[3] += 1; // definition mimics usage
3549	//
3550	// Because these patterns are highly recursive, changes at a lower level in the recursion require copying some or all of
3551	// the pattern. Each of these patterns has some subtle variation to ensure correct syntax in a particular context.
3552	// ============================================================================
3553
3554	// ----------------------------------------------------------------------------
3555	// The set of valid declarators before a compound statement for defining a function is less than the set of declarators
3556	// to define a variable or function prototype, e.g.:
3557	//
3558	// valid declaration invalid definition
3559	// ----------------- ------------------
3560	// int f; int f {}
3561	// int f; int f {}
3562	// int f[10]; int f[10] {}
3563	// int (f)(int); int (f)(int) {}
3564	//
3565	// To preclude this syntactic anomaly requires separating the grammar rules for variable and function declarators, hence
3566	// variable_declarator and function_declarator.
3567	// ----------------------------------------------------------------------------
3568
3569	// This pattern parses a declaration of a variable that is not redefining a typedef name. The pattern precludes
3570	// declaring an array of functions versus a pointer to an array of functions.
3571
3572	paren_identifier:
3573	identifier_at
3574	{ $$ = DeclarationNode::newName( $1 ); }
3575	\| '?' identifier
3576	// { SemanticError( yylloc, "keyword parameter is currently unimplemented." ); $$ = nullptr; }
3577	{ $$ = DeclarationNode::newName( $2 ); }
3578	\| '(' paren_identifier ')' // redundant parenthesis
3579	{ $$ = $2; }
3580	;
3581
3582	variable_declarator:
3583	paren_identifier attribute_list_opt
3584	{ $$ = $1->addQualifiers( $2 ); }
3585	\| variable_ptr
3586	\| variable_array attribute_list_opt
3587	{ $$ = $1->addQualifiers( $2 ); }
3588	\| variable_function attribute_list_opt
3589	{ $$ = $1->addQualifiers( $2 ); }
3590	;
3591
3592	variable_ptr:
3593	ptrref_operator variable_declarator
3594	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3595	\| ptrref_operator type_qualifier_list variable_declarator
3596	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3597	\| '(' variable_ptr ')' attribute_list_opt // redundant parenthesis
3598	{ $$ = $2->addQualifiers( $4 ); }
3599	\| '(' attribute_list variable_ptr ')' attribute_list_opt // redundant parenthesis
3600	{ $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3601	;
3602
3603	variable_array:
3604	paren_identifier array_dimension
3605	{ $$ = $1->addArray( $2 ); }
3606	\| '(' variable_ptr ')' array_dimension
3607	{ $$ = $2->addArray( $4 ); }
3608	\| '(' attribute_list variable_ptr ')' array_dimension
3609	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3610	\| '(' variable_array ')' multi_array_dimension // redundant parenthesis
3611	{ $$ = $2->addArray( $4 ); }
3612	\| '(' attribute_list variable_array ')' multi_array_dimension // redundant parenthesis
3613	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3614	\| '(' variable_array ')' // redundant parenthesis
3615	{ $$ = $2; }
3616	\| '(' attribute_list variable_array ')' // redundant parenthesis
3617	{ $$ = $3->addQualifiers( $2 ); }
3618	;
3619
3620	variable_function:
3621	'(' variable_ptr ')' '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3622	{ $$ = $2->addParamList( $5 ); }
3623	\| '(' attribute_list variable_ptr ')' '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3624	{ $$ = $3->addQualifiers( $2 )->addParamList( $6 ); }
3625	\| '(' variable_function ')' // redundant parenthesis
3626	{ $$ = $2; }
3627	\| '(' attribute_list variable_function ')' // redundant parenthesis
3628	{ $$ = $3->addQualifiers( $2 ); }
3629	;
3630
3631	// This pattern parses a function declarator that is not redefining a typedef name. For non-nested functions, there is
3632	// no context where a function definition can redefine a typedef name, i.e., the typedef and function name cannot exist
3633	// is the same scope. The pattern precludes returning arrays and functions versus pointers to arrays and functions.
3634
3635	function_declarator:
3636	function_no_ptr attribute_list_opt
3637	{ $$ = $1->addQualifiers( $2 ); }
3638	\| function_ptr
3639	\| function_array attribute_list_opt
3640	{ $$ = $1->addQualifiers( $2 ); }
3641	;
3642
3643	function_no_ptr:
3644	paren_identifier '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3645	{ $$ = $1->addParamList( $3 ); }
3646	\| '(' function_ptr ')' '(' parameter_list_ellipsis_opt ')'
3647	{ $$ = $2->addParamList( $5 ); }
3648	\| '(' attribute_list function_ptr ')' '(' parameter_list_ellipsis_opt ')'
3649	{ $$ = $3->addQualifiers( $2 )->addParamList( $6 ); }
3650	\| '(' function_no_ptr ')' // redundant parenthesis
3651	{ $$ = $2; }
3652	\| '(' attribute_list function_no_ptr ')' // redundant parenthesis
3653	{ $$ = $3->addQualifiers( $2 ); }
3654	;
3655
3656	function_ptr:
3657	ptrref_operator function_declarator
3658	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3659	\| ptrref_operator type_qualifier_list function_declarator
3660	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3661	\| '(' function_ptr ')' attribute_list_opt
3662	{ $$ = $2->addQualifiers( $4 ); }
3663	\| '(' attribute_list function_ptr ')' attribute_list_opt
3664	{ $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3665	;
3666
3667	function_array:
3668	'(' function_ptr ')' array_dimension
3669	{ $$ = $2->addArray( $4 ); }
3670	\| '(' attribute_list function_ptr ')' array_dimension
3671	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3672	\| '(' function_array ')' multi_array_dimension // redundant parenthesis
3673	{ $$ = $2->addArray( $4 ); }
3674	\| '(' attribute_list function_array ')' multi_array_dimension // redundant parenthesis
3675	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3676	\| '(' function_array ')' // redundant parenthesis
3677	{ $$ = $2; }
3678	\| '(' attribute_list function_array ')' // redundant parenthesis
3679	{ $$ = $3->addQualifiers( $2 ); }
3680	;
3681
3682	// This pattern parses an old-style K&R function declarator (OBSOLESCENT, see 4)
3683	//
3684	// f( a, b, c ) int a, *b, c[]; {}
3685	//
3686	// that is not redefining a typedef name (see function_declarator for additional comments). The pattern precludes
3687	// returning arrays and functions versus pointers to arrays and functions.
3688
3689	KR_function_declarator:
3690	KR_function_no_ptr
3691	\| KR_function_ptr
3692	\| KR_function_array
3693	;
3694
3695	KR_function_no_ptr:
3696	paren_identifier '(' identifier_list ')' // function_declarator handles empty parameter
3697	{ $$ = $1->addIdList( $3 ); }
3698	\| '(' KR_function_ptr ')' '(' parameter_list_ellipsis_opt ')'
3699	{ $$ = $2->addParamList( $5 ); }
3700	\| '(' attribute_list KR_function_ptr ')' '(' parameter_list_ellipsis_opt ')'
3701	{ $$ = $3->addQualifiers( $2 )->addParamList( $6 ); }
3702	\| '(' KR_function_no_ptr ')' // redundant parenthesis
3703	{ $$ = $2; }
3704	\| '(' attribute_list KR_function_no_ptr ')' // redundant parenthesis
3705	{ $$ = $3->addQualifiers( $2 ); }
3706	;
3707
3708	KR_function_ptr:
3709	ptrref_operator KR_function_declarator
3710	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3711	\| ptrref_operator type_qualifier_list KR_function_declarator
3712	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3713	\| '(' KR_function_ptr ')'
3714	{ $$ = $2; }
3715	\| '(' attribute_list KR_function_ptr ')'
3716	{ $$ = $3->addQualifiers( $2 ); }
3717	;
3718
3719	KR_function_array:
3720	'(' KR_function_ptr ')' array_dimension
3721	{ $$ = $2->addArray( $4 ); }
3722	\| '(' attribute_list KR_function_ptr ')' array_dimension
3723	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3724	\| '(' KR_function_array ')' multi_array_dimension // redundant parenthesis
3725	{ $$ = $2->addArray( $4 ); }
3726	\| '(' attribute_list KR_function_array ')' multi_array_dimension // redundant parenthesis
3727	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3728	\| '(' KR_function_array ')' // redundant parenthesis
3729	{ $$ = $2; }
3730	\| '(' attribute_list KR_function_array ')' // redundant parenthesis
3731	{ $$ = $3->addQualifiers( $2 ); }
3732	;
3733
3734	// This pattern parses a declaration for a variable that redefines a type name, e.g.:
3735	//
3736	// typedef int foo;
3737	// {
3738	// int foo; // redefine typedef name in new scope
3739	// }
3740
3741	paren_type:
3742	typedef_name
3743	{
3744	// hide type name in enclosing scope by variable name
3745	typedefTable.addToEnclosingScope( *$1->name, IDENTIFIER, "paren_type" );
3746	}
3747	\| '(' paren_type ')'
3748	{ $$ = $2; }
3749	;
3750
3751	variable_type_redeclarator:
3752	paren_type attribute_list_opt
3753	{ $$ = $1->addQualifiers( $2 ); }
3754	\| variable_type_ptr
3755	\| variable_type_array attribute_list_opt
3756	{ $$ = $1->addQualifiers( $2 ); }
3757	\| variable_type_function attribute_list_opt
3758	{ $$ = $1->addQualifiers( $2 ); }
3759	;
3760
3761	variable_type_ptr:
3762	ptrref_operator variable_type_redeclarator
3763	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3764	\| ptrref_operator type_qualifier_list variable_type_redeclarator
3765	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3766	\| '(' variable_type_ptr ')' attribute_list_opt // redundant parenthesis
3767	{ $$ = $2->addQualifiers( $4 ); }
3768	\| '(' attribute_list variable_type_ptr ')' attribute_list_opt // redundant parenthesis
3769	{ $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3770	;
3771
3772	variable_type_array:
3773	paren_type array_dimension
3774	{ $$ = $1->addArray( $2 ); }
3775	\| '(' variable_type_ptr ')' array_dimension
3776	{ $$ = $2->addArray( $4 ); }
3777	\| '(' attribute_list variable_type_ptr ')' array_dimension
3778	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3779	\| '(' variable_type_array ')' multi_array_dimension // redundant parenthesis
3780	{ $$ = $2->addArray( $4 ); }
3781	\| '(' attribute_list variable_type_array ')' multi_array_dimension // redundant parenthesis
3782	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3783	\| '(' variable_type_array ')' // redundant parenthesis
3784	{ $$ = $2; }
3785	\| '(' attribute_list variable_type_array ')' // redundant parenthesis
3786	{ $$ = $3->addQualifiers( $2 ); }
3787	;
3788
3789	variable_type_function:
3790	'(' variable_type_ptr ')' '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3791	{ $$ = $2->addParamList( $5 ); }
3792	\| '(' attribute_list variable_type_ptr ')' '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3793	{ $$ = $3->addQualifiers( $2 )->addParamList( $6 ); }
3794	\| '(' variable_type_function ')' // redundant parenthesis
3795	{ $$ = $2; }
3796	\| '(' attribute_list variable_type_function ')' // redundant parenthesis
3797	{ $$ = $3->addQualifiers( $2 ); }
3798	;
3799
3800	// This pattern parses a declaration for a function prototype that redefines a type name. It precludes declaring an
3801	// array of functions versus a pointer to an array of functions, and returning arrays and functions versus pointers to
3802	// arrays and functions.
3803
3804	function_type_redeclarator:
3805	function_type_no_ptr attribute_list_opt
3806	{ $$ = $1->addQualifiers( $2 ); }
3807	\| function_type_ptr
3808	\| function_type_array attribute_list_opt
3809	{ $$ = $1->addQualifiers( $2 ); }
3810	;
3811
3812	function_type_no_ptr:
3813	paren_type '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3814	{ $$ = $1->addParamList( $3 ); }
3815	\| '(' function_type_ptr ')' '(' parameter_list_ellipsis_opt ')'
3816	{ $$ = $2->addParamList( $5 ); }
3817	\| '(' attribute_list function_type_ptr ')' '(' parameter_list_ellipsis_opt ')'
3818	{ $$ = $3->addQualifiers( $2 )->addParamList( $6 ); }
3819	\| '(' function_type_no_ptr ')' // redundant parenthesis
3820	{ $$ = $2; }
3821	\| '(' attribute_list function_type_no_ptr ')' // redundant parenthesis
3822	{ $$ = $3->addQualifiers( $2 ); }
3823	;
3824
3825	function_type_ptr:
3826	ptrref_operator function_type_redeclarator
3827	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3828	\| ptrref_operator type_qualifier_list function_type_redeclarator
3829	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3830	\| '(' function_type_ptr ')' attribute_list_opt
3831	{ $$ = $2->addQualifiers( $4 ); }
3832	\| '(' attribute_list function_type_ptr ')' attribute_list_opt
3833	{ $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3834	;
3835
3836	function_type_array:
3837	'(' function_type_ptr ')' array_dimension
3838	{ $$ = $2->addArray( $4 ); }
3839	\| '(' attribute_list function_type_ptr ')' array_dimension
3840	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3841	\| '(' function_type_array ')' multi_array_dimension // redundant parenthesis
3842	{ $$ = $2->addArray( $4 ); }
3843	\| '(' attribute_list function_type_array ')' multi_array_dimension // redundant parenthesis
3844	{ $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3845	\| '(' function_type_array ')' // redundant parenthesis
3846	{ $$ = $2; }
3847	\| '(' attribute_list function_type_array ')' // redundant parenthesis
3848	{ $$ = $3->addQualifiers( $2 ); }
3849	;
3850
3851	// This pattern parses a declaration for a parameter variable of a function prototype or actual that is not redefining a
3852	// typedef name and allows the C99 array options, which can only appear in a parameter list. The pattern precludes
3853	// declaring an array of functions versus a pointer to an array of functions, and returning arrays and functions versus
3854	// pointers to arrays and functions.
3855
3856	identifier_parameter_declarator:
3857	paren_identifier attribute_list_opt
3858	{ $$ = $1->addQualifiers( $2 ); }
3859	\| '&' MUTEX paren_identifier attribute_list_opt
3860	{ $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newFromTypeData( build_type_qualifier( ast::CV::Mutex ) ),
3861	OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3862	\| identifier_parameter_ptr
3863	\| identifier_parameter_array attribute_list_opt
3864	{ $$ = $1->addQualifiers( $2 ); }
3865	\| identifier_parameter_function attribute_list_opt
3866	{ $$ = $1->addQualifiers( $2 ); }
3867	;
3868
3869	identifier_parameter_ptr:
3870	ptrref_operator identifier_parameter_declarator
3871	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3872	\| ptrref_operator type_qualifier_list identifier_parameter_declarator
3873	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3874	\| '(' identifier_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3875	{ $$ = $2->addQualifiers( $4 ); }
3876	;
3877
3878	identifier_parameter_array:
3879	paren_identifier array_parameter_dimension
3880	{ $$ = $1->addArray( $2 ); }
3881	\| '(' identifier_parameter_ptr ')' array_dimension
3882	{ $$ = $2->addArray( $4 ); }
3883	\| '(' identifier_parameter_array ')' multi_array_dimension // redundant parenthesis
3884	{ $$ = $2->addArray( $4 ); }
3885	\| '(' identifier_parameter_array ')' // redundant parenthesis
3886	{ $$ = $2; }
3887	;
3888
3889	identifier_parameter_function:
3890	paren_identifier '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3891	{ $$ = $1->addParamList( $3 ); }
3892	\| '(' identifier_parameter_ptr ')' '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3893	{ $$ = $2->addParamList( $5 ); }
3894	\| '(' identifier_parameter_function ')' // redundant parenthesis
3895	{ $$ = $2; }
3896	;
3897
3898	// This pattern parses a declaration for a parameter variable or function prototype that is redefining a typedef name,
3899	// e.g.:
3900	//
3901	// typedef int foo;
3902	// forall( otype T ) struct foo;
3903	// int f( int foo ); // redefine typedef name in new scope
3904	//
3905	// and allows the C99 array options, which can only appear in a parameter list.
3906
3907	type_parameter_redeclarator:
3908	typedef_name attribute_list_opt
3909	{ $$ = $1->addQualifiers( $2 ); }
3910	\| '&' MUTEX typedef_name attribute_list_opt
3911	{ $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newFromTypeData( build_type_qualifier( ast::CV::Mutex ) ),
3912	OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3913	\| type_parameter_ptr
3914	\| type_parameter_array attribute_list_opt
3915	{ $$ = $1->addQualifiers( $2 ); }
3916	\| type_parameter_function attribute_list_opt
3917	{ $$ = $1->addQualifiers( $2 ); }
3918	;
3919
3920	typedef_name:
3921	TYPEDEFname
3922	{ $$ = DeclarationNode::newName( $1 ); }
3923	\| TYPEGENname
3924	{ $$ = DeclarationNode::newName( $1 ); }
3925	;
3926
3927	type_parameter_ptr:
3928	ptrref_operator type_parameter_redeclarator
3929	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3930	\| ptrref_operator type_qualifier_list type_parameter_redeclarator
3931	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3932	\| '(' type_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3933	{ $$ = $2->addQualifiers( $4 ); }
3934	;
3935
3936	type_parameter_array:
3937	typedef_name array_parameter_dimension
3938	{ $$ = $1->addArray( $2 ); }
3939	\| '(' type_parameter_ptr ')' array_parameter_dimension
3940	{ $$ = $2->addArray( $4 ); }
3941	;
3942
3943	type_parameter_function:
3944	typedef_name '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3945	{ $$ = $1->addParamList( $3 ); }
3946	\| '(' type_parameter_ptr ')' '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3947	{ $$ = $2->addParamList( $5 ); }
3948	;
3949
3950	// This pattern parses a declaration of an abstract variable or function prototype, i.e., there is no identifier to
3951	// which the type applies, e.g.:
3952	//
3953	// sizeof( int );
3954	// sizeof( int * );
3955	// sizeof( int [10] );
3956	// sizeof( int (*)() );
3957	// sizeof( int () );
3958	//
3959	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3960	// and functions versus pointers to arrays and functions.
3961
3962	abstract_declarator:
3963	abstract_ptr
3964	\| abstract_array attribute_list_opt
3965	{ $$ = $1->addQualifiers( $2 ); }
3966	\| abstract_function attribute_list_opt
3967	{ $$ = $1->addQualifiers( $2 ); }
3968	;
3969
3970	abstract_ptr:
3971	ptrref_operator
3972	{ $$ = DeclarationNode::newPointer( nullptr, $1 ); }
3973	\| ptrref_operator type_qualifier_list
3974	{ $$ = DeclarationNode::newPointer( $2, $1 ); }
3975	\| ptrref_operator abstract_declarator
3976	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3977	\| ptrref_operator type_qualifier_list abstract_declarator
3978	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3979	\| '(' abstract_ptr ')' attribute_list_opt
3980	{ $$ = $2->addQualifiers( $4 ); }
3981	;
3982
3983	abstract_array:
3984	array_dimension
3985	\| '(' abstract_ptr ')' array_dimension
3986	{ $$ = $2->addArray( $4 ); }
3987	\| '(' abstract_array ')' multi_array_dimension // redundant parenthesis
3988	{ $$ = $2->addArray( $4 ); }
3989	\| '(' abstract_array ')' // redundant parenthesis
3990	{ $$ = $2; }
3991	;
3992
3993	abstract_function:
3994	'(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3995	{ $$ = DeclarationNode::newFunction( nullptr, nullptr, $2, nullptr ); }
3996	\| '(' abstract_ptr ')' '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
3997	{ $$ = $2->addParamList( $5 ); }
3998	\| '(' abstract_function ')' // redundant parenthesis
3999	{ $$ = $2; }
4000	;
4001
4002	array_dimension:
4003	// Only the first dimension can be empty.
4004	'[' ']'
4005	{ $$ = DeclarationNode::newArray( nullptr, nullptr, false ); }
4006	\| '[' ']' multi_array_dimension
4007	{ $$ = DeclarationNode::newArray( nullptr, nullptr, false )->addArray( $3 ); }
4008	// Cannot use constant_expression because of tuples => semantic check
4009	\| '[' assignment_expression ',' comma_expression ']' // CFA
4010	{ $$ = DeclarationNode::newArray( $2, nullptr, false )->addArray( DeclarationNode::newArray( $4, nullptr, false ) ); }
4011	// { SemanticError( yylloc, "New array dimension is currently unimplemented." ); $$ = nullptr; }
4012
4013	// If needed, the following parses and does not use comma_expression, so the array structure can be built.
4014	// \| '[' push assignment_expression pop ',' push array_dimension_list pop ']' // CFA
4015
4016	\| '[' array_type_list ']' // CFA
4017	{ $$ = DeclarationNode::newArray( $2, nullptr, false ); }
4018	\| multi_array_dimension
4019	;
4020
4021	// array_dimension_list:
4022	// assignment_expression
4023	// \| array_dimension_list ',' assignment_expression
4024	// ;
4025
4026	array_type_list:
4027	basic_type_name
4028	{ $$ = new ExpressionNode( new ast::TypeExpr( yylloc, maybeMoveBuildType( $1 ) ) ); }
4029	\| type_name
4030	{ $$ = new ExpressionNode( new ast::TypeExpr( yylloc, maybeMoveBuildType( $1 ) ) ); }
4031	\| assignment_expression upupeq assignment_expression
4032	\| array_type_list ',' basic_type_name
4033	{ $$ = $1->set_last( new ExpressionNode( new ast::TypeExpr( yylloc, maybeMoveBuildType( $3 ) ) ) ); }
4034	\| array_type_list ',' type_name
4035	{ $$ = $1->set_last( new ExpressionNode( new ast::TypeExpr( yylloc, maybeMoveBuildType( $3 ) ) ) ); }
4036	\| array_type_list ',' assignment_expression upupeq assignment_expression
4037	;
4038
4039	upupeq:
4040	'~'
4041	{ $$ = OperKinds::LThan; }
4042	\| ErangeUpEq
4043	{ $$ = OperKinds::LEThan; }
4044	;
4045
4046	multi_array_dimension:
4047	'[' assignment_expression ']'
4048	{ $$ = DeclarationNode::newArray( $2, nullptr, false ); }
4049	\| '[' '*' ']' // C99
4050	{ $$ = DeclarationNode::newVarArray( 0 ); }
4051	\| multi_array_dimension '[' assignment_expression ']'
4052	{ $$ = $1->addArray( DeclarationNode::newArray( $3, nullptr, false ) ); }
4053	\| multi_array_dimension '[' '*' ']' // C99
4054	{ $$ = $1->addArray( DeclarationNode::newVarArray( 0 ) ); }
4055	;
4056
4057	// This pattern parses a declaration of a parameter abstract variable or function prototype, i.e., there is no
4058	// identifier to which the type applies, e.g.:
4059	//
4060	// int f( int ); // not handled here
4061	// int f( int * ); // abstract function-prototype parameter; no parameter name specified
4062	// int f( int (*)() ); // abstract function-prototype parameter; no parameter name specified
4063	// int f( int (int) ); // abstract function-prototype parameter; no parameter name specified
4064	//
4065	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
4066	// and functions versus pointers to arrays and functions. In addition, the pattern handles the special meaning of
4067	// parenthesis around a typedef name:
4068	//
4069	// ISO/IEC 9899:1999 Section 6.7.5.3(11) : "In a parameter declaration, a single typedef name in
4070	// parentheses is taken to be an abstract declarator that specifies a function with a single parameter,
4071	// not as redundant parentheses around the identifier."
4072	//
4073	// For example:
4074	//
4075	// typedef float T;
4076	// int f( int ( T [5] ) ); // see abstract_parameter_declarator
4077	// int g( int ( T ( int ) ) ); // see abstract_parameter_declarator
4078	// int f( int f1( T a[5] ) ); // see identifier_parameter_declarator
4079	// int g( int g1( T g2( int p ) ) ); // see identifier_parameter_declarator
4080	//
4081	// In essence, a '(' immediately to the left of typedef name, T, is interpreted as starting a parameter type list, and
4082	// not as redundant parentheses around a redeclaration of T. Finally, the pattern also precludes declaring an array of
4083	// functions versus a pointer to an array of functions, and returning arrays and functions versus pointers to arrays and
4084	// functions.
4085
4086	abstract_parameter_declarator_opt:
4087	// empty
4088	{ $$ = nullptr; }
4089	\| abstract_parameter_declarator
4090	;
4091
4092	abstract_parameter_declarator:
4093	abstract_parameter_ptr
4094	\| '&' MUTEX attribute_list_opt
4095	{ $$ = DeclarationNode::newPointer( DeclarationNode::newFromTypeData( build_type_qualifier( ast::CV::Mutex ) ),
4096	OperKinds::AddressOf )->addQualifiers( $3 ); }
4097	\| abstract_parameter_array attribute_list_opt
4098	{ $$ = $1->addQualifiers( $2 ); }
4099	\| abstract_parameter_function attribute_list_opt
4100	{ $$ = $1->addQualifiers( $2 ); }
4101	;
4102
4103	abstract_parameter_ptr:
4104	ptrref_operator
4105	{ $$ = DeclarationNode::newPointer( nullptr, $1 ); }
4106	\| ptrref_operator type_qualifier_list
4107	{ $$ = DeclarationNode::newPointer( $2, $1 ); }
4108	\| ptrref_operator abstract_parameter_declarator
4109	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
4110	\| ptrref_operator type_qualifier_list abstract_parameter_declarator
4111	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
4112	\| '(' abstract_parameter_ptr ')' attribute_list_opt // redundant parenthesis
4113	{ $$ = $2->addQualifiers( $4 ); }
4114	;
4115
4116	abstract_parameter_array:
4117	array_parameter_dimension
4118	\| '(' abstract_parameter_ptr ')' array_parameter_dimension
4119	{ $$ = $2->addArray( $4 ); }
4120	\| '(' abstract_parameter_array ')' multi_array_dimension // redundant parenthesis
4121	{ $$ = $2->addArray( $4 ); }
4122	\| '(' abstract_parameter_array ')' // redundant parenthesis
4123	{ $$ = $2; }
4124	;
4125
4126	abstract_parameter_function:
4127	'(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
4128	{ $$ = DeclarationNode::newFunction( nullptr, nullptr, $2, nullptr ); }
4129	\| '(' abstract_parameter_ptr ')' '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
4130	{ $$ = $2->addParamList( $5 ); }
4131	\| '(' abstract_parameter_function ')' // redundant parenthesis
4132	{ $$ = $2; }
4133	;
4134
4135	array_parameter_dimension:
4136	// Only the first dimension can be empty or have qualifiers.
4137	array_parameter_1st_dimension
4138	\| array_parameter_1st_dimension multi_array_dimension
4139	{ $$ = $1->addArray( $2 ); }
4140	\| multi_array_dimension
4141	;
4142
4143	// The declaration of an array parameter has additional syntax over arrays in normal variable declarations:
4144	//
4145	// ISO/IEC 9899:1999 Section 6.7.5.2(1) : "The optional type qualifiers and the keyword static shall appear only in
4146	// a declaration of a function parameter with an array type, and then only in the outermost array type derivation."
4147
4148	array_parameter_1st_dimension:
4149	'[' ']'
4150	{ $$ = DeclarationNode::newArray( nullptr, nullptr, false ); }
4151	// multi_array_dimension handles the '[' '*' ']' case
4152	\| '[' push type_qualifier_list '*' pop ']' // remaining C99
4153	{ $$ = DeclarationNode::newVarArray( $3 ); }
4154	\| '[' push type_qualifier_list pop ']'
4155	{ $$ = DeclarationNode::newArray( nullptr, $3, false ); }
4156	// multi_array_dimension handles the '[' assignment_expression ']' case
4157	\| '[' push type_qualifier_list assignment_expression pop ']'
4158	{ $$ = DeclarationNode::newArray( $4, $3, false ); }
4159	\| '[' push STATIC type_qualifier_list_opt assignment_expression pop ']'
4160	{ $$ = DeclarationNode::newArray( $5, $4, true ); }
4161	\| '[' push type_qualifier_list STATIC assignment_expression pop ']'
4162	{ $$ = DeclarationNode::newArray( $5, $3, true ); }
4163	;
4164
4165	// This pattern parses a declaration of an abstract variable, but does not allow "int ()" for a function pointer.
4166	//
4167	// struct S {
4168	// int;
4169	// int *;
4170	// int [10];
4171	// int (*)();
4172	// };
4173
4174	variable_abstract_declarator:
4175	variable_abstract_ptr
4176	\| variable_abstract_array attribute_list_opt
4177	{ $$ = $1->addQualifiers( $2 ); }
4178	\| variable_abstract_function attribute_list_opt
4179	{ $$ = $1->addQualifiers( $2 ); }
4180	;
4181
4182	variable_abstract_ptr:
4183	ptrref_operator
4184	{ $$ = DeclarationNode::newPointer( nullptr, $1 ); }
4185	\| ptrref_operator type_qualifier_list
4186	{ $$ = DeclarationNode::newPointer( $2, $1 ); }
4187	\| ptrref_operator variable_abstract_declarator
4188	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
4189	\| ptrref_operator type_qualifier_list variable_abstract_declarator
4190	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
4191	\| '(' variable_abstract_ptr ')' attribute_list_opt // redundant parenthesis
4192	{ $$ = $2->addQualifiers( $4 ); }
4193	;
4194
4195	variable_abstract_array:
4196	array_dimension
4197	\| '(' variable_abstract_ptr ')' array_dimension
4198	{ $$ = $2->addArray( $4 ); }
4199	\| '(' variable_abstract_array ')' multi_array_dimension // redundant parenthesis
4200	{ $$ = $2->addArray( $4 ); }
4201	\| '(' variable_abstract_array ')' // redundant parenthesis
4202	{ $$ = $2; }
4203	;
4204
4205	variable_abstract_function:
4206	'(' variable_abstract_ptr ')' '(' parameter_list_ellipsis_opt ')' // empty parameter list OBSOLESCENT (see 3)
4207	{ $$ = $2->addParamList( $5 ); }
4208	\| '(' variable_abstract_function ')' // redundant parenthesis
4209	{ $$ = $2; }
4210	;
4211
4212	// This pattern parses a new-style declaration for a parameter variable or function prototype that is either an
4213	// identifier or typedef name and allows the C99 array options, which can only appear in a parameter list.
4214
4215	cfa_identifier_parameter_declarator_tuple: // CFA
4216	cfa_identifier_parameter_declarator_no_tuple
4217	\| cfa_abstract_tuple
4218	\| type_qualifier_list cfa_abstract_tuple
4219	{ $$ = $2->addQualifiers( $1 ); }
4220	;
4221
4222	cfa_identifier_parameter_declarator_no_tuple: // CFA
4223	cfa_identifier_parameter_ptr
4224	\| cfa_identifier_parameter_array
4225	;
4226
4227	cfa_identifier_parameter_ptr: // CFA
4228	// No SUE declaration in parameter list.
4229	ptrref_operator type_specifier_nobody
4230	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
4231	\| type_qualifier_list ptrref_operator type_specifier_nobody
4232	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
4233	\| ptrref_operator cfa_abstract_function
4234	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
4235	\| type_qualifier_list ptrref_operator cfa_abstract_function
4236	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
4237	\| ptrref_operator cfa_identifier_parameter_declarator_tuple
4238	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
4239	\| type_qualifier_list ptrref_operator cfa_identifier_parameter_declarator_tuple
4240	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
4241	;
4242
4243	cfa_identifier_parameter_array: // CFA
4244	// Only the first dimension can be empty or have qualifiers. Empty dimension must be factored out due to
4245	// shift/reduce conflict with new-style empty (void) function return type.
4246	'[' ']' type_specifier_nobody
4247	{ $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
4248	\| cfa_array_parameter_1st_dimension type_specifier_nobody
4249	{ $$ = $2->addNewArray( $1 ); }
4250	\| '[' ']' multi_array_dimension type_specifier_nobody
4251	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
4252	\| cfa_array_parameter_1st_dimension multi_array_dimension type_specifier_nobody
4253	{ $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
4254	\| multi_array_dimension type_specifier_nobody
4255	{ $$ = $2->addNewArray( $1 ); }
4256
4257	\| '[' ']' cfa_identifier_parameter_ptr
4258	{ $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
4259	\| cfa_array_parameter_1st_dimension cfa_identifier_parameter_ptr
4260	{ $$ = $2->addNewArray( $1 ); }
4261	\| '[' ']' multi_array_dimension cfa_identifier_parameter_ptr
4262	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
4263	\| cfa_array_parameter_1st_dimension multi_array_dimension cfa_identifier_parameter_ptr
4264	{ $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
4265	\| multi_array_dimension cfa_identifier_parameter_ptr
4266	{ $$ = $2->addNewArray( $1 ); }
4267	;
4268
4269	cfa_array_parameter_1st_dimension:
4270	'[' type_qualifier_list '*' ']' // remaining C99
4271	{ $$ = DeclarationNode::newVarArray( $2 ); }
4272	\| '[' type_qualifier_list assignment_expression ']'
4273	{ $$ = DeclarationNode::newArray( $3, $2, false ); }
4274	\| '[' declaration_qualifier_list assignment_expression ']'
4275	// declaration_qualifier_list must be used because of shift/reduce conflict with
4276	// assignment_expression, so a semantic check is necessary to preclude them as a type_qualifier cannot
4277	// appear in this context.
4278	{ $$ = DeclarationNode::newArray( $3, $2, true ); }
4279	\| '[' declaration_qualifier_list type_qualifier_list assignment_expression ']'
4280	{ $$ = DeclarationNode::newArray( $4, $3->addQualifiers( $2 ), true ); }
4281	;
4282
4283	// This pattern parses a new-style declaration of an abstract variable or function prototype, i.e., there is no
4284	// identifier to which the type applies, e.g.:
4285	//
4286	// [int] f( int ); // abstract variable parameter; no parameter name specified
4287	// [int] f( [int] (int) ); // abstract function-prototype parameter; no parameter name specified
4288	//
4289	// These rules need LR(3):
4290	//
4291	// cfa_abstract_tuple identifier_or_type_name
4292	// '[' cfa_parameter_list ']' identifier_or_type_name '(' cfa_parameter_list_ellipsis_opt ')'
4293	//
4294	// since a function return type can be syntactically identical to a tuple type:
4295	//
4296	// [int, int] t;
4297	// [int, int] f( int );
4298	//
4299	// Therefore, it is necessary to look at the token after identifier_or_type_name to know when to reduce
4300	// cfa_abstract_tuple. To make this LR(1), several rules have to be flattened (lengthened) to allow the necessary
4301	// lookahead. To accomplish this, cfa_abstract_declarator has an entry point without tuple, and tuple declarations are
4302	// duplicated when appearing with cfa_function_specifier.
4303
4304	cfa_abstract_declarator_tuple: // CFA
4305	cfa_abstract_tuple
4306	\| type_qualifier_list cfa_abstract_tuple
4307	{ $$ = $2->addQualifiers( $1 ); }
4308	\| cfa_abstract_declarator_no_tuple
4309	;
4310
4311	cfa_abstract_declarator_no_tuple: // CFA
4312	cfa_abstract_ptr
4313	\| cfa_abstract_array
4314	;
4315
4316	cfa_abstract_ptr: // CFA
4317	ptrref_operator type_specifier
4318	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
4319	\| type_qualifier_list ptrref_operator type_specifier
4320	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
4321	\| ptrref_operator cfa_abstract_function
4322	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
4323	\| type_qualifier_list ptrref_operator cfa_abstract_function
4324	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
4325	\| ptrref_operator cfa_abstract_declarator_tuple
4326	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
4327	\| type_qualifier_list ptrref_operator cfa_abstract_declarator_tuple
4328	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
4329	;
4330
4331	cfa_abstract_array: // CFA
4332	// Only the first dimension can be empty. Empty dimension must be factored out due to shift/reduce conflict with
4333	// empty (void) function return type.
4334	'[' ']' type_specifier
4335	{ $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
4336	\| '[' ']' multi_array_dimension type_specifier
4337	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
4338	\| multi_array_dimension type_specifier
4339	{ $$ = $2->addNewArray( $1 ); }
4340	\| '[' ']' cfa_abstract_ptr
4341	{ $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
4342	\| '[' ']' multi_array_dimension cfa_abstract_ptr
4343	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
4344	\| multi_array_dimension cfa_abstract_ptr
4345	{ $$ = $2->addNewArray( $1 ); }
4346	;
4347
4348	cfa_abstract_tuple: // CFA
4349	'[' cfa_abstract_parameter_list ']'
4350	{ $$ = DeclarationNode::newTuple( $2 ); }
4351	\| '[' type_specifier_nobody ELLIPSIS ']'
4352	{ SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
4353	\| '[' type_specifier_nobody ELLIPSIS constant_expression ']'
4354	{ SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
4355	;
4356
4357	cfa_abstract_function: // CFA
4358	'[' ']' '(' cfa_parameter_list_ellipsis_opt ')'
4359	{ $$ = DeclarationNode::newFunction( nullptr, DeclarationNode::newTuple( nullptr ), $4, nullptr ); }
4360	\| cfa_abstract_tuple '(' push cfa_parameter_list_ellipsis_opt pop ')'
4361	{ $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
4362	\| cfa_function_return '(' push cfa_parameter_list_ellipsis_opt pop ')'
4363	{ $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
4364	;
4365
4366	// 1) ISO/IEC 9899:1999 Section 6.7.2(2) : "At least one type specifier shall be given in the declaration specifiers in
4367	// each declaration, and in the specifier-qualifier list in each structure declaration and type name."
4368	//
4369	// 2) ISO/IEC 9899:1999 Section 6.11.5(1) : "The placement of a storage-class specifier other than at the beginning of
4370	// the declaration specifiers in a declaration is an obsolescent feature."
4371	//
4372	// 3) ISO/IEC 9899:1999 Section 6.11.6(1) : "The use of function declarators with empty parentheses (not
4373	// prototype-format parameter type declarators) is an obsolescent feature."
4374	//
4375	// 4) ISO/IEC 9899:1999 Section 6.11.7(1) : "The use of function definitions with separate parameter identifier and
4376	// declaration lists (not prototype-format parameter type and identifier declarators) is an obsolescent feature.
4377
4378	// ********************** MISCELLANEOUS ******************************
4379
4380	comma_opt: // redundant comma
4381	// empty
4382	\| ','
4383	;
4384
4385	default_initializer_opt:
4386	// empty
4387	{ $$ = nullptr; }
4388	\| '=' assignment_expression
4389	{ $$ = $2; }
4390	;
4391
4392	%%
4393
4394	// ----end of grammar----
4395
4396	// Local Variables: //
4397	// mode: c++ //
4398	// tab-width: 4 //
4399	// compile-command: "bison -Wcounterexamples parser.yy" //
4400	// End: //

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

Download in other formats:

Original Format