Context Navigation

parser.yy @ 4a9ccc3

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

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

Download in other formats:

Original Format