Context Navigation

parser.yy @ a77713b

ADTast-experimentalenumpthread-emulationqualifiedEnum

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

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

Download in other formats:

Original Format