Context Navigation

parser.yy @ 08e75215

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

Last change on this file since 08e75215 was f9c3100, checked in by Peter A. Buhr <pabuhr@…>, 4 years ago
refactor assignment_operator, limit aggregate name to unqualified name, add new syntax for enumerated-type extensions and enum initialization, rename typedef rule to typedef_name
Property mode set to `100644`
File size: 143.3 KB

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

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

Download in other formats:

Original Format