Context Navigation

parser.yy @ d435c04

ADTarm-ehast-experimentalenumforall-pointer-decayjacob/cs343-translationnew-ast-unique-exprpthread-emulationqualifiedEnum

Last change on this file since d435c04 was b66d14a, checked in by Peter A. Buhr <pabuhr@…>, 4 years ago
add new type kinds DStype and ALtype
Property mode set to `100644`
File size: 137.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 : Mon Jan 11 21:32:10 2021
13	// Update Count : 4633
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_opt argument_expression default_initializer_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 new_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_opt '}' // 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_opt ')'
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_opt '}' // 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_opt:
673	// empty
674	{ $$ = nullptr; }
675	\| argument_expression
676	\| argument_expression_list_opt ',' 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 ')' cast_expression // CFA
796	{ $$ = new ExpressionNode( new VirtualCastExpr( maybeMoveBuild< Expression >( $4 ), maybeMoveBuildType( nullptr ) ) ); }
797	\| '(' VIRTUAL type_no_function ')' cast_expression // CFA
798	{ $$ = new ExpressionNode( new VirtualCastExpr( maybeMoveBuild< Expression >( $5 ), maybeMoveBuildType( $3 ) ) ); }
799	\| '(' RETURN type_no_function ')' cast_expression // CFA
800	{ SemanticError( yylloc, "Return cast is currently unimplemented." ); $$ = nullptr; }
801	\| '(' COERCE type_no_function ')' cast_expression // CFA
802	{ SemanticError( yylloc, "Coerce cast is currently unimplemented." ); $$ = nullptr; }
803	\| '(' qualifier_cast_list ')' cast_expression // CFA
804	{ SemanticError( yylloc, "Qualifier cast is currently unimplemented." ); $$ = nullptr; }
805	// \| '(' type_no_function ')' tuple
806	// { $$ = new ExpressionNode( build_cast( $2, $4 ) ); }
807	;
808
809	qualifier_cast_list:
810	cast_modifier type_qualifier_name
811	\| cast_modifier MUTEX
812	\| qualifier_cast_list cast_modifier type_qualifier_name
813	\| qualifier_cast_list cast_modifier MUTEX
814	;
815
816	cast_modifier:
817	'-'
818	\| '+'
819	;
820
821	exponential_expression:
822	cast_expression
823	\| exponential_expression '\\' cast_expression
824	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Exp, $1, $3 ) ); }
825	;
826
827	multiplicative_expression:
828	exponential_expression
829	\| multiplicative_expression '*' exponential_expression
830	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Mul, $1, $3 ) ); }
831	\| multiplicative_expression '/' exponential_expression
832	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Div, $1, $3 ) ); }
833	\| multiplicative_expression '%' exponential_expression
834	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Mod, $1, $3 ) ); }
835	;
836
837	additive_expression:
838	multiplicative_expression
839	\| additive_expression '+' multiplicative_expression
840	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Plus, $1, $3 ) ); }
841	\| additive_expression '-' multiplicative_expression
842	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Minus, $1, $3 ) ); }
843	;
844
845	shift_expression:
846	additive_expression
847	\| shift_expression LS additive_expression
848	{ $$ = new ExpressionNode( build_binary_val( OperKinds::LShift, $1, $3 ) ); }
849	\| shift_expression RS additive_expression
850	{ $$ = new ExpressionNode( build_binary_val( OperKinds::RShift, $1, $3 ) ); }
851	;
852
853	relational_expression:
854	shift_expression
855	\| relational_expression '<' shift_expression
856	{ $$ = new ExpressionNode( build_binary_val( OperKinds::LThan, $1, $3 ) ); }
857	\| relational_expression '>' shift_expression
858	{ $$ = new ExpressionNode( build_binary_val( OperKinds::GThan, $1, $3 ) ); }
859	\| relational_expression LE shift_expression
860	{ $$ = new ExpressionNode( build_binary_val( OperKinds::LEThan, $1, $3 ) ); }
861	\| relational_expression GE shift_expression
862	{ $$ = new ExpressionNode( build_binary_val( OperKinds::GEThan, $1, $3 ) ); }
863	;
864
865	equality_expression:
866	relational_expression
867	\| equality_expression EQ relational_expression
868	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Eq, $1, $3 ) ); }
869	\| equality_expression NE relational_expression
870	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Neq, $1, $3 ) ); }
871	;
872
873	AND_expression:
874	equality_expression
875	\| AND_expression '&' equality_expression
876	{ $$ = new ExpressionNode( build_binary_val( OperKinds::BitAnd, $1, $3 ) ); }
877	;
878
879	exclusive_OR_expression:
880	AND_expression
881	\| exclusive_OR_expression '^' AND_expression
882	{ $$ = new ExpressionNode( build_binary_val( OperKinds::Xor, $1, $3 ) ); }
883	;
884
885	inclusive_OR_expression:
886	exclusive_OR_expression
887	\| inclusive_OR_expression '\|' exclusive_OR_expression
888	{ $$ = new ExpressionNode( build_binary_val( OperKinds::BitOr, $1, $3 ) ); }
889	;
890
891	logical_AND_expression:
892	inclusive_OR_expression
893	\| logical_AND_expression ANDAND inclusive_OR_expression
894	{ $$ = new ExpressionNode( build_and_or( $1, $3, true ) ); }
895	;
896
897	logical_OR_expression:
898	logical_AND_expression
899	\| logical_OR_expression OROR logical_AND_expression
900	{ $$ = new ExpressionNode( build_and_or( $1, $3, false ) ); }
901	;
902
903	conditional_expression:
904	logical_OR_expression
905	\| logical_OR_expression '?' comma_expression ':' conditional_expression
906	{ $$ = new ExpressionNode( build_cond( $1, $3, $5 ) ); }
907	// FIX ME: computes $1 twice
908	\| logical_OR_expression '?' /* empty */ ':' conditional_expression // GCC, omitted first operand
909	{ $$ = new ExpressionNode( build_cond( $1, $1, $4 ) ); }
910	;
911
912	constant_expression:
913	conditional_expression
914	;
915
916	assignment_expression:
917	// CFA, assignment is separated from assignment_operator to ensure no assignment operations for tuples
918	conditional_expression
919	\| unary_expression assignment_operator assignment_expression
920	{
921	// if ( $2 == OperKinds::AtAssn ) {
922	// SemanticError( yylloc, "C @= assignment is currently unimplemented." ); $$ = nullptr;
923	// } else {
924	$$ = new ExpressionNode( build_binary_val( $2, $1, $3 ) );
925	// } // if
926	}
927	\| unary_expression '=' '{' initializer_list_opt comma_opt '}'
928	{ SemanticError( yylloc, "Initializer assignment is currently unimplemented." ); $$ = nullptr; }
929	;
930
931	assignment_expression_opt:
932	// empty
933	{ $$ = nullptr; }
934	\| assignment_expression
935	;
936
937	assignment_operator:
938	'=' { $$ = OperKinds::Assign; }
939	\| ATassign { $$ = OperKinds::AtAssn; }
940	\| EXPassign { $$ = OperKinds::ExpAssn; }
941	\| MULTassign { $$ = OperKinds::MulAssn; }
942	\| DIVassign { $$ = OperKinds::DivAssn; }
943	\| MODassign { $$ = OperKinds::ModAssn; }
944	\| PLUSassign { $$ = OperKinds::PlusAssn; }
945	\| MINUSassign { $$ = OperKinds::MinusAssn; }
946	\| LSassign { $$ = OperKinds::LSAssn; }
947	\| RSassign { $$ = OperKinds::RSAssn; }
948	\| ANDassign { $$ = OperKinds::AndAssn; }
949	\| ERassign { $$ = OperKinds::ERAssn; }
950	\| ORassign { $$ = OperKinds::OrAssn; }
951	;
952
953	tuple: // CFA, tuple
954	// CFA, one assignment_expression is factored out of comma_expression to eliminate a shift/reduce conflict with
955	// comma_expression in cfa_identifier_parameter_array and cfa_abstract_array
956	// '[' ']'
957	// { $$ = new ExpressionNode( build_tuple() ); }
958	// \| '[' push assignment_expression pop ']'
959	// { $$ = new ExpressionNode( build_tuple( $3 ) ); }
960	'[' ',' tuple_expression_list ']'
961	{ $$ = new ExpressionNode( build_tuple( (ExpressionNode *)(new ExpressionNode( nullptr ) )->set_last( $3 ) ) ); }
962	\| '[' push assignment_expression pop ',' tuple_expression_list ']'
963	{ $$ = new ExpressionNode( build_tuple( (ExpressionNode *)($3->set_last( $6 ) ) )); }
964	;
965
966	tuple_expression_list:
967	assignment_expression
968	\| '@' // CFA
969	{ SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
970	\| tuple_expression_list ',' assignment_expression
971	{ $$ = (ExpressionNode *)($1->set_last( $3 )); }
972	\| tuple_expression_list ',' '@'
973	{ SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
974	;
975
976	comma_expression:
977	assignment_expression
978	\| comma_expression ',' assignment_expression
979	{ $$ = new ExpressionNode( new CommaExpr( maybeMoveBuild< Expression >( $1 ), maybeMoveBuild< Expression >( $3 ) ) ); }
980	;
981
982	comma_expression_opt:
983	// empty
984	{ $$ = nullptr; }
985	\| comma_expression
986	;
987
988	//************************* STATEMENTS *****************************
989
990	statement:
991	labeled_statement
992	\| compound_statement
993	\| expression_statement
994	\| selection_statement
995	\| iteration_statement
996	\| jump_statement
997	\| with_statement
998	\| mutex_statement
999	\| waitfor_statement
1000	\| exception_statement
1001	\| enable_disable_statement
1002	{ SemanticError( yylloc, "enable/disable statement is currently unimplemented." ); $$ = nullptr; }
1003	\| asm_statement
1004	\| DIRECTIVE
1005	{ $$ = new StatementNode( build_directive( $1 ) ); }
1006	;
1007
1008	labeled_statement:
1009	// labels cannot be identifiers 0 or 1
1010	identifier_or_type_name ':' attribute_list_opt statement
1011	{ $$ = $4->add_label( $1, $3 ); }
1012	;
1013
1014	compound_statement:
1015	'{' '}'
1016	{ $$ = new StatementNode( build_compound( (StatementNode *)0 ) ); }
1017	\| '{' push
1018	local_label_declaration_opt // GCC, local labels
1019	statement_decl_list // C99, intermix declarations and statements
1020	pop '}'
1021	{ $$ = new StatementNode( build_compound( $4 ) ); }
1022	;
1023
1024	statement_decl_list: // C99
1025	statement_decl
1026	\| statement_decl_list statement_decl
1027	{ assert( $1 ); $1->set_last( $2 ); $$ = $1; }
1028	;
1029
1030	statement_decl:
1031	declaration // CFA, new & old style declarations
1032	{ $$ = new StatementNode( $1 ); }
1033	\| EXTENSION declaration // GCC
1034	{ distExt( $2 ); $$ = new StatementNode( $2 ); }
1035	\| function_definition
1036	{ $$ = new StatementNode( $1 ); }
1037	\| EXTENSION function_definition // GCC
1038	{ distExt( $2 ); $$ = new StatementNode( $2 ); }
1039	\| statement
1040	;
1041
1042	statement_list_nodecl:
1043	statement
1044	\| statement_list_nodecl statement
1045	{ assert( $1 ); $1->set_last( $2 ); $$ = $1; }
1046	;
1047
1048	expression_statement:
1049	comma_expression_opt ';'
1050	{ $$ = new StatementNode( build_expr( $1 ) ); }
1051	;
1052
1053	selection_statement:
1054	// pop causes a S/R conflict without separating the IF statement into a non-terminal even after resolving
1055	// the inherent S/R conflict with THEN/ELSE.
1056	push if_statement pop
1057	{ $$ = $2; }
1058	\| SWITCH '(' comma_expression ')' case_clause
1059	{ $$ = new StatementNode( build_switch( true, $3, $5 ) ); }
1060	\| SWITCH '(' comma_expression ')' '{' push declaration_list_opt switch_clause_list_opt pop '}' // CFA
1061	{
1062	StatementNode *sw = new StatementNode( build_switch( true, $3, $8 ) );
1063	// The semantics of the declaration list is changed to include associated initialization, which is performed
1064	// before the transfer to the appropriate case clause by hoisting the declarations into a compound
1065	// statement around the switch. Statements after the initial declaration list can never be executed, and
1066	// therefore, are removed from the grammar even though C allows it. The change also applies to choose
1067	// statement.
1068	$$ = $7 ? new StatementNode( build_compound( (StatementNode *)((new StatementNode( $7 ))->set_last( sw )) ) ) : sw;
1069	}
1070	\| CHOOSE '(' comma_expression ')' case_clause // CFA
1071	{ $$ = new StatementNode( build_switch( false, $3, $5 ) ); }
1072	\| CHOOSE '(' comma_expression ')' '{' push declaration_list_opt switch_clause_list_opt pop '}' // CFA
1073	{
1074	StatementNode *sw = new StatementNode( build_switch( false, $3, $8 ) );
1075	$$ = $7 ? new StatementNode( build_compound( (StatementNode *)((new StatementNode( $7 ))->set_last( sw )) ) ) : sw;
1076	}
1077	;
1078
1079	if_statement:
1080	IF '(' if_control_expression ')' statement %prec THEN
1081	// explicitly deal with the shift/reduce conflict on if/else
1082	{ $$ = new StatementNode( build_if( $3, maybe_build_compound( $5 ), nullptr ) ); }
1083	\| IF '(' if_control_expression ')' statement ELSE statement
1084	{ $$ = new StatementNode( build_if( $3, maybe_build_compound( $5 ), maybe_build_compound( $7 ) ) ); }
1085	;
1086
1087	if_control_expression:
1088	comma_expression
1089	{ $$ = new IfCtrl( nullptr, $1 ); }
1090	\| c_declaration // no semi-colon
1091	{ $$ = new IfCtrl( $1, nullptr ); }
1092	\| cfa_declaration // no semi-colon
1093	{ $$ = new IfCtrl( $1, nullptr ); }
1094	\| declaration comma_expression // semi-colon separated
1095	{ $$ = new IfCtrl( $1, $2 ); }
1096	;
1097
1098	// CASE and DEFAULT clauses are only allowed in the SWITCH statement, precluding Duff's device. In addition, a case
1099	// clause allows a list of values and subranges.
1100
1101	case_value: // CFA
1102	constant_expression { $$ = $1; }
1103	\| constant_expression ELLIPSIS constant_expression // GCC, subrange
1104	{ $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild< Expression >( $1 ), maybeMoveBuild< Expression >( $3 ) ) ); }
1105	\| subrange // CFA, subrange
1106	;
1107
1108	case_value_list: // CFA
1109	case_value { $$ = new StatementNode( build_case( $1 ) ); }
1110	// convert case list, e.g., "case 1, 3, 5:" into "case 1: case 3: case 5"
1111	\| case_value_list ',' case_value { $$ = (StatementNode *)($1->set_last( new StatementNode( build_case( $3 ) ) ) ); }
1112	;
1113
1114	case_label: // CFA
1115	CASE case_value_list ':' { $$ = $2; }
1116	\| DEFAULT ':' { $$ = new StatementNode( build_default() ); }
1117	// A semantic check is required to ensure only one default clause per switch/choose statement.
1118	;
1119
1120	//label_list_opt:
1121	// // empty
1122	// \| identifier_or_type_name ':'
1123	// \| label_list_opt identifier_or_type_name ':'
1124	// ;
1125
1126	case_label_list: // CFA
1127	case_label
1128	\| case_label_list case_label { $$ = (StatementNode *)( $1->set_last( $2 )); }
1129	;
1130
1131	case_clause: // CFA
1132	case_label_list statement { $$ = $1->append_last_case( maybe_build_compound( $2 ) ); }
1133	;
1134
1135	switch_clause_list_opt: // CFA
1136	// empty
1137	{ $$ = nullptr; }
1138	\| switch_clause_list
1139	;
1140
1141	switch_clause_list: // CFA
1142	case_label_list statement_list_nodecl
1143	{ $$ = $1->append_last_case( new StatementNode( build_compound( $2 ) ) ); }
1144	\| switch_clause_list case_label_list statement_list_nodecl
1145	{ $$ = (StatementNode *)( $1->set_last( $2->append_last_case( new StatementNode( build_compound( $3 ) ) ) ) ); }
1146	;
1147
1148	iteration_statement:
1149	WHILE '(' push if_control_expression ')' statement pop
1150	{ $$ = new StatementNode( build_while( $4, maybe_build_compound( $6 ) ) ); }
1151	\| WHILE '(' ')' statement // CFA => while ( 1 )
1152	{ $$ = new StatementNode( build_while( new IfCtrl( nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ), maybe_build_compound( $4 ) ) ); }
1153	\| DO statement WHILE '(' comma_expression ')' ';'
1154	{ $$ = new StatementNode( build_do_while( $5, maybe_build_compound( $2 ) ) ); }
1155	\| DO statement WHILE '(' ')' ';' // CFA => do while( 1 )
1156	{ $$ = new StatementNode( build_do_while( new ExpressionNode( build_constantInteger( *new string( "1" ) ) ), maybe_build_compound( $2 ) ) ); }
1157	\| FOR '(' push for_control_expression_list ')' statement pop
1158	{ $$ = new StatementNode( build_for( $4, maybe_build_compound( $6 ) ) ); }
1159	\| FOR '(' ')' statement // CFA => for ( ;; )
1160	{ $$ = new StatementNode( build_for( new ForCtrl( (ExpressionNode * )nullptr, (ExpressionNode * )nullptr, (ExpressionNode * )nullptr ), maybe_build_compound( $4 ) ) ); }
1161	;
1162
1163	for_control_expression_list:
1164	for_control_expression
1165	\| for_control_expression_list ':' for_control_expression
1166	// ForCtrl + ForCtrl:
1167	// init + init => multiple declaration statements that are hoisted
1168	// condition + condition => (expression) && (expression)
1169	// change + change => (expression), (expression)
1170	{
1171	$1->init->set_last( $3->init );
1172	if ( $1->condition ) {
1173	if ( $3->condition ) {
1174	$1->condition->expr.reset( new LogicalExpr( $1->condition->expr.release(), $3->condition->expr.release(), true ) );
1175	} // if
1176	} else $1->condition = $3->condition;
1177	if ( $1->change ) {
1178	if ( $3->change ) {
1179	$1->change->expr.reset( new CommaExpr( $1->change->expr.release(), $3->change->expr.release() ) );
1180	} // if
1181	} else $1->change = $3->change;
1182	$$ = $1;
1183	}
1184	;
1185
1186	for_control_expression:
1187	';' comma_expression_opt ';' comma_expression_opt
1188	{ $$ = new ForCtrl( (ExpressionNode * )nullptr, $2, $4 ); }
1189	\| comma_expression ';' comma_expression_opt ';' comma_expression_opt
1190	{ $$ = new ForCtrl( $1, $3, $5 ); }
1191	\| declaration comma_expression_opt ';' comma_expression_opt // C99, declaration has ';'
1192	{ $$ = new ForCtrl( $1, $2, $4 ); }
1193
1194	\| comma_expression // CFA
1195	{ $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1196	OperKinds::LThan, $1->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1197	\| '=' comma_expression // CFA
1198	{ $$ = forCtrl( $2, new string( DeclarationNode::anonymous.newName() ), new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1199	OperKinds::LEThan, $2->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1200	\| comma_expression inclexcl comma_expression // CFA
1201	{ $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), $1->clone(), $2, $3, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1202	\| comma_expression inclexcl comma_expression '~' comma_expression // CFA
1203	{ $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), $1->clone(), $2, $3, $5 ); }
1204	\| comma_expression ';' // CFA
1205	{ $$ = forCtrl( new ExpressionNode( build_constantInteger( *new string( "0u" ) ) ), $1, nullptr, OperKinds::LThan, nullptr, nullptr ); }
1206	\| comma_expression ';' comma_expression // CFA
1207	{ $$ = forCtrl( $3, $1, new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1208	OperKinds::LThan, $3->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1209	\| comma_expression ';' '=' comma_expression // CFA
1210	{ $$ = forCtrl( $4, $1, new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1211	OperKinds::LEThan, $4->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1212	\| comma_expression ';' comma_expression inclexcl comma_expression // CFA
1213	{ $$ = forCtrl( $3, $1, $3->clone(), $4, $5, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1214	\| comma_expression ';' comma_expression inclexcl comma_expression '~' comma_expression // CFA
1215	{ $$ = forCtrl( $3, $1, $3->clone(), $4, $5, $7 ); }
1216
1217	// There is a S/R conflicit if ~ and -~ are factored out.
1218	\| comma_expression ';' comma_expression '~' '@' // CFA
1219	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::LThan, nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1220	\| comma_expression ';' comma_expression ErangeDown '@' // CFA
1221	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::GThan, nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1222	\| comma_expression ';' comma_expression '~' '@' '~' comma_expression // CFA
1223	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::LThan, nullptr, $7 ); }
1224	\| comma_expression ';' comma_expression ErangeDown '@' '~' comma_expression // CFA
1225	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::GThan, nullptr, $7 ); }
1226	\| comma_expression ';' comma_expression '~' '@' '~' '@' // CFA
1227	{ $$ = forCtrl( $3, $1, $3->clone(), OperKinds::LThan, nullptr, nullptr ); }
1228	;
1229
1230	inclexcl:
1231	'~'
1232	{ $$ = OperKinds::LThan; }
1233	\| ErangeUpEq
1234	{ $$ = OperKinds::LEThan; }
1235	\| ErangeDown
1236	{ $$ = OperKinds::GThan; }
1237	\| ErangeDownEq
1238	{ $$ = OperKinds::GEThan; }
1239	;
1240
1241	jump_statement:
1242	GOTO identifier_or_type_name ';'
1243	{ $$ = new StatementNode( build_branch( $2, BranchStmt::Goto ) ); }
1244	\| GOTO '*' comma_expression ';' // GCC, computed goto
1245	// The syntax for the GCC computed goto violates normal expression precedence, e.g., goto i+3; => goto (i+3);
1246	// whereas normal operator precedence yields goto (*i)+3;
1247	{ $$ = new StatementNode( build_computedgoto( $3 ) ); }
1248	// A semantic check is required to ensure fallthru appears only in the body of a choose statement.
1249	\| fall_through_name ';' // CFA
1250	{ $$ = new StatementNode( build_branch( BranchStmt::FallThrough ) ); }
1251	\| fall_through_name identifier_or_type_name ';' // CFA
1252	{ $$ = new StatementNode( build_branch( $2, BranchStmt::FallThrough ) ); }
1253	\| fall_through_name DEFAULT ';' // CFA
1254	{ $$ = new StatementNode( build_branch( BranchStmt::FallThroughDefault ) ); }
1255	\| CONTINUE ';'
1256	// A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1257	{ $$ = new StatementNode( build_branch( BranchStmt::Continue ) ); }
1258	\| CONTINUE identifier_or_type_name ';' // CFA, multi-level continue
1259	// A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1260	// the target of the transfer appears only at the start of an iteration statement.
1261	{ $$ = new StatementNode( build_branch( $2, BranchStmt::Continue ) ); }
1262	\| BREAK ';'
1263	// A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1264	{ $$ = new StatementNode( build_branch( BranchStmt::Break ) ); }
1265	\| BREAK identifier_or_type_name ';' // CFA, multi-level exit
1266	// A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1267	// the target of the transfer appears only at the start of an iteration statement.
1268	{ $$ = new StatementNode( build_branch( $2, BranchStmt::Break ) ); }
1269	\| RETURN comma_expression_opt ';'
1270	{ $$ = new StatementNode( build_return( $2 ) ); }
1271	\| RETURN '{' initializer_list_opt comma_opt '}' ';'
1272	{ SemanticError( yylloc, "Initializer return is currently unimplemented." ); $$ = nullptr; }
1273	\| SUSPEND ';'
1274	{ $$ = new StatementNode( build_suspend( nullptr ) ); }
1275	\| SUSPEND compound_statement
1276	{ $$ = new StatementNode( build_suspend( $2 ) ); }
1277	\| SUSPEND COROUTINE ';'
1278	{ $$ = new StatementNode( build_suspend( nullptr, SuspendStmt::Coroutine ) ); }
1279	\| SUSPEND COROUTINE compound_statement
1280	{ $$ = new StatementNode( build_suspend( $3, SuspendStmt::Coroutine ) ); }
1281	\| SUSPEND GENERATOR ';'
1282	{ $$ = new StatementNode( build_suspend( nullptr, SuspendStmt::Generator ) ); }
1283	\| SUSPEND GENERATOR compound_statement
1284	{ $$ = new StatementNode( build_suspend( $3, SuspendStmt::Generator ) ); }
1285	\| THROW assignment_expression_opt ';' // handles rethrow
1286	{ $$ = new StatementNode( build_throw( $2 ) ); }
1287	\| THROWRESUME assignment_expression_opt ';' // handles reresume
1288	{ $$ = new StatementNode( build_resume( $2 ) ); }
1289	\| THROWRESUME assignment_expression_opt AT assignment_expression ';' // handles reresume
1290	{ $$ = new StatementNode( build_resume_at( $2, $4 ) ); }
1291	;
1292
1293	fall_through_name: // CFA
1294	FALLTHRU
1295	\| FALLTHROUGH
1296	;
1297
1298	with_statement:
1299	WITH '(' tuple_expression_list ')' statement
1300	{
1301	$$ = new StatementNode( build_with( $3, $5 ) );
1302	}
1303	;
1304
1305	// If MUTEX becomes a general qualifier, there are shift/reduce conflicts, so change syntax to "with mutex".
1306	mutex_statement:
1307	MUTEX '(' argument_expression_list_opt ')' statement
1308	{ SemanticError( yylloc, "Mutex statement is currently unimplemented." ); $$ = nullptr; }
1309	;
1310
1311	when_clause:
1312	WHEN '(' comma_expression ')' { $$ = $3; }
1313	;
1314
1315	when_clause_opt:
1316	// empty
1317	{ $$ = nullptr; }
1318	\| when_clause
1319	;
1320
1321	waitfor:
1322	WAITFOR '(' cast_expression ')'
1323	{ $$ = $3; }
1324	// \| WAITFOR '(' cast_expression ',' argument_expression_list_opt ')'
1325	// { $$ = (ExpressionNode *)$3->set_last( $5 ); }
1326	\| WAITFOR '(' cast_expression_list ':' argument_expression_list_opt ')'
1327	{ $$ = (ExpressionNode *)($3->set_last( $5 )); }
1328	;
1329
1330	cast_expression_list:
1331	cast_expression
1332	\| cast_expression_list ',' cast_expression
1333	// { $$ = (ExpressionNode *)($1->set_last( $3 )); }
1334	{ SemanticError( yylloc, "List of mutex member is currently unimplemented." ); $$ = nullptr; }
1335	;
1336
1337	timeout:
1338	TIMEOUT '(' comma_expression ')' { $$ = $3; }
1339	;
1340
1341	waitfor_clause:
1342	when_clause_opt waitfor statement %prec THEN
1343	{ $$ = build_waitfor( $2, maybe_build_compound( $3 ), $1 ); }
1344	\| when_clause_opt waitfor statement WOR waitfor_clause
1345	{ $$ = build_waitfor( $2, maybe_build_compound( $3 ), $1, $5 ); }
1346	\| when_clause_opt timeout statement %prec THEN
1347	{ $$ = build_waitfor_timeout( $2, maybe_build_compound( $3 ), $1 ); }
1348	\| when_clause_opt ELSE statement
1349	{ $$ = build_waitfor_timeout( nullptr, maybe_build_compound( $3 ), $1 ); }
1350	// "else" must be conditional after timeout or timeout is never triggered (i.e., it is meaningless)
1351	\| when_clause_opt timeout statement WOR ELSE statement
1352	{ SemanticError( yylloc, "else clause must be conditional after timeout or timeout never triggered." ); $$ = nullptr; }
1353	\| when_clause_opt timeout statement WOR when_clause ELSE statement
1354	{ $$ = build_waitfor_timeout( $2, maybe_build_compound( $3 ), $1, maybe_build_compound( $7 ), $5 ); }
1355	;
1356
1357	waitfor_statement:
1358	when_clause_opt waitfor statement %prec THEN
1359	{ $$ = new StatementNode( build_waitfor( $2, $3, $1 ) ); }
1360	\| when_clause_opt waitfor statement WOR waitfor_clause
1361	{ $$ = new StatementNode( build_waitfor( $2, $3, $1, $5 ) ); }
1362	;
1363
1364	exception_statement:
1365	TRY compound_statement handler_clause
1366	{ $$ = new StatementNode( build_try( $2, $3, 0 ) ); }
1367	\| TRY compound_statement finally_clause
1368	{ $$ = new StatementNode( build_try( $2, 0, $3 ) ); }
1369	\| TRY compound_statement handler_clause finally_clause
1370	{ $$ = new StatementNode( build_try( $2, $3, $4 ) ); }
1371	;
1372
1373	handler_clause:
1374	handler_key '(' push exception_declaration pop handler_predicate_opt ')' compound_statement
1375	{ $$ = new StatementNode( build_catch( $1, $4, $6, $8 ) ); }
1376	\| handler_clause handler_key '(' push exception_declaration pop handler_predicate_opt ')' compound_statement
1377	{ $$ = (StatementNode *)$1->set_last( new StatementNode( build_catch( $2, $5, $7, $9 ) ) ); }
1378	;
1379
1380	handler_predicate_opt:
1381	// empty
1382	{ $$ = nullptr; }
1383	\| ';' conditional_expression { $$ = $2; }
1384	;
1385
1386	handler_key:
1387	CATCH { $$ = CatchStmt::Terminate; }
1388	\| CATCHRESUME { $$ = CatchStmt::Resume; }
1389	;
1390
1391	finally_clause:
1392	FINALLY compound_statement { $$ = new StatementNode( build_finally( $2 ) ); }
1393	;
1394
1395	exception_declaration:
1396	// No SUE declaration in parameter list.
1397	type_specifier_nobody
1398	\| type_specifier_nobody declarator
1399	{ $$ = $2->addType( $1 ); }
1400	\| type_specifier_nobody variable_abstract_declarator
1401	{ $$ = $2->addType( $1 ); }
1402	\| cfa_abstract_declarator_tuple identifier // CFA
1403	{ $$ = $1->addName( $2 ); }
1404	\| cfa_abstract_declarator_tuple // CFA
1405	;
1406
1407	enable_disable_statement:
1408	enable_disable_key identifier_list compound_statement
1409	;
1410
1411	enable_disable_key:
1412	ENABLE
1413	\| DISABLE
1414	;
1415
1416	asm_statement:
1417	ASM asm_volatile_opt '(' string_literal ')' ';'
1418	{ $$ = new StatementNode( build_asm( $2, $4, 0 ) ); }
1419	\| ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ')' ';' // remaining GCC
1420	{ $$ = new StatementNode( build_asm( $2, $4, $6 ) ); }
1421	\| ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ')' ';'
1422	{ $$ = new StatementNode( build_asm( $2, $4, $6, $8 ) ); }
1423	\| ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ':' asm_clobbers_list_opt ')' ';'
1424	{ $$ = new StatementNode( build_asm( $2, $4, $6, $8, $10 ) ); }
1425	\| ASM asm_volatile_opt GOTO '(' string_literal ':' ':' asm_operands_opt ':' asm_clobbers_list_opt ':' label_list ')' ';'
1426	{ $$ = new StatementNode( build_asm( $2, $5, 0, $8, $10, $12 ) ); }
1427	;
1428
1429	asm_volatile_opt: // GCC
1430	// empty
1431	{ $$ = false; }
1432	\| VOLATILE
1433	{ $$ = true; }
1434	;
1435
1436	asm_operands_opt: // GCC
1437	// empty
1438	{ $$ = nullptr; } // use default argument
1439	\| asm_operands_list
1440	;
1441
1442	asm_operands_list: // GCC
1443	asm_operand
1444	\| asm_operands_list ',' asm_operand
1445	{ $$ = (ExpressionNode *)($1->set_last( $3 )); }
1446	;
1447
1448	asm_operand: // GCC
1449	string_literal '(' constant_expression ')'
1450	{ $$ = new ExpressionNode( new AsmExpr( nullptr, $1, maybeMoveBuild< Expression >( $3 ) ) ); }
1451	\| '[' IDENTIFIER ']' string_literal '(' constant_expression ')'
1452	{ $$ = new ExpressionNode( new AsmExpr( $2, $4, maybeMoveBuild< Expression >( $6 ) ) ); }
1453	;
1454
1455	asm_clobbers_list_opt: // GCC
1456	// empty
1457	{ $$ = nullptr; } // use default argument
1458	\| string_literal
1459	{ $$ = new ExpressionNode( $1 ); }
1460	\| asm_clobbers_list_opt ',' string_literal
1461	{ $$ = (ExpressionNode *)($1->set_last( new ExpressionNode( $3 ) )); }
1462	;
1463
1464	label_list:
1465	identifier
1466	{
1467	$$ = new LabelNode(); $$->labels.push_back( *$1 );
1468	delete $1; // allocated by lexer
1469	}
1470	\| label_list ',' identifier
1471	{
1472	$$ = $1; $1->labels.push_back( *$3 );
1473	delete $3; // allocated by lexer
1474	}
1475	;
1476
1477	//***************************** DECLARATIONS *******************************
1478
1479	declaration_list_opt: // used at beginning of switch statement
1480	// empty
1481	{ $$ = nullptr; }
1482	\| declaration_list
1483	;
1484
1485	declaration_list:
1486	declaration
1487	\| declaration_list declaration
1488	{ $$ = $1->appendList( $2 ); }
1489	;
1490
1491	KR_parameter_list_opt: // used to declare parameter types in K&R style functions
1492	// empty
1493	{ $$ = nullptr; }
1494	\| KR_parameter_list
1495	;
1496
1497	KR_parameter_list:
1498	push c_declaration pop ';'
1499	{ $$ = $2; }
1500	\| KR_parameter_list push c_declaration pop ';'
1501	{ $$ = $1->appendList( $3 ); }
1502	;
1503
1504	local_label_declaration_opt: // GCC, local label
1505	// empty
1506	\| local_label_declaration_list
1507	;
1508
1509	local_label_declaration_list: // GCC, local label
1510	LABEL local_label_list ';'
1511	\| local_label_declaration_list LABEL local_label_list ';'
1512	;
1513
1514	local_label_list: // GCC, local label
1515	identifier_or_type_name
1516	\| local_label_list ',' identifier_or_type_name
1517	;
1518
1519	declaration: // old & new style declarations
1520	c_declaration ';'
1521	\| cfa_declaration ';' // CFA
1522	\| static_assert // C11
1523	;
1524
1525	static_assert:
1526	STATICASSERT '(' constant_expression ',' string_literal ')' ';' // C11
1527	{ $$ = DeclarationNode::newStaticAssert( $3, $5 ); }
1528	\| STATICASSERT '(' constant_expression ')' ';' // CFA
1529	{ $$ = DeclarationNode::newStaticAssert( $3, build_constantStr( *new string( "\"\"" ) ) ); }
1530
1531	// C declaration syntax is notoriously confusing and error prone. Cforall provides its own type, variable and function
1532	// declarations. CFA declarations use the same declaration tokens as in C; however, CFA places declaration modifiers to
1533	// the left of the base type, while C declarations place modifiers to the right of the base type. CFA declaration
1534	// modifiers are interpreted from left to right and the entire type specification is distributed across all variables in
1535	// the declaration list (as in Pascal). ANSI C and the new CFA declarations may appear together in the same program
1536	// block, but cannot be mixed within a specific declaration.
1537	//
1538	// CFA C
1539	// [10] int x; int x[10]; // array of 10 integers
1540	// [10] * char y; char *y[10]; // array of 10 pointers to char
1541
1542	cfa_declaration: // CFA
1543	cfa_variable_declaration
1544	\| cfa_typedef_declaration
1545	\| cfa_function_declaration
1546	\| type_declaring_list
1547	{ SemanticError( yylloc, "otype declaration is currently unimplemented." ); $$ = nullptr; }
1548	\| trait_specifier
1549	;
1550
1551	cfa_variable_declaration: // CFA
1552	cfa_variable_specifier initializer_opt
1553	{ $$ = $1->addInitializer( $2 ); }
1554	\| declaration_qualifier_list cfa_variable_specifier initializer_opt
1555	// declaration_qualifier_list also includes type_qualifier_list, so a semantic check is necessary to preclude
1556	// them as a type_qualifier cannot appear in that context.
1557	{ $$ = $2->addQualifiers( $1 )->addInitializer( $3 ); }
1558	\| cfa_variable_declaration pop ',' push identifier_or_type_name initializer_opt
1559	{ $$ = $1->appendList( $1->cloneType( $5 )->addInitializer( $6 ) ); }
1560	;
1561
1562	cfa_variable_specifier: // CFA
1563	// A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1564	// storage-class
1565	cfa_abstract_declarator_no_tuple identifier_or_type_name asm_name_opt
1566	{ $$ = $1->addName( $2 )->addAsmName( $3 ); }
1567	\| cfa_abstract_tuple identifier_or_type_name asm_name_opt
1568	{ $$ = $1->addName( $2 )->addAsmName( $3 ); }
1569	\| type_qualifier_list cfa_abstract_tuple identifier_or_type_name asm_name_opt
1570	{ $$ = $2->addQualifiers( $1 )->addName( $3 )->addAsmName( $4 ); }
1571	;
1572
1573	cfa_function_declaration: // CFA
1574	cfa_function_specifier
1575	\| type_qualifier_list cfa_function_specifier
1576	{ $$ = $2->addQualifiers( $1 ); }
1577	\| declaration_qualifier_list cfa_function_specifier
1578	{ $$ = $2->addQualifiers( $1 ); }
1579	\| declaration_qualifier_list type_qualifier_list cfa_function_specifier
1580	{ $$ = $3->addQualifiers( $1 )->addQualifiers( $2 ); }
1581	\| cfa_function_declaration ',' identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')'
1582	{
1583	// Append the return type at the start (left-hand-side) to each identifier in the list.
1584	DeclarationNode * ret = new DeclarationNode;
1585	ret->type = maybeClone( $1->type->base );
1586	$$ = $1->appendList( DeclarationNode::newFunction( $3, ret, $6, nullptr ) );
1587	}
1588	;
1589
1590	cfa_function_specifier: // CFA
1591	// '[' ']' identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' // S/R conflict
1592	// {
1593	// $$ = DeclarationNode::newFunction( $3, DeclarationNode::newTuple( 0 ), $6, 0, true );
1594	// }
1595	// '[' ']' identifier '(' push cfa_parameter_ellipsis_list_opt pop ')'
1596	// {
1597	// typedefTable.setNextIdentifier( *$5 );
1598	// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1599	// }
1600	// \| '[' ']' TYPEDEFname '(' push cfa_parameter_ellipsis_list_opt pop ')'
1601	// {
1602	// typedefTable.setNextIdentifier( *$5 );
1603	// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1604	// }
1605	// \| '[' ']' typegen_name
1606	// identifier_or_type_name must be broken apart because of the sequence:
1607	//
1608	// '[' ']' identifier_or_type_name '(' cfa_parameter_ellipsis_list_opt ')'
1609	// '[' ']' type_specifier
1610	//
1611	// type_specifier can resolve to just TYPEDEFname (e.g., typedef int T; int f( T );). Therefore this must be
1612	// flattened to allow lookahead to the '(' without having to reduce identifier_or_type_name.
1613	cfa_abstract_tuple identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' attribute_list_opt
1614	// To obtain LR(1 ), this rule must be factored out from function return type (see cfa_abstract_declarator).
1615	{ $$ = DeclarationNode::newFunction( $2, $1, $5, 0 )->addQualifiers( $8 ); }
1616	\| cfa_function_return identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' attribute_list_opt
1617	{ $$ = DeclarationNode::newFunction( $2, $1, $5, 0 )->addQualifiers( $8 ); }
1618	;
1619
1620	cfa_function_return: // CFA
1621	'[' push cfa_parameter_list pop ']'
1622	{ $$ = DeclarationNode::newTuple( $3 ); }
1623	\| '[' push cfa_parameter_list pop ',' push cfa_abstract_parameter_list pop ']'
1624	// To obtain LR(1 ), the last cfa_abstract_parameter_list is added into this flattened rule to lookahead to the ']'.
1625	{ $$ = DeclarationNode::newTuple( $3->appendList( $7 ) ); }
1626	;
1627
1628	cfa_typedef_declaration: // CFA
1629	TYPEDEF cfa_variable_specifier
1630	{
1631	typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "1" );
1632	$$ = $2->addTypedef();
1633	}
1634	\| TYPEDEF cfa_function_specifier
1635	{
1636	typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "2" );
1637	$$ = $2->addTypedef();
1638	}
1639	\| cfa_typedef_declaration pop ',' push identifier
1640	{
1641	typedefTable.addToEnclosingScope( *$5, TYPEDEFname, "3" );
1642	$$ = $1->appendList( $1->cloneType( $5 ) );
1643	}
1644	;
1645
1646	// Traditionally typedef is part of storage-class specifier for syntactic convenience only. Here, it is factored out as
1647	// a separate form of declaration, which syntactically precludes storage-class specifiers and initialization.
1648
1649	typedef_declaration:
1650	TYPEDEF type_specifier declarator
1651	{
1652	typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "4" );
1653	$$ = $3->addType( $2 )->addTypedef();
1654	}
1655	\| typedef_declaration pop ',' push declarator
1656	{
1657	typedefTable.addToEnclosingScope( *$5->name, TYPEDEFname, "5" );
1658	$$ = $1->appendList( $1->cloneBaseType( $5 )->addTypedef() );
1659	}
1660	\| type_qualifier_list TYPEDEF type_specifier declarator // remaining OBSOLESCENT (see 2 )
1661	{
1662	typedefTable.addToEnclosingScope( *$4->name, TYPEDEFname, "6" );
1663	$$ = $4->addType( $3 )->addQualifiers( $1 )->addTypedef();
1664	}
1665	\| type_specifier TYPEDEF declarator
1666	{
1667	typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "7" );
1668	$$ = $3->addType( $1 )->addTypedef();
1669	}
1670	\| type_specifier TYPEDEF type_qualifier_list declarator
1671	{
1672	typedefTable.addToEnclosingScope( *$4->name, TYPEDEFname, "8" );
1673	$$ = $4->addQualifiers( $1 )->addTypedef()->addType( $1 );
1674	}
1675	;
1676
1677	typedef_expression:
1678	// deprecated GCC, naming expression type: typedef name = exp; gives a name to the type of an expression
1679	TYPEDEF identifier '=' assignment_expression
1680	{
1681	SemanticError( yylloc, "Typedef expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
1682	}
1683	\| typedef_expression pop ',' push identifier '=' assignment_expression
1684	{
1685	SemanticError( yylloc, "Typedef expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
1686	}
1687	;
1688
1689	c_declaration:
1690	declaration_specifier declaring_list
1691	{ $$ = distAttr( $1, $2 ); }
1692	\| typedef_declaration
1693	\| typedef_expression // deprecated GCC, naming expression type
1694	\| sue_declaration_specifier
1695	;
1696
1697	declaring_list:
1698	// A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1699	// storage-class
1700	declarator asm_name_opt initializer_opt
1701	{ $$ = $1->addAsmName( $2 )->addInitializer( $3 ); }
1702	\| declaring_list ',' attribute_list_opt declarator asm_name_opt initializer_opt
1703	{ $$ = $1->appendList( $4->addQualifiers( $3 )->addAsmName( $5 )->addInitializer( $6 ) ); }
1704	;
1705
1706	declaration_specifier: // type specifier + storage class
1707	basic_declaration_specifier
1708	\| sue_declaration_specifier
1709	\| type_declaration_specifier
1710	;
1711
1712	declaration_specifier_nobody: // type specifier + storage class - {...}
1713	// Preclude SUE declarations in restricted scopes:
1714	//
1715	// int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
1716	//
1717	// because it is impossible to call f due to name equivalence.
1718	basic_declaration_specifier
1719	\| sue_declaration_specifier_nobody
1720	\| type_declaration_specifier
1721	;
1722
1723	type_specifier: // type specifier
1724	basic_type_specifier
1725	\| sue_type_specifier
1726	\| type_type_specifier
1727	;
1728
1729	type_specifier_nobody: // type specifier - {...}
1730	// Preclude SUE declarations in restricted scopes:
1731	//
1732	// int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
1733	//
1734	// because it is impossible to call f due to name equivalence.
1735	basic_type_specifier
1736	\| sue_type_specifier_nobody
1737	\| type_type_specifier
1738	;
1739
1740	type_qualifier_list_opt: // GCC, used in asm_statement
1741	// empty
1742	{ $$ = nullptr; }
1743	\| type_qualifier_list
1744	;
1745
1746	type_qualifier_list:
1747	// A semantic check is necessary to ensure a type qualifier is appropriate for the kind of declaration.
1748	//
1749	// ISO/IEC 9899:1999 Section 6.7.3(4 ) : If the same qualifier appears more than once in the same
1750	// specifier-qualifier-list, either directly or via one or more typedefs, the behavior is the same as if it
1751	// appeared only once.
1752	type_qualifier
1753	\| type_qualifier_list type_qualifier
1754	{ $$ = $1->addQualifiers( $2 ); }
1755	;
1756
1757	type_qualifier:
1758	type_qualifier_name
1759	\| attribute
1760	;
1761
1762	type_qualifier_name:
1763	CONST
1764	{ $$ = DeclarationNode::newTypeQualifier( Type::Const ); }
1765	\| RESTRICT
1766	{ $$ = DeclarationNode::newTypeQualifier( Type::Restrict ); }
1767	\| VOLATILE
1768	{ $$ = DeclarationNode::newTypeQualifier( Type::Volatile ); }
1769	\| ATOMIC
1770	{ $$ = DeclarationNode::newTypeQualifier( Type::Atomic ); }
1771	\| forall
1772	;
1773
1774	forall:
1775	FORALL '(' type_parameter_list ')' // CFA
1776	{ $$ = DeclarationNode::newForall( $3 ); }
1777	;
1778
1779	declaration_qualifier_list:
1780	storage_class_list
1781	\| type_qualifier_list storage_class_list // remaining OBSOLESCENT (see 2 )
1782	{ $$ = $1->addQualifiers( $2 ); }
1783	\| declaration_qualifier_list type_qualifier_list storage_class_list
1784	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1785	;
1786
1787	storage_class_list:
1788	// A semantic check is necessary to ensure a storage class is appropriate for the kind of declaration and that
1789	// only one of each is specified, except for inline, which can appear with the others.
1790	//
1791	// ISO/IEC 9899:1999 Section 6.7.1(2) : At most, one storage-class specifier may be given in the declaration
1792	// specifiers in a declaration.
1793	storage_class
1794	\| storage_class_list storage_class
1795	{ $$ = $1->addQualifiers( $2 ); }
1796	;
1797
1798	storage_class:
1799	EXTERN
1800	{ $$ = DeclarationNode::newStorageClass( Type::Extern ); }
1801	\| STATIC
1802	{ $$ = DeclarationNode::newStorageClass( Type::Static ); }
1803	\| AUTO
1804	{ $$ = DeclarationNode::newStorageClass( Type::Auto ); }
1805	\| REGISTER
1806	{ $$ = DeclarationNode::newStorageClass( Type::Register ); }
1807	\| THREADLOCAL // C11
1808	{ $$ = DeclarationNode::newStorageClass( Type::Threadlocal ); }
1809	// Put function specifiers here to simplify parsing rules, but separate them semantically.
1810	\| INLINE // C99
1811	{ $$ = DeclarationNode::newFuncSpecifier( Type::Inline ); }
1812	\| FORTRAN // C99
1813	{ $$ = DeclarationNode::newFuncSpecifier( Type::Fortran ); }
1814	\| NORETURN // C11
1815	{ $$ = DeclarationNode::newFuncSpecifier( Type::Noreturn ); }
1816	;
1817
1818	basic_type_name:
1819	VOID
1820	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Void ); }
1821	\| BOOL // C99
1822	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Bool ); }
1823	\| CHAR
1824	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Char ); }
1825	\| INT
1826	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Int ); }
1827	\| INT128
1828	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Int128 ); }
1829	\| UINT128
1830	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Int128 )->addType( DeclarationNode::newSignedNess( DeclarationNode::Unsigned ) ); }
1831	\| FLOAT
1832	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Float ); }
1833	\| DOUBLE
1834	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Double ); }
1835	\| uuFLOAT80
1836	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uuFloat80 ); }
1837	\| uuFLOAT128
1838	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uuFloat128 ); }
1839	\| uFLOAT16
1840	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat16 ); }
1841	\| uFLOAT32
1842	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat32 ); }
1843	\| uFLOAT32X
1844	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat32x ); }
1845	\| uFLOAT64
1846	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat64 ); }
1847	\| uFLOAT64X
1848	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat64x ); }
1849	\| uFLOAT128
1850	{ $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat128 ); }
1851	\| COMPLEX // C99
1852	{ $$ = DeclarationNode::newComplexType( DeclarationNode::Complex ); }
1853	\| IMAGINARY // C99
1854	{ $$ = DeclarationNode::newComplexType( DeclarationNode::Imaginary ); }
1855	\| SIGNED
1856	{ $$ = DeclarationNode::newSignedNess( DeclarationNode::Signed ); }
1857	\| UNSIGNED
1858	{ $$ = DeclarationNode::newSignedNess( DeclarationNode::Unsigned ); }
1859	\| SHORT
1860	{ $$ = DeclarationNode::newLength( DeclarationNode::Short ); }
1861	\| LONG
1862	{ $$ = DeclarationNode::newLength( DeclarationNode::Long ); }
1863	\| VALIST // GCC, __builtin_va_list
1864	{ $$ = DeclarationNode::newBuiltinType( DeclarationNode::Valist ); }
1865	\| AUTO_TYPE
1866	{ $$ = DeclarationNode::newBuiltinType( DeclarationNode::AutoType ); }
1867	;
1868
1869	basic_declaration_specifier:
1870	// A semantic check is necessary for conflicting storage classes.
1871	basic_type_specifier
1872	\| declaration_qualifier_list basic_type_specifier
1873	{ $$ = $2->addQualifiers( $1 ); }
1874	\| basic_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
1875	{ $$ = $1->addQualifiers( $2 ); }
1876	\| basic_declaration_specifier storage_class type_qualifier_list
1877	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1878	\| basic_declaration_specifier storage_class basic_type_specifier
1879	{ $$ = $3->addQualifiers( $2 )->addType( $1 ); }
1880	;
1881
1882	basic_type_specifier:
1883	direct_type
1884	// Cannot have type modifiers, e.g., short, long, etc.
1885	\| type_qualifier_list_opt indirect_type type_qualifier_list_opt
1886	{ $$ = $2->addQualifiers( $1 )->addQualifiers( $3 ); }
1887	;
1888
1889	direct_type:
1890	basic_type_name
1891	\| type_qualifier_list basic_type_name
1892	{ $$ = $2->addQualifiers( $1 ); }
1893	\| direct_type type_qualifier
1894	{ $$ = $1->addQualifiers( $2 ); }
1895	\| direct_type basic_type_name
1896	{ $$ = $1->addType( $2 ); }
1897	;
1898
1899	indirect_type:
1900	TYPEOF '(' type ')' // GCC: typeof( x ) y;
1901	{ $$ = $3; }
1902	\| TYPEOF '(' comma_expression ')' // GCC: typeof( a+b ) y;
1903	{ $$ = DeclarationNode::newTypeof( $3 ); }
1904	\| BASETYPEOF '(' type ')' // CFA: basetypeof( x ) y;
1905	{ $$ = DeclarationNode::newTypeof( new ExpressionNode( new TypeExpr( maybeMoveBuildType( $3 ) ) ), true ); }
1906	\| BASETYPEOF '(' comma_expression ')' // CFA: basetypeof( a+b ) y;
1907	{ $$ = DeclarationNode::newTypeof( $3, true ); }
1908	\| ZERO_T // CFA
1909	{ $$ = DeclarationNode::newBuiltinType( DeclarationNode::Zero ); }
1910	\| ONE_T // CFA
1911	{ $$ = DeclarationNode::newBuiltinType( DeclarationNode::One ); }
1912	;
1913
1914	sue_declaration_specifier: // struct, union, enum + storage class + type specifier
1915	sue_type_specifier
1916	\| declaration_qualifier_list sue_type_specifier
1917	{ $$ = $2->addQualifiers( $1 ); }
1918	\| sue_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
1919	{ $$ = $1->addQualifiers( $2 ); }
1920	\| sue_declaration_specifier storage_class type_qualifier_list
1921	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1922	;
1923
1924	sue_type_specifier: // struct, union, enum + type specifier
1925	elaborated_type
1926	\| type_qualifier_list
1927	{ if ( $1->type != nullptr && $1->type->forall ) forall = true; } // remember generic type
1928	elaborated_type
1929	{ $$ = $3->addQualifiers( $1 ); }
1930	\| sue_type_specifier type_qualifier
1931	{
1932	if ( $2->type != nullptr && $2->type->forall ) forall = true; // remember generic type
1933	$$ = $1->addQualifiers( $2 );
1934	}
1935	;
1936
1937	sue_declaration_specifier_nobody: // struct, union, enum - {...} + storage class + type specifier
1938	sue_type_specifier_nobody
1939	\| declaration_qualifier_list sue_type_specifier_nobody
1940	{ $$ = $2->addQualifiers( $1 ); }
1941	\| sue_declaration_specifier_nobody storage_class // remaining OBSOLESCENT (see 2)
1942	{ $$ = $1->addQualifiers( $2 ); }
1943	\| sue_declaration_specifier_nobody storage_class type_qualifier_list
1944	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1945	;
1946
1947	sue_type_specifier_nobody: // struct, union, enum - {...} + type specifier
1948	elaborated_type_nobody
1949	\| type_qualifier_list elaborated_type_nobody
1950	{ $$ = $2->addQualifiers( $1 ); }
1951	\| sue_type_specifier_nobody type_qualifier
1952	{ $$ = $1->addQualifiers( $2 ); }
1953	;
1954
1955	type_declaration_specifier:
1956	type_type_specifier
1957	\| declaration_qualifier_list type_type_specifier
1958	{ $$ = $2->addQualifiers( $1 ); }
1959	\| type_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
1960	{ $$ = $1->addQualifiers( $2 ); }
1961	\| type_declaration_specifier storage_class type_qualifier_list
1962	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1963	;
1964
1965	type_type_specifier: // typedef types
1966	type_name
1967	\| type_qualifier_list type_name
1968	{ $$ = $2->addQualifiers( $1 ); }
1969	\| type_type_specifier type_qualifier
1970	{ $$ = $1->addQualifiers( $2 ); }
1971	;
1972
1973	type_name:
1974	TYPEDEFname
1975	{ $$ = DeclarationNode::newFromTypedef( $1 ); }
1976	\| '.' TYPEDEFname
1977	{ $$ = DeclarationNode::newQualifiedType( DeclarationNode::newFromGlobalScope(), DeclarationNode::newFromTypedef( $2 ) ); }
1978	\| type_name '.' TYPEDEFname
1979	{ $$ = DeclarationNode::newQualifiedType( $1, DeclarationNode::newFromTypedef( $3 ) ); }
1980	\| typegen_name
1981	\| '.' typegen_name
1982	{ $$ = DeclarationNode::newQualifiedType( DeclarationNode::newFromGlobalScope(), $2 ); }
1983	\| type_name '.' typegen_name
1984	{ $$ = DeclarationNode::newQualifiedType( $1, $3 ); }
1985	;
1986
1987	typegen_name: // CFA
1988	TYPEGENname
1989	{ $$ = DeclarationNode::newFromTypeGen( $1, nullptr ); }
1990	\| TYPEGENname '(' ')'
1991	{ $$ = DeclarationNode::newFromTypeGen( $1, nullptr ); }
1992	\| TYPEGENname '(' type_list ')'
1993	{ $$ = DeclarationNode::newFromTypeGen( $1, $3 ); }
1994	;
1995
1996	elaborated_type: // struct, union, enum
1997	aggregate_type
1998	\| enum_type
1999	;
2000
2001	elaborated_type_nobody: // struct, union, enum - {...}
2002	aggregate_type_nobody
2003	\| enum_type_nobody
2004	;
2005
2006	fred:
2007	// empty
2008	{ yyy = false; }
2009	;
2010
2011	aggregate_type: // struct, union
2012	aggregate_key attribute_list_opt
2013	{ forall = false; } // reset
2014	'{' field_declaration_list_opt '}' type_parameters_opt
2015	{ $$ = DeclarationNode::newAggregate( $1, nullptr, $7, $5, true )->addQualifiers( $2 ); }
2016	\| aggregate_key attribute_list_opt identifier fred
2017	{
2018	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2019	forall = false; // reset
2020	}
2021	'{' field_declaration_list_opt '}' type_parameters_opt
2022	{ $$ = DeclarationNode::newAggregate( $1, $3, $9, $7, true )->addQualifiers( $2 ); }
2023	\| aggregate_key attribute_list_opt type_name fred
2024	{
2025	// 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)
2026	typedefTable.makeTypedef( *$3->type->leafName(), forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2027	forall = false; // reset
2028	}
2029	'{' field_declaration_list_opt '}' type_parameters_opt
2030	{ $$ = DeclarationNode::newAggregate( $1, $3->type->symbolic.name, $9, $7, true )->addQualifiers( $2 ); }
2031	\| aggregate_type_nobody
2032	;
2033
2034	type_parameters_opt:
2035	// empty
2036	{ $$ = nullptr; } %prec '}'
2037	\| '(' type_list ')'
2038	{ $$ = $2; }
2039	;
2040
2041	aggregate_type_nobody: // struct, union - {...}
2042	aggregate_key attribute_list_opt identifier fred
2043	{
2044	typedefTable.makeTypedef( *$3, forall \|\| typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname );
2045	forall = false; // reset
2046	$$ = DeclarationNode::newAggregate( $1, $3, nullptr, nullptr, false )->addQualifiers( $2 );
2047	}
2048	\| aggregate_key attribute_list_opt type_name fred
2049	{
2050	forall = false; // reset
2051	// Create new generic declaration with same name as previous forward declaration, where the IDENTIFIER is
2052	// switched to a TYPEGENname. Link any generic arguments from typegen_name to new generic declaration and
2053	// delete newFromTypeGen.
2054	$$ = DeclarationNode::newAggregate( $1, $3->type->symbolic.name, $3->type->symbolic.actuals, nullptr, false )->addQualifiers( $2 );
2055	$3->type->symbolic.name = nullptr;
2056	$3->type->symbolic.actuals = nullptr;
2057	delete $3;
2058	}
2059	;
2060
2061	aggregate_key:
2062	aggregate_data
2063	\| aggregate_control
2064	;
2065
2066	aggregate_data:
2067	STRUCT
2068	{ yyy = true; $$ = AggregateDecl::Struct; }
2069	\| UNION
2070	{ yyy = true; $$ = AggregateDecl::Union; }
2071	\| EXCEPTION // CFA
2072	// { yyy = true; $$ = AggregateDecl::Exception; }
2073	{ SemanticError( yylloc, "exception aggregate is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2074	;
2075
2076	aggregate_control: // CFA
2077	MONITOR
2078	{ yyy = true; $$ = AggregateDecl::Monitor; }
2079	\| MUTEX STRUCT
2080	{ yyy = true; $$ = AggregateDecl::Monitor; }
2081	\| GENERATOR
2082	{ yyy = true; $$ = AggregateDecl::Generator; }
2083	\| MUTEX GENERATOR
2084	{ SemanticError( yylloc, "monitor generator is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2085	\| COROUTINE
2086	{ yyy = true; $$ = AggregateDecl::Coroutine; }
2087	\| MUTEX COROUTINE
2088	{ SemanticError( yylloc, "monitor coroutine is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2089	\| THREAD
2090	{ yyy = true; $$ = AggregateDecl::Thread; }
2091	\| MUTEX THREAD
2092	{ SemanticError( yylloc, "monitor thread is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2093	;
2094
2095	field_declaration_list_opt:
2096	// empty
2097	{ $$ = nullptr; }
2098	\| field_declaration_list_opt field_declaration
2099	{ $$ = $1 ? $1->appendList( $2 ) : $2; }
2100	;
2101
2102	field_declaration:
2103	type_specifier field_declaring_list_opt ';'
2104	{ $$ = fieldDecl( $1, $2 ); }
2105	\| EXTENSION type_specifier field_declaring_list_opt ';' // GCC
2106	{ $$ = fieldDecl( $2, $3 ); distExt( $$ ); }
2107	\| INLINE type_specifier field_abstract_list_opt ';' // CFA
2108	{
2109	if ( ! $3 ) { // field declarator ?
2110	$3 = DeclarationNode::newName( nullptr );
2111	} // if
2112	$3->inLine = true;
2113	$$ = distAttr( $2, $3 ); // mark all fields in list
2114	distInl( $3 );
2115	}
2116	\| INLINE aggregate_control ';' // CFA
2117	{ SemanticError( yylloc, "INLINE aggregate control currently unimplemented." ); $$ = nullptr; }
2118	\| typedef_declaration ';' // CFA
2119	\| cfa_field_declaring_list ';' // CFA, new style field declaration
2120	\| EXTENSION cfa_field_declaring_list ';' // GCC
2121	{ distExt( $2 ); $$ = $2; } // mark all fields in list
2122	\| INLINE cfa_field_abstract_list ';' // CFA, new style field declaration
2123	{ $$ = $2; } // mark all fields in list
2124	\| cfa_typedef_declaration ';' // CFA
2125	\| static_assert // C11
2126	;
2127
2128	field_declaring_list_opt:
2129	// empty
2130	{ $$ = nullptr; }
2131	\| field_declarator
2132	\| field_declaring_list_opt ',' attribute_list_opt field_declarator
2133	{ $$ = $1->appendList( $4->addQualifiers( $3 ) ); }
2134	;
2135
2136	field_declarator:
2137	bit_subrange_size // C special case, no field name
2138	{ $$ = DeclarationNode::newBitfield( $1 ); }
2139	\| variable_declarator bit_subrange_size_opt
2140	// A semantic check is required to ensure bit_subrange only appears on integral types.
2141	{ $$ = $1->addBitfield( $2 ); }
2142	\| variable_type_redeclarator bit_subrange_size_opt
2143	// A semantic check is required to ensure bit_subrange only appears on integral types.
2144	{ $$ = $1->addBitfield( $2 ); }
2145	;
2146
2147	field_abstract_list_opt:
2148	// empty
2149	{ $$ = nullptr; }
2150	\| field_abstract
2151	\| field_abstract_list_opt ',' attribute_list_opt field_abstract
2152	{ $$ = $1->appendList( $4->addQualifiers( $3 ) ); }
2153	;
2154
2155	field_abstract:
2156	// no bit fields
2157	variable_abstract_declarator
2158	;
2159
2160	cfa_field_declaring_list: // CFA, new style field declaration
2161	// bit-fields are handled by C declarations
2162	cfa_abstract_declarator_tuple identifier_or_type_name
2163	{ $$ = $1->addName( $2 ); }
2164	\| cfa_field_declaring_list ',' identifier_or_type_name
2165	{ $$ = $1->appendList( $1->cloneType( $3 ) ); }
2166	;
2167
2168	cfa_field_abstract_list: // CFA, new style field declaration
2169	// bit-fields are handled by C declarations
2170	cfa_abstract_declarator_tuple
2171	\| cfa_field_abstract_list ','
2172	{ $$ = $1->appendList( $1->cloneType( 0 ) ); }
2173	;
2174
2175	bit_subrange_size_opt:
2176	// empty
2177	{ $$ = nullptr; }
2178	\| bit_subrange_size
2179	;
2180
2181	bit_subrange_size:
2182	':' assignment_expression
2183	{ $$ = $2; }
2184	;
2185
2186	enum_type: // enum
2187	ENUM attribute_list_opt '{' enumerator_list comma_opt '}'
2188	{ $$ = DeclarationNode::newEnum( nullptr, $4, true )->addQualifiers( $2 ); }
2189	\| ENUM attribute_list_opt identifier
2190	{ typedefTable.makeTypedef( *$3 ); }
2191	'{' enumerator_list comma_opt '}'
2192	{ $$ = DeclarationNode::newEnum( $3, $6, true )->addQualifiers( $2 ); }
2193	\| ENUM attribute_list_opt type_name
2194	'{' enumerator_list comma_opt '}'
2195	{ $$ = DeclarationNode::newEnum( $3->type->symbolic.name, $5, true )->addQualifiers( $2 ); }
2196	\| enum_type_nobody
2197	;
2198
2199	enum_type_nobody: // enum - {...}
2200	ENUM attribute_list_opt identifier
2201	{
2202	typedefTable.makeTypedef( *$3 );
2203	$$ = DeclarationNode::newEnum( $3, 0, false )->addQualifiers( $2 );
2204	}
2205	\| ENUM attribute_list_opt type_name
2206	{
2207	typedefTable.makeTypedef( *$3->type->symbolic.name );
2208	$$ = DeclarationNode::newEnum( $3->type->symbolic.name, 0, false )->addQualifiers( $2 );
2209	}
2210	;
2211
2212	enumerator_list:
2213	identifier_or_type_name enumerator_value_opt
2214	{ $$ = DeclarationNode::newEnumConstant( $1, $2 ); }
2215	\| enumerator_list ',' identifier_or_type_name enumerator_value_opt
2216	{ $$ = $1->appendList( DeclarationNode::newEnumConstant( $3, $4 ) ); }
2217	;
2218
2219	enumerator_value_opt:
2220	// empty
2221	{ $$ = nullptr; }
2222	\| '=' constant_expression
2223	{ $$ = $2; }
2224	;
2225
2226	cfa_parameter_ellipsis_list_opt: // CFA, abstract + real
2227	// empty
2228	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Void ); }
2229	\| ELLIPSIS
2230	{ $$ = nullptr; }
2231	\| cfa_abstract_parameter_list
2232	\| cfa_parameter_list
2233	\| cfa_parameter_list pop ',' push cfa_abstract_parameter_list
2234	{ $$ = $1->appendList( $5 ); }
2235	\| cfa_abstract_parameter_list pop ',' push ELLIPSIS
2236	{ $$ = $1->addVarArgs(); }
2237	\| cfa_parameter_list pop ',' push ELLIPSIS
2238	{ $$ = $1->addVarArgs(); }
2239	;
2240
2241	cfa_parameter_list: // CFA
2242	// To obtain LR(1) between cfa_parameter_list and cfa_abstract_tuple, the last cfa_abstract_parameter_list is
2243	// factored out from cfa_parameter_list, flattening the rules to get lookahead to the ']'.
2244	cfa_parameter_declaration
2245	\| cfa_abstract_parameter_list pop ',' push cfa_parameter_declaration
2246	{ $$ = $1->appendList( $5 ); }
2247	\| cfa_parameter_list pop ',' push cfa_parameter_declaration
2248	{ $$ = $1->appendList( $5 ); }
2249	\| cfa_parameter_list pop ',' push cfa_abstract_parameter_list pop ',' push cfa_parameter_declaration
2250	{ $$ = $1->appendList( $5 )->appendList( $9 ); }
2251	;
2252
2253	cfa_abstract_parameter_list: // CFA, new & old style abstract
2254	cfa_abstract_parameter_declaration
2255	\| cfa_abstract_parameter_list pop ',' push cfa_abstract_parameter_declaration
2256	{ $$ = $1->appendList( $5 ); }
2257	;
2258
2259	parameter_type_list_opt:
2260	// empty
2261	{ $$ = nullptr; }
2262	\| ELLIPSIS
2263	{ $$ = nullptr; }
2264	\| parameter_list
2265	\| parameter_list pop ',' push ELLIPSIS
2266	{ $$ = $1->addVarArgs(); }
2267	;
2268
2269	parameter_list: // abstract + real
2270	abstract_parameter_declaration
2271	\| parameter_declaration
2272	\| parameter_list pop ',' push abstract_parameter_declaration
2273	{ $$ = $1->appendList( $5 ); }
2274	\| parameter_list pop ',' push parameter_declaration
2275	{ $$ = $1->appendList( $5 ); }
2276	;
2277
2278	// Provides optional identifier names (abstract_declarator/variable_declarator), no initialization, different semantics
2279	// for typedef name by using type_parameter_redeclarator instead of typedef_redeclarator, and function prototypes.
2280
2281	cfa_parameter_declaration: // CFA, new & old style parameter declaration
2282	parameter_declaration
2283	\| cfa_identifier_parameter_declarator_no_tuple identifier_or_type_name default_initializer_opt
2284	{ $$ = $1->addName( $2 ); }
2285	\| cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2286	// To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2287	{ $$ = $1->addName( $2 ); }
2288	\| type_qualifier_list cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2289	{ $$ = $2->addName( $3 )->addQualifiers( $1 ); }
2290	\| cfa_function_specifier
2291	;
2292
2293	cfa_abstract_parameter_declaration: // CFA, new & old style parameter declaration
2294	abstract_parameter_declaration
2295	\| cfa_identifier_parameter_declarator_no_tuple
2296	\| cfa_abstract_tuple
2297	// To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2298	\| type_qualifier_list cfa_abstract_tuple
2299	{ $$ = $2->addQualifiers( $1 ); }
2300	\| cfa_abstract_function
2301	;
2302
2303	parameter_declaration:
2304	// No SUE declaration in parameter list.
2305	declaration_specifier_nobody identifier_parameter_declarator default_initializer_opt
2306	{ $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2307	\| declaration_specifier_nobody type_parameter_redeclarator default_initializer_opt
2308	{ $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2309	;
2310
2311	abstract_parameter_declaration:
2312	declaration_specifier_nobody default_initializer_opt
2313	{ $$ = $1->addInitializer( $2 ? new InitializerNode( $2 ) : nullptr ); }
2314	\| declaration_specifier_nobody abstract_parameter_declarator default_initializer_opt
2315	{ $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2316	;
2317
2318	// ISO/IEC 9899:1999 Section 6.9.1(6) : "An identifier declared as a typedef name shall not be redeclared as a
2319	// parameter." Because the scope of the K&R-style parameter-list sees the typedef first, the following is based only on
2320	// identifiers. The ANSI-style parameter-list can redefine a typedef name.
2321
2322	identifier_list: // K&R-style parameter list => no types
2323	identifier
2324	{ $$ = DeclarationNode::newName( $1 ); }
2325	\| identifier_list ',' identifier
2326	{ $$ = $1->appendList( DeclarationNode::newName( $3 ) ); }
2327	;
2328
2329	identifier_or_type_name:
2330	identifier
2331	\| TYPEDEFname
2332	\| TYPEGENname
2333	;
2334
2335	type_no_function: // sizeof, alignof, cast (constructor)
2336	cfa_abstract_declarator_tuple // CFA
2337	\| type_specifier
2338	\| type_specifier abstract_declarator
2339	{ $$ = $2->addType( $1 ); }
2340	;
2341
2342	type: // typeof, assertion
2343	type_no_function
2344	\| cfa_abstract_function // CFA
2345	;
2346
2347	initializer_opt:
2348	// empty
2349	{ $$ = nullptr; }
2350	\| '=' initializer
2351	{ $$ = $2; }
2352	\| '=' VOID
2353	{ $$ = new InitializerNode( true ); }
2354	\| ATassign initializer
2355	{ $$ = $2->set_maybeConstructed( false ); }
2356	;
2357
2358	initializer:
2359	assignment_expression { $$ = new InitializerNode( $1 ); }
2360	\| '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $2, true ); }
2361	;
2362
2363	initializer_list_opt:
2364	// empty
2365	{ $$ = nullptr; }
2366	\| initializer
2367	\| designation initializer { $$ = $2->set_designators( $1 ); }
2368	\| initializer_list_opt ',' initializer { $$ = (InitializerNode *)( $1->set_last( $3 ) ); }
2369	\| initializer_list_opt ',' designation initializer
2370	{ $$ = (InitializerNode *)($1->set_last( $4->set_designators( $3 ) )); }
2371	;
2372
2373	// There is an unreconcileable parsing problem between C99 and CFA with respect to designators. The problem is use of
2374	// '=' to separator the designator from the initializer value, as in:
2375	//
2376	// int x[10] = { [1] = 3 };
2377	//
2378	// The string "[1] = 3" can be parsed as a designator assignment or a tuple assignment. To disambiguate this case, CFA
2379	// changes the syntax from "=" to ":" as the separator between the designator and initializer. GCC does uses ":" for
2380	// field selection. The optional use of the "=" in GCC, or in this case ":", cannot be supported either due to
2381	// shift/reduce conflicts
2382
2383	designation:
2384	designator_list ':' // C99, CFA uses ":" instead of "="
2385	\| identifier ':' // GCC, field name
2386	{ $$ = new ExpressionNode( build_varref( $1 ) ); }
2387	;
2388
2389	designator_list: // C99
2390	designator
2391	\| designator_list designator
2392	{ $$ = (ExpressionNode *)($1->set_last( $2 )); }
2393	//\| designator_list designator { $$ = new ExpressionNode( $1, $2 ); }
2394	;
2395
2396	designator:
2397	'.' identifier // C99, field name
2398	{ $$ = new ExpressionNode( build_varref( $2 ) ); }
2399	\| '[' push assignment_expression pop ']' // C99, single array element
2400	// assignment_expression used instead of constant_expression because of shift/reduce conflicts with tuple.
2401	{ $$ = $3; }
2402	\| '[' push subrange pop ']' // CFA, multiple array elements
2403	{ $$ = $3; }
2404	\| '[' push constant_expression ELLIPSIS constant_expression pop ']' // GCC, multiple array elements
2405	{ $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild< Expression >( $3 ), maybeMoveBuild< Expression >( $5 ) ) ); }
2406	\| '.' '[' push field_name_list pop ']' // CFA, tuple field selector
2407	{ $$ = $4; }
2408	;
2409
2410	// The CFA type system is based on parametric polymorphism, the ability to declare functions with type parameters,
2411	// rather than an object-oriented type system. This required four groups of extensions:
2412	//
2413	// Overloading: function, data, and operator identifiers may be overloaded.
2414	//
2415	// Type declarations: "otype" is used to generate new types for declaring objects. Similarly, "dtype" is used for object
2416	// and incomplete types, and "ftype" is used for function types. Type declarations with initializers provide
2417	// definitions of new types. Type declarations with storage class "extern" provide opaque types.
2418	//
2419	// Polymorphic functions: A forall clause declares a type parameter. The corresponding argument is inferred at the call
2420	// site. A polymorphic function is not a template; it is a function, with an address and a type.
2421	//
2422	// Specifications and Assertions: Specifications are collections of declarations parameterized by one or more
2423	// types. They serve many of the purposes of abstract classes, and specification hierarchies resemble subclass
2424	// hierarchies. Unlike classes, they can define relationships between types. Assertions declare that a type or
2425	// types provide the operations declared by a specification. Assertions are normally used to declare requirements
2426	// on type arguments of polymorphic functions.
2427
2428	type_parameter_list: // CFA
2429	type_parameter
2430	\| type_parameter_list ',' type_parameter
2431	{ $$ = $1->appendList( $3 ); }
2432	;
2433
2434	type_initializer_opt: // CFA
2435	// empty
2436	{ $$ = nullptr; }
2437	\| '=' type
2438	{ $$ = $2; }
2439	;
2440
2441	type_parameter: // CFA
2442	type_class identifier_or_type_name
2443	{ typedefTable.addToScope( *$2, TYPEDEFname, "9" ); }
2444	type_initializer_opt assertion_list_opt
2445	{ $$ = DeclarationNode::newTypeParam( $1, $2 )->addTypeInitializer( $4 )->addAssertions( $5 ); }
2446	\| identifier_or_type_name new_type_class
2447	{ typedefTable.addToScope( *$1, TYPEDEFname, "9" ); }
2448	type_initializer_opt assertion_list_opt
2449	{ $$ = DeclarationNode::newTypeParam( $2, $1 )->addTypeInitializer( $4 )->addAssertions( $5 ); }
2450	\| '[' identifier_or_type_name ']'
2451	{
2452	typedefTable.addToScope( *$2, TYPEDEFname, "9" );
2453	$$ = DeclarationNode::newTypeParam( TypeDecl::ALtype, $2 );
2454	}
2455	// \| type_specifier identifier_parameter_declarator
2456	\| assertion_list
2457	{ $$ = DeclarationNode::newTypeParam( TypeDecl::Dtype, new string( DeclarationNode::anonymous.newName() ) )->addAssertions( $1 ); }
2458	;
2459
2460	new_type_class: // CFA
2461	// empty
2462	{ $$ = TypeDecl::Otype; }
2463	\| '&'
2464	{ $$ = TypeDecl::Dtype; }
2465	\| '*'
2466	{ $$ = TypeDecl::DStype; } // dtype + sized
2467	\| ELLIPSIS
2468	{ $$ = TypeDecl::Ttype; }
2469	;
2470
2471	type_class: // CFA
2472	OTYPE
2473	{ $$ = TypeDecl::Otype; }
2474	\| DTYPE
2475	{ $$ = TypeDecl::Dtype; }
2476	\| FTYPE
2477	{ $$ = TypeDecl::Ftype; }
2478	\| TTYPE
2479	{ $$ = TypeDecl::Ttype; }
2480	;
2481
2482	assertion_list_opt: // CFA
2483	// empty
2484	{ $$ = nullptr; }
2485	\| assertion_list
2486	;
2487
2488	assertion_list: // CFA
2489	assertion
2490	\| assertion_list assertion
2491	{ $$ = $1->appendList( $2 ); }
2492	;
2493
2494	assertion: // CFA
2495	'\|' identifier_or_type_name '(' type_list ')'
2496	{ $$ = DeclarationNode::newTraitUse( $2, $4 ); }
2497	\| '\|' '{' push trait_declaration_list pop '}'
2498	{ $$ = $4; }
2499	// \| '\|' '(' push type_parameter_list pop ')' '{' push trait_declaration_list pop '}' '(' type_list ')'
2500	// { SemanticError( yylloc, "Generic data-type assertion is currently unimplemented." ); $$ = nullptr; }
2501	;
2502
2503	type_list: // CFA
2504	type
2505	{ $$ = new ExpressionNode( new TypeExpr( maybeMoveBuildType( $1 ) ) ); }
2506	\| assignment_expression
2507	{ SemanticError( yylloc, toString("Expression generic parameters are currently unimplemented: ", $1->build()) ); $$ = nullptr; }
2508	\| type_list ',' type
2509	{ $$ = (ExpressionNode *)($1->set_last( new ExpressionNode( new TypeExpr( maybeMoveBuildType( $3 ) ) ) )); }
2510	\| type_list ',' assignment_expression
2511	{ SemanticError( yylloc, toString("Expression generic parameters are currently unimplemented: ", $3->build()) ); $$ = nullptr; }
2512	// { $$ = (ExpressionNode *)( $1->set_last( $3 )); }
2513	;
2514
2515	type_declaring_list: // CFA
2516	OTYPE type_declarator
2517	{ $$ = $2; }
2518	\| storage_class_list OTYPE type_declarator
2519	{ $$ = $3->addQualifiers( $1 ); }
2520	\| type_declaring_list ',' type_declarator
2521	{ $$ = $1->appendList( $3->copySpecifiers( $1 ) ); }
2522	;
2523
2524	type_declarator: // CFA
2525	type_declarator_name assertion_list_opt
2526	{ $$ = $1->addAssertions( $2 ); }
2527	\| type_declarator_name assertion_list_opt '=' type
2528	{ $$ = $1->addAssertions( $2 )->addType( $4 ); }
2529	;
2530
2531	type_declarator_name: // CFA
2532	identifier_or_type_name
2533	{
2534	typedefTable.addToEnclosingScope( *$1, TYPEDEFname, "10" );
2535	$$ = DeclarationNode::newTypeDecl( $1, 0 );
2536	}
2537	\| identifier_or_type_name '(' type_parameter_list ')'
2538	{
2539	typedefTable.addToEnclosingScope( *$1, TYPEGENname, "11" );
2540	$$ = DeclarationNode::newTypeDecl( $1, $3 );
2541	}
2542	;
2543
2544	trait_specifier: // CFA
2545	TRAIT identifier_or_type_name '(' type_parameter_list ')' '{' '}'
2546	{ $$ = DeclarationNode::newTrait( $2, $4, 0 ); }
2547	\| TRAIT identifier_or_type_name '(' type_parameter_list ')' '{' push trait_declaration_list pop '}'
2548	{ $$ = DeclarationNode::newTrait( $2, $4, $8 ); }
2549	;
2550
2551	trait_declaration_list: // CFA
2552	trait_declaration
2553	\| trait_declaration_list pop push trait_declaration
2554	{ $$ = $1->appendList( $4 ); }
2555	;
2556
2557	trait_declaration: // CFA
2558	cfa_trait_declaring_list ';'
2559	\| trait_declaring_list ';'
2560	;
2561
2562	cfa_trait_declaring_list: // CFA
2563	cfa_variable_specifier
2564	\| cfa_function_specifier
2565	\| cfa_trait_declaring_list pop ',' push identifier_or_type_name
2566	{ $$ = $1->appendList( $1->cloneType( $5 ) ); }
2567	;
2568
2569	trait_declaring_list: // CFA
2570	type_specifier declarator
2571	{ $$ = $2->addType( $1 ); }
2572	\| trait_declaring_list pop ',' push declarator
2573	{ $$ = $1->appendList( $1->cloneBaseType( $5 ) ); }
2574	;
2575
2576	//*************************** EXTERNAL DEFINITIONS ***************************
2577
2578	translation_unit:
2579	// empty, input file
2580	\| external_definition_list
2581	{ parseTree = parseTree ? parseTree->appendList( $1 ) : $1; }
2582	;
2583
2584	external_definition_list:
2585	push external_definition pop
2586	{ $$ = $2; }
2587	\| external_definition_list push external_definition pop
2588	{ $$ = $1 ? $1->appendList( $3 ) : $3; }
2589	;
2590
2591	external_definition_list_opt:
2592	// empty
2593	{ $$ = nullptr; }
2594	\| external_definition_list
2595	;
2596
2597	up:
2598	{ typedefTable.up( forall ); forall = false; }
2599	;
2600
2601	down:
2602	{ typedefTable.down(); }
2603	;
2604
2605	external_definition:
2606	declaration
2607	\| external_function_definition
2608	\| EXTENSION external_definition // GCC, multiple __extension__ allowed, meaning unknown
2609	{
2610	distExt( $2 ); // mark all fields in list
2611	$$ = $2;
2612	}
2613	\| ASM '(' string_literal ')' ';' // GCC, global assembler statement
2614	{
2615	$$ = DeclarationNode::newAsmStmt( new StatementNode( build_asm( false, $3, 0 ) ) );
2616	}
2617	\| EXTERN STRINGliteral // C++-style linkage specifier
2618	{
2619	linkageStack.push( linkage ); // handle nested extern "C"/"Cforall"
2620	linkage = LinkageSpec::update( yylloc, linkage, $2 );
2621	}
2622	'{' up external_definition_list_opt down '}'
2623	{
2624	linkage = linkageStack.top();
2625	linkageStack.pop();
2626	$$ = $6;
2627	}
2628	\| type_qualifier_list
2629	{
2630	if ( $1->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
2631	if ( $1->type->forall ) forall = true; // remember generic type
2632	}
2633	'{' up external_definition_list_opt down '}' // CFA, namespace
2634	{
2635	distQual( $5, $1 );
2636	forall = false;
2637	$$ = $5;
2638	}
2639	\| declaration_qualifier_list
2640	{
2641	if ( $1->type && $1->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
2642	if ( $1->type && $1->type->forall ) forall = true; // remember generic type
2643	}
2644	'{' up external_definition_list_opt down '}' // CFA, namespace
2645	{
2646	distQual( $5, $1 );
2647	forall = false;
2648	$$ = $5;
2649	}
2650	\| declaration_qualifier_list type_qualifier_list
2651	{
2652	if ( ($1->type && $1->type->qualifiers.val) \|\| $2->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
2653	if ( ($1->type && $1->type->forall) \|\| $2->type->forall ) forall = true; // remember generic type
2654	}
2655	'{' up external_definition_list_opt down '}' // CFA, namespace
2656	{
2657	distQual( $6, $1->addQualifiers( $2 ) );
2658	forall = false;
2659	$$ = $6;
2660	}
2661	;
2662
2663	external_function_definition:
2664	function_definition
2665	// These rules are a concession to the "implicit int" type_specifier because there is a significant amount of
2666	// legacy code with global functions missing the type-specifier for the return type, and assuming "int".
2667	// Parsing is possible because function_definition does not appear in the context of an expression (nested
2668	// functions preclude this concession, i.e., all nested function must have a return type). A function prototype
2669	// declaration must still have a type_specifier. OBSOLESCENT (see 1)
2670	\| function_declarator compound_statement
2671	{ $$ = $1->addFunctionBody( $2 ); }
2672	\| KR_function_declarator KR_parameter_list_opt compound_statement
2673	{ $$ = $1->addOldDeclList( $2 )->addFunctionBody( $3 ); }
2674	;
2675
2676	with_clause_opt:
2677	// empty
2678	{ $$ = nullptr; forall = false; }
2679	\| WITH '(' tuple_expression_list ')'
2680	{ $$ = $3; forall = false; }
2681	;
2682
2683	function_definition:
2684	cfa_function_declaration with_clause_opt compound_statement // CFA
2685	{
2686	// Add the function body to the last identifier in the function definition list, i.e., foo3:
2687	// [const double] foo1(), foo2( int ), foo3( double ) { return 3.0; }
2688	$1->get_last()->addFunctionBody( $3, $2 );
2689	$$ = $1;
2690	}
2691	\| declaration_specifier function_declarator with_clause_opt compound_statement
2692	{
2693	rebindForall( $1, $2 );
2694	$$ = $2->addFunctionBody( $4, $3 )->addType( $1 );
2695	}
2696	\| declaration_specifier variable_type_redeclarator with_clause_opt compound_statement
2697	{
2698	rebindForall( $1, $2 );
2699	$$ = $2->addFunctionBody( $4, $3 )->addType( $1 );
2700	}
2701	// handles default int return type, OBSOLESCENT (see 1)
2702	\| type_qualifier_list function_declarator with_clause_opt compound_statement
2703	{ $$ = $2->addFunctionBody( $4, $3 )->addQualifiers( $1 ); }
2704	// handles default int return type, OBSOLESCENT (see 1)
2705	\| declaration_qualifier_list function_declarator with_clause_opt compound_statement
2706	{ $$ = $2->addFunctionBody( $4, $3 )->addQualifiers( $1 ); }
2707	// handles default int return type, OBSOLESCENT (see 1)
2708	\| declaration_qualifier_list type_qualifier_list function_declarator with_clause_opt compound_statement
2709	{ $$ = $3->addFunctionBody( $5, $4 )->addQualifiers( $2 )->addQualifiers( $1 ); }
2710
2711	// Old-style K&R function definition, OBSOLESCENT (see 4)
2712	\| declaration_specifier KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2713	{
2714	rebindForall( $1, $2 );
2715	$$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addType( $1 );
2716	}
2717	// handles default int return type, OBSOLESCENT (see 1)
2718	\| type_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2719	{ $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addQualifiers( $1 ); }
2720	// handles default int return type, OBSOLESCENT (see 1)
2721	\| declaration_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2722	{ $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addQualifiers( $1 ); }
2723	// handles default int return type, OBSOLESCENT (see 1)
2724	\| declaration_qualifier_list type_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2725	{ $$ = $3->addOldDeclList( $4 )->addFunctionBody( $6, $5 )->addQualifiers( $2 )->addQualifiers( $1 ); }
2726	;
2727
2728	declarator:
2729	variable_declarator
2730	\| variable_type_redeclarator
2731	\| function_declarator
2732	;
2733
2734	subrange:
2735	constant_expression '~' constant_expression // CFA, integer subrange
2736	{ $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild< Expression >( $1 ), maybeMoveBuild< Expression >( $3 ) ) ); }
2737	;
2738
2739	asm_name_opt: // GCC
2740	// empty
2741	{ $$ = nullptr; }
2742	\| ASM '(' string_literal ')' attribute_list_opt
2743	{
2744	DeclarationNode * name = new DeclarationNode();
2745	name->asmName = $3;
2746	$$ = name->addQualifiers( $5 );
2747	}
2748	;
2749
2750	attribute_list_opt: // GCC
2751	// empty
2752	{ $$ = nullptr; }
2753	\| attribute_list
2754	;
2755
2756	attribute_list: // GCC
2757	attribute
2758	\| attribute_list attribute
2759	{ $$ = $2->addQualifiers( $1 ); }
2760	;
2761
2762	attribute: // GCC
2763	ATTRIBUTE '(' '(' attribute_name_list ')' ')'
2764	{ $$ = $4; }
2765	;
2766
2767	attribute_name_list: // GCC
2768	attribute_name
2769	\| attribute_name_list ',' attribute_name
2770	{ $$ = $3->addQualifiers( $1 ); }
2771	;
2772
2773	attribute_name: // GCC
2774	// empty
2775	{ $$ = nullptr; }
2776	\| attr_name
2777	{ $$ = DeclarationNode::newAttribute( $1 ); }
2778	\| attr_name '(' argument_expression_list_opt ')'
2779	{ $$ = DeclarationNode::newAttribute( $1, $3 ); }
2780	;
2781
2782	attr_name: // GCC
2783	IDENTIFIER
2784	\| quasi_keyword
2785	\| TYPEDEFname
2786	\| TYPEGENname
2787	\| FALLTHROUGH
2788	{ $$ = Token{ new string( "fallthrough" ), { nullptr, -1 } }; }
2789	\| CONST
2790	{ $$ = Token{ new string( "__const__" ), { nullptr, -1 } }; }
2791	;
2792
2793	// ============================================================================
2794	// The following sections are a series of grammar patterns used to parse declarators. Multiple patterns are necessary
2795	// because the type of an identifier in wrapped around the identifier in the same form as its usage in an expression, as
2796	// in:
2797	//
2798	// int (*f())[10] { ... };
2799	// ... (*f())[3] += 1; // definition mimics usage
2800	//
2801	// Because these patterns are highly recursive, changes at a lower level in the recursion require copying some or all of
2802	// the pattern. Each of these patterns has some subtle variation to ensure correct syntax in a particular context.
2803	// ============================================================================
2804
2805	// ----------------------------------------------------------------------------
2806	// The set of valid declarators before a compound statement for defining a function is less than the set of declarators
2807	// to define a variable or function prototype, e.g.:
2808	//
2809	// valid declaration invalid definition
2810	// ----------------- ------------------
2811	// int f; int f {}
2812	// int f; int f {}
2813	// int f[10]; int f[10] {}
2814	// int (f)(int); int (f)(int) {}
2815	//
2816	// To preclude this syntactic anomaly requires separating the grammar rules for variable and function declarators, hence
2817	// variable_declarator and function_declarator.
2818	// ----------------------------------------------------------------------------
2819
2820	// This pattern parses a declaration of a variable that is not redefining a typedef name. The pattern precludes
2821	// declaring an array of functions versus a pointer to an array of functions.
2822
2823	variable_declarator:
2824	paren_identifier attribute_list_opt
2825	{ $$ = $1->addQualifiers( $2 ); }
2826	\| variable_ptr
2827	\| variable_array attribute_list_opt
2828	{ $$ = $1->addQualifiers( $2 ); }
2829	\| variable_function attribute_list_opt
2830	{ $$ = $1->addQualifiers( $2 ); }
2831	;
2832
2833	paren_identifier:
2834	identifier
2835	{ $$ = DeclarationNode::newName( $1 ); }
2836	\| '(' paren_identifier ')' // redundant parenthesis
2837	{ $$ = $2; }
2838	;
2839
2840	variable_ptr:
2841	ptrref_operator variable_declarator
2842	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
2843	\| ptrref_operator type_qualifier_list variable_declarator
2844	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
2845	\| '(' variable_ptr ')' attribute_list_opt
2846	{ $$ = $2->addQualifiers( $4 ); } // redundant parenthesis
2847	;
2848
2849	variable_array:
2850	paren_identifier array_dimension
2851	{ $$ = $1->addArray( $2 ); }
2852	\| '(' variable_ptr ')' array_dimension
2853	{ $$ = $2->addArray( $4 ); }
2854	\| '(' variable_array ')' multi_array_dimension // redundant parenthesis
2855	{ $$ = $2->addArray( $4 ); }
2856	\| '(' variable_array ')' // redundant parenthesis
2857	{ $$ = $2; }
2858	;
2859
2860	variable_function:
2861	'(' variable_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2862	{ $$ = $2->addParamList( $6 ); }
2863	\| '(' variable_function ')' // redundant parenthesis
2864	{ $$ = $2; }
2865	;
2866
2867	// This pattern parses a function declarator that is not redefining a typedef name. For non-nested functions, there is
2868	// no context where a function definition can redefine a typedef name, i.e., the typedef and function name cannot exist
2869	// is the same scope. The pattern precludes returning arrays and functions versus pointers to arrays and functions.
2870
2871	function_declarator:
2872	function_no_ptr attribute_list_opt
2873	{ $$ = $1->addQualifiers( $2 ); }
2874	\| function_ptr
2875	\| function_array attribute_list_opt
2876	{ $$ = $1->addQualifiers( $2 ); }
2877	;
2878
2879	function_no_ptr:
2880	paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2881	{ $$ = $1->addParamList( $4 ); }
2882	\| '(' function_ptr ')' '(' push parameter_type_list_opt pop ')'
2883	{ $$ = $2->addParamList( $6 ); }
2884	\| '(' function_no_ptr ')' // redundant parenthesis
2885	{ $$ = $2; }
2886	;
2887
2888	function_ptr:
2889	ptrref_operator function_declarator
2890	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
2891	\| ptrref_operator type_qualifier_list function_declarator
2892	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
2893	\| '(' function_ptr ')'
2894	{ $$ = $2; }
2895	;
2896
2897	function_array:
2898	'(' function_ptr ')' array_dimension
2899	{ $$ = $2->addArray( $4 ); }
2900	\| '(' function_array ')' multi_array_dimension // redundant parenthesis
2901	{ $$ = $2->addArray( $4 ); }
2902	\| '(' function_array ')' // redundant parenthesis
2903	{ $$ = $2; }
2904	;
2905
2906	// This pattern parses an old-style K&R function declarator (OBSOLESCENT, see 4)
2907	//
2908	// f( a, b, c ) int a, *b, c[]; {}
2909	//
2910	// that is not redefining a typedef name (see function_declarator for additional comments). The pattern precludes
2911	// returning arrays and functions versus pointers to arrays and functions.
2912
2913	KR_function_declarator:
2914	KR_function_no_ptr
2915	\| KR_function_ptr
2916	\| KR_function_array
2917	;
2918
2919	KR_function_no_ptr:
2920	paren_identifier '(' identifier_list ')' // function_declarator handles empty parameter
2921	{ $$ = $1->addIdList( $3 ); }
2922	\| '(' KR_function_ptr ')' '(' push parameter_type_list_opt pop ')'
2923	{ $$ = $2->addParamList( $6 ); }
2924	\| '(' KR_function_no_ptr ')' // redundant parenthesis
2925	{ $$ = $2; }
2926	;
2927
2928	KR_function_ptr:
2929	ptrref_operator KR_function_declarator
2930	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
2931	\| ptrref_operator type_qualifier_list KR_function_declarator
2932	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
2933	\| '(' KR_function_ptr ')'
2934	{ $$ = $2; }
2935	;
2936
2937	KR_function_array:
2938	'(' KR_function_ptr ')' array_dimension
2939	{ $$ = $2->addArray( $4 ); }
2940	\| '(' KR_function_array ')' multi_array_dimension // redundant parenthesis
2941	{ $$ = $2->addArray( $4 ); }
2942	\| '(' KR_function_array ')' // redundant parenthesis
2943	{ $$ = $2; }
2944	;
2945
2946	// This pattern parses a declaration for a variable or function prototype that redefines a type name, e.g.:
2947	//
2948	// typedef int foo;
2949	// {
2950	// int foo; // redefine typedef name in new scope
2951	// }
2952	//
2953	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
2954	// and functions versus pointers to arrays and functions.
2955
2956	variable_type_redeclarator:
2957	paren_type attribute_list_opt
2958	{ $$ = $1->addQualifiers( $2 ); }
2959	\| type_ptr
2960	\| type_array attribute_list_opt
2961	{ $$ = $1->addQualifiers( $2 ); }
2962	\| type_function attribute_list_opt
2963	{ $$ = $1->addQualifiers( $2 ); }
2964	;
2965
2966	paren_type:
2967	typedef
2968	// hide type name in enclosing scope by variable name
2969	{
2970	// if ( ! typedefTable.existsCurr( *$1->name ) ) {
2971	typedefTable.addToEnclosingScope( *$1->name, IDENTIFIER, "ID" );
2972	// } else {
2973	// SemanticError( yylloc, string("'") + *$1->name + "' redeclared as different kind of symbol." ); $$ = nullptr;
2974	// } // if
2975	}
2976	\| '(' paren_type ')'
2977	{ $$ = $2; }
2978	;
2979
2980	type_ptr:
2981	ptrref_operator variable_type_redeclarator
2982	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
2983	\| ptrref_operator type_qualifier_list variable_type_redeclarator
2984	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
2985	\| '(' type_ptr ')' attribute_list_opt
2986	{ $$ = $2->addQualifiers( $4 ); } // redundant parenthesis
2987	;
2988
2989	type_array:
2990	paren_type array_dimension
2991	{ $$ = $1->addArray( $2 ); }
2992	\| '(' type_ptr ')' array_dimension
2993	{ $$ = $2->addArray( $4 ); }
2994	\| '(' type_array ')' multi_array_dimension // redundant parenthesis
2995	{ $$ = $2->addArray( $4 ); }
2996	\| '(' type_array ')' // redundant parenthesis
2997	{ $$ = $2; }
2998	;
2999
3000	type_function:
3001	paren_type '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3002	{ $$ = $1->addParamList( $4 ); }
3003	\| '(' type_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3004	{ $$ = $2->addParamList( $6 ); }
3005	\| '(' type_function ')' // redundant parenthesis
3006	{ $$ = $2; }
3007	;
3008
3009	// This pattern parses a declaration for a parameter variable of a function prototype or actual that is not redefining a
3010	// typedef name and allows the C99 array options, which can only appear in a parameter list. The pattern precludes
3011	// declaring an array of functions versus a pointer to an array of functions, and returning arrays and functions versus
3012	// pointers to arrays and functions.
3013
3014	identifier_parameter_declarator:
3015	paren_identifier attribute_list_opt
3016	{ $$ = $1->addQualifiers( $2 ); }
3017	\| '&' MUTEX paren_identifier attribute_list_opt
3018	{ $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3019	\| identifier_parameter_ptr
3020	\| identifier_parameter_array attribute_list_opt
3021	{ $$ = $1->addQualifiers( $2 ); }
3022	\| identifier_parameter_function attribute_list_opt
3023	{ $$ = $1->addQualifiers( $2 ); }
3024	;
3025
3026	identifier_parameter_ptr:
3027	ptrref_operator identifier_parameter_declarator
3028	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3029	\| ptrref_operator type_qualifier_list identifier_parameter_declarator
3030	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3031	\| '(' identifier_parameter_ptr ')' attribute_list_opt
3032	{ $$ = $2->addQualifiers( $4 ); }
3033	;
3034
3035	identifier_parameter_array:
3036	paren_identifier array_parameter_dimension
3037	{ $$ = $1->addArray( $2 ); }
3038	\| '(' identifier_parameter_ptr ')' array_dimension
3039	{ $$ = $2->addArray( $4 ); }
3040	\| '(' identifier_parameter_array ')' multi_array_dimension // redundant parenthesis
3041	{ $$ = $2->addArray( $4 ); }
3042	\| '(' identifier_parameter_array ')' // redundant parenthesis
3043	{ $$ = $2; }
3044	;
3045
3046	identifier_parameter_function:
3047	paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3048	{ $$ = $1->addParamList( $4 ); }
3049	\| '(' identifier_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3050	{ $$ = $2->addParamList( $6 ); }
3051	\| '(' identifier_parameter_function ')' // redundant parenthesis
3052	{ $$ = $2; }
3053	;
3054
3055	// This pattern parses a declaration for a parameter variable or function prototype that is redefining a typedef name,
3056	// e.g.:
3057	//
3058	// typedef int foo;
3059	// forall( otype T ) struct foo;
3060	// int f( int foo ); // redefine typedef name in new scope
3061	//
3062	// and allows the C99 array options, which can only appear in a parameter list.
3063
3064	type_parameter_redeclarator:
3065	typedef attribute_list_opt
3066	{ $$ = $1->addQualifiers( $2 ); }
3067	\| '&' MUTEX typedef attribute_list_opt
3068	{ $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3069	\| type_parameter_ptr
3070	\| type_parameter_array attribute_list_opt
3071	{ $$ = $1->addQualifiers( $2 ); }
3072	\| type_parameter_function attribute_list_opt
3073	{ $$ = $1->addQualifiers( $2 ); }
3074	;
3075
3076	typedef:
3077	TYPEDEFname
3078	{ $$ = DeclarationNode::newName( $1 ); }
3079	\| TYPEGENname
3080	{ $$ = DeclarationNode::newName( $1 ); }
3081	;
3082
3083	type_parameter_ptr:
3084	ptrref_operator type_parameter_redeclarator
3085	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3086	\| ptrref_operator type_qualifier_list type_parameter_redeclarator
3087	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3088	\| '(' type_parameter_ptr ')' attribute_list_opt
3089	{ $$ = $2->addQualifiers( $4 ); }
3090	;
3091
3092	type_parameter_array:
3093	typedef array_parameter_dimension
3094	{ $$ = $1->addArray( $2 ); }
3095	\| '(' type_parameter_ptr ')' array_parameter_dimension
3096	{ $$ = $2->addArray( $4 ); }
3097	;
3098
3099	type_parameter_function:
3100	typedef '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3101	{ $$ = $1->addParamList( $4 ); }
3102	\| '(' type_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3103	{ $$ = $2->addParamList( $6 ); }
3104	;
3105
3106	// This pattern parses a declaration of an abstract variable or function prototype, i.e., there is no identifier to
3107	// which the type applies, e.g.:
3108	//
3109	// sizeof( int );
3110	// sizeof( int * );
3111	// sizeof( int [10] );
3112	// sizeof( int (*)() );
3113	// sizeof( int () );
3114	//
3115	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3116	// and functions versus pointers to arrays and functions.
3117
3118	abstract_declarator:
3119	abstract_ptr
3120	\| abstract_array attribute_list_opt
3121	{ $$ = $1->addQualifiers( $2 ); }
3122	\| abstract_function attribute_list_opt
3123	{ $$ = $1->addQualifiers( $2 ); }
3124	;
3125
3126	abstract_ptr:
3127	ptrref_operator
3128	{ $$ = DeclarationNode::newPointer( 0, $1 ); }
3129	\| ptrref_operator type_qualifier_list
3130	{ $$ = DeclarationNode::newPointer( $2, $1 ); }
3131	\| ptrref_operator abstract_declarator
3132	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3133	\| ptrref_operator type_qualifier_list abstract_declarator
3134	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3135	\| '(' abstract_ptr ')' attribute_list_opt
3136	{ $$ = $2->addQualifiers( $4 ); }
3137	;
3138
3139	abstract_array:
3140	array_dimension
3141	\| '(' abstract_ptr ')' array_dimension
3142	{ $$ = $2->addArray( $4 ); }
3143	\| '(' abstract_array ')' multi_array_dimension // redundant parenthesis
3144	{ $$ = $2->addArray( $4 ); }
3145	\| '(' abstract_array ')' // redundant parenthesis
3146	{ $$ = $2; }
3147	;
3148
3149	abstract_function:
3150	'(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3151	{ $$ = DeclarationNode::newFunction( nullptr, nullptr, $3, nullptr ); }
3152	\| '(' abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3153	{ $$ = $2->addParamList( $6 ); }
3154	\| '(' abstract_function ')' // redundant parenthesis
3155	{ $$ = $2; }
3156	;
3157
3158	array_dimension:
3159	// Only the first dimension can be empty.
3160	'[' ']'
3161	{ $$ = DeclarationNode::newArray( 0, 0, false ); }
3162	\| '[' ']' multi_array_dimension
3163	{ $$ = DeclarationNode::newArray( 0, 0, false )->addArray( $3 ); }
3164	\| multi_array_dimension
3165	;
3166
3167	multi_array_dimension:
3168	'[' push assignment_expression pop ']'
3169	{ $$ = DeclarationNode::newArray( $3, 0, false ); }
3170	\| '[' push '*' pop ']' // C99
3171	{ $$ = DeclarationNode::newVarArray( 0 ); }
3172	\| multi_array_dimension '[' push assignment_expression pop ']'
3173	{ $$ = $1->addArray( DeclarationNode::newArray( $4, 0, false ) ); }
3174	\| multi_array_dimension '[' push '*' pop ']' // C99
3175	{ $$ = $1->addArray( DeclarationNode::newVarArray( 0 ) ); }
3176	;
3177
3178	// This pattern parses a declaration of a parameter abstract variable or function prototype, i.e., there is no
3179	// identifier to which the type applies, e.g.:
3180	//
3181	// int f( int ); // not handled here
3182	// int f( int * ); // abstract function-prototype parameter; no parameter name specified
3183	// int f( int (*)() ); // abstract function-prototype parameter; no parameter name specified
3184	// int f( int (int) ); // abstract function-prototype parameter; no parameter name specified
3185	//
3186	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3187	// and functions versus pointers to arrays and functions. In addition, the pattern handles the
3188	// special meaning of parenthesis around a typedef name:
3189	//
3190	// ISO/IEC 9899:1999 Section 6.7.5.3(11) : "In a parameter declaration, a single typedef name in
3191	// parentheses is taken to be an abstract declarator that specifies a function with a single parameter,
3192	// not as redundant parentheses around the identifier."
3193	//
3194	// For example:
3195	//
3196	// typedef float T;
3197	// int f( int ( T [5] ) ); // see abstract_parameter_declarator
3198	// int g( int ( T ( int ) ) ); // see abstract_parameter_declarator
3199	// int f( int f1( T a[5] ) ); // see identifier_parameter_declarator
3200	// int g( int g1( T g2( int p ) ) ); // see identifier_parameter_declarator
3201	//
3202	// In essence, a '(' immediately to the left of typedef name, T, is interpreted as starting a parameter type list, and
3203	// not as redundant parentheses around a redeclaration of T. Finally, the pattern also precludes declaring an array of
3204	// functions versus a pointer to an array of functions, and returning arrays and functions versus pointers to arrays and
3205	// functions.
3206
3207	abstract_parameter_declarator:
3208	abstract_parameter_ptr
3209	\| '&' MUTEX attribute_list_opt
3210	{ $$ = DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf )->addQualifiers( $3 ); }
3211	\| abstract_parameter_array attribute_list_opt
3212	{ $$ = $1->addQualifiers( $2 ); }
3213	\| abstract_parameter_function attribute_list_opt
3214	{ $$ = $1->addQualifiers( $2 ); }
3215	;
3216
3217	abstract_parameter_ptr:
3218	ptrref_operator
3219	{ $$ = DeclarationNode::newPointer( nullptr, $1 ); }
3220	\| ptrref_operator type_qualifier_list
3221	{ $$ = DeclarationNode::newPointer( $2, $1 ); }
3222	\| ptrref_operator abstract_parameter_declarator
3223	{ $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3224	\| ptrref_operator type_qualifier_list abstract_parameter_declarator
3225	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3226	\| '(' abstract_parameter_ptr ')' attribute_list_opt
3227	{ $$ = $2->addQualifiers( $4 ); }
3228	;
3229
3230	abstract_parameter_array:
3231	array_parameter_dimension
3232	\| '(' abstract_parameter_ptr ')' array_parameter_dimension
3233	{ $$ = $2->addArray( $4 ); }
3234	\| '(' abstract_parameter_array ')' multi_array_dimension // redundant parenthesis
3235	{ $$ = $2->addArray( $4 ); }
3236	\| '(' abstract_parameter_array ')' // redundant parenthesis
3237	{ $$ = $2; }
3238	;
3239
3240	abstract_parameter_function:
3241	'(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3242	{ $$ = DeclarationNode::newFunction( nullptr, nullptr, $3, nullptr ); }
3243	\| '(' abstract_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3244	{ $$ = $2->addParamList( $6 ); }
3245	\| '(' abstract_parameter_function ')' // redundant parenthesis
3246	{ $$ = $2; }
3247	;
3248
3249	array_parameter_dimension:
3250	// Only the first dimension can be empty or have qualifiers.
3251	array_parameter_1st_dimension
3252	\| array_parameter_1st_dimension multi_array_dimension
3253	{ $$ = $1->addArray( $2 ); }
3254	\| multi_array_dimension
3255	;
3256
3257	// The declaration of an array parameter has additional syntax over arrays in normal variable declarations:
3258	//
3259	// ISO/IEC 9899:1999 Section 6.7.5.2(1) : "The optional type qualifiers and the keyword static shall appear only in
3260	// a declaration of a function parameter with an array type, and then only in the outermost array type derivation."
3261
3262	array_parameter_1st_dimension:
3263	'[' ']'
3264	{ $$ = DeclarationNode::newArray( 0, 0, false ); }
3265	// multi_array_dimension handles the '[' '*' ']' case
3266	\| '[' push type_qualifier_list '*' pop ']' // remaining C99
3267	{ $$ = DeclarationNode::newVarArray( $3 ); }
3268	\| '[' push type_qualifier_list pop ']'
3269	{ $$ = DeclarationNode::newArray( 0, $3, false ); }
3270	// multi_array_dimension handles the '[' assignment_expression ']' case
3271	\| '[' push type_qualifier_list assignment_expression pop ']'
3272	{ $$ = DeclarationNode::newArray( $4, $3, false ); }
3273	\| '[' push STATIC type_qualifier_list_opt assignment_expression pop ']'
3274	{ $$ = DeclarationNode::newArray( $5, $4, true ); }
3275	\| '[' push type_qualifier_list STATIC assignment_expression pop ']'
3276	{ $$ = DeclarationNode::newArray( $5, $3, true ); }
3277	;
3278
3279	// This pattern parses a declaration of an abstract variable, but does not allow "int ()" for a function pointer.
3280	//
3281	// struct S {
3282	// int;
3283	// int *;
3284	// int [10];
3285	// int (*)();
3286	// };
3287
3288	variable_abstract_declarator:
3289	variable_abstract_ptr
3290	\| variable_abstract_array attribute_list_opt
3291	{ $$ = $1->addQualifiers( $2 ); }
3292	\| variable_abstract_function attribute_list_opt
3293	{ $$ = $1->addQualifiers( $2 ); }
3294	;
3295
3296	variable_abstract_ptr:
3297	ptrref_operator
3298	{ $$ = DeclarationNode::newPointer( 0, $1 ); }
3299	\| ptrref_operator type_qualifier_list
3300	{ $$ = DeclarationNode::newPointer( $2, $1 ); }
3301	\| ptrref_operator variable_abstract_declarator
3302	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3303	\| ptrref_operator type_qualifier_list variable_abstract_declarator
3304	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3305	\| '(' variable_abstract_ptr ')' attribute_list_opt
3306	{ $$ = $2->addQualifiers( $4 ); }
3307	;
3308
3309	variable_abstract_array:
3310	array_dimension
3311	\| '(' variable_abstract_ptr ')' array_dimension
3312	{ $$ = $2->addArray( $4 ); }
3313	\| '(' variable_abstract_array ')' multi_array_dimension // redundant parenthesis
3314	{ $$ = $2->addArray( $4 ); }
3315	\| '(' variable_abstract_array ')' // redundant parenthesis
3316	{ $$ = $2; }
3317	;
3318
3319	variable_abstract_function:
3320	'(' variable_abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3321	{ $$ = $2->addParamList( $6 ); }
3322	\| '(' variable_abstract_function ')' // redundant parenthesis
3323	{ $$ = $2; }
3324	;
3325
3326	// This pattern parses a new-style declaration for a parameter variable or function prototype that is either an
3327	// identifier or typedef name and allows the C99 array options, which can only appear in a parameter list.
3328
3329	cfa_identifier_parameter_declarator_tuple: // CFA
3330	cfa_identifier_parameter_declarator_no_tuple
3331	\| cfa_abstract_tuple
3332	\| type_qualifier_list cfa_abstract_tuple
3333	{ $$ = $2->addQualifiers( $1 ); }
3334	;
3335
3336	cfa_identifier_parameter_declarator_no_tuple: // CFA
3337	cfa_identifier_parameter_ptr
3338	\| cfa_identifier_parameter_array
3339	;
3340
3341	cfa_identifier_parameter_ptr: // CFA
3342	// No SUE declaration in parameter list.
3343	ptrref_operator type_specifier_nobody
3344	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3345	\| type_qualifier_list ptrref_operator type_specifier_nobody
3346	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3347	\| ptrref_operator cfa_abstract_function
3348	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3349	\| type_qualifier_list ptrref_operator cfa_abstract_function
3350	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3351	\| ptrref_operator cfa_identifier_parameter_declarator_tuple
3352	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3353	\| type_qualifier_list ptrref_operator cfa_identifier_parameter_declarator_tuple
3354	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3355	;
3356
3357	cfa_identifier_parameter_array: // CFA
3358	// Only the first dimension can be empty or have qualifiers. Empty dimension must be factored out due to
3359	// shift/reduce conflict with new-style empty (void) function return type.
3360	'[' ']' type_specifier_nobody
3361	{ $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3362	\| cfa_array_parameter_1st_dimension type_specifier_nobody
3363	{ $$ = $2->addNewArray( $1 ); }
3364	\| '[' ']' multi_array_dimension type_specifier_nobody
3365	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3366	\| cfa_array_parameter_1st_dimension multi_array_dimension type_specifier_nobody
3367	{ $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
3368	\| multi_array_dimension type_specifier_nobody
3369	{ $$ = $2->addNewArray( $1 ); }
3370
3371	\| '[' ']' cfa_identifier_parameter_ptr
3372	{ $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3373	\| cfa_array_parameter_1st_dimension cfa_identifier_parameter_ptr
3374	{ $$ = $2->addNewArray( $1 ); }
3375	\| '[' ']' multi_array_dimension cfa_identifier_parameter_ptr
3376	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3377	\| cfa_array_parameter_1st_dimension multi_array_dimension cfa_identifier_parameter_ptr
3378	{ $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
3379	\| multi_array_dimension cfa_identifier_parameter_ptr
3380	{ $$ = $2->addNewArray( $1 ); }
3381	;
3382
3383	cfa_array_parameter_1st_dimension:
3384	'[' push type_qualifier_list '*' pop ']' // remaining C99
3385	{ $$ = DeclarationNode::newVarArray( $3 ); }
3386	\| '[' push type_qualifier_list assignment_expression pop ']'
3387	{ $$ = DeclarationNode::newArray( $4, $3, false ); }
3388	\| '[' push declaration_qualifier_list assignment_expression pop ']'
3389	// declaration_qualifier_list must be used because of shift/reduce conflict with
3390	// assignment_expression, so a semantic check is necessary to preclude them as a type_qualifier cannot
3391	// appear in this context.
3392	{ $$ = DeclarationNode::newArray( $4, $3, true ); }
3393	\| '[' push declaration_qualifier_list type_qualifier_list assignment_expression pop ']'
3394	{ $$ = DeclarationNode::newArray( $5, $4->addQualifiers( $3 ), true ); }
3395	;
3396
3397	// This pattern parses a new-style declaration of an abstract variable or function prototype, i.e., there is no
3398	// identifier to which the type applies, e.g.:
3399	//
3400	// [int] f( int ); // abstract variable parameter; no parameter name specified
3401	// [int] f( [int] (int) ); // abstract function-prototype parameter; no parameter name specified
3402	//
3403	// These rules need LR(3):
3404	//
3405	// cfa_abstract_tuple identifier_or_type_name
3406	// '[' cfa_parameter_list ']' identifier_or_type_name '(' cfa_parameter_ellipsis_list_opt ')'
3407	//
3408	// since a function return type can be syntactically identical to a tuple type:
3409	//
3410	// [int, int] t;
3411	// [int, int] f( int );
3412	//
3413	// Therefore, it is necessary to look at the token after identifier_or_type_name to know when to reduce
3414	// cfa_abstract_tuple. To make this LR(1), several rules have to be flattened (lengthened) to allow the necessary
3415	// lookahead. To accomplish this, cfa_abstract_declarator has an entry point without tuple, and tuple declarations are
3416	// duplicated when appearing with cfa_function_specifier.
3417
3418	cfa_abstract_declarator_tuple: // CFA
3419	cfa_abstract_tuple
3420	\| type_qualifier_list cfa_abstract_tuple
3421	{ $$ = $2->addQualifiers( $1 ); }
3422	\| cfa_abstract_declarator_no_tuple
3423	;
3424
3425	cfa_abstract_declarator_no_tuple: // CFA
3426	cfa_abstract_ptr
3427	\| cfa_abstract_array
3428	;
3429
3430	cfa_abstract_ptr: // CFA
3431	ptrref_operator type_specifier
3432	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3433	\| type_qualifier_list ptrref_operator type_specifier
3434	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3435	\| ptrref_operator cfa_abstract_function
3436	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3437	\| type_qualifier_list ptrref_operator cfa_abstract_function
3438	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3439	\| ptrref_operator cfa_abstract_declarator_tuple
3440	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3441	\| type_qualifier_list ptrref_operator cfa_abstract_declarator_tuple
3442	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3443	;
3444
3445	cfa_abstract_array: // CFA
3446	// Only the first dimension can be empty. Empty dimension must be factored out due to shift/reduce conflict with
3447	// empty (void) function return type.
3448	'[' ']' type_specifier
3449	{ $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3450	\| '[' ']' multi_array_dimension type_specifier
3451	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3452	\| multi_array_dimension type_specifier
3453	{ $$ = $2->addNewArray( $1 ); }
3454	\| '[' ']' cfa_abstract_ptr
3455	{ $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3456	\| '[' ']' multi_array_dimension cfa_abstract_ptr
3457	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3458	\| multi_array_dimension cfa_abstract_ptr
3459	{ $$ = $2->addNewArray( $1 ); }
3460	;
3461
3462	cfa_abstract_tuple: // CFA
3463	'[' push cfa_abstract_parameter_list pop ']'
3464	{ $$ = DeclarationNode::newTuple( $3 ); }
3465	\| '[' push type_specifier_nobody ELLIPSIS pop ']'
3466	{ SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
3467	\| '[' push type_specifier_nobody ELLIPSIS constant_expression pop ']'
3468	{ SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
3469	;
3470
3471	cfa_abstract_function: // CFA
3472	// '[' ']' '(' cfa_parameter_ellipsis_list_opt ')'
3473	// { $$ = DeclarationNode::newFunction( nullptr, DeclarationNode::newTuple( nullptr ), $4, nullptr ); }
3474	cfa_abstract_tuple '(' push cfa_parameter_ellipsis_list_opt pop ')'
3475	{ $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
3476	\| cfa_function_return '(' push cfa_parameter_ellipsis_list_opt pop ')'
3477	{ $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
3478	;
3479
3480	// 1) ISO/IEC 9899:1999 Section 6.7.2(2) : "At least one type specifier shall be given in the declaration specifiers in
3481	// each declaration, and in the specifier-qualifier list in each structure declaration and type name."
3482	//
3483	// 2) ISO/IEC 9899:1999 Section 6.11.5(1) : "The placement of a storage-class specifier other than at the beginning of
3484	// the declaration specifiers in a declaration is an obsolescent feature."
3485	//
3486	// 3) ISO/IEC 9899:1999 Section 6.11.6(1) : "The use of function declarators with empty parentheses (not
3487	// prototype-format parameter type declarators) is an obsolescent feature."
3488	//
3489	// 4) ISO/IEC 9899:1999 Section 6.11.7(1) : "The use of function definitions with separate parameter identifier and
3490	// declaration lists (not prototype-format parameter type and identifier declarators) is an obsolescent feature.
3491
3492	//*********************** MISCELLANEOUS ******************************
3493
3494	comma_opt: // redundant comma
3495	// empty
3496	\| ','
3497	;
3498
3499	default_initializer_opt:
3500	// empty
3501	{ $$ = nullptr; }
3502	\| '=' assignment_expression
3503	{ $$ = $2; }
3504	;
3505
3506	%%
3507
3508	// ----end of grammar----
3509
3510	// Local Variables: //
3511	// mode: c++ //
3512	// tab-width: 4 //
3513	// compile-command: "make install" //
3514	// End: //

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

Download in other formats:

Original Format