Context Navigation

parser.yy @ 5cefa43

ADTast-experimentalenumpthread-emulationqualifiedEnum

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

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

Download in other formats:

Original Format