Context Navigation

parser.yy @ dc86541

ADTaaron-thesisarm-ehast-experimentalcleanup-dtorsdeferred_resndemanglerenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerpthread-emulationqualifiedEnumresolv-newwith_gc

Last change on this file since dc86541 was 3f0c6a5, checked in by Rob Schluntz <rschlunt@…>, 8 years ago

Merge branch 'master' into tuples

Conflicts:

src/Parser/parser.cc
src/Parser/parser.yy

Property mode set to 100644

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

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

Download in other formats:

Original Format