Context Navigation

parser.yy@ dac593fd

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 dac593fd was 8cc5cb0, checked in by Peter A. Buhr <pabuhr@…>, 9 years ago
more refactoring of parser code
Property mode set to `100644`
File size: 103.0 KB

Line
1	//
2	// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3	//
4	// The contents of this file are covered under the licence agreement in the
5	// file "LICENCE" distributed with Cforall.
6	//
7	// cfa.y --
8	//
9	// Author : Peter A. Buhr
10	// Created On : Sat Sep 1 20:22:55 2001
11	// Last Modified By : Peter A. Buhr
12	// Last Modified On : Thu Aug 11 18:02:57 2016
13	// Update Count : 1861
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 StatementNode2( build_expr( new ExpressionNode( build_func( new ExpressionNode( build_varref( fn ) ), (ExpressionNode *)( $2 )->set_link( $4 ) ) ) ) );
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 StatementNode2( build_expr( $1 ) ); }
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 StatementNode2( build_if( $3, $5, nullptr ) ); }
726	\| IF '(' comma_expression ')' statement ELSE statement
727	{ $$ = new StatementNode2( build_if( $3, $5, $7 ) ); }
728	\| SWITCH '(' comma_expression ')' case_clause // CFA
729	{ $$ = new StatementNode2( build_switch( $3, $5 ) ); }
730	\| SWITCH '(' comma_expression ')' '{' push declaration_list_opt switch_clause_list_opt '}' // CFA
731	{
732	StatementNode *sw = new StatementNode2( build_switch( $3, $8 ) );
733	// The semantics of the declaration list is changed to include associated initialization, which is performed
734	// before the transfer to the appropriate case clause by hoisting the declarations into a compound
735	// statement around the switch. Statements after the initial declaration list can never be executed, and
736	// therefore, are removed from the grammar even though C allows it. The change also applies to choose
737	// statement.
738	$$ = $7 != 0 ? new CompoundStmtNode( (StatementNode *)((new StatementNode( $7 ))->set_link( sw )) ) : sw;
739	}
740	\| CHOOSE '(' comma_expression ')' case_clause // CFA
741	{ $$ = new StatementNode2( build_switch( $3, $5 ) ); }
742	\| CHOOSE '(' comma_expression ')' '{' push declaration_list_opt choose_clause_list_opt '}' // CFA
743	{
744	StatementNode *sw = new StatementNode2( build_switch( $3, $8 ) );
745	$$ = $7 != 0 ? new CompoundStmtNode( (StatementNode *)((new StatementNode( $7 ))->set_link( sw )) ) : sw;
746	}
747	;
748
749	// CASE and DEFAULT clauses are only allowed in the SWITCH statement, precluding Duff's device. In addition, a case
750	// clause allows a list of values and subranges.
751
752	case_value: // CFA
753	constant_expression { $$ = $1; }
754	\| constant_expression ELLIPSIS constant_expression // GCC, subrange
755	{ $$ = new ExpressionNode( build_range( $1, $3 ) ); }
756	\| subrange // CFA, subrange
757	;
758
759	case_value_list: // CFA
760	//case_value { $$ = new StatementNode( StatementNode::Case, $1, 0 ); }
761	case_value { $$ = new StatementNode2( build_case( $1 ) ); }
762	// convert case list, e.g., "case 1, 3, 5:" into "case 1: case 3: case 5"
763	\| case_value_list ',' case_value { $$ = (StatementNode *)($1->set_link( new StatementNode2( build_case( $3 ) ) ) ); }
764	;
765
766	case_label: // CFA
767	CASE case_value_list ':' { $$ = $2; }
768	\| DEFAULT ':' { $$ = new StatementNode2( build_default() ); }
769	// A semantic check is required to ensure only one default clause per switch/choose statement.
770	;
771
772	case_label_list: // CFA
773	case_label
774	\| case_label_list case_label { $$ = (StatementNode *)( $1->set_link( $2 )); }
775	;
776
777	case_clause: // CFA
778	case_label_list statement { $$ = $1->append_last_case( new CompoundStmtNode( $2 ) ); }
779	;
780
781	switch_clause_list_opt: // CFA
782	// empty
783	{ $$ = 0; }
784	\| switch_clause_list
785	;
786
787	switch_clause_list: // CFA
788	case_label_list statement_list
789	{ $$ = $1->append_last_case( new CompoundStmtNode( $2 ) ); }
790	\| switch_clause_list case_label_list statement_list
791	{ $$ = (StatementNode *)( $1->set_link( $2->append_last_case( new CompoundStmtNode( $3 ) ) ) ); }
792	;
793
794	choose_clause_list_opt: // CFA
795	// empty
796	{ $$ = 0; }
797	\| choose_clause_list
798	;
799
800	choose_clause_list: // CFA
801	case_label_list fall_through
802	{ $$ = $1->append_last_case( $2 ); }
803	\| case_label_list statement_list fall_through_opt
804	{ $$ = $1->append_last_case( new CompoundStmtNode( (StatementNode )mkList( ($2, *$3 ) ) ) ); }
805	\| choose_clause_list case_label_list fall_through
806	{ $$ = (StatementNode *)( $1->set_link( $2->append_last_case( $3 ))); }
807	\| choose_clause_list case_label_list statement_list fall_through_opt
808	{ $$ = (StatementNode )( $1->set_link( $2->append_last_case( new CompoundStmtNode( (StatementNode )mkList( ($3, $4 ) ) ) ) ) ); }
809	;
810
811	fall_through_opt: // CFA
812	// empty
813	{ $$ = new StatementNode2( build_branch( "", BranchStmt::Break ) ); } // insert implicit break
814	\| fall_through
815	;
816
817	fall_through: // CFA
818	FALLTHRU
819	{ $$ = 0; }
820	\| FALLTHRU ';'
821	{ $$ = 0; }
822	;
823
824	iteration_statement:
825	WHILE '(' comma_expression ')' statement
826	{ $$ = new StatementNode2( build_while( $3, $5 ) ); }
827	\| DO statement WHILE '(' comma_expression ')' ';'
828	{ $$ = new StatementNode2( build_while( $5, $2 ) ); }
829	\| FOR '(' push for_control_expression ')' statement
830	{ $$ = new StatementNode2( build_for( $4, $6 ) ); }
831	;
832
833	for_control_expression:
834	comma_expression_opt pop ';' comma_expression_opt ';' comma_expression_opt
835	{ $$ = new ForCtl( $1, $4, $6 ); }
836	\| declaration comma_expression_opt ';' comma_expression_opt // C99
837	{ $$ = new ForCtl( $1, $2, $4 ); }
838	;
839
840	jump_statement:
841	GOTO IDENTIFIER ';'
842	{ $$ = new StatementNode2( build_branch( *$2, BranchStmt::Goto ) ); }
843	\| GOTO '*' comma_expression ';' // GCC, computed goto
844	// The syntax for the GCC computed goto violates normal expression precedence, e.g., goto i+3; => goto (i+3);
845	// whereas normal operator precedence yields goto (*i)+3;
846	{ $$ = new StatementNode2( build_computedgoto( $3 ) ); }
847	\| CONTINUE ';'
848	// A semantic check is required to ensure this statement appears only in the body of an iteration statement.
849	{ $$ = new StatementNode2( build_branch( "", BranchStmt::Continue ) ); }
850	\| CONTINUE IDENTIFIER ';' // CFA, multi-level continue
851	// A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
852	// the target of the transfer appears only at the start of an iteration statement.
853	{ $$ = new StatementNode2( build_branch( *$2, BranchStmt::Continue ) ); delete $2; }
854	\| BREAK ';'
855	// A semantic check is required to ensure this statement appears only in the body of an iteration statement.
856	{ $$ = new StatementNode2( build_branch( "", BranchStmt::Break ) ); }
857	\| BREAK IDENTIFIER ';' // CFA, multi-level exit
858	// A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
859	// the target of the transfer appears only at the start of an iteration statement.
860	{ $$ = new StatementNode2( build_branch( *$2, BranchStmt::Break ) ); delete $2; }
861	\| RETURN comma_expression_opt ';'
862	{ $$ = new StatementNode2( build_return( $2 ) ); }
863	\| THROW assignment_expression_opt ';' // handles rethrow
864	{ $$ = new StatementNode2( build_throw( $2 ) ); }
865	\| THROWRESUME assignment_expression_opt ';' // handles reresume
866	{ $$ = new StatementNode2( build_throw( $2 ) ); }
867	\| THROWRESUME assignment_expression_opt AT assignment_expression ';' // handles reresume
868	{ $$ = new StatementNode2( build_throw( $2 ) ); }
869	;
870
871	exception_statement:
872	TRY compound_statement handler_list
873	{ $$ = new StatementNode( StatementNode::Try, 0,(StatementNode )(mkList(($2,*$3 )))); }
874	\| TRY compound_statement finally_clause
875	{ $$ = new StatementNode( StatementNode::Try, 0,(StatementNode )(mkList(($2,*$3 )))); }
876	\| TRY compound_statement handler_list finally_clause
877	{
878	$3->set_link( $4 );
879	$$ = new StatementNode( StatementNode::Try, 0,(StatementNode )(mkList(($2,*$3 ))));
880	}
881	;
882
883	handler_list:
884	// There must be at least one catch clause
885	handler_clause
886	// ISO/IEC 9899:1999 Section 15.3(6 ) If present, a "..." handler shall be the last handler for its try block.
887	\| CATCH '(' ELLIPSIS ')' compound_statement
888	{ $$ = StatementNode::newCatchStmt( 0, $5, true ); }
889	\| handler_clause CATCH '(' ELLIPSIS ')' compound_statement
890	{ $$ = $1->set_link( StatementNode::newCatchStmt( 0, $6, true ) ); }
891	\| CATCHRESUME '(' ELLIPSIS ')' compound_statement
892	{ $$ = StatementNode::newCatchStmt( 0, $5, true ); }
893	\| handler_clause CATCHRESUME '(' ELLIPSIS ')' compound_statement
894	{ $$ = $1->set_link( StatementNode::newCatchStmt( 0, $6, true ) ); }
895	;
896
897	handler_clause:
898	CATCH '(' push push exception_declaration pop ')' compound_statement pop
899	{ $$ = StatementNode::newCatchStmt( $5, $8 ); }
900	\| handler_clause CATCH '(' push push exception_declaration pop ')' compound_statement pop
901	{ $$ = $1->set_link( StatementNode::newCatchStmt( $6, $9 ) ); }
902	\| CATCHRESUME '(' push push exception_declaration pop ')' compound_statement pop
903	{ $$ = StatementNode::newCatchStmt( $5, $8 ); }
904	\| handler_clause CATCHRESUME '(' push push exception_declaration pop ')' compound_statement pop
905	{ $$ = $1->set_link( StatementNode::newCatchStmt( $6, $9 ) ); }
906	;
907
908	finally_clause:
909	FINALLY compound_statement
910	{
911	$$ = new StatementNode( StatementNode::Finally, 0, $2 );
912	std::cout << "Just created a finally node" << std::endl;
913	}
914	;
915
916	exception_declaration:
917	// A semantic check is required to ensure type_specifier does not create a new type, e.g.:
918	//
919	// catch ( struct { int i; } x ) ...
920	//
921	// This new type cannot catch any thrown type because of name equivalence among types.
922	type_specifier
923	\| type_specifier declarator
924	{
925	typedefTable.addToEnclosingScope( TypedefTable::ID );
926	$$ = $2->addType( $1 );
927	}
928	\| type_specifier variable_abstract_declarator
929	{ $$ = $2->addType( $1 ); }
930	\| new_abstract_declarator_tuple no_attr_identifier // CFA
931	{
932	typedefTable.addToEnclosingScope( TypedefTable::ID );
933	$$ = $1->addName( $2 );
934	}
935	\| new_abstract_declarator_tuple // CFA
936	;
937
938	asm_statement:
939	ASM asm_volatile_opt '(' string_literal_list ')' ';'
940	{ $$ = new AsmStmtNode( StatementNode::Asm, $2, $4, 0 ); }
941	\| ASM asm_volatile_opt '(' string_literal_list ':' asm_operands_opt ')' ';' // remaining GCC
942	{ $$ = new AsmStmtNode( StatementNode::Asm, $2, $4, $6 ); }
943	\| ASM asm_volatile_opt '(' string_literal_list ':' asm_operands_opt ':' asm_operands_opt ')' ';'
944	{ $$ = new AsmStmtNode( StatementNode::Asm, $2, $4, $6, $8 ); }
945	\| ASM asm_volatile_opt '(' string_literal_list ':' asm_operands_opt ':' asm_operands_opt ':' asm_clobbers_list_opt ')' ';'
946	{ $$ = new AsmStmtNode( StatementNode::Asm, $2, $4, $6, $8, $10 ); }
947	\| ASM asm_volatile_opt GOTO '(' string_literal_list ':' ':' asm_operands_opt ':' asm_clobbers_list_opt ':' label_list ')' ';'
948	{ $$ = new AsmStmtNode( StatementNode::Asm, $2, $5, 0, $8, $10, $12 ); }
949	;
950
951	asm_volatile_opt: // GCC
952	// empty
953	{ $$ = false; }
954	\| VOLATILE
955	{ $$ = true; }
956	;
957
958	asm_operands_opt: // GCC
959	// empty
960	{ $$ = 0; } // use default argument
961	\| asm_operands_list
962	;
963
964	asm_operands_list: // GCC
965	asm_operand
966	\| asm_operands_list ',' asm_operand
967	{ $$ = (ExpressionNode *)$1->set_link( $3 ); }
968	;
969
970	asm_operand: // GCC
971	string_literal_list '(' constant_expression ')'
972	{ $$ = new ExpressionNode( build_asm( 0, $1, $3 ) ); }
973	\| '[' constant_expression ']' string_literal_list '(' constant_expression ')'
974	{ $$ = new ExpressionNode( build_asm( $2, $4, $6 ) ); }
975	;
976
977	asm_clobbers_list_opt: // GCC
978	// empty
979	{ $$ = 0; } // use default argument
980	\| string_literal_list
981	{ $$ = new ExpressionNode( $1 ); }
982	\| asm_clobbers_list_opt ',' string_literal_list
983	{ $$ = (ExpressionNode *)$1->set_link( new ExpressionNode( $3 ) ); }
984	;
985
986	label_list:
987	no_attr_identifier
988	{ $$ = new LabelNode(); $$->append_label( $1 ); }
989	\| label_list ',' no_attr_identifier
990	{ $$ = $1; $1->append_label( $3 ); }
991	;
992
993	//***************************** DECLARATIONS *******************************
994
995	declaration_list_opt: // used at beginning of switch statement
996	pop
997	{ $$ = 0; }
998	\| declaration_list
999	;
1000
1001	declaration_list:
1002	declaration
1003	\| declaration_list push declaration
1004	{ $$ = $1->appendList( $3 ); }
1005	;
1006
1007	old_declaration_list_opt: // used to declare parameter types in K&R style functions
1008	pop
1009	{ $$ = 0; }
1010	\| old_declaration_list
1011	;
1012
1013	old_declaration_list:
1014	old_declaration
1015	\| old_declaration_list push old_declaration
1016	{ $$ = $1->appendList( $3 ); }
1017	;
1018
1019	local_label_declaration_opt: // GCC, local label
1020	// empty
1021	\| local_label_declaration_list
1022	;
1023
1024	local_label_declaration_list: // GCC, local label
1025	LABEL local_label_list ';'
1026	\| local_label_declaration_list LABEL local_label_list ';'
1027	;
1028
1029	local_label_list: // GCC, local label
1030	no_attr_identifier_or_type_name {}
1031	\| local_label_list ',' no_attr_identifier_or_type_name {}
1032	;
1033
1034	declaration: // CFA, new & old style declarations
1035	new_declaration
1036	\| old_declaration
1037	;
1038
1039	// C declaration syntax is notoriously confusing and error prone. Cforall provides its own type, variable and function
1040	// declarations. CFA declarations use the same declaration tokens as in C; however, CFA places declaration modifiers to
1041	// the left of the base type, while C declarations place modifiers to the right of the base type. CFA declaration
1042	// modifiers are interpreted from left to right and the entire type specification is distributed across all variables in
1043	// the declaration list (as in Pascal). ANSI C and the new CFA declarations may appear together in the same program
1044	// block, but cannot be mixed within a specific declaration.
1045	//
1046	// CFA C
1047	// [10] int x; int x[10]; // array of 10 integers
1048	// [10] * char y; char *y[10]; // array of 10 pointers to char
1049
1050	new_declaration: // CFA
1051	new_variable_declaration pop ';'
1052	\| new_typedef_declaration pop ';'
1053	\| new_function_declaration pop ';'
1054	\| type_declaring_list pop ';'
1055	\| trait_specifier pop ';'
1056	;
1057
1058	new_variable_declaration: // CFA
1059	new_variable_specifier initializer_opt
1060	{
1061	typedefTable.addToEnclosingScope( TypedefTable::ID );
1062	$$ = $1->addInitializer( $2 );
1063	}
1064	\| declaration_qualifier_list new_variable_specifier initializer_opt
1065	// declaration_qualifier_list also includes type_qualifier_list, so a semantic check is necessary to preclude
1066	// them as a type_qualifier cannot appear in that context.
1067	{
1068	typedefTable.addToEnclosingScope( TypedefTable::ID );
1069	$$ = $2->addQualifiers( $1 )->addInitializer( $3 );;
1070	}
1071	\| new_variable_declaration pop ',' push identifier_or_type_name initializer_opt
1072	{
1073	typedefTable.addToEnclosingScope( *$5, TypedefTable::ID );
1074	$$ = $1->appendList( $1->cloneType( $5 )->addInitializer( $6 ) );
1075	}
1076	;
1077
1078	new_variable_specifier: // CFA
1079	// A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1080	// storage-class
1081	new_abstract_declarator_no_tuple identifier_or_type_name asm_name_opt
1082	{
1083	typedefTable.setNextIdentifier( *$2 );
1084	$$ = $1->addName( $2 );
1085	}
1086	\| new_abstract_tuple identifier_or_type_name asm_name_opt
1087	{
1088	typedefTable.setNextIdentifier( *$2 );
1089	$$ = $1->addName( $2 );
1090	}
1091	\| type_qualifier_list new_abstract_tuple identifier_or_type_name asm_name_opt
1092	{
1093	typedefTable.setNextIdentifier( *$3 );
1094	$$ = $2->addQualifiers( $1 )->addName( $3 );
1095	}
1096	;
1097
1098	new_function_declaration: // CFA
1099	new_function_specifier
1100	{
1101	typedefTable.addToEnclosingScope( TypedefTable::ID );
1102	$$ = $1;
1103	}
1104	\| type_qualifier_list new_function_specifier
1105	{
1106	typedefTable.addToEnclosingScope( TypedefTable::ID );
1107	$$ = $2->addQualifiers( $1 );
1108	}
1109	\| declaration_qualifier_list new_function_specifier
1110	{
1111	typedefTable.addToEnclosingScope( TypedefTable::ID );
1112	$$ = $2->addQualifiers( $1 );
1113	}
1114	\| declaration_qualifier_list type_qualifier_list new_function_specifier
1115	{
1116	typedefTable.addToEnclosingScope( TypedefTable::ID );
1117	$$ = $3->addQualifiers( $1 )->addQualifiers( $2 );
1118	}
1119	\| new_function_declaration pop ',' push identifier_or_type_name
1120	{
1121	typedefTable.addToEnclosingScope( *$5, TypedefTable::ID );
1122	$$ = $1->appendList( $1->cloneType( $5 ) );
1123	}
1124	;
1125
1126	new_function_specifier: // CFA
1127	'[' ']' identifier_or_type_name '(' push new_parameter_type_list_opt pop ')' // S/R conflict
1128	{
1129	$$ = DeclarationNode::newFunction( $3, DeclarationNode::newTuple( 0 ), $6, 0, true );
1130	}
1131	// '[' ']' identifier '(' push new_parameter_type_list_opt pop ')'
1132	// {
1133	// typedefTable.setNextIdentifier( *$5 );
1134	// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1135	// }
1136	// \| '[' ']' TYPEDEFname '(' push new_parameter_type_list_opt pop ')'
1137	// {
1138	// typedefTable.setNextIdentifier( *$5 );
1139	// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1140	// }
1141	// \| '[' ']' typegen_name
1142	// identifier_or_type_name must be broken apart because of the sequence:
1143	//
1144	// '[' ']' identifier_or_type_name '(' new_parameter_type_list_opt ')'
1145	// '[' ']' type_specifier
1146	//
1147	// type_specifier can resolve to just TYPEDEFname (e.g., typedef int T; int f( T );). Therefore this must be
1148	// flattened to allow lookahead to the '(' without having to reduce identifier_or_type_name.
1149	\| new_abstract_tuple identifier_or_type_name '(' push new_parameter_type_list_opt pop ')'
1150	// To obtain LR(1 ), this rule must be factored out from function return type (see new_abstract_declarator).
1151	{
1152	$$ = DeclarationNode::newFunction( $2, $1, $5, 0, true );
1153	}
1154	\| new_function_return identifier_or_type_name '(' push new_parameter_type_list_opt pop ')'
1155	{
1156	$$ = DeclarationNode::newFunction( $2, $1, $5, 0, true );
1157	}
1158	;
1159
1160	new_function_return: // CFA
1161	'[' push new_parameter_list pop ']'
1162	{ $$ = DeclarationNode::newTuple( $3 ); }
1163	\| '[' push new_parameter_list pop ',' push new_abstract_parameter_list pop ']'
1164	// To obtain LR(1 ), the last new_abstract_parameter_list is added into this flattened rule to lookahead to the
1165	// ']'.
1166	{ $$ = DeclarationNode::newTuple( $3->appendList( $7 ) ); }
1167	;
1168
1169	new_typedef_declaration: // CFA
1170	TYPEDEF new_variable_specifier
1171	{
1172	typedefTable.addToEnclosingScope( TypedefTable::TD );
1173	$$ = $2->addTypedef();
1174	}
1175	\| TYPEDEF new_function_specifier
1176	{
1177	typedefTable.addToEnclosingScope( TypedefTable::TD );
1178	$$ = $2->addTypedef();
1179	}
1180	\| new_typedef_declaration pop ',' push no_attr_identifier
1181	{
1182	typedefTable.addToEnclosingScope( *$5, TypedefTable::TD );
1183	$$ = $1->appendList( $1->cloneType( $5 ) );
1184	}
1185	;
1186
1187	// Traditionally typedef is part of storage-class specifier for syntactic convenience only. Here, it is factored out as
1188	// a separate form of declaration, which syntactically precludes storage-class specifiers and initialization.
1189
1190	typedef_declaration:
1191	TYPEDEF type_specifier declarator
1192	{
1193	typedefTable.addToEnclosingScope( TypedefTable::TD );
1194	$$ = $3->addType( $2 )->addTypedef();
1195	}
1196	\| typedef_declaration pop ',' push declarator
1197	{
1198	typedefTable.addToEnclosingScope( TypedefTable::TD );
1199	$$ = $1->appendList( $1->cloneBaseType( $5 )->addTypedef() );
1200	}
1201	\| type_qualifier_list TYPEDEF type_specifier declarator // remaining OBSOLESCENT (see 2 )
1202	{
1203	typedefTable.addToEnclosingScope( TypedefTable::TD );
1204	$$ = $4->addType( $3 )->addQualifiers( $1 )->addTypedef();
1205	}
1206	\| type_specifier TYPEDEF declarator
1207	{
1208	typedefTable.addToEnclosingScope( TypedefTable::TD );
1209	$$ = $3->addType( $1 )->addTypedef();
1210	}
1211	\| type_specifier TYPEDEF type_qualifier_list declarator
1212	{
1213	typedefTable.addToEnclosingScope( TypedefTable::TD );
1214	$$ = $4->addQualifiers( $1 )->addTypedef()->addType( $1 );
1215	}
1216	;
1217
1218	typedef_expression:
1219	// GCC, naming expression type: typedef name = exp; gives a name to the type of an expression
1220	TYPEDEF no_attr_identifier '=' assignment_expression
1221	{
1222	typedefTable.addToEnclosingScope( *$2, TypedefTable::TD );
1223	$$ = DeclarationNode::newName( 0 ); // XXX
1224	}
1225	\| typedef_expression pop ',' push no_attr_identifier '=' assignment_expression
1226	{
1227	typedefTable.addToEnclosingScope( *$5, TypedefTable::TD );
1228	$$ = DeclarationNode::newName( 0 ); // XXX
1229	}
1230	;
1231
1232	old_declaration:
1233	declaring_list pop ';'
1234	\| typedef_declaration pop ';'
1235	\| typedef_expression pop ';' // GCC, naming expression type
1236	\| sue_declaration_specifier pop ';'
1237	;
1238
1239	declaring_list:
1240	// A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1241	// storage-class
1242	declaration_specifier declarator asm_name_opt initializer_opt
1243	{
1244	typedefTable.addToEnclosingScope( TypedefTable::ID );
1245	$$ = ( $2->addType( $1 ))->addInitializer( $4 );
1246	}
1247	\| declaring_list ',' attribute_list_opt declarator asm_name_opt initializer_opt
1248	{
1249	typedefTable.addToEnclosingScope( TypedefTable::ID );
1250	$$ = $1->appendList( $1->cloneBaseType( $4->addInitializer( $6 ) ) );
1251	}
1252	;
1253
1254	declaration_specifier: // type specifier + storage class
1255	basic_declaration_specifier
1256	\| sue_declaration_specifier
1257	\| typedef_declaration_specifier
1258	\| typegen_declaration_specifier
1259	;
1260
1261	type_specifier: // declaration specifier - storage class
1262	basic_type_specifier
1263	\| sue_type_specifier
1264	\| typedef_type_specifier
1265	\| typegen_type_specifier
1266	;
1267
1268	type_qualifier_list_opt: // GCC, used in asm_statement
1269	// empty
1270	{ $$ = 0; }
1271	\| type_qualifier_list
1272	;
1273
1274	type_qualifier_list:
1275	// A semantic check is necessary to ensure a type qualifier is appropriate for the kind of declaration.
1276	//
1277	// ISO/IEC 9899:1999 Section 6.7.3(4 ) : If the same qualifier appears more than once in the same
1278	// specifier-qualifier-list, either directly or via one or more typedefs, the behavior is the same as if it
1279	// appeared only once.
1280	type_qualifier
1281	\| type_qualifier_list type_qualifier
1282	{ $$ = $1->addQualifiers( $2 ); }
1283	;
1284
1285	type_qualifier:
1286	type_qualifier_name
1287	\| attribute
1288	//{ $$ = DeclarationNode::newQualifier( DeclarationNode::Attribute ); }
1289	;
1290
1291	type_qualifier_name:
1292	CONST
1293	{ $$ = DeclarationNode::newQualifier( DeclarationNode::Const ); }
1294	\| RESTRICT
1295	{ $$ = DeclarationNode::newQualifier( DeclarationNode::Restrict ); }
1296	\| VOLATILE
1297	{ $$ = DeclarationNode::newQualifier( DeclarationNode::Volatile ); }
1298	\| LVALUE // CFA
1299	{ $$ = DeclarationNode::newQualifier( DeclarationNode::Lvalue ); }
1300	\| ATOMIC
1301	{ $$ = DeclarationNode::newQualifier( DeclarationNode::Atomic ); }
1302	\| FORALL '('
1303	{
1304	typedefTable.enterScope();
1305	}
1306	type_parameter_list ')' // CFA
1307	{
1308	typedefTable.leaveScope();
1309	$$ = DeclarationNode::newForall( $4 );
1310	}
1311	;
1312
1313	declaration_qualifier_list:
1314	storage_class_list
1315	\| type_qualifier_list storage_class_list // remaining OBSOLESCENT (see 2 )
1316	{ $$ = $1->addQualifiers( $2 ); }
1317	\| declaration_qualifier_list type_qualifier_list storage_class_list
1318	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1319	;
1320
1321	storage_class_list:
1322	// A semantic check is necessary to ensure a storage class is appropriate for the kind of declaration and that
1323	// only one of each is specified, except for inline, which can appear with the others.
1324	//
1325	// ISO/IEC 9899:1999 Section 6.7.1(2) : At most, one storage-class specifier may be given in the declaration
1326	// specifiers in a declaration.
1327	storage_class
1328	\| storage_class_list storage_class
1329	{ $$ = $1->addQualifiers( $2 ); }
1330	;
1331
1332	storage_class:
1333	storage_class_name
1334	;
1335
1336	storage_class_name:
1337	EXTERN
1338	{ $$ = DeclarationNode::newStorageClass( DeclarationNode::Extern ); }
1339	\| STATIC
1340	{ $$ = DeclarationNode::newStorageClass( DeclarationNode::Static ); }
1341	\| AUTO
1342	{ $$ = DeclarationNode::newStorageClass( DeclarationNode::Auto ); }
1343	\| REGISTER
1344	{ $$ = DeclarationNode::newStorageClass( DeclarationNode::Register ); }
1345	\| INLINE // C99
1346	{ $$ = DeclarationNode::newStorageClass( DeclarationNode::Inline ); }
1347	\| FORTRAN // C99
1348	{ $$ = DeclarationNode::newStorageClass( DeclarationNode::Fortran ); }
1349	\| NORETURN // C11
1350	{ $$ = DeclarationNode::newStorageClass( DeclarationNode::Noreturn ); }
1351	\| THREADLOCAL // C11
1352	{ $$ = DeclarationNode::newStorageClass( DeclarationNode::Threadlocal ); }
1353	;
1354
1355	basic_type_name:
1356	CHAR
1357	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Char ); }
1358	\| DOUBLE
1359	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Double ); }
1360	\| FLOAT
1361	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Float ); }
1362	\| INT
1363	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Int ); }
1364	\| LONG
1365	{ $$ = DeclarationNode::newModifier( DeclarationNode::Long ); }
1366	\| SHORT
1367	{ $$ = DeclarationNode::newModifier( DeclarationNode::Short ); }
1368	\| SIGNED
1369	{ $$ = DeclarationNode::newModifier( DeclarationNode::Signed ); }
1370	\| UNSIGNED
1371	{ $$ = DeclarationNode::newModifier( DeclarationNode::Unsigned ); }
1372	\| VOID
1373	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Void ); }
1374	\| BOOL // C99
1375	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Bool ); }
1376	\| COMPLEX // C99
1377	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Complex ); }
1378	\| IMAGINARY // C99
1379	{ $$ = DeclarationNode::newBasicType( DeclarationNode::Imaginary ); }
1380	\| VALIST // GCC, __builtin_va_list
1381	{ $$ = DeclarationNode::newBuiltinType( DeclarationNode::Valist ); }
1382	;
1383
1384	basic_declaration_specifier:
1385	// A semantic check is necessary for conflicting storage classes.
1386	basic_type_specifier
1387	\| declaration_qualifier_list basic_type_specifier
1388	{ $$ = $2->addQualifiers( $1 ); }
1389	\| basic_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
1390	{ $$ = $1->addQualifiers( $2 ); }
1391	\| basic_declaration_specifier storage_class type_qualifier_list
1392	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1393	\| basic_declaration_specifier storage_class basic_type_specifier
1394	{ $$ = $3->addQualifiers( $2 )->addType( $1 ); }
1395	;
1396
1397	basic_type_specifier:
1398	direct_type_name
1399	\| type_qualifier_list_opt indirect_type_name type_qualifier_list_opt
1400	{ $$ = $2->addQualifiers( $1 )->addQualifiers( $3 ); }
1401	;
1402
1403	direct_type_name:
1404	// A semantic check is necessary for conflicting type qualifiers.
1405	basic_type_name
1406	\| type_qualifier_list basic_type_name
1407	{ $$ = $2->addQualifiers( $1 ); }
1408	\| direct_type_name type_qualifier
1409	{ $$ = $1->addQualifiers( $2 ); }
1410	\| direct_type_name basic_type_name
1411	{ $$ = $1->addType( $2 ); }
1412	;
1413
1414	indirect_type_name:
1415	TYPEOF '(' type_name ')' // GCC: typeof(x) y;
1416	{ $$ = $3; }
1417	\| TYPEOF '(' comma_expression ')' // GCC: typeof(a+b) y;
1418	{ $$ = DeclarationNode::newTypeof( $3 ); }
1419	\| ATTR_TYPEGENname '(' type_name ')' // CFA: e.g., @type(x) y;
1420	{ $$ = DeclarationNode::newAttr( $1, $3 ); }
1421	\| ATTR_TYPEGENname '(' comma_expression ')' // CFA: e.g., @type(a+b) y;
1422	{ $$ = DeclarationNode::newAttr( $1, $3 ); }
1423	;
1424
1425	sue_declaration_specifier:
1426	sue_type_specifier
1427	\| declaration_qualifier_list sue_type_specifier
1428	{ $$ = $2->addQualifiers( $1 ); }
1429	\| sue_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
1430	{ $$ = $1->addQualifiers( $2 ); }
1431	\| sue_declaration_specifier storage_class type_qualifier_list
1432	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1433	;
1434
1435	sue_type_specifier:
1436	elaborated_type_name // struct, union, enum
1437	\| type_qualifier_list elaborated_type_name
1438	{ $$ = $2->addQualifiers( $1 ); }
1439	\| sue_type_specifier type_qualifier
1440	{ $$ = $1->addQualifiers( $2 ); }
1441	;
1442
1443	typedef_declaration_specifier:
1444	typedef_type_specifier
1445	\| declaration_qualifier_list typedef_type_specifier
1446	{ $$ = $2->addQualifiers( $1 ); }
1447	\| typedef_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
1448	{ $$ = $1->addQualifiers( $2 ); }
1449	\| typedef_declaration_specifier storage_class type_qualifier_list
1450	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1451	;
1452
1453	typedef_type_specifier: // typedef types
1454	TYPEDEFname
1455	{ $$ = DeclarationNode::newFromTypedef( $1 ); }
1456	\| type_qualifier_list TYPEDEFname
1457	{ $$ = DeclarationNode::newFromTypedef( $2 )->addQualifiers( $1 ); }
1458	\| typedef_type_specifier type_qualifier
1459	{ $$ = $1->addQualifiers( $2 ); }
1460	;
1461
1462	elaborated_type_name:
1463	aggregate_name
1464	\| enum_name
1465	;
1466
1467	aggregate_name:
1468	aggregate_key '{' field_declaration_list '}'
1469	{ $$ = DeclarationNode::newAggregate( $1, 0, 0, $3, true ); }
1470	\| aggregate_key no_attr_identifier_or_type_name
1471	{
1472	typedefTable.makeTypedef( *$2 );
1473	$$ = DeclarationNode::newAggregate( $1, $2, 0, 0, false );
1474	}
1475	\| aggregate_key no_attr_identifier_or_type_name
1476	{ typedefTable.makeTypedef( *$2 ); }
1477	'{' field_declaration_list '}'
1478	{ $$ = DeclarationNode::newAggregate( $1, $2, 0, $5, true ); }
1479	\| aggregate_key '(' type_name_list ')' '{' field_declaration_list '}' // CFA
1480	{ $$ = DeclarationNode::newAggregate( $1, 0, $3, $6, false ); }
1481	\| aggregate_key typegen_name // CFA, S/R conflict
1482	{ $$ = $2; }
1483	;
1484
1485	aggregate_key:
1486	STRUCT attribute_list_opt
1487	{ $$ = DeclarationNode::Struct; }
1488	\| UNION attribute_list_opt
1489	{ $$ = DeclarationNode::Union; }
1490	;
1491
1492	field_declaration_list:
1493	// empty
1494	{ $$ = 0; }
1495	\| field_declaration_list field_declaration
1496	{ $$ = $1 != 0 ? $1->appendList( $2 ) : $2; }
1497	;
1498
1499	field_declaration:
1500	new_field_declaring_list ';' // CFA, new style field declaration
1501	\| EXTENSION new_field_declaring_list ';' // GCC
1502	{ $$ = $2->set_extension( true ); }
1503	\| field_declaring_list ';'
1504	\| EXTENSION field_declaring_list ';' // GCC
1505	{ // mark all fields in list
1506	for ( DeclarationNode iter = $2; iter != NULL; iter = (DeclarationNode )iter->get_link() )
1507	iter->set_extension( true );
1508	$$ = $2;
1509	}
1510	;
1511
1512	new_field_declaring_list: // CFA, new style field declaration
1513	new_abstract_declarator_tuple // CFA, no field name
1514	\| new_abstract_declarator_tuple no_attr_identifier_or_type_name
1515	{ $$ = $1->addName( $2 ); }
1516	\| new_field_declaring_list ',' no_attr_identifier_or_type_name
1517	{ $$ = $1->appendList( $1->cloneType( $3 ) ); }
1518	\| new_field_declaring_list ',' // CFA, no field name
1519	{ $$ = $1->appendList( $1->cloneType( 0 ) ); }
1520	;
1521
1522	field_declaring_list:
1523	type_specifier field_declarator
1524	{ $$ = $2->addType( $1 ); }
1525	\| field_declaring_list ',' attribute_list_opt field_declarator
1526	{ $$ = $1->appendList( $1->cloneBaseType( $4 ) ); }
1527	;
1528
1529	field_declarator:
1530	// empty
1531	{ $$ = DeclarationNode::newName( 0 ); /* XXX */ } // CFA, no field name
1532	\| bit_subrange_size // no field name
1533	{ $$ = DeclarationNode::newBitfield( $1 ); }
1534	\| variable_declarator bit_subrange_size_opt
1535	// A semantic check is required to ensure bit_subrange only appears on base type int.
1536	{ $$ = $1->addBitfield( $2 ); }
1537	\| variable_type_redeclarator bit_subrange_size_opt
1538	// A semantic check is required to ensure bit_subrange only appears on base type int.
1539	{ $$ = $1->addBitfield( $2 ); }
1540	\| variable_abstract_declarator // CFA, no field name
1541	;
1542
1543	bit_subrange_size_opt:
1544	// empty
1545	{ $$ = 0; }
1546	\| bit_subrange_size
1547	{ $$ = $1; }
1548	;
1549
1550	bit_subrange_size:
1551	':' constant_expression
1552	{ $$ = $2; }
1553	;
1554
1555	enum_key:
1556	ENUM attribute_list_opt
1557	;
1558
1559	enum_name:
1560	enum_key '{' enumerator_list comma_opt '}'
1561	{ $$ = DeclarationNode::newEnum( 0, $3 ); }
1562	\| enum_key no_attr_identifier_or_type_name
1563	{
1564	typedefTable.makeTypedef( *$2 );
1565	$$ = DeclarationNode::newEnum( $2, 0 );
1566	}
1567	\| enum_key no_attr_identifier_or_type_name
1568	{ typedefTable.makeTypedef( *$2 ); }
1569	'{' enumerator_list comma_opt '}'
1570	{ $$ = DeclarationNode::newEnum( $2, $5 ); }
1571	;
1572
1573	enumerator_list:
1574	no_attr_identifier_or_type_name enumerator_value_opt
1575	{ $$ = DeclarationNode::newEnumConstant( $1, $2 ); }
1576	\| enumerator_list ',' no_attr_identifier_or_type_name enumerator_value_opt
1577	{ $$ = $1->appendList( DeclarationNode::newEnumConstant( $3, $4 ) ); }
1578	;
1579
1580	enumerator_value_opt:
1581	// empty
1582	{ $$ = 0; }
1583	\| '=' constant_expression
1584	{ $$ = $2; }
1585	;
1586
1587	// Minimum of one parameter after which ellipsis is allowed only at the end.
1588
1589	new_parameter_type_list_opt: // CFA
1590	// empty
1591	{ $$ = 0; }
1592	\| new_parameter_type_list
1593	;
1594
1595	new_parameter_type_list: // CFA, abstract + real
1596	new_abstract_parameter_list
1597	\| new_parameter_list
1598	\| new_parameter_list pop ',' push new_abstract_parameter_list
1599	{ $$ = $1->appendList( $5 ); }
1600	\| new_abstract_parameter_list pop ',' push ELLIPSIS
1601	{ $$ = $1->addVarArgs(); }
1602	\| new_parameter_list pop ',' push ELLIPSIS
1603	{ $$ = $1->addVarArgs(); }
1604	;
1605
1606	new_parameter_list: // CFA
1607	// To obtain LR(1) between new_parameter_list and new_abstract_tuple, the last new_abstract_parameter_list is
1608	// factored out from new_parameter_list, flattening the rules to get lookahead to the ']'.
1609	new_parameter_declaration
1610	\| new_abstract_parameter_list pop ',' push new_parameter_declaration
1611	{ $$ = $1->appendList( $5 ); }
1612	\| new_parameter_list pop ',' push new_parameter_declaration
1613	{ $$ = $1->appendList( $5 ); }
1614	\| new_parameter_list pop ',' push new_abstract_parameter_list pop ',' push new_parameter_declaration
1615	{ $$ = $1->appendList( $5 )->appendList( $9 ); }
1616	;
1617
1618	new_abstract_parameter_list: // CFA, new & old style abstract
1619	new_abstract_parameter_declaration
1620	\| new_abstract_parameter_list pop ',' push new_abstract_parameter_declaration
1621	{ $$ = $1->appendList( $5 ); }
1622	;
1623
1624	parameter_type_list_opt:
1625	// empty
1626	{ $$ = 0; }
1627	\| parameter_type_list
1628	;
1629
1630	parameter_type_list:
1631	parameter_list
1632	\| parameter_list pop ',' push ELLIPSIS
1633	{ $$ = $1->addVarArgs(); }
1634	;
1635
1636	parameter_list: // abstract + real
1637	abstract_parameter_declaration
1638	\| parameter_declaration
1639	\| parameter_list pop ',' push abstract_parameter_declaration
1640	{ $$ = $1->appendList( $5 ); }
1641	\| parameter_list pop ',' push parameter_declaration
1642	{ $$ = $1->appendList( $5 ); }
1643	;
1644
1645	// Provides optional identifier names (abstract_declarator/variable_declarator), no initialization, different semantics
1646	// for typedef name by using type_parameter_redeclarator instead of typedef_redeclarator, and function prototypes.
1647
1648	new_parameter_declaration: // CFA, new & old style parameter declaration
1649	parameter_declaration
1650	\| new_identifier_parameter_declarator_no_tuple identifier_or_type_name assignment_opt
1651	{ $$ = $1->addName( $2 ); }
1652	\| new_abstract_tuple identifier_or_type_name assignment_opt
1653	// To obtain LR(1), these rules must be duplicated here (see new_abstract_declarator).
1654	{ $$ = $1->addName( $2 ); }
1655	\| type_qualifier_list new_abstract_tuple identifier_or_type_name assignment_opt
1656	{ $$ = $2->addName( $3 )->addQualifiers( $1 ); }
1657	\| new_function_specifier
1658	;
1659
1660	new_abstract_parameter_declaration: // CFA, new & old style parameter declaration
1661	abstract_parameter_declaration
1662	\| new_identifier_parameter_declarator_no_tuple
1663	\| new_abstract_tuple
1664	// To obtain LR(1), these rules must be duplicated here (see new_abstract_declarator).
1665	\| type_qualifier_list new_abstract_tuple
1666	{ $$ = $2->addQualifiers( $1 ); }
1667	\| new_abstract_function
1668	;
1669
1670	parameter_declaration:
1671	declaration_specifier identifier_parameter_declarator assignment_opt
1672	{
1673	typedefTable.addToEnclosingScope( TypedefTable::ID );
1674	$$ = $2->addType( $1 )->addInitializer( new InitializerNode( $3 ) );
1675	}
1676	\| declaration_specifier type_parameter_redeclarator assignment_opt
1677	{
1678	typedefTable.addToEnclosingScope( TypedefTable::ID );
1679	$$ = $2->addType( $1 )->addInitializer( new InitializerNode( $3 ) );
1680	}
1681	;
1682
1683	abstract_parameter_declaration:
1684	declaration_specifier
1685	\| declaration_specifier abstract_parameter_declarator
1686	{ $$ = $2->addType( $1 ); }
1687	;
1688
1689	// ISO/IEC 9899:1999 Section 6.9.1(6) : "An identifier declared as a typedef name shall not be redeclared as a
1690	// parameter." Because the scope of the K&R-style parameter-list sees the typedef first, the following is based only on
1691	// identifiers. The ANSI-style parameter-list can redefine a typedef name.
1692
1693	identifier_list: // K&R-style parameter list => no types
1694	no_attr_identifier
1695	{ $$ = DeclarationNode::newName( $1 ); }
1696	\| identifier_list ',' no_attr_identifier
1697	{ $$ = $1->appendList( DeclarationNode::newName( $3 ) ); }
1698	;
1699
1700	identifier_or_type_name:
1701	identifier
1702	\| TYPEDEFname
1703	\| TYPEGENname
1704	;
1705
1706	no_01_identifier_or_type_name:
1707	no_01_identifier
1708	\| TYPEDEFname
1709	\| TYPEGENname
1710	;
1711
1712	no_attr_identifier_or_type_name:
1713	no_attr_identifier
1714	\| TYPEDEFname
1715	\| TYPEGENname
1716	;
1717
1718	type_name_no_function: // sizeof, alignof, cast (constructor)
1719	new_abstract_declarator_tuple // CFA
1720	\| type_specifier
1721	\| type_specifier variable_abstract_declarator
1722	{ $$ = $2->addType( $1 ); }
1723	;
1724
1725	type_name: // typeof, assertion
1726	new_abstract_declarator_tuple // CFA
1727	\| new_abstract_function // CFA
1728	\| type_specifier
1729	\| type_specifier abstract_declarator
1730	{ $$ = $2->addType( $1 ); }
1731	;
1732
1733	initializer_opt:
1734	// empty
1735	{ $$ = 0; }
1736	\| '=' initializer
1737	{ $$ = $2; }
1738	\| ATassign initializer
1739	{ $$ = $2->set_maybeConstructed( false ); }
1740	;
1741
1742	initializer:
1743	assignment_expression { $$ = new InitializerNode( $1 ); }
1744	\| '{' initializer_list comma_opt '}' { $$ = new InitializerNode( $2, true ); }
1745	;
1746
1747	initializer_list:
1748	// empty
1749	{ $$ = 0; }
1750	\| initializer
1751	\| designation initializer { $$ = $2->set_designators( $1 ); }
1752	\| initializer_list ',' initializer { $$ = (InitializerNode *)( $1->set_link( $3 ) ); }
1753	\| initializer_list ',' designation initializer
1754	{ $$ = (InitializerNode *)( $1->set_link( $4->set_designators( $3 ) ) ); }
1755	;
1756
1757	// There is an unreconcileable parsing problem between C99 and CFA with respect to designators. The problem is use of
1758	// '=' to separator the designator from the initializer value, as in:
1759	//
1760	// int x[10] = { [1] = 3 };
1761	//
1762	// The string "[1] = 3" can be parsed as a designator assignment or a tuple assignment. To disambiguate this case, CFA
1763	// changes the syntax from "=" to ":" as the separator between the designator and initializer. GCC does uses ":" for
1764	// field selection. The optional use of the "=" in GCC, or in this case ":", cannot be supported either due to
1765	// shift/reduce conflicts
1766
1767	designation:
1768	designator_list ':' // C99, CFA uses ":" instead of "="
1769	\| no_attr_identifier_or_type_name ':' // GCC, field name
1770	{ $$ = new ExpressionNode( build_varref( $1 ) ); }
1771	;
1772
1773	designator_list: // C99
1774	designator
1775	\| designator_list designator
1776	{ $$ = (ExpressionNode *)( $1->set_link( $2 ) ); }
1777	//\| designator_list designator { $$ = new ExpressionNode( $1, $2 ); }
1778	;
1779
1780	designator:
1781	'.' no_attr_identifier_or_type_name // C99, field name
1782	{ $$ = new ExpressionNode( build_varref( $2 ) ); }
1783	\| '[' push assignment_expression pop ']' // C99, single array element
1784	// assignment_expression used instead of constant_expression because of shift/reduce conflicts with tuple.
1785	{ $$ = $3; }
1786	\| '[' push subrange pop ']' // CFA, multiple array elements
1787	{ $$ = $3; }
1788	\| '[' push constant_expression ELLIPSIS constant_expression pop ']' // GCC, multiple array elements
1789	{ $$ = new ExpressionNode( build_range( $3, $5 ) ); }
1790	\| '.' '[' push field_list pop ']' // CFA, tuple field selector
1791	{ $$ = $4; }
1792	;
1793
1794	// The CFA type system is based on parametric polymorphism, the ability to declare functions with type parameters,
1795	// rather than an object-oriented type system. This required four groups of extensions:
1796	//
1797	// Overloading: function, data, and operator identifiers may be overloaded.
1798	//
1799	// Type declarations: "type" is used to generate new types for declaring objects. Similarly, "dtype" is used for object
1800	// and incomplete types, and "ftype" is used for function types. Type declarations with initializers provide
1801	// definitions of new types. Type declarations with storage class "extern" provide opaque types.
1802	//
1803	// Polymorphic functions: A forall clause declares a type parameter. The corresponding argument is inferred at the call
1804	// site. A polymorphic function is not a template; it is a function, with an address and a type.
1805	//
1806	// Specifications and Assertions: Specifications are collections of declarations parameterized by one or more
1807	// types. They serve many of the purposes of abstract classes, and specification hierarchies resemble subclass
1808	// hierarchies. Unlike classes, they can define relationships between types. Assertions declare that a type or
1809	// types provide the operations declared by a specification. Assertions are normally used to declare requirements
1810	// on type arguments of polymorphic functions.
1811
1812	typegen_declaration_specifier: // CFA
1813	typegen_type_specifier
1814	\| declaration_qualifier_list typegen_type_specifier
1815	{ $$ = $2->addQualifiers( $1 ); }
1816	\| typegen_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
1817	{ $$ = $1->addQualifiers( $2 ); }
1818	\| typegen_declaration_specifier storage_class type_qualifier_list
1819	{ $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1820	;
1821
1822	typegen_type_specifier: // CFA
1823	typegen_name
1824	\| type_qualifier_list typegen_name
1825	{ $$ = $2->addQualifiers( $1 ); }
1826	\| typegen_type_specifier type_qualifier
1827	{ $$ = $1->addQualifiers( $2 ); }
1828	;
1829
1830	typegen_name: // CFA
1831	TYPEGENname '(' type_name_list ')'
1832	{ $$ = DeclarationNode::newFromTypeGen( $1, $3 ); }
1833	;
1834
1835	type_parameter_list: // CFA
1836	type_parameter assignment_opt
1837	\| type_parameter_list ',' type_parameter assignment_opt
1838	{ $$ = $1->appendList( $3 ); }
1839	;
1840
1841	type_parameter: // CFA
1842	type_class no_attr_identifier_or_type_name
1843	{ typedefTable.addToEnclosingScope( *$2, TypedefTable::TD ); }
1844	assertion_list_opt
1845	{ $$ = DeclarationNode::newTypeParam( $1, $2 )->addAssertions( $4 ); }
1846	\| type_specifier identifier_parameter_declarator
1847	;
1848
1849	type_class: // CFA
1850	OTYPE
1851	{ $$ = DeclarationNode::Type; }
1852	\| DTYPE
1853	{ $$ = DeclarationNode::Ftype; }
1854	\| FTYPE
1855	{ $$ = DeclarationNode::Dtype; }
1856	;
1857
1858	assertion_list_opt: // CFA
1859	// empty
1860	{ $$ = 0; }
1861	\| assertion_list_opt assertion
1862	{ $$ = $1 != 0 ? $1->appendList( $2 ) : $2; }
1863	;
1864
1865	assertion: // CFA
1866	'\|' no_attr_identifier_or_type_name '(' type_name_list ')'
1867	{
1868	typedefTable.openTrait( *$2 );
1869	$$ = DeclarationNode::newTraitUse( $2, $4 );
1870	}
1871	\| '\|' '{' push trait_declaration_list '}'
1872	{ $$ = $4; }
1873	\| '\|' '(' push type_parameter_list pop ')' '{' push trait_declaration_list '}' '(' type_name_list ')'
1874	{ $$ = 0; }
1875	;
1876
1877	type_name_list: // CFA
1878	type_name
1879	{ $$ = new ExpressionNode( build_typevalue( $1 ) ); }
1880	\| assignment_expression
1881	\| type_name_list ',' type_name
1882	{ $$ = (ExpressionNode *)( $1->set_link( new ExpressionNode( build_typevalue( $3 ) ) ) ); }
1883	\| type_name_list ',' assignment_expression
1884	{ $$ = (ExpressionNode *)( $1->set_link( $3 )); }
1885	;
1886
1887	type_declaring_list: // CFA
1888	OTYPE type_declarator
1889	{ $$ = $2; }
1890	\| storage_class_list OTYPE type_declarator
1891	{ $$ = $3->addQualifiers( $1 ); }
1892	\| type_declaring_list ',' type_declarator
1893	{ $$ = $1->appendList( $3->copyStorageClasses( $1 ) ); }
1894	;
1895
1896	type_declarator: // CFA
1897	type_declarator_name assertion_list_opt
1898	{ $$ = $1->addAssertions( $2 ); }
1899	\| type_declarator_name assertion_list_opt '=' type_name
1900	{ $$ = $1->addAssertions( $2 )->addType( $4 ); }
1901	;
1902
1903	type_declarator_name: // CFA
1904	no_attr_identifier_or_type_name
1905	{
1906	typedefTable.addToEnclosingScope( *$1, TypedefTable::TD );
1907	$$ = DeclarationNode::newTypeDecl( $1, 0 );
1908	}
1909	\| no_01_identifier_or_type_name '(' push type_parameter_list pop ')'
1910	{
1911	typedefTable.addToEnclosingScope( *$1, TypedefTable::TG );
1912	$$ = DeclarationNode::newTypeDecl( $1, $4 );
1913	}
1914	;
1915
1916	trait_specifier: // CFA
1917	TRAIT no_attr_identifier_or_type_name '(' push type_parameter_list pop ')' '{' '}'
1918	{
1919	typedefTable.addToEnclosingScope( *$2, TypedefTable::ID );
1920	$$ = DeclarationNode::newTrait( $2, $5, 0 );
1921	}
1922	\| TRAIT no_attr_identifier_or_type_name '(' push type_parameter_list pop ')' '{'
1923	{
1924	typedefTable.enterTrait( *$2 );
1925	typedefTable.enterScope();
1926	}
1927	trait_declaration_list '}'
1928	{
1929	typedefTable.leaveTrait();
1930	typedefTable.addToEnclosingScope( *$2, TypedefTable::ID );
1931	$$ = DeclarationNode::newTrait( $2, $5, $10 );
1932	}
1933	;
1934
1935	trait_declaration_list: // CFA
1936	trait_declaration
1937	\| trait_declaration_list push trait_declaration
1938	{ $$ = $1->appendList( $3 ); }
1939	;
1940
1941	trait_declaration: // CFA
1942	new_trait_declaring_list pop ';'
1943	\| trait_declaring_list pop ';'
1944	;
1945
1946	new_trait_declaring_list: // CFA
1947	new_variable_specifier
1948	{
1949	typedefTable.addToEnclosingScope2( TypedefTable::ID );
1950	$$ = $1;
1951	}
1952	\| new_function_specifier
1953	{
1954	typedefTable.addToEnclosingScope2( TypedefTable::ID );
1955	$$ = $1;
1956	}
1957	\| new_trait_declaring_list pop ',' push identifier_or_type_name
1958	{
1959	typedefTable.addToEnclosingScope2( *$5, TypedefTable::ID );
1960	$$ = $1->appendList( $1->cloneType( $5 ) );
1961	}
1962	;
1963
1964	trait_declaring_list: // CFA
1965	type_specifier declarator
1966	{
1967	typedefTable.addToEnclosingScope2( TypedefTable::ID );
1968	$$ = $2->addType( $1 );
1969	}
1970	\| trait_declaring_list pop ',' push declarator
1971	{
1972	typedefTable.addToEnclosingScope2( TypedefTable::ID );
1973	$$ = $1->appendList( $1->cloneBaseType( $5 ) );
1974	}
1975	;
1976
1977	//*************************** EXTERNAL DEFINITIONS ***************************
1978
1979	translation_unit:
1980	// empty
1981	{} // empty input file
1982	\| external_definition_list
1983	{
1984	if ( theTree ) {
1985	theTree->appendList( $1 );
1986	} else {
1987	theTree = $1;
1988	}
1989	}
1990	;
1991
1992	external_definition_list:
1993	external_definition
1994	\| external_definition_list push external_definition
1995	{ $$ = ( $1 != NULL ) ? $1->appendList( $3 ) : $3; }
1996	;
1997
1998	external_definition_list_opt:
1999	// empty
2000	{ $$ = 0; }
2001	\| external_definition_list
2002	;
2003
2004	external_definition:
2005	declaration
2006	\| external_function_definition
2007	\| asm_statement // GCC, global assembler statement
2008	{}
2009	\| EXTERN STRINGliteral
2010	{
2011	linkageStack.push( linkage );
2012	linkage = LinkageSpec::fromString( *$2 );
2013	}
2014	'{' external_definition_list_opt '}' // C++-style linkage specifier
2015	{
2016	linkage = linkageStack.top();
2017	linkageStack.pop();
2018	$$ = $5;
2019	}
2020	\| EXTENSION external_definition
2021	{ // mark all fields in list
2022	for ( DeclarationNode iter = $2; iter != NULL; iter = (DeclarationNode )iter->get_link() )
2023	iter->set_extension( true );
2024	$$ = $2;
2025	}
2026	;
2027
2028	external_function_definition:
2029	function_definition
2030	// These rules are a concession to the "implicit int" type_specifier because there is a significant amount of
2031	// legacy code with global functions missing the type-specifier for the return type, and assuming "int".
2032	// Parsing is possible because function_definition does not appear in the context of an expression (nested
2033	// functions preclude this concession, i.e., all nested function must have a return type). A function prototype
2034	// declaration must still have a type_specifier. OBSOLESCENT (see 1)
2035	\| function_declarator compound_statement
2036	{
2037	typedefTable.addToEnclosingScope( TypedefTable::ID );
2038	typedefTable.leaveScope();
2039	$$ = $1->addFunctionBody( $2 );
2040	}
2041	\| old_function_declarator push old_declaration_list_opt compound_statement
2042	{
2043	typedefTable.addToEnclosingScope( TypedefTable::ID );
2044	typedefTable.leaveScope();
2045	$$ = $1->addOldDeclList( $3 )->addFunctionBody( $4 );
2046	}
2047	;
2048
2049	function_definition:
2050	new_function_declaration compound_statement // CFA
2051	{
2052	typedefTable.addToEnclosingScope( TypedefTable::ID );
2053	typedefTable.leaveScope();
2054	$$ = $1->addFunctionBody( $2 );
2055	}
2056	\| declaration_specifier function_declarator compound_statement
2057	{
2058	typedefTable.addToEnclosingScope( TypedefTable::ID );
2059	typedefTable.leaveScope();
2060	$$ = $2->addFunctionBody( $3 )->addType( $1 );
2061	}
2062	\| type_qualifier_list function_declarator compound_statement
2063	{
2064	typedefTable.addToEnclosingScope( TypedefTable::ID );
2065	typedefTable.leaveScope();
2066	$$ = $2->addFunctionBody( $3 )->addQualifiers( $1 );
2067	}
2068	\| declaration_qualifier_list function_declarator compound_statement
2069	{
2070	typedefTable.addToEnclosingScope( TypedefTable::ID );
2071	typedefTable.leaveScope();
2072	$$ = $2->addFunctionBody( $3 )->addQualifiers( $1 );
2073	}
2074	\| declaration_qualifier_list type_qualifier_list function_declarator compound_statement
2075	{
2076	typedefTable.addToEnclosingScope( TypedefTable::ID );
2077	typedefTable.leaveScope();
2078	$$ = $3->addFunctionBody( $4 )->addQualifiers( $2 )->addQualifiers( $1 );
2079	}
2080
2081	// Old-style K&R function definition, OBSOLESCENT (see 4)
2082	\| declaration_specifier old_function_declarator push old_declaration_list_opt compound_statement
2083	{
2084	typedefTable.addToEnclosingScope( TypedefTable::ID );
2085	typedefTable.leaveScope();
2086	$$ = $2->addOldDeclList( $4 )->addFunctionBody( $5 )->addType( $1 );
2087	}
2088	\| type_qualifier_list old_function_declarator push old_declaration_list_opt compound_statement
2089	{
2090	typedefTable.addToEnclosingScope( TypedefTable::ID );
2091	typedefTable.leaveScope();
2092	$$ = $2->addOldDeclList( $4 )->addFunctionBody( $5 )->addQualifiers( $1 );
2093	}
2094
2095	// Old-style K&R function definition with "implicit int" type_specifier, OBSOLESCENT (see 4)
2096	\| declaration_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	\| declaration_qualifier_list type_qualifier_list old_function_declarator push old_declaration_list_opt compound_statement
2103	{
2104	typedefTable.addToEnclosingScope( TypedefTable::ID );
2105	typedefTable.leaveScope();
2106	$$ = $3->addOldDeclList( $5 )->addFunctionBody( $6 )->addQualifiers( $2 )->addQualifiers( $1 );
2107	}
2108	;
2109
2110	declarator:
2111	variable_declarator
2112	\| variable_type_redeclarator
2113	\| function_declarator
2114	;
2115
2116	subrange:
2117	constant_expression '~' constant_expression // CFA, integer subrange
2118	{ $$ = new ExpressionNode( build_range( $1, $3 ) ); }
2119	;
2120
2121	asm_name_opt: // GCC
2122	// empty
2123	\| ASM '(' string_literal_list ')' attribute_list_opt
2124	;
2125
2126	attribute_list_opt: // GCC
2127	// empty
2128	{ $$ = 0; }
2129	\| attribute_list
2130	;
2131
2132	attribute_list: // GCC
2133	attribute
2134	\| attribute_list attribute
2135	{ $$ = $2->addQualifiers( $1 ); }
2136	;
2137
2138	attribute: // GCC
2139	ATTRIBUTE '(' '(' attribute_parameter_list ')' ')'
2140	// { $$ = DeclarationNode::newQualifier( DeclarationNode::Attribute ); }
2141	{ $$ = 0; }
2142	;
2143
2144	attribute_parameter_list: // GCC
2145	attrib
2146	\| attribute_parameter_list ',' attrib
2147	;
2148
2149	attrib: // GCC
2150	// empty
2151	\| any_word
2152	\| any_word '(' comma_expression_opt ')'
2153	;
2154
2155	any_word: // GCC
2156	identifier_or_type_name {}
2157	\| storage_class_name {}
2158	\| basic_type_name {}
2159	\| type_qualifier {}
2160	;
2161
2162	// ============================================================================
2163	// The following sections are a series of grammar patterns used to parse declarators. Multiple patterns are necessary
2164	// because the type of an identifier in wrapped around the identifier in the same form as its usage in an expression, as
2165	// in:
2166	//
2167	// int (*f())[10] { ... };
2168	// ... (*f())[3] += 1; // definition mimics usage
2169	//
2170	// Because these patterns are highly recursive, changes at a lower level in the recursion require copying some or all of
2171	// the pattern. Each of these patterns has some subtle variation to ensure correct syntax in a particular context.
2172	// ============================================================================
2173
2174	// ----------------------------------------------------------------------------
2175	// The set of valid declarators before a compound statement for defining a function is less than the set of declarators
2176	// to define a variable or function prototype, e.g.:
2177	//
2178	// valid declaration invalid definition
2179	// ----------------- ------------------
2180	// int f; int f {}
2181	// int f; int f {}
2182	// int f[10]; int f[10] {}
2183	// int (f)(int); int (f)(int) {}
2184	//
2185	// To preclude this syntactic anomaly requires separating the grammar rules for variable and function declarators, hence
2186	// variable_declarator and function_declarator.
2187	// ----------------------------------------------------------------------------
2188
2189	// This pattern parses a declaration of a variable that is not redefining a typedef name. The pattern precludes
2190	// declaring an array of functions versus a pointer to an array of functions.
2191
2192	variable_declarator:
2193	paren_identifier attribute_list_opt
2194	{ $$ = $1->addQualifiers( $2 ); }
2195	\| variable_ptr
2196	\| variable_array attribute_list_opt
2197	{ $$ = $1->addQualifiers( $2 ); }
2198	\| variable_function attribute_list_opt
2199	{ $$ = $1->addQualifiers( $2 ); }
2200	;
2201
2202	paren_identifier:
2203	identifier
2204	{
2205	typedefTable.setNextIdentifier( *$1 );
2206	$$ = DeclarationNode::newName( $1 );
2207	}
2208	\| '(' paren_identifier ')' // redundant parenthesis
2209	{ $$ = $2; }
2210	;
2211
2212	variable_ptr:
2213	ptrref_operator variable_declarator
2214	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0 ) ); }
2215	\| ptrref_operator type_qualifier_list variable_declarator
2216	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2 ) ); }
2217	\| '(' variable_ptr ')'
2218	{ $$ = $2; }
2219	;
2220
2221	variable_array:
2222	paren_identifier array_dimension
2223	{ $$ = $1->addArray( $2 ); }
2224	\| '(' variable_ptr ')' array_dimension
2225	{ $$ = $2->addArray( $4 ); }
2226	\| '(' variable_array ')' multi_array_dimension // redundant parenthesis
2227	{ $$ = $2->addArray( $4 ); }
2228	\| '(' variable_array ')' // redundant parenthesis
2229	{ $$ = $2; }
2230	;
2231
2232	variable_function:
2233	'(' variable_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2234	{ $$ = $2->addParamList( $6 ); }
2235	\| '(' variable_function ')' // redundant parenthesis
2236	{ $$ = $2; }
2237	;
2238
2239	// This pattern parses a function declarator that is not redefining a typedef name. For non-nested functions, there is
2240	// no context where a function definition can redefine a typedef name, i.e., the typedef and function name cannot exist
2241	// is the same scope. The pattern precludes returning arrays and functions versus pointers to arrays and functions.
2242
2243	function_declarator:
2244	function_no_ptr attribute_list_opt
2245	{ $$ = $1->addQualifiers( $2 ); }
2246	\| function_ptr
2247	\| function_array attribute_list_opt
2248	{ $$ = $1->addQualifiers( $2 ); }
2249	;
2250
2251	function_no_ptr:
2252	paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2253	{ $$ = $1->addParamList( $4 ); }
2254	\| '(' function_ptr ')' '(' push parameter_type_list_opt pop ')'
2255	{ $$ = $2->addParamList( $6 ); }
2256	\| '(' function_no_ptr ')' // redundant parenthesis
2257	{ $$ = $2; }
2258	;
2259
2260	function_ptr:
2261	ptrref_operator function_declarator
2262	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0 ) ); }
2263	\| ptrref_operator type_qualifier_list function_declarator
2264	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2 ) ); }
2265	\| '(' function_ptr ')'
2266	{ $$ = $2; }
2267	;
2268
2269	function_array:
2270	'(' function_ptr ')' array_dimension
2271	{ $$ = $2->addArray( $4 ); }
2272	\| '(' function_array ')' multi_array_dimension // redundant parenthesis
2273	{ $$ = $2->addArray( $4 ); }
2274	\| '(' function_array ')' // redundant parenthesis
2275	{ $$ = $2; }
2276	;
2277
2278	// This pattern parses an old-style K&R function declarator (OBSOLESCENT, see 4) that is not redefining a typedef name
2279	// (see function_declarator for additional comments). The pattern precludes returning arrays and functions versus
2280	// pointers to arrays and functions.
2281
2282	old_function_declarator:
2283	old_function_no_ptr
2284	\| old_function_ptr
2285	\| old_function_array
2286	;
2287
2288	old_function_no_ptr:
2289	paren_identifier '(' identifier_list ')' // function_declarator handles empty parameter
2290	{ $$ = $1->addIdList( $3 ); }
2291	\| '(' old_function_ptr ')' '(' identifier_list ')'
2292	{ $$ = $2->addIdList( $5 ); }
2293	\| '(' old_function_no_ptr ')' // redundant parenthesis
2294	{ $$ = $2; }
2295	;
2296
2297	old_function_ptr:
2298	ptrref_operator old_function_declarator
2299	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0 ) ); }
2300	\| ptrref_operator type_qualifier_list old_function_declarator
2301	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2 ) ); }
2302	\| '(' old_function_ptr ')'
2303	{ $$ = $2; }
2304	;
2305
2306	old_function_array:
2307	'(' old_function_ptr ')' array_dimension
2308	{ $$ = $2->addArray( $4 ); }
2309	\| '(' old_function_array ')' multi_array_dimension // redundant parenthesis
2310	{ $$ = $2->addArray( $4 ); }
2311	\| '(' old_function_array ')' // redundant parenthesis
2312	{ $$ = $2; }
2313	;
2314
2315	// This pattern parses a declaration for a variable or function prototype that redefines a type name, e.g.:
2316	//
2317	// typedef int foo;
2318	// {
2319	// int foo; // redefine typedef name in new scope
2320	// }
2321	//
2322	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
2323	// and functions versus pointers to arrays and functions.
2324
2325	variable_type_redeclarator:
2326	paren_type attribute_list_opt
2327	{ $$ = $1->addQualifiers( $2 ); }
2328	\| type_ptr
2329	\| type_array attribute_list_opt
2330	{ $$ = $1->addQualifiers( $2 ); }
2331	\| type_function attribute_list_opt
2332	{ $$ = $1->addQualifiers( $2 ); }
2333	;
2334
2335	paren_type:
2336	typedef
2337	\| '(' paren_type ')'
2338	{ $$ = $2; }
2339	;
2340
2341	type_ptr:
2342	ptrref_operator variable_type_redeclarator
2343	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0 ) ); }
2344	\| ptrref_operator type_qualifier_list variable_type_redeclarator
2345	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2 ) ); }
2346	\| '(' type_ptr ')'
2347	{ $$ = $2; }
2348	;
2349
2350	type_array:
2351	paren_type array_dimension
2352	{ $$ = $1->addArray( $2 ); }
2353	\| '(' type_ptr ')' array_dimension
2354	{ $$ = $2->addArray( $4 ); }
2355	\| '(' type_array ')' multi_array_dimension // redundant parenthesis
2356	{ $$ = $2->addArray( $4 ); }
2357	\| '(' type_array ')' // redundant parenthesis
2358	{ $$ = $2; }
2359	;
2360
2361	type_function:
2362	paren_type '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2363	{ $$ = $1->addParamList( $4 ); }
2364	\| '(' type_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2365	{ $$ = $2->addParamList( $6 ); }
2366	\| '(' type_function ')' // redundant parenthesis
2367	{ $$ = $2; }
2368	;
2369
2370	// This pattern parses a declaration for a parameter variable or function prototype that is not redefining a typedef
2371	// name and allows the C99 array options, which can only appear in a parameter list. The pattern precludes declaring an
2372	// array of functions versus a pointer to an array of functions, and returning arrays and functions versus pointers to
2373	// arrays and functions.
2374
2375	identifier_parameter_declarator:
2376	paren_identifier attribute_list_opt
2377	{ $$ = $1->addQualifiers( $2 ); }
2378	\| identifier_parameter_ptr
2379	\| identifier_parameter_array attribute_list_opt
2380	{ $$ = $1->addQualifiers( $2 ); }
2381	\| identifier_parameter_function attribute_list_opt
2382	{ $$ = $1->addQualifiers( $2 ); }
2383	;
2384
2385	identifier_parameter_ptr:
2386	ptrref_operator identifier_parameter_declarator
2387	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0 ) ); }
2388	\| ptrref_operator type_qualifier_list identifier_parameter_declarator
2389	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2 ) ); }
2390	\| '(' identifier_parameter_ptr ')'
2391	{ $$ = $2; }
2392	;
2393
2394	identifier_parameter_array:
2395	paren_identifier array_parameter_dimension
2396	{ $$ = $1->addArray( $2 ); }
2397	\| '(' identifier_parameter_ptr ')' array_dimension
2398	{ $$ = $2->addArray( $4 ); }
2399	\| '(' identifier_parameter_array ')' multi_array_dimension // redundant parenthesis
2400	{ $$ = $2->addArray( $4 ); }
2401	\| '(' identifier_parameter_array ')' // redundant parenthesis
2402	{ $$ = $2; }
2403	;
2404
2405	identifier_parameter_function:
2406	paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2407	{ $$ = $1->addParamList( $4 ); }
2408	\| '(' identifier_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2409	{ $$ = $2->addParamList( $6 ); }
2410	\| '(' identifier_parameter_function ')' // redundant parenthesis
2411	{ $$ = $2; }
2412	;
2413
2414	// This pattern parses a declaration for a parameter variable or function prototype that is redefining a typedef name,
2415	// e.g.:
2416	//
2417	// typedef int foo;
2418	// int f( int foo ); // redefine typedef name in new scope
2419	//
2420	// and allows the C99 array options, which can only appear in a parameter list. In addition, the pattern handles the
2421	// special meaning of parenthesis around a typedef name:
2422	//
2423	// ISO/IEC 9899:1999 Section 6.7.5.3(11) : "In a parameter declaration, a single typedef name in
2424	// parentheses is taken to be an abstract declarator that specifies a function with a single parameter,
2425	// not as redundant parentheses around the identifier."
2426	//
2427	// For example:
2428	//
2429	// typedef float T;
2430	// int f( int ( T [5] ) ); // see abstract_parameter_declarator
2431	// int g( int ( T ( int ) ) ); // see abstract_parameter_declarator
2432	// int f( int f1( T a[5] ) ); // see identifier_parameter_declarator
2433	// int g( int g1( T g2( int p ) ) ); // see identifier_parameter_declarator
2434	//
2435	// In essence, a '(' immediately to the left of typedef name, T, is interpreted as starting a parameter type list, and
2436	// not as redundant parentheses around a redeclaration of T. Finally, the pattern also precludes declaring an array of
2437	// functions versus a pointer to an array of functions, and returning arrays and functions versus pointers to arrays and
2438	// functions.
2439
2440	type_parameter_redeclarator:
2441	typedef attribute_list_opt
2442	{ $$ = $1->addQualifiers( $2 ); }
2443	\| type_parameter_ptr
2444	\| type_parameter_array attribute_list_opt
2445	{ $$ = $1->addQualifiers( $2 ); }
2446	\| type_parameter_function attribute_list_opt
2447	{ $$ = $1->addQualifiers( $2 ); }
2448	;
2449
2450	typedef:
2451	TYPEDEFname
2452	{
2453	typedefTable.setNextIdentifier( *$1 );
2454	$$ = DeclarationNode::newName( $1 );
2455	}
2456	\| TYPEGENname
2457	{
2458	typedefTable.setNextIdentifier( *$1 );
2459	$$ = DeclarationNode::newName( $1 );
2460	}
2461	;
2462
2463	type_parameter_ptr:
2464	ptrref_operator type_parameter_redeclarator
2465	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0 ) ); }
2466	\| ptrref_operator type_qualifier_list type_parameter_redeclarator
2467	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2 ) ); }
2468	\| '(' type_parameter_ptr ')'
2469	{ $$ = $2; }
2470	;
2471
2472	type_parameter_array:
2473	typedef array_parameter_dimension
2474	{ $$ = $1->addArray( $2 ); }
2475	\| '(' type_parameter_ptr ')' array_parameter_dimension
2476	{ $$ = $2->addArray( $4 ); }
2477	;
2478
2479	type_parameter_function:
2480	typedef '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2481	{ $$ = $1->addParamList( $4 ); }
2482	\| '(' type_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2483	{ $$ = $2->addParamList( $6 ); }
2484	;
2485
2486	// This pattern parses a declaration of an abstract variable or function prototype, i.e., there is no identifier to
2487	// which the type applies, e.g.:
2488	//
2489	// sizeof( int );
2490	// sizeof( int [10] );
2491	//
2492	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
2493	// and functions versus pointers to arrays and functions.
2494
2495	abstract_declarator:
2496	abstract_ptr
2497	\| abstract_array attribute_list_opt
2498	{ $$ = $1->addQualifiers( $2 ); }
2499	\| abstract_function attribute_list_opt
2500	{ $$ = $1->addQualifiers( $2 ); }
2501	;
2502
2503	abstract_ptr:
2504	ptrref_operator
2505	{ $$ = DeclarationNode::newPointer( 0 ); }
2506	\| ptrref_operator type_qualifier_list
2507	{ $$ = DeclarationNode::newPointer( $2 ); }
2508	\| ptrref_operator abstract_declarator
2509	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0 ) ); }
2510	\| ptrref_operator type_qualifier_list abstract_declarator
2511	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2 ) ); }
2512	\| '(' abstract_ptr ')'
2513	{ $$ = $2; }
2514	;
2515
2516	abstract_array:
2517	array_dimension
2518	\| '(' abstract_ptr ')' array_dimension
2519	{ $$ = $2->addArray( $4 ); }
2520	\| '(' abstract_array ')' multi_array_dimension // redundant parenthesis
2521	{ $$ = $2->addArray( $4 ); }
2522	\| '(' abstract_array ')' // redundant parenthesis
2523	{ $$ = $2; }
2524	;
2525
2526	abstract_function:
2527	'(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2528	{ $$ = DeclarationNode::newFunction( 0, 0, $3, 0 ); }
2529	\| '(' abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2530	{ $$ = $2->addParamList( $6 ); }
2531	\| '(' abstract_function ')' // redundant parenthesis
2532	{ $$ = $2; }
2533	;
2534
2535	array_dimension:
2536	// Only the first dimension can be empty.
2537	'[' ']'
2538	{ $$ = DeclarationNode::newArray( 0, 0, false ); }
2539	\| '[' ']' multi_array_dimension
2540	{ $$ = DeclarationNode::newArray( 0, 0, false )->addArray( $3 ); }
2541	\| multi_array_dimension
2542	;
2543
2544	multi_array_dimension:
2545	'[' push assignment_expression pop ']'
2546	{ $$ = DeclarationNode::newArray( $3, 0, false ); }
2547	\| '[' push '*' pop ']' // C99
2548	{ $$ = DeclarationNode::newVarArray( 0 ); }
2549	\| multi_array_dimension '[' push assignment_expression pop ']'
2550	{ $$ = $1->addArray( DeclarationNode::newArray( $4, 0, false ) ); }
2551	\| multi_array_dimension '[' push '*' pop ']' // C99
2552	{ $$ = $1->addArray( DeclarationNode::newVarArray( 0 ) ); }
2553	;
2554
2555	// This pattern parses a declaration of a parameter abstract variable or function prototype, i.e., there is no
2556	// identifier to which the type applies, e.g.:
2557	//
2558	// int f( int ); // abstract variable parameter; no parameter name specified
2559	// int f( int (int) ); // abstract function-prototype parameter; no parameter name specified
2560	//
2561	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
2562	// and functions versus pointers to arrays and functions.
2563
2564	abstract_parameter_declarator:
2565	abstract_parameter_ptr
2566	\| abstract_parameter_array attribute_list_opt
2567	{ $$ = $1->addQualifiers( $2 ); }
2568	\| abstract_parameter_function attribute_list_opt
2569	{ $$ = $1->addQualifiers( $2 ); }
2570	;
2571
2572	abstract_parameter_ptr:
2573	ptrref_operator
2574	{ $$ = DeclarationNode::newPointer( 0 ); }
2575	\| ptrref_operator type_qualifier_list
2576	{ $$ = DeclarationNode::newPointer( $2 ); }
2577	\| ptrref_operator abstract_parameter_declarator
2578	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0 ) ); }
2579	\| ptrref_operator type_qualifier_list abstract_parameter_declarator
2580	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2 ) ); }
2581	\| '(' abstract_parameter_ptr ')'
2582	{ $$ = $2; }
2583	;
2584
2585	abstract_parameter_array:
2586	array_parameter_dimension
2587	\| '(' abstract_parameter_ptr ')' array_parameter_dimension
2588	{ $$ = $2->addArray( $4 ); }
2589	\| '(' abstract_parameter_array ')' multi_array_dimension // redundant parenthesis
2590	{ $$ = $2->addArray( $4 ); }
2591	\| '(' abstract_parameter_array ')' // redundant parenthesis
2592	{ $$ = $2; }
2593	;
2594
2595	abstract_parameter_function:
2596	'(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2597	{ $$ = DeclarationNode::newFunction( 0, 0, $3, 0 ); }
2598	\| '(' abstract_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2599	{ $$ = $2->addParamList( $6 ); }
2600	\| '(' abstract_parameter_function ')' // redundant parenthesis
2601	{ $$ = $2; }
2602	;
2603
2604	array_parameter_dimension:
2605	// Only the first dimension can be empty or have qualifiers.
2606	array_parameter_1st_dimension
2607	\| array_parameter_1st_dimension multi_array_dimension
2608	{ $$ = $1->addArray( $2 ); }
2609	\| multi_array_dimension
2610	;
2611
2612	// The declaration of an array parameter has additional syntax over arrays in normal variable declarations:
2613	//
2614	// ISO/IEC 9899:1999 Section 6.7.5.2(1) : "The optional type qualifiers and the keyword static shall appear only in
2615	// a declaration of a function parameter with an array type, and then only in the outermost array type derivation."
2616
2617	array_parameter_1st_dimension:
2618	'[' ']'
2619	{ $$ = DeclarationNode::newArray( 0, 0, false ); }
2620	// multi_array_dimension handles the '[' '*' ']' case
2621	\| '[' push type_qualifier_list '*' pop ']' // remaining C99
2622	{ $$ = DeclarationNode::newVarArray( $3 ); }
2623	\| '[' push type_qualifier_list pop ']'
2624	{ $$ = DeclarationNode::newArray( 0, $3, false ); }
2625	// multi_array_dimension handles the '[' assignment_expression ']' case
2626	\| '[' push type_qualifier_list assignment_expression pop ']'
2627	{ $$ = DeclarationNode::newArray( $4, $3, false ); }
2628	\| '[' push STATIC type_qualifier_list_opt assignment_expression pop ']'
2629	{ $$ = DeclarationNode::newArray( $5, $4, true ); }
2630	\| '[' push type_qualifier_list STATIC assignment_expression pop ']'
2631	{ $$ = DeclarationNode::newArray( $5, $3, true ); }
2632	;
2633
2634	// This pattern parses a declaration of an abstract variable, i.e., there is no identifier to which the type applies,
2635	// e.g.:
2636	//
2637	// sizeof( int ); // abstract variable; no identifier name specified
2638	//
2639	// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
2640	// and functions versus pointers to arrays and functions.
2641
2642	variable_abstract_declarator:
2643	variable_abstract_ptr
2644	\| variable_abstract_array attribute_list_opt
2645	{ $$ = $1->addQualifiers( $2 ); }
2646	\| variable_abstract_function attribute_list_opt
2647	{ $$ = $1->addQualifiers( $2 ); }
2648	;
2649
2650	variable_abstract_ptr:
2651	ptrref_operator
2652	{ $$ = DeclarationNode::newPointer( 0 ); }
2653	\| ptrref_operator type_qualifier_list
2654	{ $$ = DeclarationNode::newPointer( $2 ); }
2655	\| ptrref_operator variable_abstract_declarator
2656	{ $$ = $2->addPointer( DeclarationNode::newPointer( 0 ) ); }
2657	\| ptrref_operator type_qualifier_list variable_abstract_declarator
2658	{ $$ = $3->addPointer( DeclarationNode::newPointer( $2 ) ); }
2659	\| '(' variable_abstract_ptr ')'
2660	{ $$ = $2; }
2661	;
2662
2663	variable_abstract_array:
2664	array_dimension
2665	\| '(' variable_abstract_ptr ')' array_dimension
2666	{ $$ = $2->addArray( $4 ); }
2667	\| '(' variable_abstract_array ')' multi_array_dimension // redundant parenthesis
2668	{ $$ = $2->addArray( $4 ); }
2669	\| '(' variable_abstract_array ')' // redundant parenthesis
2670	{ $$ = $2; }
2671	;
2672
2673	variable_abstract_function:
2674	'(' variable_abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2675	{ $$ = $2->addParamList( $6 ); }
2676	\| '(' variable_abstract_function ')' // redundant parenthesis
2677	{ $$ = $2; }
2678	;
2679
2680	// This pattern parses a new-style declaration for a parameter variable or function prototype that is either an
2681	// identifier or typedef name and allows the C99 array options, which can only appear in a parameter list.
2682
2683	new_identifier_parameter_declarator_tuple: // CFA
2684	new_identifier_parameter_declarator_no_tuple
2685	\| new_abstract_tuple
2686	\| type_qualifier_list new_abstract_tuple
2687	{ $$ = $2->addQualifiers( $1 ); }
2688	;
2689
2690	new_identifier_parameter_declarator_no_tuple: // CFA
2691	new_identifier_parameter_ptr
2692	\| new_identifier_parameter_array
2693	;
2694
2695	new_identifier_parameter_ptr: // CFA
2696	ptrref_operator type_specifier
2697	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0 ) ); }
2698	\| type_qualifier_list ptrref_operator type_specifier
2699	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1 ) ); }
2700	\| ptrref_operator new_abstract_function
2701	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0 ) ); }
2702	\| type_qualifier_list ptrref_operator new_abstract_function
2703	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1 ) ); }
2704	\| ptrref_operator new_identifier_parameter_declarator_tuple
2705	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0 ) ); }
2706	\| type_qualifier_list ptrref_operator new_identifier_parameter_declarator_tuple
2707	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1 ) ); }
2708	;
2709
2710	new_identifier_parameter_array: // CFA
2711	// Only the first dimension can be empty or have qualifiers. Empty dimension must be factored out due to
2712	// shift/reduce conflict with new-style empty (void) function return type.
2713	'[' ']' type_specifier
2714	{ $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
2715	\| new_array_parameter_1st_dimension type_specifier
2716	{ $$ = $2->addNewArray( $1 ); }
2717	\| '[' ']' multi_array_dimension type_specifier
2718	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
2719	\| new_array_parameter_1st_dimension multi_array_dimension type_specifier
2720	{ $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
2721	\| multi_array_dimension type_specifier
2722	{ $$ = $2->addNewArray( $1 ); }
2723	\| '[' ']' new_identifier_parameter_ptr
2724	{ $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
2725	\| new_array_parameter_1st_dimension new_identifier_parameter_ptr
2726	{ $$ = $2->addNewArray( $1 ); }
2727	\| '[' ']' multi_array_dimension new_identifier_parameter_ptr
2728	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
2729	\| new_array_parameter_1st_dimension multi_array_dimension new_identifier_parameter_ptr
2730	{ $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
2731	\| multi_array_dimension new_identifier_parameter_ptr
2732	{ $$ = $2->addNewArray( $1 ); }
2733	;
2734
2735	new_array_parameter_1st_dimension:
2736	'[' push type_qualifier_list '*' pop ']' // remaining C99
2737	{ $$ = DeclarationNode::newVarArray( $3 ); }
2738	\| '[' push type_qualifier_list assignment_expression pop ']'
2739	{ $$ = DeclarationNode::newArray( $4, $3, false ); }
2740	\| '[' push declaration_qualifier_list assignment_expression pop ']'
2741	// declaration_qualifier_list must be used because of shift/reduce conflict with
2742	// assignment_expression, so a semantic check is necessary to preclude them as a type_qualifier cannot
2743	// appear in this context.
2744	{ $$ = DeclarationNode::newArray( $4, $3, true ); }
2745	\| '[' push declaration_qualifier_list type_qualifier_list assignment_expression pop ']'
2746	{ $$ = DeclarationNode::newArray( $5, $4->addQualifiers( $3 ), true ); }
2747	;
2748
2749	// This pattern parses a new-style declaration of an abstract variable or function prototype, i.e., there is no
2750	// identifier to which the type applies, e.g.:
2751	//
2752	// [int] f( int ); // abstract variable parameter; no parameter name specified
2753	// [int] f( [int] (int) ); // abstract function-prototype parameter; no parameter name specified
2754	//
2755	// These rules need LR(3):
2756	//
2757	// new_abstract_tuple identifier_or_type_name
2758	// '[' new_parameter_list ']' identifier_or_type_name '(' new_parameter_type_list_opt ')'
2759	//
2760	// since a function return type can be syntactically identical to a tuple type:
2761	//
2762	// [int, int] t;
2763	// [int, int] f( int );
2764	//
2765	// Therefore, it is necessary to look at the token after identifier_or_type_name to know when to reduce
2766	// new_abstract_tuple. To make this LR(1), several rules have to be flattened (lengthened) to allow the necessary
2767	// lookahead. To accomplish this, new_abstract_declarator has an entry point without tuple, and tuple declarations are
2768	// duplicated when appearing with new_function_specifier.
2769
2770	new_abstract_declarator_tuple: // CFA
2771	new_abstract_tuple
2772	\| type_qualifier_list new_abstract_tuple
2773	{ $$ = $2->addQualifiers( $1 ); }
2774	\| new_abstract_declarator_no_tuple
2775	;
2776
2777	new_abstract_declarator_no_tuple: // CFA
2778	new_abstract_ptr
2779	\| new_abstract_array
2780	;
2781
2782	new_abstract_ptr: // CFA
2783	ptrref_operator type_specifier
2784	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0 ) ); }
2785	\| type_qualifier_list ptrref_operator type_specifier
2786	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1 ) ); }
2787	\| ptrref_operator new_abstract_function
2788	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0 ) ); }
2789	\| type_qualifier_list ptrref_operator new_abstract_function
2790	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1 ) ); }
2791	\| ptrref_operator new_abstract_declarator_tuple
2792	{ $$ = $2->addNewPointer( DeclarationNode::newPointer( 0 ) ); }
2793	\| type_qualifier_list ptrref_operator new_abstract_declarator_tuple
2794	{ $$ = $3->addNewPointer( DeclarationNode::newPointer( $1 ) ); }
2795	;
2796
2797	new_abstract_array: // CFA
2798	// Only the first dimension can be empty. Empty dimension must be factored out due to shift/reduce conflict with
2799	// empty (void) function return type.
2800	'[' ']' type_specifier
2801	{ $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
2802	\| '[' ']' multi_array_dimension type_specifier
2803	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
2804	\| multi_array_dimension type_specifier
2805	{ $$ = $2->addNewArray( $1 ); }
2806	\| '[' ']' new_abstract_ptr
2807	{ $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
2808	\| '[' ']' multi_array_dimension new_abstract_ptr
2809	{ $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
2810	\| multi_array_dimension new_abstract_ptr
2811	{ $$ = $2->addNewArray( $1 ); }
2812	;
2813
2814	new_abstract_tuple: // CFA
2815	'[' push new_abstract_parameter_list pop ']'
2816	{ $$ = DeclarationNode::newTuple( $3 ); }
2817	;
2818
2819	new_abstract_function: // CFA
2820	'[' ']' '(' new_parameter_type_list_opt ')'
2821	{ $$ = DeclarationNode::newFunction( 0, DeclarationNode::newTuple( 0 ), $4, 0 ); }
2822	\| new_abstract_tuple '(' push new_parameter_type_list_opt pop ')'
2823	{ $$ = DeclarationNode::newFunction( 0, $1, $4, 0 ); }
2824	\| new_function_return '(' push new_parameter_type_list_opt pop ')'
2825	{ $$ = DeclarationNode::newFunction( 0, $1, $4, 0 ); }
2826	;
2827
2828	// 1) ISO/IEC 9899:1999 Section 6.7.2(2) : "At least one type specifier shall be given in the declaration specifiers in
2829	// each declaration, and in the specifier-qualifier list in each structure declaration and type name."
2830	//
2831	// 2) ISO/IEC 9899:1999 Section 6.11.5(1) : "The placement of a storage-class specifier other than at the beginning of
2832	// the declaration specifiers in a declaration is an obsolescent feature."
2833	//
2834	// 3) ISO/IEC 9899:1999 Section 6.11.6(1) : "The use of function declarators with empty parentheses (not
2835	// prototype-format parameter type declarators) is an obsolescent feature."
2836	//
2837	// 4) ISO/IEC 9899:1999 Section 6.11.7(1) : "The use of function definitions with separate parameter identifier and
2838	// declaration lists (not prototype-format parameter type and identifier declarators) is an obsolescent feature.
2839
2840	//*********************** MISCELLANEOUS ******************************
2841
2842	comma_opt: // redundant comma
2843	// empty
2844	\| ','
2845	;
2846
2847	assignment_opt:
2848	// empty
2849	{ $$ = 0; }
2850	\| '=' assignment_expression
2851	{ $$ = $2; }
2852	;
2853
2854	%%
2855	// ----end of grammar----
2856
2857	void yyerror( const char * ) {
2858	std::cout << "Error ";
2859	if ( yyfilename ) {
2860	std::cout << "in file " << yyfilename << " ";
2861	} // if
2862	std::cout << "at line " << yylineno << " reading token \"" << (yytext[0] == '\0' ? "EOF" : yytext) << "\"" << std::endl;
2863	}
2864
2865	// Local Variables: //
2866	// mode: c++ //
2867	// tab-width: 4 //
2868	// compile-command: "make install" //
2869	// End: //

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

Download in other formats:

Original Format