Context Navigation

parser.yy@ 3bff885

Visit:

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum resolv-new with_gc

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

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

Download in other formats:

Original Format