Context Navigation

parser.yy@ 5ae36ed

Visit:

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors ctor deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox memory 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 5ae36ed was 2f22cc4, checked in by Peter A. Buhr <pabuhr@…>, 9 years ago
more refactoring of parser code
Property mode set to `100644`
File size: 103.4 KB

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

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

Download in other formats:

Original Format