Context Navigation

parser.yy @ 7c919446

ADTaaron-thesisarm-ehast-experimentalcleanup-dtorsdeferred_resndemanglerenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprno_listpersistent-indexerpthread-emulationqualifiedEnum

Last change on this file since 7c919446 was 713926ca, checked in by Peter A. Buhr <pabuhr@…>, 6 years ago
generalize waitfor routine, and error for no conditional on else after timeout
Property mode set to `100644`
File size: 124.6 KB

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

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

Download in other formats:

Original Format