Context Navigation

parser.yy @ 6e50a6b

ADTast-experimentalenumforall-pointer-decayjacob/cs343-translationnew-ast-unique-exprpthread-emulationqualifiedEnum

Last change on this file since 6e50a6b was 6e50a6b, checked in by Michael Brooks <mlbrooks@…>, 3 years ago

Implementing language-provided syntax for (array) dimensions.

Former z(i) and Z(N) macros are eliminated.

Property mode set to 100644

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

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

Download in other formats:

Original Format