Context Navigation

parser.yy @ 5b544a6

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

Last change on this file since 5b544a6 was 9306559f, checked in by Thierry Delisle <tdelisle@…>, 5 years ago
Fixed small errors in generators code
Property mode set to `100644`
File size: 136.3 KB

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

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

Download in other formats:

Original Format