Context Navigation

parser.yy @ 8ff586c

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

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

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

Download in other formats:

Original Format