Context Navigation

parser.yy @ c1b0b8f

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

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

Download in other formats:

Original Format