Context Navigation

parser.yy @ 21a44ca

ADTarm-ehast-experimentalcleanup-dtorsenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprpthread-emulationqualifiedEnum

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

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

Download in other formats:

Original Format