Context Navigation

parser.yy @ 08e0d65

Last change on this file since 08e0d65 was b6f2e7ab, checked in by Andrew Beach <ajbeach@…>, 2 months ago
Removed SizeofExpr::expr and AlignofExpr::expr, expressions that would be stored there are wrapped in TypeofType? and stored in the type field. Some special cases to hide the typeof in code generation were added. In addition, initializer length is calculated in more cases so that the full type of more arrays is known sooner. Other than that, most of the code changes were just stripping out the conditional code and checks no longer needed. Some tests had to be updated, because the typeof is not hidden in dumps and the resolver replaces known typeof expressions with the type. The extension case caused some concern but it appears that just hides warnings in the expression which no longer exists.
Property mode set to `100644`
File size: 178.8 KB

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

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

Download in other formats:

Original Format