source: src/Parser/parser.yy@ d2f09e4

ADT ast-experimental pthread-emulation
Last change on this file since d2f09e4 was 4fee301, checked in by Peter A. Buhr <pabuhr@…>, 3 years ago

update compiler error messages for-loop control
  • Property mode set to 100644
File size: 160.2 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// parser.yy --
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 : Mon Aug 22 23:05:55 2022
13// Update Count : 5651
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// designation with '=' (use ':' instead)
29//
30// This incompatibility is discussed in detail before the "designation" grammar rule. Most of the syntactic extensions
31// from ANSI90 to ANSI11 C are marked with the comment "C99/C11".
32
33// This grammar also has two levels of extensions. The first extensions cover most of the GCC C extensions. All of the
34// syntactic extensions for GCC C are marked with the comment "GCC". The second extensions are for Cforall (CFA), which
35// fixes several of C's outstanding problems and extends C with many modern language concepts. All of the syntactic
36// extensions for CFA C are marked with the comment "CFA".
37
38%{
39#define YYDEBUG_LEXER_TEXT( yylval ) // lexer loads this up each time
40#define YYDEBUG 1 // get the pretty debugging code to compile
41#define YYERROR_VERBOSE // more information in syntax errors
42
43#undef __GNUC_MINOR__
44
45#include <cstdio>
46#include <stack>
47using namespace std;
48
49#include "SynTree/Declaration.h"
50#include "ParseNode.h"
51#include "TypedefTable.h"
52#include "TypeData.h"
53#include "SynTree/LinkageSpec.h"
54#include "Common/SemanticError.h" // error_str
55#include "Common/utility.h" // for maybeMoveBuild, maybeBuild, CodeLo...
56
57#include "SynTree/Attribute.h" // for Attribute
58
59// lex uses __null in a boolean context, it's fine.
60//#pragma GCC diagnostic ignored "-Wparentheses-equality"
61
62extern DeclarationNode * parseTree;
63extern LinkageSpec::Spec linkage;
64extern TypedefTable typedefTable;
65
66stack<LinkageSpec::Spec> linkageStack;
67
68bool appendStr( string & to, string & from ) {
69 // 1. Multiple strings are concatenated into a single string but not combined internally. The reason is that
70 // "\x12" "3" is treated as 2 characters versus 1 because "escape sequences are converted into single members of
71 // the execution character set just prior to adjacent string literal concatenation" (C11, Section 6.4.5-8). It is
72 // easier to let the C compiler handle this case.
73 //
74 // 2. String encodings are transformed into canonical form (one encoding at start) so the encoding can be found
75 // without searching the string, e.g.: "abc" L"def" L"ghi" => L"abc" "def" "ghi". Multiple encodings must match,
76 // e.g., u"a" U"b" L"c" is disallowed.
77
78 if ( from[0] != '"' ) { // encoding ?
79 if ( to[0] != '"' ) { // encoding ?
80 if ( to[0] != from[0] || to[1] != from[1] ) { // different encodings ?
81 yyerror( "non-matching string encodings for string-literal concatenation" );
82 return false; // parse error, must call YYERROR in action
83 } else if ( from[1] == '8' ) {
84 from.erase( 0, 1 ); // remove 2nd encoding
85 } // if
86 } else {
87 if ( from[1] == '8' ) { // move encoding to start
88 to = "u8" + to;
89 from.erase( 0, 1 ); // remove 2nd encoding
90 } else {
91 to = from[0] + to;
92 } // if
93 } // if
94 from.erase( 0, 1 ); // remove 2nd encoding
95 } // if
96 to += " " + from; // concatenated into single string
97 return true;
98} // appendStr
99
100DeclarationNode * distAttr( DeclarationNode * typeSpec, DeclarationNode * declList ) {
101 // distribute declaration_specifier across all declared variables, e.g., static, const, but not __attribute__.
102 assert( declList );
103// printf( "distAttr1 typeSpec %p\n", typeSpec ); typeSpec->print( std::cout );
104 DeclarationNode * cur = declList, * cl = (new DeclarationNode)->addType( typeSpec );
105// printf( "distAttr2 cl %p\n", cl ); cl->type->print( std::cout );
106// cl->type->aggregate.name = cl->type->aggInst.aggregate->aggregate.name;
107
108 for ( cur = dynamic_cast<DeclarationNode *>( cur->get_next() ); cur != nullptr; cur = dynamic_cast<DeclarationNode *>( cur->get_next() ) ) {
109 cl->cloneBaseType( cur );
110 } // for
111 declList->addType( cl );
112// printf( "distAttr3 declList %p\n", declList ); declList->print( std::cout, 0 );
113 return declList;
114} // distAttr
115
116void distExt( DeclarationNode * declaration ) {
117 // distribute EXTENSION across all declarations
118 for ( DeclarationNode *iter = declaration; iter != nullptr; iter = (DeclarationNode *)iter->get_next() ) {
119 iter->set_extension( true );
120 } // for
121} // distExt
122
123void distInl( DeclarationNode * declaration ) {
124 // distribute INLINE across all declarations
125 for ( DeclarationNode *iter = declaration; iter != nullptr; iter = (DeclarationNode *)iter->get_next() ) {
126 iter->set_inLine( true );
127 } // for
128} // distInl
129
130void distQual( DeclarationNode * declaration, DeclarationNode * qualifiers ) {
131 // distribute qualifiers across all non-variable declarations in a distribution statemement
132 for ( DeclarationNode * iter = declaration; iter != nullptr; iter = (DeclarationNode *)iter->get_next() ) {
133 // SKULLDUGGERY: Distributions are parsed inside out, so qualifiers are added to declarations inside out. Since
134 // addQualifiers appends to the back of the list, the forall clauses are in the wrong order (right to left). To
135 // get the qualifiers in the correct order and still use addQualifiers (otherwise, 90% of addQualifiers has to
136 // be copied to add to front), the appropriate forall pointers are interchanged before calling addQualifiers.
137 DeclarationNode * clone = qualifiers->clone();
138 if ( qualifiers->type ) { // forall clause ? (handles SC)
139 if ( iter->type->kind == TypeData::Aggregate ) { // struct/union ?
140 swap( clone->type->forall, iter->type->aggregate.params );
141 iter->addQualifiers( clone );
142 } else if ( iter->type->kind == TypeData::AggregateInst && iter->type->aggInst.aggregate->aggregate.body ) { // struct/union ?
143 // Create temporary node to hold aggregate, call addQualifiers as above, then put nodes back together.
144 DeclarationNode newnode;
145 swap( newnode.type, iter->type->aggInst.aggregate );
146 swap( clone->type->forall, newnode.type->aggregate.params );
147 newnode.addQualifiers( clone );
148 swap( newnode.type, iter->type->aggInst.aggregate );
149 } else if ( iter->type->kind == TypeData::Function ) { // routines ?
150 swap( clone->type->forall, iter->type->forall );
151 iter->addQualifiers( clone );
152 } // if
153 } else { // just SC qualifiers
154 iter->addQualifiers( clone );
155 } // if
156 } // for
157 delete qualifiers;
158} // distQual
159
160// There is an ambiguity for inline generic-routine return-types and generic routines.
161// forall( otype T ) struct S { int i; } bar( T ) {}
162// Does the forall bind to the struct or the routine, and how would it be possible to explicitly specify the binding.
163// forall( otype T ) struct S { int T; } forall( otype W ) bar( W ) {}
164// Currently, the forall is associated with the routine, and the generic type has to be separately defined:
165// forall( otype T ) struct S { int T; };
166// forall( otype W ) bar( W ) {}
167
168void rebindForall( DeclarationNode * declSpec, DeclarationNode * funcDecl ) {
169 if ( declSpec->type->kind == TypeData::Aggregate ) { // ignore aggregate definition
170 funcDecl->type->forall = declSpec->type->aggregate.params; // move forall from aggregate to function type
171 declSpec->type->aggregate.params = nullptr;
172 } // if
173} // rebindForall
174
175string * build_postfix_name( string * name ) {
176 *name = string("__postfix_func_") + *name;
177 return name;
178} // build_postfix_name
179
180DeclarationNode * fieldDecl( DeclarationNode * typeSpec, DeclarationNode * fieldList ) {
181 if ( ! fieldList ) { // field declarator ?
182 if ( ! ( typeSpec->type && (typeSpec->type->kind == TypeData::Aggregate || typeSpec->type->kind == TypeData::Enum) ) ) {
183 stringstream ss;
184 // printf( "fieldDecl1 typeSpec %p\n", typeSpec ); typeSpec->type->print( std::cout );
185 SemanticWarning( yylloc, Warning::SuperfluousDecl, ss.str().c_str() );
186 return nullptr;
187 } // if
188 // printf( "fieldDecl2 typeSpec %p\n", typeSpec ); typeSpec->type->print( std::cout );
189 fieldList = DeclarationNode::newName( nullptr );
190 } // if
191// return distAttr( typeSpec, fieldList ); // mark all fields in list
192
193 // printf( "fieldDecl3 typeSpec %p\n", typeSpec ); typeSpec->print( std::cout, 0 );
194 DeclarationNode * temp = distAttr( typeSpec, fieldList ); // mark all fields in list
195 // printf( "fieldDecl4 temp %p\n", temp ); temp->print( std::cout, 0 );
196 return temp;
197} // fieldDecl
198
199#define NEW_ZERO new ExpressionNode( build_constantInteger( *new string( "0" ) ) )
200#define NEW_ONE new ExpressionNode( build_constantInteger( *new string( "1" ) ) )
201#define UPDOWN( compop, left, right ) (compop == OperKinds::LThan || compop == OperKinds::LEThan ? left : right)
202#define MISSING_ANON_FIELD "Missing loop fields with an anonymous loop index is meaningless as loop index is unavailable in loop body."
203#define MISSING_LOW "Missing low value for up-to range so index is uninitialized."
204#define MISSING_HIGH "Missing high value for down-to range so index is uninitialized."
205
206ForCtrl * forCtrl( DeclarationNode * index, ExpressionNode * start, enum OperKinds compop, ExpressionNode * comp, ExpressionNode * inc ) {
207 if ( index->initializer ) {
208 SemanticError( yylloc, "Direct initialization disallowed. Use instead: type var; initialization ~ comparison ~ increment." );
209 } // if
210 if ( index->next ) {
211 SemanticError( yylloc, "Multiple loop indexes disallowed in for-loop declaration." );
212 } // if
213 return new ForCtrl( index->addInitializer( new InitializerNode( start ) ),
214 // NULL comp/inc => leave blank
215 comp ? new ExpressionNode( build_binary_val( compop, new ExpressionNode( build_varref( new string( *index->name ) ) ), comp ) ) : nullptr,
216 inc ? new ExpressionNode( build_binary_val( compop == OperKinds::LThan || compop == OperKinds::LEThan ? // choose += or -= for upto/downto
217 OperKinds::PlusAssn : OperKinds::MinusAssn, new ExpressionNode( build_varref( new string( *index->name ) ) ), inc ) ) : nullptr );
218} // forCtrl
219
220ForCtrl * forCtrl( ExpressionNode * type, string * index, ExpressionNode * start, enum OperKinds compop, ExpressionNode * comp, ExpressionNode * inc ) {
221 ConstantExpr * constant = dynamic_cast<ConstantExpr *>(type->expr.get());
222 if ( constant && (constant->get_constant()->get_value() == "0" || constant->get_constant()->get_value() == "1") ) {
223 type = new ExpressionNode( new CastExpr( maybeMoveBuild<Expression>(type), new BasicType( Type::Qualifiers(), BasicType::SignedInt ) ) );
224 } // if
225// type = new ExpressionNode( build_func( new ExpressionNode( build_varref( new string( "__for_control_index_constraints__" ) ) ), type ) );
226 return new ForCtrl(
227 distAttr( DeclarationNode::newTypeof( type, true ), DeclarationNode::newName( index )->addInitializer( new InitializerNode( start ) ) ),
228 // NULL comp/inc => leave blank
229 comp ? new ExpressionNode( build_binary_val( compop, new ExpressionNode( build_varref( new string( *index ) ) ), comp ) ) : nullptr,
230 inc ? new ExpressionNode( build_binary_val( compop == OperKinds::LThan || compop == OperKinds::LEThan ? // choose += or -= for upto/downto
231 OperKinds::PlusAssn : OperKinds::MinusAssn, new ExpressionNode( build_varref( new string( *index ) ) ), inc ) ) : nullptr );
232} // forCtrl
233
234ForCtrl * forCtrl( ExpressionNode * type, ExpressionNode * index, ExpressionNode * start, enum OperKinds compop, ExpressionNode * comp, ExpressionNode * inc ) {
235 if ( NameExpr * identifier = dynamic_cast<NameExpr *>(index->expr.get()) ) {
236 return forCtrl( type, new string( identifier->name ), start, compop, comp, inc );
237 } else if ( CommaExpr * commaExpr = dynamic_cast<CommaExpr *>(index->expr.get()) ) {
238 if ( NameExpr * identifier = dynamic_cast<NameExpr *>(commaExpr->arg1 ) ) {
239 return forCtrl( type, new string( identifier->name ), start, compop, comp, inc );
240 } else {
241 SemanticError( yylloc, "Expression disallowed. Only loop-index name allowed." ); return nullptr;
242 } // if
243 } else {
244 SemanticError( yylloc, "Expression disallowed. Only loop-index name allowed." ); return nullptr;
245 } // if
246} // forCtrl
247
248bool forall = false; // aggregate have one or more forall qualifiers ?
249
250// https://www.gnu.org/software/bison/manual/bison.html#Location-Type
251#define YYLLOC_DEFAULT(Cur, Rhs, N) \
252if ( N ) { \
253 (Cur).first_line = YYRHSLOC( Rhs, 1 ).first_line; \
254 (Cur).first_column = YYRHSLOC( Rhs, 1 ).first_column; \
255 (Cur).last_line = YYRHSLOC( Rhs, N ).last_line; \
256 (Cur).last_column = YYRHSLOC( Rhs, N ).last_column; \
257 (Cur).filename = YYRHSLOC( Rhs, 1 ).filename; \
258} else { \
259 (Cur).first_line = (Cur).last_line = YYRHSLOC( Rhs, 0 ).last_line; \
260 (Cur).first_column = (Cur).last_column = YYRHSLOC( Rhs, 0 ).last_column; \
261 (Cur).filename = YYRHSLOC( Rhs, 0 ).filename; \
262}
263%}
264
265%define parse.error verbose
266
267// Types declaration for productions
268%union {
269 Token tok;
270 ParseNode * pn;
271 ExpressionNode * en;
272 DeclarationNode * decl;
273 AggregateDecl::Aggregate aggKey;
274 TypeDecl::Kind tclass;
275 StatementNode * sn;
276 WaitForStmt * wfs;
277 Expression * constant;
278 CondCtl * ifctl;
279 ForCtrl * fctl;
280 enum OperKinds compop;
281 LabelNode * label;
282 InitializerNode * in;
283 OperKinds op;
284 std::string * str;
285 bool flag;
286 CatchStmt::Kind catch_kind;
287 GenericExpr * genexpr;
288}
289
290//************************* TERMINAL TOKENS ********************************
291
292// keywords
293%token TYPEDEF
294%token EXTERN STATIC AUTO REGISTER
295%token THREADLOCAL // C11
296%token INLINE FORTRAN // C99, extension ISO/IEC 9899:1999 Section J.5.9(1)
297%token NORETURN // C11
298%token CONST VOLATILE
299%token RESTRICT // C99
300%token ATOMIC // C11
301%token FORALL MUTEX VIRTUAL VTABLE COERCE // CFA
302%token VOID CHAR SHORT INT LONG FLOAT DOUBLE SIGNED UNSIGNED
303%token BOOL COMPLEX IMAGINARY // C99
304%token INT128 UINT128 uuFLOAT80 uuFLOAT128 // GCC
305%token uFLOAT16 uFLOAT32 uFLOAT32X uFLOAT64 uFLOAT64X uFLOAT128 // GCC
306%token DECIMAL32 DECIMAL64 DECIMAL128 // GCC
307%token ZERO_T ONE_T // CFA
308%token SIZEOF TYPEOF VALIST AUTO_TYPE // GCC
309%token OFFSETOF BASETYPEOF TYPEID // CFA
310%token ENUM STRUCT UNION
311%token EXCEPTION // CFA
312%token GENERATOR COROUTINE MONITOR THREAD // CFA
313%token OTYPE FTYPE DTYPE TTYPE TRAIT // CFA
314// %token RESUME // CFA
315%token LABEL // GCC
316%token SUSPEND // CFA
317%token ATTRIBUTE EXTENSION // GCC
318%token IF ELSE SWITCH CASE DEFAULT DO WHILE FOR BREAK CONTINUE GOTO RETURN
319%token CHOOSE FALLTHRU FALLTHROUGH WITH WHEN WAITFOR // CFA
320%token DISABLE ENABLE TRY THROW THROWRESUME AT // CFA
321%token ASM // C99, extension ISO/IEC 9899:1999 Section J.5.10(1)
322%token ALIGNAS ALIGNOF GENERIC STATICASSERT // C11
323
324// names and constants: lexer differentiates between identifier and typedef names
325%token<tok> IDENTIFIER QUOTED_IDENTIFIER TYPEDIMname TYPEDEFname TYPEGENname
326%token<tok> TIMEOUT WOR CATCH RECOVER CATCHRESUME FIXUP FINALLY // CFA
327%token<tok> INTEGERconstant CHARACTERconstant STRINGliteral
328%token<tok> DIRECTIVE
329// Floating point constant is broken into three kinds of tokens because of the ambiguity with tuple indexing and
330// overloading constants 0/1, e.g., x.1 is lexed as (x)(.1), where (.1) is a factional constant, but is semantically
331// converted into the tuple index (.)(1). e.g., 3.x
332%token<tok> FLOATING_DECIMALconstant FLOATING_FRACTIONconstant FLOATINGconstant
333
334// multi-character operators
335%token ARROW // ->
336%token ICR DECR // ++ --
337%token LS RS // << >>
338%token LE GE EQ NE // <= >= == !=
339%token ANDAND OROR // && ||
340%token ELLIPSIS // ...
341
342%token EXPassign MULTassign DIVassign MODassign // \= *= /= %=
343%token PLUSassign MINUSassign // += -=
344%token LSassign RSassign // <<= >>=
345%token ANDassign ERassign ORassign // &= ^= |=
346
347%token ErangeUpEq ErangeDown ErangeDownEq // ~= -~ -~=
348%token ATassign // @=
349
350%type<tok> identifier identifier_at identifier_or_type_name attr_name
351%type<tok> quasi_keyword
352%type<constant> string_literal
353%type<str> string_literal_list
354
355// expressions
356%type<en> constant
357%type<en> tuple tuple_expression_list
358%type<op> ptrref_operator unary_operator assignment_operator simple_assignment_operator compound_assignment_operator
359%type<en> primary_expression postfix_expression unary_expression
360%type<en> cast_expression_list cast_expression exponential_expression multiplicative_expression additive_expression
361%type<en> shift_expression relational_expression equality_expression
362%type<en> AND_expression exclusive_OR_expression inclusive_OR_expression
363%type<en> logical_AND_expression logical_OR_expression
364%type<en> conditional_expression constant_expression assignment_expression assignment_expression_opt
365%type<en> comma_expression comma_expression_opt
366%type<en> argument_expression_list_opt argument_expression_list argument_expression default_initializer_opt
367%type<ifctl> conditional_declaration
368%type<fctl> for_control_expression for_control_expression_list
369%type<compop> updown updowneq downupdowneq
370%type<en> subrange
371%type<decl> asm_name_opt
372%type<en> asm_operands_opt asm_operands_list asm_operand
373%type<label> label_list
374%type<en> asm_clobbers_list_opt
375%type<flag> asm_volatile_opt
376%type<en> handler_predicate_opt
377%type<genexpr> generic_association generic_assoc_list
378
379// statements
380%type<sn> statement labeled_statement compound_statement
381%type<sn> statement_decl statement_decl_list statement_list_nodecl
382%type<sn> selection_statement if_statement
383%type<sn> switch_clause_list_opt switch_clause_list
384%type<en> case_value
385%type<sn> case_clause case_value_list case_label case_label_list
386%type<sn> iteration_statement jump_statement
387%type<sn> expression_statement asm_statement
388%type<sn> with_statement
389%type<en> with_clause_opt
390%type<sn> exception_statement handler_clause finally_clause
391%type<catch_kind> handler_key
392%type<sn> mutex_statement
393%type<en> when_clause when_clause_opt waitfor timeout
394%type<sn> waitfor_statement
395%type<wfs> waitfor_clause
396
397// declarations
398%type<decl> abstract_declarator abstract_ptr abstract_array abstract_function array_dimension multi_array_dimension
399%type<decl> abstract_parameter_declarator abstract_parameter_ptr abstract_parameter_array abstract_parameter_function array_parameter_dimension array_parameter_1st_dimension
400%type<decl> abstract_parameter_declaration
401
402%type<aggKey> aggregate_key aggregate_data aggregate_control
403%type<decl> aggregate_type aggregate_type_nobody
404
405%type<decl> assertion assertion_list assertion_list_opt
406
407%type<en> bit_subrange_size_opt bit_subrange_size
408
409%type<decl> basic_declaration_specifier basic_type_name basic_type_specifier direct_type indirect_type
410%type<decl> vtable vtable_opt default_opt
411
412%type<decl> trait_declaration trait_declaration_list trait_declaring_list trait_specifier
413
414%type<decl> declaration declaration_list declaration_list_opt declaration_qualifier_list
415%type<decl> declaration_specifier declaration_specifier_nobody declarator declaring_list
416
417%type<decl> elaborated_type elaborated_type_nobody
418
419%type<decl> enumerator_list enum_type enum_type_nobody
420%type<in> enumerator_value_opt
421
422%type<decl> external_definition external_definition_list external_definition_list_opt
423
424%type<decl> exception_declaration
425
426%type<decl> field_declaration_list_opt field_declaration field_declaring_list_opt field_declarator field_abstract_list_opt field_abstract
427%type<en> field field_name_list field_name fraction_constants_opt
428
429%type<decl> external_function_definition function_definition function_array function_declarator function_no_ptr function_ptr
430
431%type<decl> identifier_parameter_declarator identifier_parameter_ptr identifier_parameter_array identifier_parameter_function
432%type<decl> identifier_list
433
434%type<decl> cfa_abstract_array cfa_abstract_declarator_no_tuple cfa_abstract_declarator_tuple
435%type<decl> cfa_abstract_function cfa_abstract_parameter_declaration cfa_abstract_parameter_list
436%type<decl> cfa_abstract_ptr cfa_abstract_tuple
437
438%type<decl> cfa_array_parameter_1st_dimension
439
440%type<decl> cfa_trait_declaring_list cfa_declaration cfa_field_declaring_list cfa_field_abstract_list
441%type<decl> cfa_function_declaration cfa_function_return cfa_function_specifier
442
443%type<decl> cfa_identifier_parameter_array cfa_identifier_parameter_declarator_no_tuple
444%type<decl> cfa_identifier_parameter_declarator_tuple cfa_identifier_parameter_ptr
445
446%type<decl> cfa_parameter_declaration cfa_parameter_list cfa_parameter_ellipsis_list_opt
447
448%type<decl> cfa_typedef_declaration cfa_variable_declaration cfa_variable_specifier
449
450%type<decl> c_declaration static_assert
451%type<decl> KR_function_declarator KR_function_no_ptr KR_function_ptr KR_function_array
452%type<decl> KR_parameter_list KR_parameter_list_opt
453
454%type<decl> parameter_declaration parameter_list parameter_type_list_opt
455
456%type<decl> paren_identifier paren_type
457
458%type<decl> storage_class storage_class_list
459
460%type<decl> sue_declaration_specifier sue_declaration_specifier_nobody sue_type_specifier sue_type_specifier_nobody
461
462%type<tclass> type_class new_type_class
463%type<decl> type_declarator type_declarator_name type_declaring_list
464
465%type<decl> type_declaration_specifier type_type_specifier type_name typegen_name
466%type<decl> typedef_name typedef_declaration typedef_expression
467
468%type<decl> variable_type_redeclarator type_ptr type_array type_function
469
470%type<decl> type_parameter_redeclarator type_parameter_ptr type_parameter_array type_parameter_function
471
472%type<decl> type type_no_function
473%type<decl> type_parameter type_parameter_list type_initializer_opt
474
475%type<en> type_parameters_opt type_list
476
477%type<decl> type_qualifier type_qualifier_name forall type_qualifier_list_opt type_qualifier_list
478%type<decl> type_specifier type_specifier_nobody
479
480%type<decl> variable_declarator variable_ptr variable_array variable_function
481%type<decl> variable_abstract_declarator variable_abstract_ptr variable_abstract_array variable_abstract_function
482
483%type<decl> attribute_list_opt attribute_list attribute attribute_name_list attribute_name
484
485// initializers
486%type<in> initializer initializer_list_opt initializer_opt
487
488// designators
489%type<en> designator designator_list designation
490
491
492// Handle shift/reduce conflict for dangling else by shifting the ELSE token. For example, this string is ambiguous:
493// .---------. matches IF '(' comma_expression ')' statement . (reduce)
494// if ( C ) S1 else S2
495// `-----------------' matches IF '(' comma_expression ')' statement . (shift) ELSE statement */
496// Similar issues exit with the waitfor statement.
497
498// Order of these lines matters (low-to-high precedence). THEN is left associative over WOR/TIMEOUT/ELSE, WOR is left
499// associative over TIMEOUT/ELSE, and TIMEOUT is left associative over ELSE.
500%precedence THEN // rule precedence for IF/WAITFOR statement
501%precedence WOR // token precedence for start of WOR in WAITFOR statement
502%precedence TIMEOUT // token precedence for start of TIMEOUT in WAITFOR statement
503%precedence CATCH // token precedence for start of TIMEOUT in WAITFOR statement
504%precedence RECOVER // token precedence for start of TIMEOUT in WAITFOR statement
505%precedence CATCHRESUME // token precedence for start of TIMEOUT in WAITFOR statement
506%precedence FIXUP // token precedence for start of TIMEOUT in WAITFOR statement
507%precedence FINALLY // token precedence for start of TIMEOUT in WAITFOR statement
508%precedence ELSE // token precedence for start of else clause in IF/WAITFOR statement
509
510
511// Handle shift/reduce conflict for generic type by shifting the '(' token. For example, this string is ambiguous:
512// forall( otype T ) struct Foo { T v; };
513// .-----. matches pointer to function returning a generic (which is impossible without a type)
514// Foo ( *fp )( int );
515// `---' matches start of TYPEGENname '('
516// must be:
517// Foo( int ) ( *fp )( int );
518// The same problem occurs here:
519// forall( otype T ) struct Foo { T v; } ( *fp )( int );
520// must be:
521// forall( otype T ) struct Foo { T v; } ( int ) ( *fp )( int );
522
523// Order of these lines matters (low-to-high precedence).
524%precedence TYPEGENname
525%precedence '}'
526%precedence '('
527
528// %precedence RESUME
529// %precedence '{'
530// %precedence ')'
531
532%locations // support location tracking for error messages
533
534%start translation_unit // parse-tree root
535
536%%
537//************************* Namespace Management ********************************
538
539// The C grammar is not context free because it relies on the distinct terminal symbols "identifier" and "TYPEDEFname",
540// which are lexically identical.
541//
542// typedef int foo; // identifier foo must now be scanned as TYPEDEFname
543// foo f; // to allow it to appear in this context
544//
545// While it may be possible to write a purely context-free grammar, such a grammar would obscure the relationship
546// between syntactic and semantic constructs. Cforall compounds this problem by introducing type names local to the
547// scope of a declaration (for instance, those introduced through "forall" qualifiers), and by introducing "type
548// generators" -- parameterized types. This latter type name creates a third class of identifiers, "TYPEGENname", which
549// must be distinguished by the lexical scanner.
550//
551// Since the scanner cannot distinguish among the different classes of identifiers without some context information,
552// there is a type table (typedefTable), which holds type names and identifiers that override type names, for each named
553// scope. During parsing, semantic actions update the type table by adding new identifiers in the current scope. For
554// each context that introduces a name scope, a new level is created in the type table and that level is popped on
555// exiting the scope. Since type names can be local to a particular declaration, each declaration is itself a scope.
556// This requires distinguishing between type names that are local to the current declaration scope and those that
557// persist past the end of the declaration (i.e., names defined in "typedef" or "otype" declarations).
558//
559// The non-terminals "push" and "pop" denote the opening and closing of named scopes. Every push has a matching pop in
560// the production rule. There are multiple lists of declarations, where each declaration is a named scope, so pop/push
561// around the list separator.
562//
563// int f( forall(T) T (*f1) T , forall( S ) S (*f2)( S ) );
564// push pop push pop
565
566push:
567 { typedefTable.enterScope(); }
568 ;
569
570pop:
571 { typedefTable.leaveScope(); }
572 ;
573
574//************************* CONSTANTS ********************************
575
576constant:
577 // ENUMERATIONconstant is not included here; it is treated as a variable with type "enumeration constant".
578 INTEGERconstant { $$ = new ExpressionNode( build_constantInteger( *$1 ) ); }
579 | FLOATING_DECIMALconstant { $$ = new ExpressionNode( build_constantFloat( *$1 ) ); }
580 | FLOATING_FRACTIONconstant { $$ = new ExpressionNode( build_constantFloat( *$1 ) ); }
581 | FLOATINGconstant { $$ = new ExpressionNode( build_constantFloat( *$1 ) ); }
582 | CHARACTERconstant { $$ = new ExpressionNode( build_constantChar( *$1 ) ); }
583 ;
584
585quasi_keyword: // CFA
586 TIMEOUT
587 | WOR
588 | CATCH
589 | RECOVER
590 | CATCHRESUME
591 | FIXUP
592 | FINALLY
593 ;
594
595identifier:
596 IDENTIFIER
597 | quasi_keyword
598 ;
599
600identifier_at:
601 identifier
602 | '@' // CFA
603 { Token tok = { new string( DeclarationNode::anonymous.newName() ), yylval.tok.loc }; $$ = tok; }
604 ;
605
606string_literal:
607 string_literal_list { $$ = build_constantStr( *$1 ); }
608 ;
609
610string_literal_list: // juxtaposed strings are concatenated
611 STRINGliteral { $$ = $1; } // conversion from tok to str
612 | string_literal_list STRINGliteral
613 {
614 if ( ! appendStr( *$1, *$2 ) ) YYERROR; // append 2nd juxtaposed string to 1st
615 delete $2; // allocated by lexer
616 $$ = $1; // conversion from tok to str
617 }
618 ;
619
620//************************* EXPRESSIONS ********************************
621
622primary_expression:
623 IDENTIFIER // typedef name cannot be used as a variable name
624 { $$ = new ExpressionNode( build_varref( $1 ) ); }
625 | quasi_keyword
626 { $$ = new ExpressionNode( build_varref( $1 ) ); }
627 | TYPEDIMname // CFA, generic length argument
628 // { $$ = new ExpressionNode( new TypeExpr( maybeMoveBuildType( DeclarationNode::newFromTypedef( $1 ) ) ) ); }
629 // { $$ = new ExpressionNode( build_varref( $1 ) ); }
630 { $$ = new ExpressionNode( build_dimensionref( $1 ) ); }
631 | tuple
632 | '(' comma_expression ')'
633 { $$ = $2; }
634 | '(' compound_statement ')' // GCC, lambda expression
635 { $$ = new ExpressionNode( new StmtExpr( dynamic_cast<CompoundStmt *>(maybeMoveBuild<Statement>($2) ) ) ); }
636 | type_name '.' identifier // CFA, nested type
637 { SemanticError( yylloc, "Qualified name is currently unimplemented." ); $$ = nullptr; }
638 | type_name '.' '[' field_name_list ']' // CFA, nested type / tuple field selector
639 { SemanticError( yylloc, "Qualified name is currently unimplemented." ); $$ = nullptr; }
640 | GENERIC '(' assignment_expression ',' generic_assoc_list ')' // C11
641 {
642 // add the missing control expression to the GenericExpr and return it
643 $5->control = maybeMoveBuild<Expression>( $3 );
644 $$ = new ExpressionNode( $5 );
645 }
646 // | RESUME '(' comma_expression ')'
647 // { SemanticError( yylloc, "Resume expression is currently unimplemented." ); $$ = nullptr; }
648 // | RESUME '(' comma_expression ')' compound_statement
649 // { SemanticError( yylloc, "Resume expression is currently unimplemented." ); $$ = nullptr; }
650 | IDENTIFIER IDENTIFIER // syntax error
651 {
652 SemanticError( yylloc, ::toString( "Adjacent identifiers are not meaningful in an expression. "
653 "Possible problem is identifier \"", *$1.str,
654 "\" is a misspelled typename or an incorrectly specified type name, "
655 "e.g., missing generic parameter or missing struct/union/enum before typename." ) );
656 $$ = nullptr;
657 }
658 | IDENTIFIER direct_type // syntax error
659 {
660 SemanticError( yylloc, ::toString( "Identifier \"", *$1.str, "\" cannot appear before a type. "
661 "Possible problem is misspelled storage or CV qualifier." ) );
662 $$ = nullptr;
663 }
664 ;
665
666generic_assoc_list: // C11
667 generic_association
668 | generic_assoc_list ',' generic_association
669 {
670 // steal the association node from the singleton and delete the wrapper
671 $1->associations.splice($1->associations.end(), $3->associations);
672 delete $3;
673 $$ = $1;
674 }
675 ;
676
677generic_association: // C11
678 type_no_function ':' assignment_expression
679 {
680 // create a GenericExpr wrapper with one association pair
681 $$ = new GenericExpr( nullptr, { { maybeMoveBuildType($1), maybeMoveBuild<Expression>( $3 ) } } );
682 }
683 | DEFAULT ':' assignment_expression
684 { $$ = new GenericExpr( nullptr, { { maybeMoveBuild<Expression>( $3 ) } } ); }
685 ;
686
687postfix_expression:
688 primary_expression
689 | postfix_expression '[' assignment_expression ',' tuple_expression_list ']'
690 // Historic, transitional: Disallow commas in subscripts.
691 // Switching to this behaviour may help check if a C compatibilty case uses comma-exprs in subscripts.
692 // Current: Commas in subscripts make tuples.
693 { $$ = new ExpressionNode( build_binary_val( OperKinds::Index, $1, new ExpressionNode( build_tuple( (ExpressionNode *)($3->set_last( $5 ) ) )) ) ); }
694 | postfix_expression '[' assignment_expression ']'
695 // CFA, comma_expression disallowed in this context because it results in a common user error: subscripting a
696 // matrix with x[i,j] instead of x[i][j]. While this change is not backwards compatible, there seems to be
697 // little advantage to this feature and many disadvantages. It is possible to write x[(i,j)] in CFA, which is
698 // equivalent to the old x[i,j].
699 { $$ = new ExpressionNode( build_binary_val( OperKinds::Index, $1, $3 ) ); }
700 | constant '[' assignment_expression ']' // 3[a], 'a'[a], 3.5[a]
701 { $$ = new ExpressionNode( build_binary_val( OperKinds::Index, $1, $3 ) ); }
702 | string_literal '[' assignment_expression ']' // "abc"[3], 3["abc"]
703 { $$ = new ExpressionNode( build_binary_val( OperKinds::Index, new ExpressionNode( $1 ), $3 ) ); }
704 | postfix_expression '{' argument_expression_list_opt '}' // CFA, constructor call
705 {
706 Token fn;
707 fn.str = new std::string( "?{}" ); // location undefined - use location of '{'?
708 $$ = new ExpressionNode( new ConstructorExpr( build_func( new ExpressionNode( build_varref( fn ) ), (ExpressionNode *)( $1 )->set_last( $3 ) ) ) );
709 }
710 | postfix_expression '(' argument_expression_list_opt ')'
711 { $$ = new ExpressionNode( build_func( $1, $3 ) ); }
712 | postfix_expression '`' identifier // CFA, postfix call
713 { $$ = new ExpressionNode( build_func( new ExpressionNode( build_varref( build_postfix_name( $3 ) ) ), $1 ) ); }
714 | constant '`' identifier // CFA, postfix call
715 { $$ = new ExpressionNode( build_func( new ExpressionNode( build_varref( build_postfix_name( $3 ) ) ), $1 ) ); }
716 | string_literal '`' identifier // CFA, postfix call
717 { $$ = new ExpressionNode( build_func( new ExpressionNode( build_varref( build_postfix_name( $3 ) ) ), new ExpressionNode( $1 ) ) ); }
718 | postfix_expression '.' identifier
719 { $$ = new ExpressionNode( build_fieldSel( $1, build_varref( $3 ) ) ); }
720 | postfix_expression '.' INTEGERconstant // CFA, tuple index
721 { $$ = new ExpressionNode( build_fieldSel( $1, build_constantInteger( *$3 ) ) ); }
722 | postfix_expression FLOATING_FRACTIONconstant // CFA, tuple index
723 { $$ = new ExpressionNode( build_fieldSel( $1, build_field_name_FLOATING_FRACTIONconstant( *$2 ) ) ); }
724 | postfix_expression '.' '[' field_name_list ']' // CFA, tuple field selector
725 { $$ = new ExpressionNode( build_fieldSel( $1, build_tuple( $4 ) ) ); }
726 | postfix_expression '.' aggregate_control
727 { $$ = new ExpressionNode( build_keyword_cast( $3, $1 ) ); }
728 | postfix_expression ARROW identifier
729 { $$ = new ExpressionNode( build_pfieldSel( $1, build_varref( $3 ) ) ); }
730 | postfix_expression ARROW INTEGERconstant // CFA, tuple index
731 { $$ = new ExpressionNode( build_pfieldSel( $1, build_constantInteger( *$3 ) ) ); }
732 | postfix_expression ARROW '[' field_name_list ']' // CFA, tuple field selector
733 { $$ = new ExpressionNode( build_pfieldSel( $1, build_tuple( $4 ) ) ); }
734 | postfix_expression ICR
735 { $$ = new ExpressionNode( build_unary_ptr( OperKinds::IncrPost, $1 ) ); }
736 | postfix_expression DECR
737 { $$ = new ExpressionNode( build_unary_ptr( OperKinds::DecrPost, $1 ) ); }
738 | '(' type_no_function ')' '{' initializer_list_opt comma_opt '}' // C99, compound-literal
739 { $$ = new ExpressionNode( build_compoundLiteral( $2, new InitializerNode( $5, true ) ) ); }
740 | '(' type_no_function ')' '@' '{' initializer_list_opt comma_opt '}' // CFA, explicit C compound-literal
741 { $$ = new ExpressionNode( build_compoundLiteral( $2, (new InitializerNode( $6, true ))->set_maybeConstructed( false ) ) ); }
742 | '^' primary_expression '{' argument_expression_list_opt '}' // CFA, destructor call
743 {
744 Token fn;
745 fn.str = new string( "^?{}" ); // location undefined
746 $$ = new ExpressionNode( build_func( new ExpressionNode( build_varref( fn ) ), (ExpressionNode *)( $2 )->set_last( $4 ) ) );
747 }
748 ;
749
750argument_expression_list_opt:
751 // empty
752 { $$ = nullptr; }
753 | argument_expression_list
754 ;
755
756argument_expression_list:
757 argument_expression
758 | argument_expression_list_opt ',' argument_expression
759 { $$ = (ExpressionNode *)($1->set_last( $3 )); }
760 ;
761
762argument_expression:
763 '@' // CFA, default parameter
764 { SemanticError( yylloc, "Default parameter for argument is currently unimplemented." ); $$ = nullptr; }
765 // { $$ = new ExpressionNode( build_constantInteger( *new string( "2" ) ) ); }
766 | assignment_expression
767 ;
768
769field_name_list: // CFA, tuple field selector
770 field
771 | field_name_list ',' field { $$ = (ExpressionNode *)($1->set_last( $3 )); }
772 ;
773
774field: // CFA, tuple field selector
775 field_name
776 | FLOATING_DECIMALconstant field
777 { $$ = new ExpressionNode( build_fieldSel( new ExpressionNode( build_field_name_FLOATING_DECIMALconstant( *$1 ) ), maybeMoveBuild<Expression>( $2 ) ) ); }
778 | FLOATING_DECIMALconstant '[' field_name_list ']'
779 { $$ = new ExpressionNode( build_fieldSel( new ExpressionNode( build_field_name_FLOATING_DECIMALconstant( *$1 ) ), build_tuple( $3 ) ) ); }
780 | field_name '.' field
781 { $$ = new ExpressionNode( build_fieldSel( $1, maybeMoveBuild<Expression>( $3 ) ) ); }
782 | field_name '.' '[' field_name_list ']'
783 { $$ = new ExpressionNode( build_fieldSel( $1, build_tuple( $4 ) ) ); }
784 | field_name ARROW field
785 { $$ = new ExpressionNode( build_pfieldSel( $1, maybeMoveBuild<Expression>( $3 ) ) ); }
786 | field_name ARROW '[' field_name_list ']'
787 { $$ = new ExpressionNode( build_pfieldSel( $1, build_tuple( $4 ) ) ); }
788 ;
789
790field_name:
791 INTEGERconstant fraction_constants_opt
792 { $$ = new ExpressionNode( build_field_name_fraction_constants( build_constantInteger( *$1 ), $2 ) ); }
793 | FLOATINGconstant fraction_constants_opt
794 { $$ = new ExpressionNode( build_field_name_fraction_constants( build_field_name_FLOATINGconstant( *$1 ), $2 ) ); }
795 | identifier_at fraction_constants_opt // CFA, allow anonymous fields
796 {
797 $$ = new ExpressionNode( build_field_name_fraction_constants( build_varref( $1 ), $2 ) );
798 }
799 ;
800
801fraction_constants_opt:
802 // empty
803 { $$ = nullptr; }
804 | fraction_constants_opt FLOATING_FRACTIONconstant
805 {
806 Expression * constant = build_field_name_FLOATING_FRACTIONconstant( *$2 );
807 $$ = $1 != nullptr ? new ExpressionNode( build_fieldSel( $1, constant ) ) : new ExpressionNode( constant );
808 }
809 ;
810
811unary_expression:
812 postfix_expression
813 // first location where constant/string can have operator applied: sizeof 3/sizeof "abc" still requires
814 // semantics checks, e.g., ++3, 3--, *3, &&3
815 | constant
816 | string_literal
817 { $$ = new ExpressionNode( $1 ); }
818 | EXTENSION cast_expression // GCC
819 { $$ = $2->set_extension( true ); }
820 // '*' ('&') is separated from unary_operator because of shift/reduce conflict in:
821 // { * X; } // dereference X
822 // { * int X; } // CFA declaration of pointer to int
823 | ptrref_operator cast_expression // CFA
824 {
825 switch ( $1 ) {
826 case OperKinds::AddressOf:
827 $$ = new ExpressionNode( new AddressExpr( maybeMoveBuild<Expression>( $2 ) ) );
828 break;
829 case OperKinds::PointTo:
830 $$ = new ExpressionNode( build_unary_val( $1, $2 ) );
831 break;
832 case OperKinds::And:
833 $$ = new ExpressionNode( new AddressExpr( new AddressExpr( maybeMoveBuild<Expression>( $2 ) ) ) );
834 break;
835 default:
836 assert( false );
837 }
838 }
839 | unary_operator cast_expression
840 { $$ = new ExpressionNode( build_unary_val( $1, $2 ) ); }
841 | ICR unary_expression
842 { $$ = new ExpressionNode( build_unary_ptr( OperKinds::Incr, $2 ) ); }
843 | DECR unary_expression
844 { $$ = new ExpressionNode( build_unary_ptr( OperKinds::Decr, $2 ) ); }
845 | SIZEOF unary_expression
846 { $$ = new ExpressionNode( new SizeofExpr( maybeMoveBuild<Expression>( $2 ) ) ); }
847 | SIZEOF '(' type_no_function ')'
848 { $$ = new ExpressionNode( new SizeofExpr( maybeMoveBuildType( $3 ) ) ); }
849 | ALIGNOF unary_expression // GCC, variable alignment
850 { $$ = new ExpressionNode( new AlignofExpr( maybeMoveBuild<Expression>( $2 ) ) ); }
851 | ALIGNOF '(' type_no_function ')' // GCC, type alignment
852 { $$ = new ExpressionNode( new AlignofExpr( maybeMoveBuildType( $3 ) ) ); }
853 | OFFSETOF '(' type_no_function ',' identifier ')'
854 { $$ = new ExpressionNode( build_offsetOf( $3, build_varref( $5 ) ) ); }
855 | TYPEID '(' type_no_function ')'
856 {
857 SemanticError( yylloc, "typeid name is currently unimplemented." ); $$ = nullptr;
858 // $$ = new ExpressionNode( build_offsetOf( $3, build_varref( $5 ) ) );
859 }
860 ;
861
862ptrref_operator:
863 '*' { $$ = OperKinds::PointTo; }
864 | '&' { $$ = OperKinds::AddressOf; }
865 // GCC, address of label must be handled by semantic check for ref,ref,label
866 | ANDAND { $$ = OperKinds::And; }
867 ;
868
869unary_operator:
870 '+' { $$ = OperKinds::UnPlus; }
871 | '-' { $$ = OperKinds::UnMinus; }
872 | '!' { $$ = OperKinds::Neg; }
873 | '~' { $$ = OperKinds::BitNeg; }
874 ;
875
876cast_expression:
877 unary_expression
878 | '(' type_no_function ')' cast_expression
879 { $$ = new ExpressionNode( build_cast( $2, $4 ) ); }
880 | '(' aggregate_control '&' ')' cast_expression // CFA
881 { $$ = new ExpressionNode( build_keyword_cast( $2, $5 ) ); }
882 | '(' aggregate_control '*' ')' cast_expression // CFA
883 { $$ = new ExpressionNode( build_keyword_cast( $2, $5 ) ); }
884 | '(' VIRTUAL ')' cast_expression // CFA
885 { $$ = new ExpressionNode( new VirtualCastExpr( maybeMoveBuild<Expression>( $4 ), maybeMoveBuildType( nullptr ) ) ); }
886 | '(' VIRTUAL type_no_function ')' cast_expression // CFA
887 { $$ = new ExpressionNode( new VirtualCastExpr( maybeMoveBuild<Expression>( $5 ), maybeMoveBuildType( $3 ) ) ); }
888 | '(' RETURN type_no_function ')' cast_expression // CFA
889 { SemanticError( yylloc, "Return cast is currently unimplemented." ); $$ = nullptr; }
890 | '(' COERCE type_no_function ')' cast_expression // CFA
891 { SemanticError( yylloc, "Coerce cast is currently unimplemented." ); $$ = nullptr; }
892 | '(' qualifier_cast_list ')' cast_expression // CFA
893 { SemanticError( yylloc, "Qualifier cast is currently unimplemented." ); $$ = nullptr; }
894// | '(' type_no_function ')' tuple
895// { $$ = new ExpressionNode( build_cast( $2, $4 ) ); }
896 ;
897
898qualifier_cast_list:
899 cast_modifier type_qualifier_name
900 | cast_modifier MUTEX
901 | qualifier_cast_list cast_modifier type_qualifier_name
902 | qualifier_cast_list cast_modifier MUTEX
903 ;
904
905cast_modifier:
906 '-'
907 | '+'
908 ;
909
910exponential_expression:
911 cast_expression
912 | exponential_expression '\\' cast_expression
913 { $$ = new ExpressionNode( build_binary_val( OperKinds::Exp, $1, $3 ) ); }
914 ;
915
916multiplicative_expression:
917 exponential_expression
918 | multiplicative_expression '*' exponential_expression
919 { $$ = new ExpressionNode( build_binary_val( OperKinds::Mul, $1, $3 ) ); }
920 | multiplicative_expression '/' exponential_expression
921 { $$ = new ExpressionNode( build_binary_val( OperKinds::Div, $1, $3 ) ); }
922 | multiplicative_expression '%' exponential_expression
923 { $$ = new ExpressionNode( build_binary_val( OperKinds::Mod, $1, $3 ) ); }
924 ;
925
926additive_expression:
927 multiplicative_expression
928 | additive_expression '+' multiplicative_expression
929 { $$ = new ExpressionNode( build_binary_val( OperKinds::Plus, $1, $3 ) ); }
930 | additive_expression '-' multiplicative_expression
931 { $$ = new ExpressionNode( build_binary_val( OperKinds::Minus, $1, $3 ) ); }
932 ;
933
934shift_expression:
935 additive_expression
936 | shift_expression LS additive_expression
937 { $$ = new ExpressionNode( build_binary_val( OperKinds::LShift, $1, $3 ) ); }
938 | shift_expression RS additive_expression
939 { $$ = new ExpressionNode( build_binary_val( OperKinds::RShift, $1, $3 ) ); }
940 ;
941
942relational_expression:
943 shift_expression
944 | relational_expression '<' shift_expression
945 { $$ = new ExpressionNode( build_binary_val( OperKinds::LThan, $1, $3 ) ); }
946 | relational_expression '>' shift_expression
947 { $$ = new ExpressionNode( build_binary_val( OperKinds::GThan, $1, $3 ) ); }
948 | relational_expression LE shift_expression
949 { $$ = new ExpressionNode( build_binary_val( OperKinds::LEThan, $1, $3 ) ); }
950 | relational_expression GE shift_expression
951 { $$ = new ExpressionNode( build_binary_val( OperKinds::GEThan, $1, $3 ) ); }
952 ;
953
954equality_expression:
955 relational_expression
956 | equality_expression EQ relational_expression
957 { $$ = new ExpressionNode( build_binary_val( OperKinds::Eq, $1, $3 ) ); }
958 | equality_expression NE relational_expression
959 { $$ = new ExpressionNode( build_binary_val( OperKinds::Neq, $1, $3 ) ); }
960 ;
961
962AND_expression:
963 equality_expression
964 | AND_expression '&' equality_expression
965 { $$ = new ExpressionNode( build_binary_val( OperKinds::BitAnd, $1, $3 ) ); }
966 ;
967
968exclusive_OR_expression:
969 AND_expression
970 | exclusive_OR_expression '^' AND_expression
971 { $$ = new ExpressionNode( build_binary_val( OperKinds::Xor, $1, $3 ) ); }
972 ;
973
974inclusive_OR_expression:
975 exclusive_OR_expression
976 | inclusive_OR_expression '|' exclusive_OR_expression
977 { $$ = new ExpressionNode( build_binary_val( OperKinds::BitOr, $1, $3 ) ); }
978 ;
979
980logical_AND_expression:
981 inclusive_OR_expression
982 | logical_AND_expression ANDAND inclusive_OR_expression
983 { $$ = new ExpressionNode( build_and_or( $1, $3, true ) ); }
984 ;
985
986logical_OR_expression:
987 logical_AND_expression
988 | logical_OR_expression OROR logical_AND_expression
989 { $$ = new ExpressionNode( build_and_or( $1, $3, false ) ); }
990 ;
991
992conditional_expression:
993 logical_OR_expression
994 | logical_OR_expression '?' comma_expression ':' conditional_expression
995 { $$ = new ExpressionNode( build_cond( $1, $3, $5 ) ); }
996 // FIX ME: computes $1 twice
997 | logical_OR_expression '?' /* empty */ ':' conditional_expression // GCC, omitted first operand
998 { $$ = new ExpressionNode( build_cond( $1, $1, $4 ) ); }
999 ;
1000
1001constant_expression:
1002 conditional_expression
1003 ;
1004
1005assignment_expression:
1006 // CFA, assignment is separated from assignment_operator to ensure no assignment operations for tuples
1007 conditional_expression
1008 | unary_expression assignment_operator assignment_expression
1009 {
1010// if ( $2 == OperKinds::AtAssn ) {
1011// SemanticError( yylloc, "C @= assignment is currently unimplemented." ); $$ = nullptr;
1012// } else {
1013 $$ = new ExpressionNode( build_binary_val( $2, $1, $3 ) );
1014// } // if
1015 }
1016 | unary_expression '=' '{' initializer_list_opt comma_opt '}'
1017 { SemanticError( yylloc, "Initializer assignment is currently unimplemented." ); $$ = nullptr; }
1018 ;
1019
1020assignment_expression_opt:
1021 // empty
1022 { $$ = nullptr; }
1023 | assignment_expression
1024 ;
1025
1026assignment_operator:
1027 simple_assignment_operator
1028 | compound_assignment_operator
1029 ;
1030
1031simple_assignment_operator:
1032 '=' { $$ = OperKinds::Assign; }
1033 | ATassign { $$ = OperKinds::AtAssn; } // CFA
1034 ;
1035
1036compound_assignment_operator:
1037 EXPassign { $$ = OperKinds::ExpAssn; }
1038 | MULTassign { $$ = OperKinds::MulAssn; }
1039 | DIVassign { $$ = OperKinds::DivAssn; }
1040 | MODassign { $$ = OperKinds::ModAssn; }
1041 | PLUSassign { $$ = OperKinds::PlusAssn; }
1042 | MINUSassign { $$ = OperKinds::MinusAssn; }
1043 | LSassign { $$ = OperKinds::LSAssn; }
1044 | RSassign { $$ = OperKinds::RSAssn; }
1045 | ANDassign { $$ = OperKinds::AndAssn; }
1046 | ERassign { $$ = OperKinds::ERAssn; }
1047 | ORassign { $$ = OperKinds::OrAssn; }
1048 ;
1049
1050tuple: // CFA, tuple
1051 // CFA, one assignment_expression is factored out of comma_expression to eliminate a shift/reduce conflict with
1052 // comma_expression in cfa_identifier_parameter_array and cfa_abstract_array
1053// '[' ']'
1054// { $$ = new ExpressionNode( build_tuple() ); }
1055// | '[' push assignment_expression pop ']'
1056// { $$ = new ExpressionNode( build_tuple( $3 ) ); }
1057 '[' ',' tuple_expression_list ']'
1058 { $$ = new ExpressionNode( build_tuple( (ExpressionNode *)(new ExpressionNode( nullptr ) )->set_last( $3 ) ) ); }
1059 | '[' push assignment_expression pop ',' tuple_expression_list ']'
1060 { $$ = new ExpressionNode( build_tuple( (ExpressionNode *)($3->set_last( $6 ) ) )); }
1061 ;
1062
1063tuple_expression_list:
1064 assignment_expression
1065 | '@' // CFA
1066 { SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
1067 | tuple_expression_list ',' assignment_expression
1068 { $$ = (ExpressionNode *)($1->set_last( $3 )); }
1069 | tuple_expression_list ',' '@'
1070 { SemanticError( yylloc, "Eliding tuple element with '@' is currently unimplemented." ); $$ = nullptr; }
1071 ;
1072
1073comma_expression:
1074 assignment_expression
1075 | comma_expression ',' assignment_expression
1076 { $$ = new ExpressionNode( new CommaExpr( maybeMoveBuild<Expression>( $1 ), maybeMoveBuild<Expression>( $3 ) ) ); }
1077 ;
1078
1079comma_expression_opt:
1080 // empty
1081 { $$ = nullptr; }
1082 | comma_expression
1083 ;
1084
1085//*************************** STATEMENTS *******************************
1086
1087statement:
1088 labeled_statement
1089 | compound_statement
1090 | expression_statement
1091 | selection_statement
1092 | iteration_statement
1093 | jump_statement
1094 | with_statement
1095 | mutex_statement
1096 | waitfor_statement
1097 | exception_statement
1098 | enable_disable_statement
1099 { SemanticError( yylloc, "enable/disable statement is currently unimplemented." ); $$ = nullptr; }
1100 | asm_statement
1101 | DIRECTIVE
1102 { $$ = new StatementNode( build_directive( $1 ) ); }
1103 ;
1104
1105labeled_statement:
1106 // labels cannot be identifiers 0 or 1
1107 identifier_or_type_name ':' attribute_list_opt statement
1108 { $$ = $4->add_label( $1, $3 ); }
1109 | identifier_or_type_name ':' attribute_list_opt error // syntax error
1110 {
1111 SemanticError( yylloc, ::toString( "Label \"", *$1.str, "\" must be associated with a statement, "
1112 "where a declaration, case, or default is not a statement. "
1113 "Move the label or terminate with a semi-colon." ) );
1114 $$ = nullptr;
1115 }
1116 ;
1117
1118compound_statement:
1119 '{' '}'
1120 { $$ = new StatementNode( build_compound( (StatementNode *)0 ) ); }
1121 | '{' push
1122 local_label_declaration_opt // GCC, local labels appear at start of block
1123 statement_decl_list // C99, intermix declarations and statements
1124 pop '}'
1125 { $$ = new StatementNode( build_compound( $4 ) ); }
1126 ;
1127
1128statement_decl_list: // C99
1129 statement_decl
1130 | statement_decl_list statement_decl
1131 { assert( $1 ); $1->set_last( $2 ); $$ = $1; }
1132 ;
1133
1134statement_decl:
1135 declaration // CFA, new & old style declarations
1136 { $$ = new StatementNode( $1 ); }
1137 | EXTENSION declaration // GCC
1138 { distExt( $2 ); $$ = new StatementNode( $2 ); }
1139 | function_definition
1140 { $$ = new StatementNode( $1 ); }
1141 | EXTENSION function_definition // GCC
1142 { distExt( $2 ); $$ = new StatementNode( $2 ); }
1143 | statement
1144 ;
1145
1146statement_list_nodecl:
1147 statement
1148 | statement_list_nodecl statement
1149 { assert( $1 ); $1->set_last( $2 ); $$ = $1; }
1150 | statement_list_nodecl error // syntax error
1151 { SemanticError( yylloc, "Declarations only allowed at the start of the switch body, i.e., after the '{'." ); $$ = nullptr; }
1152 ;
1153
1154expression_statement:
1155 comma_expression_opt ';'
1156 { $$ = new StatementNode( build_expr( $1 ) ); }
1157 | MUTEX '(' ')' comma_expression ';'
1158 { $$ = new StatementNode( build_mutex( nullptr, new StatementNode( build_expr( $4 ) ) ) ); }
1159 ;
1160
1161selection_statement:
1162 // pop causes a S/R conflict without separating the IF statement into a non-terminal even after resolving
1163 // the inherent S/R conflict with THEN/ELSE.
1164 push if_statement pop
1165 { $$ = $2; }
1166 | SWITCH '(' comma_expression ')' case_clause
1167 { $$ = new StatementNode( build_switch( true, $3, $5 ) ); }
1168 | SWITCH '(' comma_expression ')' '{' push declaration_list_opt switch_clause_list_opt pop '}' // CFA
1169 {
1170 StatementNode *sw = new StatementNode( build_switch( true, $3, $8 ) );
1171 // The semantics of the declaration list is changed to include associated initialization, which is performed
1172 // *before* the transfer to the appropriate case clause by hoisting the declarations into a compound
1173 // statement around the switch. Statements after the initial declaration list can never be executed, and
1174 // therefore, are removed from the grammar even though C allows it. The change also applies to choose
1175 // statement.
1176 $$ = $7 ? new StatementNode( build_compound( (StatementNode *)((new StatementNode( $7 ))->set_last( sw )) ) ) : sw;
1177 }
1178 | SWITCH '(' comma_expression ')' '{' error '}' // CFA, syntax error
1179 { SemanticError( yylloc, "Only declarations can appear before the list of case clauses." ); $$ = nullptr; }
1180 | CHOOSE '(' comma_expression ')' case_clause // CFA
1181 { $$ = new StatementNode( build_switch( false, $3, $5 ) ); }
1182 | CHOOSE '(' comma_expression ')' '{' push declaration_list_opt switch_clause_list_opt pop '}' // CFA
1183 {
1184 StatementNode *sw = new StatementNode( build_switch( false, $3, $8 ) );
1185 $$ = $7 ? new StatementNode( build_compound( (StatementNode *)((new StatementNode( $7 ))->set_last( sw )) ) ) : sw;
1186 }
1187 | CHOOSE '(' comma_expression ')' '{' error '}' // CFA, syntax error
1188 { SemanticError( yylloc, "Only declarations can appear before the list of case clauses." ); $$ = nullptr; }
1189 ;
1190
1191if_statement:
1192 IF '(' conditional_declaration ')' statement %prec THEN
1193 // explicitly deal with the shift/reduce conflict on if/else
1194 { $$ = new StatementNode( build_if( $3, maybe_build_compound( $5 ), nullptr ) ); }
1195 | IF '(' conditional_declaration ')' statement ELSE statement
1196 { $$ = new StatementNode( build_if( $3, maybe_build_compound( $5 ), maybe_build_compound( $7 ) ) ); }
1197 ;
1198
1199conditional_declaration:
1200 comma_expression
1201 { $$ = new CondCtl( nullptr, $1 ); }
1202 | c_declaration // no semi-colon
1203 { $$ = new CondCtl( $1, nullptr ); }
1204 | cfa_declaration // no semi-colon
1205 { $$ = new CondCtl( $1, nullptr ); }
1206 | declaration comma_expression // semi-colon separated
1207 { $$ = new CondCtl( $1, $2 ); }
1208 ;
1209
1210// CASE and DEFAULT clauses are only allowed in the SWITCH statement, precluding Duff's device. In addition, a case
1211// clause allows a list of values and subranges.
1212
1213case_value: // CFA
1214 constant_expression { $$ = $1; }
1215 | constant_expression ELLIPSIS constant_expression // GCC, subrange
1216 { $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild<Expression>( $1 ), maybeMoveBuild<Expression>( $3 ) ) ); }
1217 | subrange // CFA, subrange
1218 ;
1219
1220case_value_list: // CFA
1221 case_value { $$ = new StatementNode( build_case( $1 ) ); }
1222 // convert case list, e.g., "case 1, 3, 5:" into "case 1: case 3: case 5"
1223 | case_value_list ',' case_value { $$ = (StatementNode *)($1->set_last( new StatementNode( build_case( $3 ) ) ) ); }
1224 ;
1225
1226case_label: // CFA
1227 CASE error // syntax error
1228 { SemanticError( yylloc, "Missing case list after case." ); $$ = nullptr; }
1229 | CASE case_value_list ':' { $$ = $2; }
1230 | CASE case_value_list error // syntax error
1231 { SemanticError( yylloc, "Missing colon after case list." ); $$ = nullptr; }
1232 | DEFAULT ':' { $$ = new StatementNode( build_default() ); }
1233 // A semantic check is required to ensure only one default clause per switch/choose statement.
1234 | DEFAULT error // syntax error
1235 { SemanticError( yylloc, "Missing colon after default." ); $$ = nullptr; }
1236 ;
1237
1238case_label_list: // CFA
1239 case_label
1240 | case_label_list case_label { $$ = (StatementNode *)( $1->set_last( $2 )); }
1241 ;
1242
1243case_clause: // CFA
1244 case_label_list statement { $$ = $1->append_last_case( maybe_build_compound( $2 ) ); }
1245 ;
1246
1247switch_clause_list_opt: // CFA
1248 // empty
1249 { $$ = nullptr; }
1250 | switch_clause_list
1251 ;
1252
1253switch_clause_list: // CFA
1254 case_label_list statement_list_nodecl
1255 { $$ = $1->append_last_case( new StatementNode( build_compound( $2 ) ) ); }
1256 | switch_clause_list case_label_list statement_list_nodecl
1257 { $$ = (StatementNode *)( $1->set_last( $2->append_last_case( new StatementNode( build_compound( $3 ) ) ) ) ); }
1258 ;
1259
1260iteration_statement:
1261 WHILE '(' ')' statement %prec THEN // CFA => while ( 1 )
1262 { $$ = new StatementNode( build_while( new CondCtl( nullptr, NEW_ONE ), maybe_build_compound( $4 ) ) ); }
1263 | WHILE '(' ')' statement ELSE statement // CFA
1264 {
1265 $$ = new StatementNode( build_while( new CondCtl( nullptr, NEW_ONE ), maybe_build_compound( $4 ) ) );
1266 SemanticWarning( yylloc, Warning::SuperfluousElse, "" );
1267 }
1268 | WHILE '(' conditional_declaration ')' statement %prec THEN
1269 { $$ = new StatementNode( build_while( $3, maybe_build_compound( $5 ) ) ); }
1270 | WHILE '(' conditional_declaration ')' statement ELSE statement // CFA
1271 { $$ = new StatementNode( build_while( $3, maybe_build_compound( $5 ), $7 ) ); }
1272 | DO statement WHILE '(' ')' ';' // CFA => do while( 1 )
1273 { $$ = new StatementNode( build_do_while( NEW_ONE, maybe_build_compound( $2 ) ) ); }
1274 | DO statement WHILE '(' ')' ELSE statement // CFA
1275 {
1276 $$ = new StatementNode( build_do_while( NEW_ONE, maybe_build_compound( $2 ) ) );
1277 SemanticWarning( yylloc, Warning::SuperfluousElse, "" );
1278 }
1279 | DO statement WHILE '(' comma_expression ')' ';'
1280 { $$ = new StatementNode( build_do_while( $5, maybe_build_compound( $2 ) ) ); }
1281 | DO statement WHILE '(' comma_expression ')' ELSE statement // CFA
1282 { $$ = new StatementNode( build_do_while( $5, maybe_build_compound( $2 ), $8 ) ); }
1283 | FOR '(' ')' statement %prec THEN // CFA => for ( ;; )
1284 { $$ = new StatementNode( build_for( new ForCtrl( (ExpressionNode * )nullptr, (ExpressionNode * )nullptr, (ExpressionNode * )nullptr ), maybe_build_compound( $4 ) ) ); }
1285 | FOR '(' ')' statement ELSE statement // CFA
1286 {
1287 $$ = new StatementNode( build_for( new ForCtrl( (ExpressionNode * )nullptr, (ExpressionNode * )nullptr, (ExpressionNode * )nullptr ), maybe_build_compound( $4 ) ) );
1288 SemanticWarning( yylloc, Warning::SuperfluousElse, "" );
1289 }
1290 | FOR '(' for_control_expression_list ')' statement %prec THEN
1291 { $$ = new StatementNode( build_for( $3, maybe_build_compound( $5 ) ) ); }
1292 | FOR '(' for_control_expression_list ')' statement ELSE statement // CFA
1293 { $$ = new StatementNode( build_for( $3, maybe_build_compound( $5 ), $7 ) ); }
1294 ;
1295
1296for_control_expression_list:
1297 for_control_expression
1298 | for_control_expression_list ':' for_control_expression
1299 // ForCtrl + ForCtrl:
1300 // init + init => multiple declaration statements that are hoisted
1301 // condition + condition => (expression) && (expression)
1302 // change + change => (expression), (expression)
1303 {
1304 $1->init->set_last( $3->init );
1305 if ( $1->condition ) {
1306 if ( $3->condition ) {
1307 $1->condition->expr.reset( new LogicalExpr( $1->condition->expr.release(), $3->condition->expr.release(), true ) );
1308 } // if
1309 } else $1->condition = $3->condition;
1310 if ( $1->change ) {
1311 if ( $3->change ) {
1312 $1->change->expr.reset( new CommaExpr( $1->change->expr.release(), $3->change->expr.release() ) );
1313 } // if
1314 } else $1->change = $3->change;
1315 $$ = $1;
1316 }
1317 ;
1318
1319for_control_expression:
1320 ';' comma_expression_opt ';' comma_expression_opt
1321 { $$ = new ForCtrl( (ExpressionNode * )nullptr, $2, $4 ); }
1322 | comma_expression ';' comma_expression_opt ';' comma_expression_opt
1323 { $$ = new ForCtrl( $1, $3, $5 ); }
1324 | declaration comma_expression_opt ';' comma_expression_opt // C99, declaration has ';'
1325 { $$ = new ForCtrl( $1, $2, $4 ); }
1326
1327 | comma_expression // CFA
1328 { $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), NEW_ZERO, OperKinds::LThan, $1->clone(), NEW_ONE ); }
1329 | downupdowneq comma_expression // CFA
1330 { $$ = forCtrl( $2, new string( DeclarationNode::anonymous.newName() ), UPDOWN( $1, NEW_ZERO, $2->clone() ), $1, UPDOWN( $1, $2->clone(), NEW_ZERO ), NEW_ONE ); }
1331
1332 | comma_expression updowneq comma_expression // CFA
1333 { $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), UPDOWN( $2, $1->clone(), $3 ), $2, UPDOWN( $2, $3->clone(), $1->clone() ), NEW_ONE ); }
1334 | '@' updowneq comma_expression // CFA
1335 {
1336 if ( $2 == OperKinds::LThan || $2 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1337 else $$ = forCtrl( $3, new string( DeclarationNode::anonymous.newName() ), $3->clone(), $2, nullptr, NEW_ONE );
1338 }
1339 | comma_expression updowneq '@' // CFA
1340 {
1341 if ( $2 == OperKinds::LThan || $2 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1342 else { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1343 }
1344 | comma_expression updowneq comma_expression '~' comma_expression // CFA
1345 { $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), UPDOWN( $2, $1->clone(), $3 ), $2, UPDOWN( $2, $3->clone(), $1->clone() ), $5 ); }
1346 | '@' updowneq comma_expression '~' comma_expression // CFA
1347 {
1348 if ( $2 == OperKinds::LThan || $2 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1349 else $$ = forCtrl( $3, new string( DeclarationNode::anonymous.newName() ), $3->clone(), $2, nullptr, $5 );
1350 }
1351 | comma_expression updowneq '@' '~' comma_expression // CFA
1352 {
1353 if ( $2 == OperKinds::LThan || $2 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1354 else { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1355 }
1356 | comma_expression updowneq comma_expression '~' '@' // CFA, error
1357 { SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1358 | '@' updowneq '@' // CFA, error
1359 { SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1360 | '@' updowneq comma_expression '~' '@' // CFA, error
1361 { SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1362 | comma_expression updowneq '@' '~' '@' // CFA, error
1363 { SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1364 | '@' updowneq '@' '~' '@' // CFA, error
1365 { SemanticError( yylloc, MISSING_ANON_FIELD ); $$ = nullptr; }
1366
1367 | comma_expression ';' comma_expression // CFA
1368 { $$ = forCtrl( $3, $1, NEW_ZERO, OperKinds::LThan, $3->clone(), NEW_ONE ); }
1369 | comma_expression ';' downupdowneq comma_expression // CFA
1370 { $$ = forCtrl( $4, $1, UPDOWN( $3, NEW_ZERO, $4->clone() ), $3, UPDOWN( $3, $4->clone(), NEW_ZERO ), NEW_ONE ); }
1371
1372 | comma_expression ';' comma_expression updowneq comma_expression // CFA
1373 { $$ = forCtrl( $3, $1, UPDOWN( $4, $3->clone(), $5 ), $4, UPDOWN( $4, $5->clone(), $3->clone() ), NEW_ONE ); }
1374 | comma_expression ';' '@' updowneq comma_expression // CFA
1375 {
1376 if ( $4 == OperKinds::LThan || $4 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1377 else $$ = forCtrl( $5, $1, $5->clone(), $4, nullptr, NEW_ONE );
1378 }
1379 | comma_expression ';' comma_expression updowneq '@' // CFA
1380 {
1381 if ( $4 == OperKinds::GThan || $4 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1382 else if ( $4 == OperKinds::LEThan ) { SemanticError( yylloc, "Equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1383 else $$ = forCtrl( $3, $1, $3->clone(), $4, nullptr, NEW_ONE );
1384 }
1385 | comma_expression ';' '@' updowneq '@' // CFA, error
1386 { SemanticError( yylloc, "Missing low/high value for up/down-to range so index is uninitialized." ); $$ = nullptr; }
1387
1388 | comma_expression ';' comma_expression updowneq comma_expression '~' comma_expression // CFA
1389 { $$ = forCtrl( $3, $1, UPDOWN( $4, $3->clone(), $5 ), $4, UPDOWN( $4, $5->clone(), $3->clone() ), $7 ); }
1390 | comma_expression ';' '@' updowneq comma_expression '~' comma_expression // CFA, error
1391 {
1392 if ( $4 == OperKinds::LThan || $4 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1393 else $$ = forCtrl( $5, $1, $5->clone(), $4, nullptr, $7 );
1394 }
1395 | comma_expression ';' comma_expression updowneq '@' '~' comma_expression // CFA
1396 {
1397 if ( $4 == OperKinds::GThan || $4 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1398 else if ( $4 == OperKinds::LEThan ) { SemanticError( yylloc, "Equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1399 else $$ = forCtrl( $3, $1, $3->clone(), $4, nullptr, $7 );
1400 }
1401 | comma_expression ';' comma_expression updowneq comma_expression '~' '@' // CFA
1402 { $$ = forCtrl( $3, $1, UPDOWN( $4, $3->clone(), $5 ), $4, UPDOWN( $4, $5->clone(), $3->clone() ), nullptr ); }
1403 | comma_expression ';' '@' updowneq comma_expression '~' '@' // CFA, error
1404 {
1405 if ( $4 == OperKinds::LThan || $4 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1406 else $$ = forCtrl( $5, $1, $5->clone(), $4, nullptr, nullptr );
1407 }
1408 | comma_expression ';' comma_expression updowneq '@' '~' '@' // CFA
1409 {
1410 if ( $4 == OperKinds::GThan || $4 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1411 else if ( $4 == OperKinds::LEThan ) { SemanticError( yylloc, "Equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1412 else $$ = forCtrl( $3, $1, $3->clone(), $4, nullptr, nullptr );
1413 }
1414 | comma_expression ';' '@' updowneq '@' '~' '@' // CFA
1415 { SemanticError( yylloc, "Missing low/high value for up/down-to range so index is uninitialized." ); $$ = nullptr; }
1416
1417 | declaration comma_expression // CFA
1418 { $$ = forCtrl( $1, NEW_ZERO, OperKinds::LThan, $2, NEW_ONE ); }
1419 | declaration downupdowneq comma_expression // CFA
1420 { $$ = forCtrl( $1, UPDOWN( $2, NEW_ZERO, $3 ), $2, UPDOWN( $2, $3->clone(), NEW_ZERO ), NEW_ONE ); }
1421
1422 | declaration comma_expression updowneq comma_expression // CFA
1423 { $$ = forCtrl( $1, UPDOWN( $3, $2->clone(), $4 ), $3, UPDOWN( $3, $4->clone(), $2->clone() ), NEW_ONE ); }
1424 | declaration '@' updowneq comma_expression // CFA
1425 {
1426 if ( $3 == OperKinds::LThan || $3 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1427 else $$ = forCtrl( $1, $4, $3, nullptr, NEW_ONE );
1428 }
1429 | declaration comma_expression updowneq '@' // CFA
1430 {
1431 if ( $3 == OperKinds::GThan || $3 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1432 else if ( $3 == OperKinds::LEThan ) { SemanticError( yylloc, "Equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1433 else $$ = forCtrl( $1, $2, $3, nullptr, NEW_ONE );
1434 }
1435
1436 | declaration comma_expression updowneq comma_expression '~' comma_expression // CFA
1437 { $$ = forCtrl( $1, UPDOWN( $3, $2, $4 ), $3, UPDOWN( $3, $4->clone(), $2->clone() ), $6 ); }
1438 | declaration '@' updowneq comma_expression '~' comma_expression // CFA
1439 {
1440 if ( $3 == OperKinds::LThan || $3 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1441 else $$ = forCtrl( $1, $4, $3, nullptr, $6 );
1442 }
1443 | declaration comma_expression updowneq '@' '~' comma_expression // CFA
1444 {
1445 if ( $3 == OperKinds::GThan || $3 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1446 else if ( $3 == OperKinds::LEThan ) { SemanticError( yylloc, "Equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1447 else $$ = forCtrl( $1, $2, $3, nullptr, $6 );
1448 }
1449 | declaration comma_expression updowneq comma_expression '~' '@' // CFA
1450 { $$ = forCtrl( $1, UPDOWN( $3, $2, $4 ), $3, UPDOWN( $3, $4->clone(), $2->clone() ), nullptr ); }
1451 | declaration '@' updowneq comma_expression '~' '@' // CFA
1452 {
1453 if ( $3 == OperKinds::LThan || $3 == OperKinds::LEThan ) { SemanticError( yylloc, MISSING_LOW ); $$ = nullptr; }
1454 else $$ = forCtrl( $1, $4, $3, nullptr, nullptr );
1455 }
1456 | declaration comma_expression updowneq '@' '~' '@' // CFA
1457 {
1458 if ( $3 == OperKinds::GThan || $3 == OperKinds::GEThan ) { SemanticError( yylloc, MISSING_HIGH ); $$ = nullptr; }
1459 else if ( $3 == OperKinds::LEThan ) { SemanticError( yylloc, "Equality with missing high value is meaningless. Use \"~\"." ); $$ = nullptr; }
1460 else $$ = forCtrl( $1, $2, $3, nullptr, nullptr );
1461 }
1462 | declaration '@' updowneq '@' '~' '@' // CFA, error
1463 { SemanticError( yylloc, "Missing low/high value for up/down-to range so index is uninitialized." ); $$ = nullptr; }
1464
1465 | comma_expression ';' TYPEDEFname // CFA, array type
1466 {
1467 SemanticError( yylloc, "Type iterator is currently unimplemented." ); $$ = nullptr;
1468 //$$ = forCtrl( new ExpressionNode( build_varref( $3 ) ), $1, nullptr, OperKinds::Range, nullptr, nullptr );
1469 }
1470 | comma_expression ';' downupdowneq TYPEDEFname // CFA, array type
1471 {
1472 if ( $3 == OperKinds::LEThan || $3 == OperKinds::GEThan ) { SemanticError( yylloc, "All enumation ranges are equal (all values). Remove \"=~\"." ); $$ = nullptr; }
1473 SemanticError( yylloc, "Type iterator is currently unimplemented." ); $$ = nullptr;
1474 }
1475 ;
1476
1477downupdowneq:
1478 ErangeDown
1479 { $$ = OperKinds::GThan; }
1480 | ErangeUpEq
1481 { $$ = OperKinds::LEThan; }
1482 | ErangeDownEq
1483 { $$ = OperKinds::GEThan; }
1484 ;
1485
1486updown:
1487 '~'
1488 { $$ = OperKinds::LThan; }
1489 | ErangeDown
1490 { $$ = OperKinds::GThan; }
1491 ;
1492
1493updowneq:
1494 updown
1495 | ErangeUpEq
1496 { $$ = OperKinds::LEThan; }
1497 | ErangeDownEq
1498 { $$ = OperKinds::GEThan; }
1499 ;
1500
1501jump_statement:
1502 GOTO identifier_or_type_name ';'
1503 { $$ = new StatementNode( build_branch( $2, BranchStmt::Goto ) ); }
1504 | GOTO '*' comma_expression ';' // GCC, computed goto
1505 // The syntax for the GCC computed goto violates normal expression precedence, e.g., goto *i+3; => goto *(i+3);
1506 // whereas normal operator precedence yields goto (*i)+3;
1507 { $$ = new StatementNode( build_computedgoto( $3 ) ); }
1508 // A semantic check is required to ensure fallthru appears only in the body of a choose statement.
1509 | fall_through_name ';' // CFA
1510 { $$ = new StatementNode( build_branch( BranchStmt::FallThrough ) ); }
1511 | fall_through_name identifier_or_type_name ';' // CFA
1512 { $$ = new StatementNode( build_branch( $2, BranchStmt::FallThrough ) ); }
1513 | fall_through_name DEFAULT ';' // CFA
1514 { $$ = new StatementNode( build_branch( BranchStmt::FallThroughDefault ) ); }
1515 | CONTINUE ';'
1516 // A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1517 { $$ = new StatementNode( build_branch( BranchStmt::Continue ) ); }
1518 | CONTINUE identifier_or_type_name ';' // CFA, multi-level continue
1519 // A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1520 // the target of the transfer appears only at the start of an iteration statement.
1521 { $$ = new StatementNode( build_branch( $2, BranchStmt::Continue ) ); }
1522 | BREAK ';'
1523 // A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1524 { $$ = new StatementNode( build_branch( BranchStmt::Break ) ); }
1525 | BREAK identifier_or_type_name ';' // CFA, multi-level exit
1526 // A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1527 // the target of the transfer appears only at the start of an iteration statement.
1528 { $$ = new StatementNode( build_branch( $2, BranchStmt::Break ) ); }
1529 | RETURN comma_expression_opt ';'
1530 { $$ = new StatementNode( build_return( $2 ) ); }
1531 | RETURN '{' initializer_list_opt comma_opt '}' ';'
1532 { SemanticError( yylloc, "Initializer return is currently unimplemented." ); $$ = nullptr; }
1533 | SUSPEND ';'
1534 { $$ = new StatementNode( build_suspend( nullptr ) ); }
1535 | SUSPEND compound_statement
1536 { $$ = new StatementNode( build_suspend( $2 ) ); }
1537 | SUSPEND COROUTINE ';'
1538 { $$ = new StatementNode( build_suspend( nullptr, SuspendStmt::Coroutine ) ); }
1539 | SUSPEND COROUTINE compound_statement
1540 { $$ = new StatementNode( build_suspend( $3, SuspendStmt::Coroutine ) ); }
1541 | SUSPEND GENERATOR ';'
1542 { $$ = new StatementNode( build_suspend( nullptr, SuspendStmt::Generator ) ); }
1543 | SUSPEND GENERATOR compound_statement
1544 { $$ = new StatementNode( build_suspend( $3, SuspendStmt::Generator ) ); }
1545 | THROW assignment_expression_opt ';' // handles rethrow
1546 { $$ = new StatementNode( build_throw( $2 ) ); }
1547 | THROWRESUME assignment_expression_opt ';' // handles reresume
1548 { $$ = new StatementNode( build_resume( $2 ) ); }
1549 | THROWRESUME assignment_expression_opt AT assignment_expression ';' // handles reresume
1550 { $$ = new StatementNode( build_resume_at( $2, $4 ) ); }
1551 ;
1552
1553fall_through_name: // CFA
1554 FALLTHRU
1555 | FALLTHROUGH
1556 ;
1557
1558with_statement:
1559 WITH '(' tuple_expression_list ')' statement
1560 { $$ = new StatementNode( build_with( $3, $5 ) ); }
1561 ;
1562
1563// If MUTEX becomes a general qualifier, there are shift/reduce conflicts, so change syntax to "with mutex".
1564mutex_statement:
1565 MUTEX '(' argument_expression_list ')' statement
1566 { $$ = new StatementNode( build_mutex( $3, $5 ) ); }
1567 ;
1568
1569when_clause:
1570 WHEN '(' comma_expression ')' { $$ = $3; }
1571 ;
1572
1573when_clause_opt:
1574 // empty
1575 { $$ = nullptr; }
1576 | when_clause
1577 ;
1578
1579waitfor:
1580 WAITFOR '(' cast_expression ')'
1581 { $$ = $3; }
1582// | WAITFOR '(' cast_expression ',' argument_expression_list_opt ')'
1583// { $$ = (ExpressionNode *)$3->set_last( $5 ); }
1584 | WAITFOR '(' cast_expression_list ':' argument_expression_list_opt ')'
1585 { $$ = (ExpressionNode *)($3->set_last( $5 )); }
1586 ;
1587
1588cast_expression_list:
1589 cast_expression
1590 | cast_expression_list ',' cast_expression
1591 // { $$ = (ExpressionNode *)($1->set_last( $3 )); }
1592 { SemanticError( yylloc, "List of mutex member is currently unimplemented." ); $$ = nullptr; }
1593 ;
1594
1595timeout:
1596 TIMEOUT '(' comma_expression ')' { $$ = $3; }
1597 ;
1598
1599waitfor_clause:
1600 when_clause_opt waitfor statement %prec THEN
1601 { $$ = build_waitfor( $2, maybe_build_compound( $3 ), $1 ); }
1602 | when_clause_opt waitfor statement WOR waitfor_clause
1603 { $$ = build_waitfor( $2, maybe_build_compound( $3 ), $1, $5 ); }
1604 | when_clause_opt timeout statement %prec THEN
1605 { $$ = build_waitfor_timeout( $2, maybe_build_compound( $3 ), $1 ); }
1606 | when_clause_opt ELSE statement
1607 { $$ = build_waitfor_timeout( nullptr, maybe_build_compound( $3 ), $1 ); }
1608 // "else" must be conditional after timeout or timeout is never triggered (i.e., it is meaningless)
1609 | when_clause_opt timeout statement WOR ELSE statement // syntax error
1610 { SemanticError( yylloc, "else clause must be conditional after timeout or timeout never triggered." ); $$ = nullptr; }
1611 | when_clause_opt timeout statement WOR when_clause ELSE statement
1612 { $$ = build_waitfor_timeout( $2, maybe_build_compound( $3 ), $1, maybe_build_compound( $7 ), $5 ); }
1613 ;
1614
1615waitfor_statement:
1616 when_clause_opt waitfor statement %prec THEN
1617 { $$ = new StatementNode( build_waitfor( $2, $3, $1 ) ); }
1618 | when_clause_opt waitfor statement WOR waitfor_clause
1619 { $$ = new StatementNode( build_waitfor( $2, $3, $1, $5 ) ); }
1620 ;
1621
1622exception_statement:
1623 TRY compound_statement handler_clause %prec THEN
1624 { $$ = new StatementNode( build_try( $2, $3, 0 ) ); }
1625 | TRY compound_statement finally_clause
1626 { $$ = new StatementNode( build_try( $2, 0, $3 ) ); }
1627 | TRY compound_statement handler_clause finally_clause
1628 { $$ = new StatementNode( build_try( $2, $3, $4 ) ); }
1629 ;
1630
1631handler_clause:
1632 handler_key '(' push exception_declaration pop handler_predicate_opt ')' compound_statement
1633 { $$ = new StatementNode( build_catch( $1, $4, $6, $8 ) ); }
1634 | handler_clause handler_key '(' push exception_declaration pop handler_predicate_opt ')' compound_statement
1635 { $$ = (StatementNode *)$1->set_last( new StatementNode( build_catch( $2, $5, $7, $9 ) ) ); }
1636 ;
1637
1638handler_predicate_opt:
1639 // empty
1640 { $$ = nullptr; }
1641 | ';' conditional_expression { $$ = $2; }
1642 ;
1643
1644handler_key:
1645 CATCH { $$ = CatchStmt::Terminate; }
1646 | RECOVER { $$ = CatchStmt::Terminate; }
1647 | CATCHRESUME { $$ = CatchStmt::Resume; }
1648 | FIXUP { $$ = CatchStmt::Resume; }
1649 ;
1650
1651finally_clause:
1652 FINALLY compound_statement { $$ = new StatementNode( build_finally( $2 ) ); }
1653 ;
1654
1655exception_declaration:
1656 // No SUE declaration in parameter list.
1657 type_specifier_nobody
1658 | type_specifier_nobody declarator
1659 { $$ = $2->addType( $1 ); }
1660 | type_specifier_nobody variable_abstract_declarator
1661 { $$ = $2->addType( $1 ); }
1662 | cfa_abstract_declarator_tuple identifier // CFA
1663 { $$ = $1->addName( $2 ); }
1664 | cfa_abstract_declarator_tuple // CFA
1665 ;
1666
1667enable_disable_statement:
1668 enable_disable_key identifier_list compound_statement
1669 ;
1670
1671enable_disable_key:
1672 ENABLE
1673 | DISABLE
1674 ;
1675
1676asm_statement:
1677 ASM asm_volatile_opt '(' string_literal ')' ';'
1678 { $$ = new StatementNode( build_asm( $2, $4, 0 ) ); }
1679 | ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ')' ';' // remaining GCC
1680 { $$ = new StatementNode( build_asm( $2, $4, $6 ) ); }
1681 | ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ')' ';'
1682 { $$ = new StatementNode( build_asm( $2, $4, $6, $8 ) ); }
1683 | ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ':' asm_clobbers_list_opt ')' ';'
1684 { $$ = new StatementNode( build_asm( $2, $4, $6, $8, $10 ) ); }
1685 | ASM asm_volatile_opt GOTO '(' string_literal ':' ':' asm_operands_opt ':' asm_clobbers_list_opt ':' label_list ')' ';'
1686 { $$ = new StatementNode( build_asm( $2, $5, 0, $8, $10, $12 ) ); }
1687 ;
1688
1689asm_volatile_opt: // GCC
1690 // empty
1691 { $$ = false; }
1692 | VOLATILE
1693 { $$ = true; }
1694 ;
1695
1696asm_operands_opt: // GCC
1697 // empty
1698 { $$ = nullptr; } // use default argument
1699 | asm_operands_list
1700 ;
1701
1702asm_operands_list: // GCC
1703 asm_operand
1704 | asm_operands_list ',' asm_operand
1705 { $$ = (ExpressionNode *)($1->set_last( $3 )); }
1706 ;
1707
1708asm_operand: // GCC
1709 string_literal '(' constant_expression ')'
1710 { $$ = new ExpressionNode( new AsmExpr( nullptr, $1, maybeMoveBuild<Expression>( $3 ) ) ); }
1711 | '[' IDENTIFIER ']' string_literal '(' constant_expression ')'
1712 { $$ = new ExpressionNode( new AsmExpr( $2, $4, maybeMoveBuild<Expression>( $6 ) ) ); }
1713 ;
1714
1715asm_clobbers_list_opt: // GCC
1716 // empty
1717 { $$ = nullptr; } // use default argument
1718 | string_literal
1719 { $$ = new ExpressionNode( $1 ); }
1720 | asm_clobbers_list_opt ',' string_literal
1721 { $$ = (ExpressionNode *)($1->set_last( new ExpressionNode( $3 ) )); }
1722 ;
1723
1724label_list:
1725 identifier
1726 {
1727 $$ = new LabelNode(); $$->labels.push_back( *$1 );
1728 delete $1; // allocated by lexer
1729 }
1730 | label_list ',' identifier
1731 {
1732 $$ = $1; $1->labels.push_back( *$3 );
1733 delete $3; // allocated by lexer
1734 }
1735 ;
1736
1737//******************************* DECLARATIONS *********************************
1738
1739declaration_list_opt: // used at beginning of switch statement
1740 // empty
1741 { $$ = nullptr; }
1742 | declaration_list
1743 ;
1744
1745declaration_list:
1746 declaration
1747 | declaration_list declaration
1748 { $$ = $1->appendList( $2 ); }
1749 ;
1750
1751KR_parameter_list_opt: // used to declare parameter types in K&R style functions
1752 // empty
1753 { $$ = nullptr; }
1754 | KR_parameter_list
1755 ;
1756
1757KR_parameter_list:
1758 push c_declaration pop ';'
1759 { $$ = $2; }
1760 | KR_parameter_list push c_declaration pop ';'
1761 { $$ = $1->appendList( $3 ); }
1762 ;
1763
1764local_label_declaration_opt: // GCC, local label
1765 // empty
1766 | local_label_declaration_list
1767 ;
1768
1769local_label_declaration_list: // GCC, local label
1770 LABEL local_label_list ';'
1771 | local_label_declaration_list LABEL local_label_list ';'
1772 ;
1773
1774local_label_list: // GCC, local label
1775 identifier_or_type_name
1776 | local_label_list ',' identifier_or_type_name
1777 ;
1778
1779declaration: // old & new style declarations
1780 c_declaration ';'
1781 {
1782 // printf( "C_DECLARATION1 %p %s\n", $$, $$->name ? $$->name->c_str() : "(nil)" );
1783 // for ( Attribute * attr: reverseIterate( $$->attributes ) ) {
1784 // printf( "\tattr %s\n", attr->name.c_str() );
1785 // } // for
1786 }
1787 | cfa_declaration ';' // CFA
1788 | static_assert // C11
1789 ;
1790
1791static_assert:
1792 STATICASSERT '(' constant_expression ',' string_literal ')' ';' // C11
1793 { $$ = DeclarationNode::newStaticAssert( $3, $5 ); }
1794 | STATICASSERT '(' constant_expression ')' ';' // CFA
1795 { $$ = DeclarationNode::newStaticAssert( $3, build_constantStr( *new string( "\"\"" ) ) ); }
1796
1797// C declaration syntax is notoriously confusing and error prone. Cforall provides its own type, variable and function
1798// declarations. CFA declarations use the same declaration tokens as in C; however, CFA places declaration modifiers to
1799// the left of the base type, while C declarations place modifiers to the right of the base type. CFA declaration
1800// modifiers are interpreted from left to right and the entire type specification is distributed across all variables in
1801// the declaration list (as in Pascal). ANSI C and the new CFA declarations may appear together in the same program
1802// block, but cannot be mixed within a specific declaration.
1803//
1804// CFA C
1805// [10] int x; int x[10]; // array of 10 integers
1806// [10] * char y; char *y[10]; // array of 10 pointers to char
1807
1808cfa_declaration: // CFA
1809 cfa_variable_declaration
1810 | cfa_typedef_declaration
1811 | cfa_function_declaration
1812 | type_declaring_list
1813 { SemanticError( yylloc, "otype declaration is currently unimplemented." ); $$ = nullptr; }
1814 | trait_specifier
1815 ;
1816
1817cfa_variable_declaration: // CFA
1818 cfa_variable_specifier initializer_opt
1819 { $$ = $1->addInitializer( $2 ); }
1820 | declaration_qualifier_list cfa_variable_specifier initializer_opt
1821 // declaration_qualifier_list also includes type_qualifier_list, so a semantic check is necessary to preclude
1822 // them as a type_qualifier cannot appear in that context.
1823 { $$ = $2->addQualifiers( $1 )->addInitializer( $3 ); }
1824 | cfa_variable_declaration pop ',' push identifier_or_type_name initializer_opt
1825 { $$ = $1->appendList( $1->cloneType( $5 )->addInitializer( $6 ) ); }
1826 ;
1827
1828cfa_variable_specifier: // CFA
1829 // A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1830 // storage-class
1831 cfa_abstract_declarator_no_tuple identifier_or_type_name asm_name_opt
1832 { $$ = $1->addName( $2 )->addAsmName( $3 ); }
1833 | cfa_abstract_tuple identifier_or_type_name asm_name_opt
1834 { $$ = $1->addName( $2 )->addAsmName( $3 ); }
1835 | type_qualifier_list cfa_abstract_tuple identifier_or_type_name asm_name_opt
1836 { $$ = $2->addQualifiers( $1 )->addName( $3 )->addAsmName( $4 ); }
1837 ;
1838
1839cfa_function_declaration: // CFA
1840 cfa_function_specifier
1841 | type_qualifier_list cfa_function_specifier
1842 { $$ = $2->addQualifiers( $1 ); }
1843 | declaration_qualifier_list cfa_function_specifier
1844 { $$ = $2->addQualifiers( $1 ); }
1845 | declaration_qualifier_list type_qualifier_list cfa_function_specifier
1846 { $$ = $3->addQualifiers( $1 )->addQualifiers( $2 ); }
1847 | cfa_function_declaration ',' identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')'
1848 {
1849 // Append the return type at the start (left-hand-side) to each identifier in the list.
1850 DeclarationNode * ret = new DeclarationNode;
1851 ret->type = maybeClone( $1->type->base );
1852 $$ = $1->appendList( DeclarationNode::newFunction( $3, ret, $6, nullptr ) );
1853 }
1854 ;
1855
1856cfa_function_specifier: // CFA
1857// '[' ']' identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' // S/R conflict
1858// {
1859// $$ = DeclarationNode::newFunction( $3, DeclarationNode::newTuple( 0 ), $6, 0, true );
1860// }
1861// '[' ']' identifier '(' push cfa_parameter_ellipsis_list_opt pop ')'
1862// {
1863// typedefTable.setNextIdentifier( *$5 );
1864// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1865// }
1866// | '[' ']' TYPEDEFname '(' push cfa_parameter_ellipsis_list_opt pop ')'
1867// {
1868// typedefTable.setNextIdentifier( *$5 );
1869// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1870// }
1871// | '[' ']' typegen_name
1872 // identifier_or_type_name must be broken apart because of the sequence:
1873 //
1874 // '[' ']' identifier_or_type_name '(' cfa_parameter_ellipsis_list_opt ')'
1875 // '[' ']' type_specifier
1876 //
1877 // type_specifier can resolve to just TYPEDEFname (e.g., typedef int T; int f( T );). Therefore this must be
1878 // flattened to allow lookahead to the '(' without having to reduce identifier_or_type_name.
1879 cfa_abstract_tuple identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' attribute_list_opt
1880 // To obtain LR(1 ), this rule must be factored out from function return type (see cfa_abstract_declarator).
1881 { $$ = DeclarationNode::newFunction( $2, $1, $5, 0 )->addQualifiers( $8 ); }
1882 | cfa_function_return identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' attribute_list_opt
1883 { $$ = DeclarationNode::newFunction( $2, $1, $5, 0 )->addQualifiers( $8 ); }
1884 ;
1885
1886cfa_function_return: // CFA
1887 '[' push cfa_parameter_list pop ']'
1888 { $$ = DeclarationNode::newTuple( $3 ); }
1889 | '[' push cfa_parameter_list pop ',' push cfa_abstract_parameter_list pop ']'
1890 // To obtain LR(1 ), the last cfa_abstract_parameter_list is added into this flattened rule to lookahead to the ']'.
1891 { $$ = DeclarationNode::newTuple( $3->appendList( $7 ) ); }
1892 ;
1893
1894cfa_typedef_declaration: // CFA
1895 TYPEDEF cfa_variable_specifier
1896 {
1897 typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "1" );
1898 $$ = $2->addTypedef();
1899 }
1900 | TYPEDEF cfa_function_specifier
1901 {
1902 typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "2" );
1903 $$ = $2->addTypedef();
1904 }
1905 | cfa_typedef_declaration pop ',' push identifier
1906 {
1907 typedefTable.addToEnclosingScope( *$5, TYPEDEFname, "3" );
1908 $$ = $1->appendList( $1->cloneType( $5 ) );
1909 }
1910 ;
1911
1912// Traditionally typedef is part of storage-class specifier for syntactic convenience only. Here, it is factored out as
1913// a separate form of declaration, which syntactically precludes storage-class specifiers and initialization.
1914
1915typedef_declaration:
1916 TYPEDEF type_specifier declarator
1917 {
1918 typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "4" );
1919 $$ = $3->addType( $2 )->addTypedef();
1920 }
1921 | typedef_declaration pop ',' push declarator
1922 {
1923 typedefTable.addToEnclosingScope( *$5->name, TYPEDEFname, "5" );
1924 $$ = $1->appendList( $1->cloneBaseType( $5 )->addTypedef() );
1925 }
1926 | type_qualifier_list TYPEDEF type_specifier declarator // remaining OBSOLESCENT (see 2 )
1927 {
1928 typedefTable.addToEnclosingScope( *$4->name, TYPEDEFname, "6" );
1929 $$ = $4->addType( $3 )->addQualifiers( $1 )->addTypedef();
1930 }
1931 | type_specifier TYPEDEF declarator
1932 {
1933 typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "7" );
1934 $$ = $3->addType( $1 )->addTypedef();
1935 }
1936 | type_specifier TYPEDEF type_qualifier_list declarator
1937 {
1938 typedefTable.addToEnclosingScope( *$4->name, TYPEDEFname, "8" );
1939 $$ = $4->addQualifiers( $1 )->addTypedef()->addType( $1 );
1940 }
1941 ;
1942
1943typedef_expression:
1944 // deprecated GCC, naming expression type: typedef name = exp; gives a name to the type of an expression
1945 TYPEDEF identifier '=' assignment_expression
1946 {
1947 SemanticError( yylloc, "Typedef expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
1948 }
1949 | typedef_expression pop ',' push identifier '=' assignment_expression
1950 {
1951 SemanticError( yylloc, "Typedef expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
1952 }
1953 ;
1954
1955c_declaration:
1956 declaration_specifier declaring_list
1957 { $$ = distAttr( $1, $2 ); }
1958 | typedef_declaration
1959 | typedef_expression // deprecated GCC, naming expression type
1960 | sue_declaration_specifier
1961 ;
1962
1963declaring_list:
1964 // A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1965 // storage-class
1966 declarator asm_name_opt initializer_opt
1967 { $$ = $1->addAsmName( $2 )->addInitializer( $3 ); }
1968 | declaring_list ',' attribute_list_opt declarator asm_name_opt initializer_opt
1969 { $$ = $1->appendList( $4->addQualifiers( $3 )->addAsmName( $5 )->addInitializer( $6 ) ); }
1970 ;
1971
1972declaration_specifier: // type specifier + storage class
1973 basic_declaration_specifier
1974 | sue_declaration_specifier
1975 | type_declaration_specifier
1976 ;
1977
1978declaration_specifier_nobody: // type specifier + storage class - {...}
1979 // Preclude SUE declarations in restricted scopes:
1980 //
1981 // int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
1982 //
1983 // because it is impossible to call f due to name equivalence.
1984 basic_declaration_specifier
1985 | sue_declaration_specifier_nobody
1986 | type_declaration_specifier
1987 ;
1988
1989type_specifier: // type specifier
1990 basic_type_specifier
1991 | sue_type_specifier
1992 {
1993 // printf( "sue_type_specifier2 %p %s\n", $$, $$->type->aggregate.name ? $$->type->aggregate.name->c_str() : "(nil)" );
1994 // for ( Attribute * attr: reverseIterate( $$->attributes ) ) {
1995 // printf( "\tattr %s\n", attr->name.c_str() );
1996 // } // for
1997 }
1998 | type_type_specifier
1999 ;
2000
2001type_specifier_nobody: // type specifier - {...}
2002 // Preclude SUE declarations in restricted scopes:
2003 //
2004 // int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
2005 //
2006 // because it is impossible to call f due to name equivalence.
2007 basic_type_specifier
2008 | sue_type_specifier_nobody
2009 | type_type_specifier
2010 ;
2011
2012type_qualifier_list_opt: // GCC, used in asm_statement
2013 // empty
2014 { $$ = nullptr; }
2015 | type_qualifier_list
2016 ;
2017
2018type_qualifier_list:
2019 // A semantic check is necessary to ensure a type qualifier is appropriate for the kind of declaration.
2020 //
2021 // ISO/IEC 9899:1999 Section 6.7.3(4 ) : If the same qualifier appears more than once in the same
2022 // specifier-qualifier-list, either directly or via one or more typedefs, the behavior is the same as if it
2023 // appeared only once.
2024 type_qualifier
2025 | type_qualifier_list type_qualifier
2026 { $$ = $1->addQualifiers( $2 ); }
2027 ;
2028
2029type_qualifier:
2030 type_qualifier_name
2031 | attribute // trick handles most atrribute locations
2032 ;
2033
2034type_qualifier_name:
2035 CONST
2036 { $$ = DeclarationNode::newTypeQualifier( Type::Const ); }
2037 | RESTRICT
2038 { $$ = DeclarationNode::newTypeQualifier( Type::Restrict ); }
2039 | VOLATILE
2040 { $$ = DeclarationNode::newTypeQualifier( Type::Volatile ); }
2041 | ATOMIC
2042 { $$ = DeclarationNode::newTypeQualifier( Type::Atomic ); }
2043 | forall
2044 ;
2045
2046forall:
2047 FORALL '(' type_parameter_list ')' // CFA
2048 { $$ = DeclarationNode::newForall( $3 ); }
2049 ;
2050
2051declaration_qualifier_list:
2052 storage_class_list
2053 | type_qualifier_list storage_class_list // remaining OBSOLESCENT (see 2 )
2054 { $$ = $1->addQualifiers( $2 ); }
2055 | declaration_qualifier_list type_qualifier_list storage_class_list
2056 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2057 ;
2058
2059storage_class_list:
2060 // A semantic check is necessary to ensure a storage class is appropriate for the kind of declaration and that
2061 // only one of each is specified, except for inline, which can appear with the others.
2062 //
2063 // ISO/IEC 9899:1999 Section 6.7.1(2) : At most, one storage-class specifier may be given in the declaration
2064 // specifiers in a declaration.
2065 storage_class
2066 | storage_class_list storage_class
2067 { $$ = $1->addQualifiers( $2 ); }
2068 ;
2069
2070storage_class:
2071 EXTERN
2072 { $$ = DeclarationNode::newStorageClass( Type::Extern ); }
2073 | STATIC
2074 { $$ = DeclarationNode::newStorageClass( Type::Static ); }
2075 | AUTO
2076 { $$ = DeclarationNode::newStorageClass( Type::Auto ); }
2077 | REGISTER
2078 { $$ = DeclarationNode::newStorageClass( Type::Register ); }
2079 | THREADLOCAL // C11
2080 { $$ = DeclarationNode::newStorageClass( Type::Threadlocal ); }
2081 // Put function specifiers here to simplify parsing rules, but separate them semantically.
2082 | INLINE // C99
2083 { $$ = DeclarationNode::newFuncSpecifier( Type::Inline ); }
2084 | FORTRAN // C99
2085 { $$ = DeclarationNode::newFuncSpecifier( Type::Fortran ); }
2086 | NORETURN // C11
2087 { $$ = DeclarationNode::newFuncSpecifier( Type::Noreturn ); }
2088 ;
2089
2090basic_type_name:
2091 VOID
2092 { $$ = DeclarationNode::newBasicType( DeclarationNode::Void ); }
2093 | BOOL // C99
2094 { $$ = DeclarationNode::newBasicType( DeclarationNode::Bool ); }
2095 | CHAR
2096 { $$ = DeclarationNode::newBasicType( DeclarationNode::Char ); }
2097 | INT
2098 { $$ = DeclarationNode::newBasicType( DeclarationNode::Int ); }
2099 | INT128
2100 { $$ = DeclarationNode::newBasicType( DeclarationNode::Int128 ); }
2101 | UINT128
2102 { $$ = DeclarationNode::newBasicType( DeclarationNode::Int128 )->addType( DeclarationNode::newSignedNess( DeclarationNode::Unsigned ) ); }
2103 | FLOAT
2104 { $$ = DeclarationNode::newBasicType( DeclarationNode::Float ); }
2105 | DOUBLE
2106 { $$ = DeclarationNode::newBasicType( DeclarationNode::Double ); }
2107 | uuFLOAT80
2108 { $$ = DeclarationNode::newBasicType( DeclarationNode::uuFloat80 ); }
2109 | uuFLOAT128
2110 { $$ = DeclarationNode::newBasicType( DeclarationNode::uuFloat128 ); }
2111 | uFLOAT16
2112 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat16 ); }
2113 | uFLOAT32
2114 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat32 ); }
2115 | uFLOAT32X
2116 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat32x ); }
2117 | uFLOAT64
2118 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat64 ); }
2119 | uFLOAT64X
2120 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat64x ); }
2121 | uFLOAT128
2122 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat128 ); }
2123 | DECIMAL32
2124 { SemanticError( yylloc, "_Decimal32 is currently unimplemented." ); $$ = nullptr; }
2125 | DECIMAL64
2126 { SemanticError( yylloc, "_Decimal64 is currently unimplemented." ); $$ = nullptr; }
2127 | DECIMAL128
2128 { SemanticError( yylloc, "_Decimal128 is currently unimplemented." ); $$ = nullptr; }
2129 | COMPLEX // C99
2130 { $$ = DeclarationNode::newComplexType( DeclarationNode::Complex ); }
2131 | IMAGINARY // C99
2132 { $$ = DeclarationNode::newComplexType( DeclarationNode::Imaginary ); }
2133 | SIGNED
2134 { $$ = DeclarationNode::newSignedNess( DeclarationNode::Signed ); }
2135 | UNSIGNED
2136 { $$ = DeclarationNode::newSignedNess( DeclarationNode::Unsigned ); }
2137 | SHORT
2138 { $$ = DeclarationNode::newLength( DeclarationNode::Short ); }
2139 | LONG
2140 { $$ = DeclarationNode::newLength( DeclarationNode::Long ); }
2141 | VALIST // GCC, __builtin_va_list
2142 { $$ = DeclarationNode::newBuiltinType( DeclarationNode::Valist ); }
2143 | AUTO_TYPE
2144 { $$ = DeclarationNode::newBuiltinType( DeclarationNode::AutoType ); }
2145 | vtable
2146 ;
2147
2148vtable_opt:
2149 // empty
2150 { $$ = nullptr; }
2151 | vtable
2152 ;
2153
2154vtable:
2155 VTABLE '(' type_name ')' default_opt
2156 { $$ = DeclarationNode::newVtableType( $3 ); }
2157 // { SemanticError( yylloc, "vtable is currently unimplemented." ); $$ = nullptr; }
2158 ;
2159
2160default_opt:
2161 // empty
2162 { $$ = nullptr; }
2163 | DEFAULT
2164 { SemanticError( yylloc, "vtable default is currently unimplemented." ); $$ = nullptr; }
2165 ;
2166
2167basic_declaration_specifier:
2168 // A semantic check is necessary for conflicting storage classes.
2169 basic_type_specifier
2170 | declaration_qualifier_list basic_type_specifier
2171 { $$ = $2->addQualifiers( $1 ); }
2172 | basic_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2173 { $$ = $1->addQualifiers( $2 ); }
2174 | basic_declaration_specifier storage_class type_qualifier_list
2175 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2176 | basic_declaration_specifier storage_class basic_type_specifier
2177 { $$ = $3->addQualifiers( $2 )->addType( $1 ); }
2178 ;
2179
2180basic_type_specifier:
2181 direct_type
2182 // Cannot have type modifiers, e.g., short, long, etc.
2183 | type_qualifier_list_opt indirect_type type_qualifier_list_opt
2184 { $$ = $2->addQualifiers( $1 )->addQualifiers( $3 ); }
2185 ;
2186
2187direct_type:
2188 basic_type_name
2189 | type_qualifier_list basic_type_name
2190 { $$ = $2->addQualifiers( $1 ); }
2191 | direct_type type_qualifier
2192 { $$ = $1->addQualifiers( $2 ); }
2193 | direct_type basic_type_name
2194 { $$ = $1->addType( $2 ); }
2195 ;
2196
2197indirect_type:
2198 TYPEOF '(' type ')' // GCC: typeof( x ) y;
2199 { $$ = $3; }
2200 | TYPEOF '(' comma_expression ')' // GCC: typeof( a+b ) y;
2201 { $$ = DeclarationNode::newTypeof( $3 ); }
2202 | BASETYPEOF '(' type ')' // CFA: basetypeof( x ) y;
2203 { $$ = DeclarationNode::newTypeof( new ExpressionNode( new TypeExpr( maybeMoveBuildType( $3 ) ) ), true ); }
2204 | BASETYPEOF '(' comma_expression ')' // CFA: basetypeof( a+b ) y;
2205 { $$ = DeclarationNode::newTypeof( $3, true ); }
2206 | ZERO_T // CFA
2207 { $$ = DeclarationNode::newBuiltinType( DeclarationNode::Zero ); }
2208 | ONE_T // CFA
2209 { $$ = DeclarationNode::newBuiltinType( DeclarationNode::One ); }
2210 ;
2211
2212sue_declaration_specifier: // struct, union, enum + storage class + type specifier
2213 sue_type_specifier
2214 {
2215 // printf( "sue_declaration_specifier %p %s\n", $$, $$->type->aggregate.name ? $$->type->aggregate.name->c_str() : "(nil)" );
2216 // for ( Attribute * attr: reverseIterate( $$->attributes ) ) {
2217 // printf( "\tattr %s\n", attr->name.c_str() );
2218 // } // for
2219 }
2220 | declaration_qualifier_list sue_type_specifier
2221 { $$ = $2->addQualifiers( $1 ); }
2222 | sue_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2223 { $$ = $1->addQualifiers( $2 ); }
2224 | sue_declaration_specifier storage_class type_qualifier_list
2225 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2226 ;
2227
2228sue_type_specifier: // struct, union, enum + type specifier
2229 elaborated_type
2230 {
2231 // printf( "sue_type_specifier %p %s\n", $$, $$->type->aggregate.name ? $$->type->aggregate.name->c_str() : "(nil)" );
2232 // for ( Attribute * attr: reverseIterate( $$->attributes ) ) {
2233 // printf( "\tattr %s\n", attr->name.c_str() );
2234 // } // for
2235 }
2236 | type_qualifier_list
2237 { if ( $1->type != nullptr && $1->type->forall ) forall = true; } // remember generic type
2238 elaborated_type
2239 { $$ = $3->addQualifiers( $1 ); }
2240 | sue_type_specifier type_qualifier
2241 {
2242 if ( $2->type != nullptr && $2->type->forall ) forall = true; // remember generic type
2243 $$ = $1->addQualifiers( $2 );
2244 }
2245 ;
2246
2247sue_declaration_specifier_nobody: // struct, union, enum - {...} + storage class + type specifier
2248 sue_type_specifier_nobody
2249 | declaration_qualifier_list sue_type_specifier_nobody
2250 { $$ = $2->addQualifiers( $1 ); }
2251 | sue_declaration_specifier_nobody storage_class // remaining OBSOLESCENT (see 2)
2252 { $$ = $1->addQualifiers( $2 ); }
2253 | sue_declaration_specifier_nobody storage_class type_qualifier_list
2254 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2255 ;
2256
2257sue_type_specifier_nobody: // struct, union, enum - {...} + type specifier
2258 elaborated_type_nobody
2259 | type_qualifier_list elaborated_type_nobody
2260 { $$ = $2->addQualifiers( $1 ); }
2261 | sue_type_specifier_nobody type_qualifier
2262 { $$ = $1->addQualifiers( $2 ); }
2263 ;
2264
2265type_declaration_specifier:
2266 type_type_specifier
2267 | declaration_qualifier_list type_type_specifier
2268 { $$ = $2->addQualifiers( $1 ); }
2269 | type_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2270 { $$ = $1->addQualifiers( $2 ); }
2271 | type_declaration_specifier storage_class type_qualifier_list
2272 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2273 ;
2274
2275type_type_specifier: // typedef types
2276 type_name
2277 | type_qualifier_list type_name
2278 { $$ = $2->addQualifiers( $1 ); }
2279 | type_type_specifier type_qualifier
2280 { $$ = $1->addQualifiers( $2 ); }
2281 ;
2282
2283type_name:
2284 TYPEDEFname
2285 { $$ = DeclarationNode::newFromTypedef( $1 ); }
2286 | '.' TYPEDEFname
2287 { $$ = DeclarationNode::newQualifiedType( DeclarationNode::newFromGlobalScope(), DeclarationNode::newFromTypedef( $2 ) ); }
2288 | type_name '.' TYPEDEFname
2289 { $$ = DeclarationNode::newQualifiedType( $1, DeclarationNode::newFromTypedef( $3 ) ); }
2290 | typegen_name
2291 | '.' typegen_name
2292 { $$ = DeclarationNode::newQualifiedType( DeclarationNode::newFromGlobalScope(), $2 ); }
2293 | type_name '.' typegen_name
2294 { $$ = DeclarationNode::newQualifiedType( $1, $3 ); }
2295 ;
2296
2297typegen_name: // CFA
2298 TYPEGENname
2299 { $$ = DeclarationNode::newFromTypeGen( $1, nullptr ); }
2300 | TYPEGENname '(' ')'
2301 { $$ = DeclarationNode::newFromTypeGen( $1, nullptr ); }
2302 | TYPEGENname '(' type_list ')'
2303 { $$ = DeclarationNode::newFromTypeGen( $1, $3 ); }
2304 ;
2305
2306elaborated_type: // struct, union, enum
2307 aggregate_type
2308 {
2309 // printf( "elaborated_type %p %s\n", $$, $$->type->aggregate.name ? $$->type->aggregate.name->c_str() : "(nil)" );
2310 // for ( Attribute * attr: reverseIterate( $$->attributes ) ) {
2311 // printf( "\tattr %s\n", attr->name.c_str() );
2312 // } // for
2313 }
2314 | enum_type
2315 ;
2316
2317elaborated_type_nobody: // struct, union, enum - {...}
2318 aggregate_type_nobody
2319 | enum_type_nobody
2320 ;
2321
2322aggregate_type: // struct, union
2323 aggregate_key attribute_list_opt
2324 { forall = false; } // reset
2325 '{' field_declaration_list_opt '}' type_parameters_opt
2326 { $$ = DeclarationNode::newAggregate( $1, nullptr, $7, $5, true )->addQualifiers( $2 ); }
2327 | aggregate_key attribute_list_opt identifier
2328 {
2329 typedefTable.makeTypedef( *$3, forall || typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2330 forall = false; // reset
2331 }
2332 '{' field_declaration_list_opt '}' type_parameters_opt
2333 {
2334 // printf( "aggregate_type1 %s\n", $3.str->c_str() );
2335 // if ( $2 )
2336 // for ( Attribute * attr: reverseIterate( $2->attributes ) ) {
2337 // printf( "copySpecifiers12 %s\n", attr->name.c_str() );
2338 // } // for
2339 $$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2340 // printf( "aggregate_type2 %p %s\n", $$, $$->type->aggregate.name ? $$->type->aggregate.name->c_str() : "(nil)" );
2341 // for ( Attribute * attr: reverseIterate( $$->attributes ) ) {
2342 // printf( "aggregate_type3 %s\n", attr->name.c_str() );
2343 // } // for
2344 }
2345 | aggregate_key attribute_list_opt TYPEDEFname // unqualified type name
2346 {
2347 typedefTable.makeTypedef( *$3, forall || typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2348 forall = false; // reset
2349 }
2350 '{' field_declaration_list_opt '}' type_parameters_opt
2351 {
2352 // printf( "AGG3\n" );
2353 DeclarationNode::newFromTypedef( $3 );
2354 $$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2355 }
2356 | aggregate_key attribute_list_opt TYPEGENname // unqualified type name
2357 {
2358 typedefTable.makeTypedef( *$3, forall || typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2359 forall = false; // reset
2360 }
2361 '{' field_declaration_list_opt '}' type_parameters_opt
2362 {
2363 // printf( "AGG4\n" );
2364 DeclarationNode::newFromTypeGen( $3, nullptr );
2365 $$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2366 }
2367 | aggregate_type_nobody
2368 ;
2369
2370type_parameters_opt:
2371 // empty
2372 { $$ = nullptr; } %prec '}'
2373 | '(' type_list ')'
2374 { $$ = $2; }
2375 ;
2376
2377aggregate_type_nobody: // struct, union - {...}
2378 aggregate_key attribute_list_opt identifier
2379 {
2380 typedefTable.makeTypedef( *$3, forall || typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname );
2381 forall = false; // reset
2382 $$ = DeclarationNode::newAggregate( $1, $3, nullptr, nullptr, false )->addQualifiers( $2 );
2383 }
2384 | aggregate_key attribute_list_opt type_name
2385 {
2386 forall = false; // reset
2387 // Create new generic declaration with same name as previous forward declaration, where the IDENTIFIER is
2388 // switched to a TYPEGENname. Link any generic arguments from typegen_name to new generic declaration and
2389 // delete newFromTypeGen.
2390 $$ = DeclarationNode::newAggregate( $1, $3->type->symbolic.name, $3->type->symbolic.actuals, nullptr, false )->addQualifiers( $2 );
2391 $3->type->symbolic.name = nullptr;
2392 $3->type->symbolic.actuals = nullptr;
2393 delete $3;
2394 }
2395 ;
2396
2397aggregate_key:
2398 aggregate_data
2399 | aggregate_control
2400 ;
2401
2402aggregate_data:
2403 STRUCT vtable_opt
2404 { $$ = AggregateDecl::Struct; }
2405 | UNION
2406 { $$ = AggregateDecl::Union; }
2407 | EXCEPTION // CFA
2408 { $$ = AggregateDecl::Exception; }
2409 // { SemanticError( yylloc, "exception aggregate is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2410 ;
2411
2412aggregate_control: // CFA
2413 MONITOR
2414 { $$ = AggregateDecl::Monitor; }
2415 | MUTEX STRUCT
2416 { $$ = AggregateDecl::Monitor; }
2417 | GENERATOR
2418 { $$ = AggregateDecl::Generator; }
2419 | MUTEX GENERATOR
2420 { SemanticError( yylloc, "monitor generator is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2421 | COROUTINE
2422 { $$ = AggregateDecl::Coroutine; }
2423 | MUTEX COROUTINE
2424 { SemanticError( yylloc, "monitor coroutine is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2425 | THREAD
2426 { $$ = AggregateDecl::Thread; }
2427 | MUTEX THREAD
2428 { SemanticError( yylloc, "monitor thread is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2429 ;
2430
2431field_declaration_list_opt:
2432 // empty
2433 { $$ = nullptr; }
2434 | field_declaration_list_opt field_declaration
2435 { $$ = $1 ? $1->appendList( $2 ) : $2; }
2436 ;
2437
2438field_declaration:
2439 type_specifier field_declaring_list_opt ';'
2440 {
2441 // printf( "type_specifier1 %p %s\n", $$, $$->type->aggregate.name ? $$->type->aggregate.name->c_str() : "(nil)" );
2442 $$ = fieldDecl( $1, $2 );
2443 // printf( "type_specifier2 %p %s\n", $$, $$->type->aggregate.name ? $$->type->aggregate.name->c_str() : "(nil)" );
2444 // for ( Attribute * attr: reverseIterate( $$->attributes ) ) {
2445 // printf( "\tattr %s\n", attr->name.c_str() );
2446 // } // for
2447 }
2448 | EXTENSION type_specifier field_declaring_list_opt ';' // GCC
2449 { $$ = fieldDecl( $2, $3 ); distExt( $$ ); }
2450 | INLINE type_specifier field_abstract_list_opt ';' // CFA
2451 {
2452 if ( ! $3 ) { // field declarator ?
2453 $3 = DeclarationNode::newName( nullptr );
2454 } // if
2455 $3->inLine = true;
2456 $$ = distAttr( $2, $3 ); // mark all fields in list
2457 distInl( $3 );
2458 }
2459 | INLINE aggregate_control ';' // CFA
2460 { SemanticError( yylloc, "INLINE aggregate control currently unimplemented." ); $$ = nullptr; }
2461 | typedef_declaration ';' // CFA
2462 | cfa_field_declaring_list ';' // CFA, new style field declaration
2463 | EXTENSION cfa_field_declaring_list ';' // GCC
2464 { distExt( $2 ); $$ = $2; } // mark all fields in list
2465 | INLINE cfa_field_abstract_list ';' // CFA, new style field declaration
2466 { $$ = $2; } // mark all fields in list
2467 | cfa_typedef_declaration ';' // CFA
2468 | static_assert // C11
2469 ;
2470
2471field_declaring_list_opt:
2472 // empty
2473 { $$ = nullptr; }
2474 | field_declarator
2475 | field_declaring_list_opt ',' attribute_list_opt field_declarator
2476 { $$ = $1->appendList( $4->addQualifiers( $3 ) ); }
2477 ;
2478
2479field_declarator:
2480 bit_subrange_size // C special case, no field name
2481 { $$ = DeclarationNode::newBitfield( $1 ); }
2482 | variable_declarator bit_subrange_size_opt
2483 // A semantic check is required to ensure bit_subrange only appears on integral types.
2484 { $$ = $1->addBitfield( $2 ); }
2485 | variable_type_redeclarator bit_subrange_size_opt
2486 // A semantic check is required to ensure bit_subrange only appears on integral types.
2487 { $$ = $1->addBitfield( $2 ); }
2488 ;
2489
2490field_abstract_list_opt:
2491 // empty
2492 { $$ = nullptr; }
2493 | field_abstract
2494 | field_abstract_list_opt ',' attribute_list_opt field_abstract
2495 { $$ = $1->appendList( $4->addQualifiers( $3 ) ); }
2496 ;
2497
2498field_abstract:
2499 // no bit fields
2500 variable_abstract_declarator
2501 ;
2502
2503cfa_field_declaring_list: // CFA, new style field declaration
2504 // bit-fields are handled by C declarations
2505 cfa_abstract_declarator_tuple identifier_or_type_name
2506 { $$ = $1->addName( $2 ); }
2507 | cfa_field_declaring_list ',' identifier_or_type_name
2508 { $$ = $1->appendList( $1->cloneType( $3 ) ); }
2509 ;
2510
2511cfa_field_abstract_list: // CFA, new style field declaration
2512 // bit-fields are handled by C declarations
2513 cfa_abstract_declarator_tuple
2514 | cfa_field_abstract_list ','
2515 { $$ = $1->appendList( $1->cloneType( 0 ) ); }
2516 ;
2517
2518bit_subrange_size_opt:
2519 // empty
2520 { $$ = nullptr; }
2521 | bit_subrange_size
2522 ;
2523
2524bit_subrange_size:
2525 ':' assignment_expression
2526 { $$ = $2; }
2527 ;
2528
2529enum_type:
2530 ENUM attribute_list_opt '{' enumerator_list comma_opt '}'
2531 { $$ = DeclarationNode::newEnum( nullptr, $4, true )->addQualifiers( $2 ); }
2532 | ENUM attribute_list_opt identifier
2533 { typedefTable.makeTypedef( *$3 ); }
2534 '{' enumerator_list comma_opt '}'
2535 { $$ = DeclarationNode::newEnum( $3, $6, true )->addQualifiers( $2 ); }
2536 | ENUM attribute_list_opt typedef_name // unqualified type name
2537 '{' enumerator_list comma_opt '}'
2538 { $$ = DeclarationNode::newEnum( $3->name, $5, true )->addQualifiers( $2 ); }
2539 | ENUM '(' ')' attribute_list_opt '{' enumerator_list comma_opt '}'
2540 { SemanticError( yylloc, "Unvalued enumerated type is currently unimplemented." ); $$ = nullptr; }
2541 | ENUM '(' cfa_abstract_parameter_declaration ')' attribute_list_opt '{' enumerator_list comma_opt '}'
2542 {
2543 if ( $3->storageClasses.val != 0 || $3->type->qualifiers.val != 0 )
2544 { SemanticError( yylloc, "storage-class and CV qualifiers are not meaningful for enumeration constants, which are const." ); }
2545
2546 $$ = DeclarationNode::newEnum( nullptr, $7, true, $3 )->addQualifiers( $5 );
2547 }
2548 | ENUM '(' cfa_abstract_parameter_declaration ')' attribute_list_opt identifier attribute_list_opt
2549 {
2550 if ( $3->storageClasses.val != 0 || $3->type->qualifiers.val != 0 ) { SemanticError( yylloc, "storage-class and CV qualifiers are not meaningful for enumeration constants, which are const." ); }
2551 typedefTable.makeTypedef( *$6 );
2552 }
2553 '{' enumerator_list comma_opt '}'
2554 {
2555 $$ = DeclarationNode::newEnum( $6, $10, true, $3 )->addQualifiers( $5 )->addQualifiers( $7 );
2556 }
2557 | ENUM '(' cfa_abstract_parameter_declaration ')' attribute_list_opt typedef_name attribute_list_opt '{' enumerator_list comma_opt '}'
2558 {
2559 if ( $3->storageClasses.val != 0 || $3->type->qualifiers.val != 0 ) { SemanticError( yylloc, "storage-class and CV qualifiers are not meaningful for enumeration constants, which are const." ); }
2560 typedefTable.makeTypedef( *$6->name );
2561 $$ = DeclarationNode::newEnum( $6->name, $9, true, $3 )->addQualifiers( $5 )->addQualifiers( $7 );
2562 }
2563 | enum_type_nobody
2564 ;
2565
2566enum_type_nobody: // enum - {...}
2567 ENUM attribute_list_opt identifier
2568 { typedefTable.makeTypedef( *$3 ); $$ = DeclarationNode::newEnum( $3, 0, false )->addQualifiers( $2 ); }
2569 | ENUM attribute_list_opt type_name // qualified type name
2570 { typedefTable.makeTypedef( *$3->type->symbolic.name ); $$ = DeclarationNode::newEnum( $3->type->symbolic.name, 0, false )->addQualifiers( $2 ); }
2571 ;
2572
2573enumerator_list:
2574 identifier_or_type_name enumerator_value_opt
2575 { $$ = DeclarationNode::newEnumValueGeneric( $1, $2 ); }
2576 | INLINE type_name
2577 { $$ = DeclarationNode::newEnumValueGeneric( new string("inline"), nullptr ); }
2578 | enumerator_list ',' identifier_or_type_name enumerator_value_opt
2579 { $$ = $1->appendList( DeclarationNode::newEnumValueGeneric( $3, $4 ) ); }
2580 | enumerator_list ',' INLINE type_name enumerator_value_opt
2581 { $$ = $1->appendList( DeclarationNode::newEnumValueGeneric( new string("inline"), nullptr ) ); }
2582 ;
2583
2584enumerator_value_opt:
2585 // empty
2586 { $$ = nullptr; }
2587 | '=' constant_expression { $$ = new InitializerNode( $2 ); }
2588 | '=' '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $3, true ); }
2589 // | simple_assignment_operator initializer
2590 // { $$ = $1 == OperKinds::Assign ? $2 : $2->set_maybeConstructed( false ); }
2591 ;
2592
2593cfa_parameter_ellipsis_list_opt: // CFA, abstract + real
2594 // empty
2595 { $$ = DeclarationNode::newBasicType( DeclarationNode::Void ); }
2596 | ELLIPSIS
2597 { $$ = nullptr; }
2598 | cfa_abstract_parameter_list
2599 | cfa_parameter_list
2600 | cfa_parameter_list pop ',' push cfa_abstract_parameter_list
2601 { $$ = $1->appendList( $5 ); }
2602 | cfa_abstract_parameter_list pop ',' push ELLIPSIS
2603 { $$ = $1->addVarArgs(); }
2604 | cfa_parameter_list pop ',' push ELLIPSIS
2605 { $$ = $1->addVarArgs(); }
2606 ;
2607
2608cfa_parameter_list: // CFA
2609 // To obtain LR(1) between cfa_parameter_list and cfa_abstract_tuple, the last cfa_abstract_parameter_list is
2610 // factored out from cfa_parameter_list, flattening the rules to get lookahead to the ']'.
2611 cfa_parameter_declaration
2612 | cfa_abstract_parameter_list pop ',' push cfa_parameter_declaration
2613 { $$ = $1->appendList( $5 ); }
2614 | cfa_parameter_list pop ',' push cfa_parameter_declaration
2615 { $$ = $1->appendList( $5 ); }
2616 | cfa_parameter_list pop ',' push cfa_abstract_parameter_list pop ',' push cfa_parameter_declaration
2617 { $$ = $1->appendList( $5 )->appendList( $9 ); }
2618 ;
2619
2620cfa_abstract_parameter_list: // CFA, new & old style abstract
2621 cfa_abstract_parameter_declaration
2622 | cfa_abstract_parameter_list pop ',' push cfa_abstract_parameter_declaration
2623 { $$ = $1->appendList( $5 ); }
2624 ;
2625
2626parameter_type_list_opt:
2627 // empty
2628 { $$ = nullptr; }
2629 | ELLIPSIS
2630 { $$ = nullptr; }
2631 | parameter_list
2632 | parameter_list pop ',' push ELLIPSIS
2633 { $$ = $1->addVarArgs(); }
2634 ;
2635
2636parameter_list: // abstract + real
2637 abstract_parameter_declaration
2638 | parameter_declaration
2639 | parameter_list pop ',' push abstract_parameter_declaration
2640 { $$ = $1->appendList( $5 ); }
2641 | parameter_list pop ',' push parameter_declaration
2642 { $$ = $1->appendList( $5 ); }
2643 ;
2644
2645// Provides optional identifier names (abstract_declarator/variable_declarator), no initialization, different semantics
2646// for typedef name by using type_parameter_redeclarator instead of typedef_redeclarator, and function prototypes.
2647
2648cfa_parameter_declaration: // CFA, new & old style parameter declaration
2649 parameter_declaration
2650 | cfa_identifier_parameter_declarator_no_tuple identifier_or_type_name default_initializer_opt
2651 { $$ = $1->addName( $2 ); }
2652 | cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2653 // To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2654 { $$ = $1->addName( $2 ); }
2655 | type_qualifier_list cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2656 { $$ = $2->addName( $3 )->addQualifiers( $1 ); }
2657 | cfa_function_specifier
2658 ;
2659
2660cfa_abstract_parameter_declaration: // CFA, new & old style parameter declaration
2661 abstract_parameter_declaration
2662 | cfa_identifier_parameter_declarator_no_tuple
2663 | cfa_abstract_tuple
2664 // To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2665 | type_qualifier_list cfa_abstract_tuple
2666 { $$ = $2->addQualifiers( $1 ); }
2667 | cfa_abstract_function
2668 ;
2669
2670parameter_declaration:
2671 // No SUE declaration in parameter list.
2672 declaration_specifier_nobody identifier_parameter_declarator default_initializer_opt
2673 { $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2674 | declaration_specifier_nobody type_parameter_redeclarator default_initializer_opt
2675 { $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2676 ;
2677
2678abstract_parameter_declaration:
2679 declaration_specifier_nobody default_initializer_opt
2680 { $$ = $1->addInitializer( $2 ? new InitializerNode( $2 ) : nullptr ); }
2681 | declaration_specifier_nobody abstract_parameter_declarator default_initializer_opt
2682 { $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2683 ;
2684
2685// ISO/IEC 9899:1999 Section 6.9.1(6) : "An identifier declared as a typedef name shall not be redeclared as a
2686// parameter." Because the scope of the K&R-style parameter-list sees the typedef first, the following is based only on
2687// identifiers. The ANSI-style parameter-list can redefine a typedef name.
2688
2689identifier_list: // K&R-style parameter list => no types
2690 identifier
2691 { $$ = DeclarationNode::newName( $1 ); }
2692 | identifier_list ',' identifier
2693 { $$ = $1->appendList( DeclarationNode::newName( $3 ) ); }
2694 ;
2695
2696identifier_or_type_name:
2697 identifier
2698 | TYPEDEFname
2699 | TYPEGENname
2700 ;
2701
2702type_no_function: // sizeof, alignof, cast (constructor)
2703 cfa_abstract_declarator_tuple // CFA
2704 | type_specifier
2705 | type_specifier abstract_declarator
2706 { $$ = $2->addType( $1 ); }
2707 ;
2708
2709type: // typeof, assertion
2710 type_no_function
2711 | cfa_abstract_function // CFA
2712 ;
2713
2714initializer_opt:
2715 // empty
2716 { $$ = nullptr; }
2717 | simple_assignment_operator initializer { $$ = $1 == OperKinds::Assign ? $2 : $2->set_maybeConstructed( false ); }
2718 | '=' VOID { $$ = new InitializerNode( true ); }
2719 | '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $2, true ); }
2720 ;
2721
2722initializer:
2723 assignment_expression { $$ = new InitializerNode( $1 ); }
2724 | '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $2, true ); }
2725 ;
2726
2727initializer_list_opt:
2728 // empty
2729 { $$ = nullptr; }
2730 | initializer
2731 | designation initializer { $$ = $2->set_designators( $1 ); }
2732 | initializer_list_opt ',' initializer { $$ = (InitializerNode *)( $1->set_last( $3 ) ); }
2733 | initializer_list_opt ',' designation initializer { $$ = (InitializerNode *)($1->set_last( $4->set_designators( $3 ) )); }
2734 ;
2735
2736// There is an unreconcileable parsing problem between C99 and CFA with respect to designators. The problem is use of
2737// '=' to separator the designator from the initializer value, as in:
2738//
2739// int x[10] = { [1] = 3 };
2740//
2741// The string "[1] = 3" can be parsed as a designator assignment or a tuple assignment. To disambiguate this case, CFA
2742// changes the syntax from "=" to ":" as the separator between the designator and initializer. GCC does uses ":" for
2743// field selection. The optional use of the "=" in GCC, or in this case ":", cannot be supported either due to
2744// shift/reduce conflicts
2745
2746designation:
2747 designator_list ':' // C99, CFA uses ":" instead of "="
2748 | identifier_at ':' // GCC, field name
2749 { $$ = new ExpressionNode( build_varref( $1 ) ); }
2750 ;
2751
2752designator_list: // C99
2753 designator
2754 | designator_list designator
2755 { $$ = (ExpressionNode *)($1->set_last( $2 )); }
2756 //| designator_list designator { $$ = new ExpressionNode( $1, $2 ); }
2757 ;
2758
2759designator:
2760 '.' identifier_at // C99, field name
2761 { $$ = new ExpressionNode( build_varref( $2 ) ); }
2762 | '[' push assignment_expression pop ']' // C99, single array element
2763 // assignment_expression used instead of constant_expression because of shift/reduce conflicts with tuple.
2764 { $$ = $3; }
2765 | '[' push subrange pop ']' // CFA, multiple array elements
2766 { $$ = $3; }
2767 | '[' push constant_expression ELLIPSIS constant_expression pop ']' // GCC, multiple array elements
2768 { $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild<Expression>( $3 ), maybeMoveBuild<Expression>( $5 ) ) ); }
2769 | '.' '[' push field_name_list pop ']' // CFA, tuple field selector
2770 { $$ = $4; }
2771 ;
2772
2773// The CFA type system is based on parametric polymorphism, the ability to declare functions with type parameters,
2774// rather than an object-oriented type system. This required four groups of extensions:
2775//
2776// Overloading: function, data, and operator identifiers may be overloaded.
2777//
2778// Type declarations: "otype" is used to generate new types for declaring objects. Similarly, "dtype" is used for object
2779// and incomplete types, and "ftype" is used for function types. Type declarations with initializers provide
2780// definitions of new types. Type declarations with storage class "extern" provide opaque types.
2781//
2782// Polymorphic functions: A forall clause declares a type parameter. The corresponding argument is inferred at the call
2783// site. A polymorphic function is not a template; it is a function, with an address and a type.
2784//
2785// Specifications and Assertions: Specifications are collections of declarations parameterized by one or more
2786// types. They serve many of the purposes of abstract classes, and specification hierarchies resemble subclass
2787// hierarchies. Unlike classes, they can define relationships between types. Assertions declare that a type or
2788// types provide the operations declared by a specification. Assertions are normally used to declare requirements
2789// on type arguments of polymorphic functions.
2790
2791type_parameter_list: // CFA
2792 type_parameter
2793 | type_parameter_list ',' type_parameter
2794 { $$ = $1->appendList( $3 ); }
2795 ;
2796
2797type_initializer_opt: // CFA
2798 // empty
2799 { $$ = nullptr; }
2800 | '=' type
2801 { $$ = $2; }
2802 ;
2803
2804type_parameter: // CFA
2805 type_class identifier_or_type_name
2806 {
2807 typedefTable.addToScope( *$2, TYPEDEFname, "9" );
2808 if ( $1 == TypeDecl::Otype ) { SemanticError( yylloc, "otype keyword is deprecated, use T " ); }
2809 if ( $1 == TypeDecl::Dtype ) { SemanticError( yylloc, "dtype keyword is deprecated, use T &" ); }
2810 if ( $1 == TypeDecl::Ttype ) { SemanticError( yylloc, "ttype keyword is deprecated, use T ..." ); }
2811 }
2812 type_initializer_opt assertion_list_opt
2813 { $$ = DeclarationNode::newTypeParam( $1, $2 )->addTypeInitializer( $4 )->addAssertions( $5 ); }
2814 | identifier_or_type_name new_type_class
2815 { typedefTable.addToScope( *$1, TYPEDEFname, "9" ); }
2816 type_initializer_opt assertion_list_opt
2817 { $$ = DeclarationNode::newTypeParam( $2, $1 )->addTypeInitializer( $4 )->addAssertions( $5 ); }
2818 | '[' identifier_or_type_name ']'
2819 {
2820 typedefTable.addToScope( *$2, TYPEDIMname, "9" );
2821 $$ = DeclarationNode::newTypeParam( TypeDecl::Dimension, $2 );
2822 }
2823 // | type_specifier identifier_parameter_declarator
2824 | assertion_list
2825 { $$ = DeclarationNode::newTypeParam( TypeDecl::Dtype, new string( DeclarationNode::anonymous.newName() ) )->addAssertions( $1 ); }
2826 ;
2827
2828new_type_class: // CFA
2829 // empty
2830 { $$ = TypeDecl::Otype; }
2831 | '&'
2832 { $$ = TypeDecl::Dtype; }
2833 | '*'
2834 { $$ = TypeDecl::DStype; } // dtype + sized
2835 // | '(' '*' ')'
2836 // { $$ = TypeDecl::Ftype; }
2837 | ELLIPSIS
2838 { $$ = TypeDecl::Ttype; }
2839 ;
2840
2841type_class: // CFA
2842 OTYPE
2843 { $$ = TypeDecl::Otype; }
2844 | DTYPE
2845 { $$ = TypeDecl::Dtype; }
2846 | FTYPE
2847 { $$ = TypeDecl::Ftype; }
2848 | TTYPE
2849 { $$ = TypeDecl::Ttype; }
2850 ;
2851
2852assertion_list_opt: // CFA
2853 // empty
2854 { $$ = nullptr; }
2855 | assertion_list
2856 ;
2857
2858assertion_list: // CFA
2859 assertion
2860 | assertion_list assertion
2861 { $$ = $1->appendList( $2 ); }
2862 ;
2863
2864assertion: // CFA
2865 '|' identifier_or_type_name '(' type_list ')'
2866 { $$ = DeclarationNode::newTraitUse( $2, $4 ); }
2867 | '|' '{' push trait_declaration_list pop '}'
2868 { $$ = $4; }
2869 // | '|' '(' push type_parameter_list pop ')' '{' push trait_declaration_list pop '}' '(' type_list ')'
2870 // { SemanticError( yylloc, "Generic data-type assertion is currently unimplemented." ); $$ = nullptr; }
2871 ;
2872
2873type_list: // CFA
2874 type
2875 { $$ = new ExpressionNode( new TypeExpr( maybeMoveBuildType( $1 ) ) ); }
2876 | assignment_expression
2877 | type_list ',' type
2878 { $$ = (ExpressionNode *)($1->set_last( new ExpressionNode( new TypeExpr( maybeMoveBuildType( $3 ) ) ) )); }
2879 | type_list ',' assignment_expression
2880 { $$ = (ExpressionNode *)( $1->set_last( $3 )); }
2881 ;
2882
2883type_declaring_list: // CFA
2884 OTYPE type_declarator
2885 { $$ = $2; }
2886 | storage_class_list OTYPE type_declarator
2887 { $$ = $3->addQualifiers( $1 ); }
2888 | type_declaring_list ',' type_declarator
2889 { $$ = $1->appendList( $3->copySpecifiers( $1 ) ); }
2890 ;
2891
2892type_declarator: // CFA
2893 type_declarator_name assertion_list_opt
2894 { $$ = $1->addAssertions( $2 ); }
2895 | type_declarator_name assertion_list_opt '=' type
2896 { $$ = $1->addAssertions( $2 )->addType( $4 ); }
2897 ;
2898
2899type_declarator_name: // CFA
2900 identifier_or_type_name
2901 {
2902 typedefTable.addToEnclosingScope( *$1, TYPEDEFname, "10" );
2903 $$ = DeclarationNode::newTypeDecl( $1, 0 );
2904 }
2905 | identifier_or_type_name '(' type_parameter_list ')'
2906 {
2907 typedefTable.addToEnclosingScope( *$1, TYPEGENname, "11" );
2908 $$ = DeclarationNode::newTypeDecl( $1, $3 );
2909 }
2910 ;
2911
2912trait_specifier: // CFA
2913 TRAIT identifier_or_type_name '(' type_parameter_list ')' '{' '}'
2914 { $$ = DeclarationNode::newTrait( $2, $4, 0 ); }
2915 | TRAIT identifier_or_type_name '(' type_parameter_list ')' '{' push trait_declaration_list pop '}'
2916 { $$ = DeclarationNode::newTrait( $2, $4, $8 ); }
2917 ;
2918
2919trait_declaration_list: // CFA
2920 trait_declaration
2921 | trait_declaration_list pop push trait_declaration
2922 { $$ = $1->appendList( $4 ); }
2923 ;
2924
2925trait_declaration: // CFA
2926 cfa_trait_declaring_list ';'
2927 | trait_declaring_list ';'
2928 ;
2929
2930cfa_trait_declaring_list: // CFA
2931 cfa_variable_specifier
2932 | cfa_function_specifier
2933 | cfa_trait_declaring_list pop ',' push identifier_or_type_name
2934 { $$ = $1->appendList( $1->cloneType( $5 ) ); }
2935 ;
2936
2937trait_declaring_list: // CFA
2938 type_specifier declarator
2939 { $$ = $2->addType( $1 ); }
2940 | trait_declaring_list pop ',' push declarator
2941 { $$ = $1->appendList( $1->cloneBaseType( $5 ) ); }
2942 ;
2943
2944//***************************** EXTERNAL DEFINITIONS *****************************
2945
2946translation_unit:
2947 // empty, input file
2948 | external_definition_list
2949 { parseTree = parseTree ? parseTree->appendList( $1 ) : $1; }
2950 ;
2951
2952external_definition_list:
2953 push external_definition pop
2954 { $$ = $2; }
2955 | external_definition_list push external_definition pop
2956 { $$ = $1 ? $1->appendList( $3 ) : $3; }
2957 ;
2958
2959external_definition_list_opt:
2960 // empty
2961 { $$ = nullptr; }
2962 | external_definition_list
2963 ;
2964
2965up:
2966 { typedefTable.up( forall ); forall = false; }
2967 ;
2968
2969down:
2970 { typedefTable.down(); }
2971 ;
2972
2973external_definition:
2974 DIRECTIVE
2975 { $$ = DeclarationNode::newDirectiveStmt( new StatementNode( build_directive( $1 ) ) ); }
2976 | declaration
2977 | external_function_definition
2978 | EXTENSION external_definition // GCC, multiple __extension__ allowed, meaning unknown
2979 {
2980 distExt( $2 ); // mark all fields in list
2981 $$ = $2;
2982 }
2983 | ASM '(' string_literal ')' ';' // GCC, global assembler statement
2984 { $$ = DeclarationNode::newAsmStmt( new StatementNode( build_asm( false, $3, 0 ) ) ); }
2985 | EXTERN STRINGliteral
2986 {
2987 linkageStack.push( linkage ); // handle nested extern "C"/"Cforall"
2988 linkage = LinkageSpec::update( yylloc, linkage, $2 );
2989 }
2990 up external_definition down
2991 {
2992 linkage = linkageStack.top();
2993 linkageStack.pop();
2994 $$ = $5;
2995 }
2996 | EXTERN STRINGliteral // C++-style linkage specifier
2997 {
2998 linkageStack.push( linkage ); // handle nested extern "C"/"Cforall"
2999 linkage = LinkageSpec::update( yylloc, linkage, $2 );
3000 }
3001 '{' up external_definition_list_opt down '}'
3002 {
3003 linkage = linkageStack.top();
3004 linkageStack.pop();
3005 $$ = $6;
3006 }
3007 | type_qualifier_list
3008 {
3009 if ( $1->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
3010 if ( $1->type->forall ) forall = true; // remember generic type
3011 }
3012 '{' up external_definition_list_opt down '}' // CFA, namespace
3013 {
3014 distQual( $5, $1 );
3015 forall = false;
3016 $$ = $5;
3017 }
3018 | declaration_qualifier_list
3019 {
3020 if ( $1->type && $1->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
3021 if ( $1->type && $1->type->forall ) forall = true; // remember generic type
3022 }
3023 '{' up external_definition_list_opt down '}' // CFA, namespace
3024 {
3025 distQual( $5, $1 );
3026 forall = false;
3027 $$ = $5;
3028 }
3029 | declaration_qualifier_list type_qualifier_list
3030 {
3031 if ( ($1->type && $1->type->qualifiers.val) || $2->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
3032 if ( ($1->type && $1->type->forall) || $2->type->forall ) forall = true; // remember generic type
3033 }
3034 '{' up external_definition_list_opt down '}' // CFA, namespace
3035 {
3036 distQual( $6, $1->addQualifiers( $2 ) );
3037 forall = false;
3038 $$ = $6;
3039 }
3040 ;
3041
3042external_function_definition:
3043 function_definition
3044 // These rules are a concession to the "implicit int" type_specifier because there is a significant amount of
3045 // legacy code with global functions missing the type-specifier for the return type, and assuming "int".
3046 // Parsing is possible because function_definition does not appear in the context of an expression (nested
3047 // functions preclude this concession, i.e., all nested function must have a return type). A function prototype
3048 // declaration must still have a type_specifier. OBSOLESCENT (see 1)
3049 | function_declarator compound_statement
3050 { $$ = $1->addFunctionBody( $2 ); }
3051 | KR_function_declarator KR_parameter_list_opt compound_statement
3052 { $$ = $1->addOldDeclList( $2 )->addFunctionBody( $3 ); }
3053 ;
3054
3055with_clause_opt:
3056 // empty
3057 { $$ = nullptr; forall = false; }
3058 | WITH '(' tuple_expression_list ')' attribute_list_opt
3059 {
3060 $$ = $3; forall = false;
3061 if ( $5 ) {
3062 SemanticError( yylloc, "Attributes cannot be associated with function body. Move attribute(s) before \"with\" clause." );
3063 $$ = nullptr;
3064 } // if
3065 }
3066 ;
3067
3068function_definition:
3069 cfa_function_declaration with_clause_opt compound_statement // CFA
3070 {
3071 // Add the function body to the last identifier in the function definition list, i.e., foo3:
3072 // [const double] foo1(), foo2( int ), foo3( double ) { return 3.0; }
3073 $1->get_last()->addFunctionBody( $3, $2 );
3074 $$ = $1;
3075 }
3076 | declaration_specifier function_declarator with_clause_opt compound_statement
3077 {
3078 rebindForall( $1, $2 );
3079 $$ = $2->addFunctionBody( $4, $3 )->addType( $1 );
3080 }
3081 | declaration_specifier variable_type_redeclarator with_clause_opt compound_statement
3082 {
3083 rebindForall( $1, $2 );
3084 $$ = $2->addFunctionBody( $4, $3 )->addType( $1 );
3085 }
3086 // handles default int return type, OBSOLESCENT (see 1)
3087 | type_qualifier_list function_declarator with_clause_opt compound_statement
3088 { $$ = $2->addFunctionBody( $4, $3 )->addQualifiers( $1 ); }
3089 // handles default int return type, OBSOLESCENT (see 1)
3090 | declaration_qualifier_list function_declarator with_clause_opt compound_statement
3091 { $$ = $2->addFunctionBody( $4, $3 )->addQualifiers( $1 ); }
3092 // handles default int return type, OBSOLESCENT (see 1)
3093 | declaration_qualifier_list type_qualifier_list function_declarator with_clause_opt compound_statement
3094 { $$ = $3->addFunctionBody( $5, $4 )->addQualifiers( $2 )->addQualifiers( $1 ); }
3095
3096 // Old-style K&R function definition, OBSOLESCENT (see 4)
3097 | declaration_specifier KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
3098 {
3099 rebindForall( $1, $2 );
3100 $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addType( $1 );
3101 }
3102 // handles default int return type, OBSOLESCENT (see 1)
3103 | type_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
3104 { $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addQualifiers( $1 ); }
3105 // handles default int return type, OBSOLESCENT (see 1)
3106 | declaration_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
3107 { $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addQualifiers( $1 ); }
3108 // handles default int return type, OBSOLESCENT (see 1)
3109 | declaration_qualifier_list type_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
3110 { $$ = $3->addOldDeclList( $4 )->addFunctionBody( $6, $5 )->addQualifiers( $2 )->addQualifiers( $1 ); }
3111 ;
3112
3113declarator:
3114 variable_declarator
3115 | variable_type_redeclarator
3116 | function_declarator
3117 ;
3118
3119subrange:
3120 constant_expression '~' constant_expression // CFA, integer subrange
3121 { $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild<Expression>( $1 ), maybeMoveBuild<Expression>( $3 ) ) ); }
3122 ;
3123
3124asm_name_opt: // GCC
3125 // empty
3126 { $$ = nullptr; }
3127 | ASM '(' string_literal ')' attribute_list_opt
3128 {
3129 DeclarationNode * name = new DeclarationNode();
3130 name->asmName = $3;
3131 $$ = name->addQualifiers( $5 );
3132 }
3133 ;
3134
3135attribute_list_opt: // GCC
3136 // empty
3137 { $$ = nullptr; }
3138 | attribute_list
3139 ;
3140
3141attribute_list: // GCC
3142 attribute
3143 | attribute_list attribute
3144 { $$ = $2->addQualifiers( $1 ); }
3145 ;
3146
3147attribute: // GCC
3148 ATTRIBUTE '(' '(' attribute_name_list ')' ')'
3149 { $$ = $4; }
3150 ;
3151
3152attribute_name_list: // GCC
3153 attribute_name
3154 | attribute_name_list ',' attribute_name
3155 { $$ = $3->addQualifiers( $1 ); }
3156 ;
3157
3158attribute_name: // GCC
3159 // empty
3160 { $$ = nullptr; }
3161 | attr_name
3162 { $$ = DeclarationNode::newAttribute( $1 ); }
3163 | attr_name '(' argument_expression_list_opt ')'
3164 { $$ = DeclarationNode::newAttribute( $1, $3 ); }
3165 ;
3166
3167attr_name: // GCC
3168 IDENTIFIER
3169 | quasi_keyword
3170 | TYPEDEFname
3171 | TYPEGENname
3172 | FALLTHROUGH
3173 { $$ = Token{ new string( "fallthrough" ), { nullptr, -1 } }; }
3174 | CONST
3175 { $$ = Token{ new string( "__const__" ), { nullptr, -1 } }; }
3176 ;
3177
3178// ============================================================================
3179// The following sections are a series of grammar patterns used to parse declarators. Multiple patterns are necessary
3180// because the type of an identifier in wrapped around the identifier in the same form as its usage in an expression, as
3181// in:
3182//
3183// int (*f())[10] { ... };
3184// ... (*f())[3] += 1; // definition mimics usage
3185//
3186// Because these patterns are highly recursive, changes at a lower level in the recursion require copying some or all of
3187// the pattern. Each of these patterns has some subtle variation to ensure correct syntax in a particular context.
3188// ============================================================================
3189
3190// ----------------------------------------------------------------------------
3191// The set of valid declarators before a compound statement for defining a function is less than the set of declarators
3192// to define a variable or function prototype, e.g.:
3193//
3194// valid declaration invalid definition
3195// ----------------- ------------------
3196// int f; int f {}
3197// int *f; int *f {}
3198// int f[10]; int f[10] {}
3199// int (*f)(int); int (*f)(int) {}
3200//
3201// To preclude this syntactic anomaly requires separating the grammar rules for variable and function declarators, hence
3202// variable_declarator and function_declarator.
3203// ----------------------------------------------------------------------------
3204
3205// This pattern parses a declaration of a variable that is not redefining a typedef name. The pattern precludes
3206// declaring an array of functions versus a pointer to an array of functions.
3207
3208paren_identifier:
3209 identifier_at
3210 { $$ = DeclarationNode::newName( $1 ); }
3211 | '(' paren_identifier ')' // redundant parenthesis
3212 { $$ = $2; }
3213 ;
3214
3215variable_declarator:
3216 paren_identifier attribute_list_opt
3217 { $$ = $1->addQualifiers( $2 ); }
3218 | variable_ptr
3219 | variable_array attribute_list_opt
3220 { $$ = $1->addQualifiers( $2 ); }
3221 | variable_function attribute_list_opt
3222 { $$ = $1->addQualifiers( $2 ); }
3223 ;
3224
3225variable_ptr:
3226 ptrref_operator variable_declarator
3227 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3228 | ptrref_operator type_qualifier_list variable_declarator
3229 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3230 | '(' variable_ptr ')' attribute_list_opt // redundant parenthesis
3231 { $$ = $2->addQualifiers( $4 ); }
3232 | '(' attribute_list variable_ptr ')' attribute_list_opt // redundant parenthesis
3233 { $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3234 ;
3235
3236variable_array:
3237 paren_identifier array_dimension
3238 { $$ = $1->addArray( $2 ); }
3239 | '(' variable_ptr ')' array_dimension
3240 { $$ = $2->addArray( $4 ); }
3241 | '(' attribute_list variable_ptr ')' array_dimension
3242 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3243 | '(' variable_array ')' multi_array_dimension // redundant parenthesis
3244 { $$ = $2->addArray( $4 ); }
3245 | '(' attribute_list variable_array ')' multi_array_dimension // redundant parenthesis
3246 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3247 | '(' variable_array ')' // redundant parenthesis
3248 { $$ = $2; }
3249 | '(' attribute_list variable_array ')' // redundant parenthesis
3250 { $$ = $3->addQualifiers( $2 ); }
3251 ;
3252
3253variable_function:
3254 '(' variable_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3255 { $$ = $2->addParamList( $6 ); }
3256 | '(' attribute_list variable_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3257 { $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3258 | '(' variable_function ')' // redundant parenthesis
3259 { $$ = $2; }
3260 | '(' attribute_list variable_function ')' // redundant parenthesis
3261 { $$ = $3->addQualifiers( $2 ); }
3262 ;
3263
3264// This pattern parses a function declarator that is not redefining a typedef name. For non-nested functions, there is
3265// no context where a function definition can redefine a typedef name, i.e., the typedef and function name cannot exist
3266// is the same scope. The pattern precludes returning arrays and functions versus pointers to arrays and functions.
3267
3268function_declarator:
3269 function_no_ptr attribute_list_opt
3270 { $$ = $1->addQualifiers( $2 ); }
3271 | function_ptr
3272 | function_array attribute_list_opt
3273 { $$ = $1->addQualifiers( $2 ); }
3274 ;
3275
3276function_no_ptr:
3277 paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3278 { $$ = $1->addParamList( $4 ); }
3279 | '(' function_ptr ')' '(' push parameter_type_list_opt pop ')'
3280 { $$ = $2->addParamList( $6 ); }
3281 | '(' attribute_list function_ptr ')' '(' push parameter_type_list_opt pop ')'
3282 { $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3283 | '(' function_no_ptr ')' // redundant parenthesis
3284 { $$ = $2; }
3285 | '(' attribute_list function_no_ptr ')' // redundant parenthesis
3286 { $$ = $3->addQualifiers( $2 ); }
3287 ;
3288
3289function_ptr:
3290 ptrref_operator function_declarator
3291 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3292 | ptrref_operator type_qualifier_list function_declarator
3293 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3294 | '(' function_ptr ')' attribute_list_opt
3295 { $$ = $2->addQualifiers( $4 ); }
3296 | '(' attribute_list function_ptr ')' attribute_list_opt
3297 { $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3298 ;
3299
3300function_array:
3301 '(' function_ptr ')' array_dimension
3302 { $$ = $2->addArray( $4 ); }
3303 | '(' attribute_list function_ptr ')' array_dimension
3304 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3305 | '(' function_array ')' multi_array_dimension // redundant parenthesis
3306 { $$ = $2->addArray( $4 ); }
3307 | '(' attribute_list function_array ')' multi_array_dimension // redundant parenthesis
3308 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3309 | '(' function_array ')' // redundant parenthesis
3310 { $$ = $2; }
3311 | '(' attribute_list function_array ')' // redundant parenthesis
3312 { $$ = $3->addQualifiers( $2 ); }
3313 ;
3314
3315// This pattern parses an old-style K&R function declarator (OBSOLESCENT, see 4)
3316//
3317// f( a, b, c ) int a, *b, c[]; {}
3318//
3319// that is not redefining a typedef name (see function_declarator for additional comments). The pattern precludes
3320// returning arrays and functions versus pointers to arrays and functions.
3321
3322KR_function_declarator:
3323 KR_function_no_ptr
3324 | KR_function_ptr
3325 | KR_function_array
3326 ;
3327
3328KR_function_no_ptr:
3329 paren_identifier '(' identifier_list ')' // function_declarator handles empty parameter
3330 { $$ = $1->addIdList( $3 ); }
3331 | '(' KR_function_ptr ')' '(' push parameter_type_list_opt pop ')'
3332 { $$ = $2->addParamList( $6 ); }
3333 | '(' attribute_list KR_function_ptr ')' '(' push parameter_type_list_opt pop ')'
3334 { $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3335 | '(' KR_function_no_ptr ')' // redundant parenthesis
3336 { $$ = $2; }
3337 | '(' attribute_list KR_function_no_ptr ')' // redundant parenthesis
3338 { $$ = $3->addQualifiers( $2 ); }
3339 ;
3340
3341KR_function_ptr:
3342 ptrref_operator KR_function_declarator
3343 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3344 | ptrref_operator type_qualifier_list KR_function_declarator
3345 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3346 | '(' KR_function_ptr ')'
3347 { $$ = $2; }
3348 | '(' attribute_list KR_function_ptr ')'
3349 { $$ = $3->addQualifiers( $2 ); }
3350 ;
3351
3352KR_function_array:
3353 '(' KR_function_ptr ')' array_dimension
3354 { $$ = $2->addArray( $4 ); }
3355 | '(' attribute_list KR_function_ptr ')' array_dimension
3356 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3357 | '(' KR_function_array ')' multi_array_dimension // redundant parenthesis
3358 { $$ = $2->addArray( $4 ); }
3359 | '(' attribute_list KR_function_array ')' multi_array_dimension // redundant parenthesis
3360 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3361 | '(' KR_function_array ')' // redundant parenthesis
3362 { $$ = $2; }
3363 | '(' attribute_list KR_function_array ')' // redundant parenthesis
3364 { $$ = $3->addQualifiers( $2 ); }
3365 ;
3366
3367// This pattern parses a declaration for a variable or function prototype that redefines a type name, e.g.:
3368//
3369// typedef int foo;
3370// {
3371// int foo; // redefine typedef name in new scope
3372// }
3373//
3374// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3375// and functions versus pointers to arrays and functions.
3376
3377paren_type:
3378 typedef_name
3379 {
3380 // hide type name in enclosing scope by variable name
3381 typedefTable.addToEnclosingScope( *$1->name, IDENTIFIER, "ID" );
3382 }
3383 | '(' paren_type ')'
3384 { $$ = $2; }
3385 ;
3386
3387variable_type_redeclarator:
3388 paren_type attribute_list_opt
3389 { $$ = $1->addQualifiers( $2 ); }
3390 | type_ptr
3391 | type_array attribute_list_opt
3392 { $$ = $1->addQualifiers( $2 ); }
3393 | type_function attribute_list_opt
3394 { $$ = $1->addQualifiers( $2 ); }
3395 ;
3396
3397type_ptr:
3398 ptrref_operator variable_type_redeclarator
3399 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3400 | ptrref_operator type_qualifier_list variable_type_redeclarator
3401 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3402 | '(' type_ptr ')' attribute_list_opt // redundant parenthesis
3403 { $$ = $2->addQualifiers( $4 ); }
3404 | '(' attribute_list type_ptr ')' attribute_list_opt // redundant parenthesis
3405 { $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3406 ;
3407
3408type_array:
3409 paren_type array_dimension
3410 { $$ = $1->addArray( $2 ); }
3411 | '(' type_ptr ')' array_dimension
3412 { $$ = $2->addArray( $4 ); }
3413 | '(' attribute_list type_ptr ')' array_dimension
3414 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3415 | '(' type_array ')' multi_array_dimension // redundant parenthesis
3416 { $$ = $2->addArray( $4 ); }
3417 | '(' attribute_list type_array ')' multi_array_dimension // redundant parenthesis
3418 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3419 | '(' type_array ')' // redundant parenthesis
3420 { $$ = $2; }
3421 | '(' attribute_list type_array ')' // redundant parenthesis
3422 { $$ = $3->addQualifiers( $2 ); }
3423 ;
3424
3425type_function:
3426 paren_type '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3427 { $$ = $1->addParamList( $4 ); }
3428 | '(' type_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3429 { $$ = $2->addParamList( $6 ); }
3430 | '(' attribute_list type_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3431 { $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3432 | '(' type_function ')' // redundant parenthesis
3433 { $$ = $2; }
3434 | '(' attribute_list type_function ')' // redundant parenthesis
3435 { $$ = $3->addQualifiers( $2 ); }
3436 ;
3437
3438// This pattern parses a declaration for a parameter variable of a function prototype or actual that is not redefining a
3439// typedef name and allows the C99 array options, which can only appear in a parameter list. The pattern precludes
3440// declaring an array of functions versus a pointer to an array of functions, and returning arrays and functions versus
3441// pointers to arrays and functions.
3442
3443identifier_parameter_declarator:
3444 paren_identifier attribute_list_opt
3445 { $$ = $1->addQualifiers( $2 ); }
3446 | '&' MUTEX paren_identifier attribute_list_opt
3447 { $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3448 | identifier_parameter_ptr
3449 | identifier_parameter_array attribute_list_opt
3450 { $$ = $1->addQualifiers( $2 ); }
3451 | identifier_parameter_function attribute_list_opt
3452 { $$ = $1->addQualifiers( $2 ); }
3453 ;
3454
3455identifier_parameter_ptr:
3456 ptrref_operator identifier_parameter_declarator
3457 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3458 | ptrref_operator type_qualifier_list identifier_parameter_declarator
3459 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3460 | '(' identifier_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3461 { $$ = $2->addQualifiers( $4 ); }
3462 ;
3463
3464identifier_parameter_array:
3465 paren_identifier array_parameter_dimension
3466 { $$ = $1->addArray( $2 ); }
3467 | '(' identifier_parameter_ptr ')' array_dimension
3468 { $$ = $2->addArray( $4 ); }
3469 | '(' identifier_parameter_array ')' multi_array_dimension // redundant parenthesis
3470 { $$ = $2->addArray( $4 ); }
3471 | '(' identifier_parameter_array ')' // redundant parenthesis
3472 { $$ = $2; }
3473 ;
3474
3475identifier_parameter_function:
3476 paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3477 { $$ = $1->addParamList( $4 ); }
3478 | '(' identifier_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3479 { $$ = $2->addParamList( $6 ); }
3480 | '(' identifier_parameter_function ')' // redundant parenthesis
3481 { $$ = $2; }
3482 ;
3483
3484// This pattern parses a declaration for a parameter variable or function prototype that is redefining a typedef name,
3485// e.g.:
3486//
3487// typedef int foo;
3488// forall( otype T ) struct foo;
3489// int f( int foo ); // redefine typedef name in new scope
3490//
3491// and allows the C99 array options, which can only appear in a parameter list.
3492
3493type_parameter_redeclarator:
3494 typedef_name attribute_list_opt
3495 { $$ = $1->addQualifiers( $2 ); }
3496 | '&' MUTEX typedef_name attribute_list_opt
3497 { $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3498 | type_parameter_ptr
3499 | type_parameter_array attribute_list_opt
3500 { $$ = $1->addQualifiers( $2 ); }
3501 | type_parameter_function attribute_list_opt
3502 { $$ = $1->addQualifiers( $2 ); }
3503 ;
3504
3505typedef_name:
3506 TYPEDEFname
3507 { $$ = DeclarationNode::newName( $1 ); }
3508 | TYPEGENname
3509 { $$ = DeclarationNode::newName( $1 ); }
3510 ;
3511
3512type_parameter_ptr:
3513 ptrref_operator type_parameter_redeclarator
3514 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3515 | ptrref_operator type_qualifier_list type_parameter_redeclarator
3516 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3517 | '(' type_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3518 { $$ = $2->addQualifiers( $4 ); }
3519 ;
3520
3521type_parameter_array:
3522 typedef_name array_parameter_dimension
3523 { $$ = $1->addArray( $2 ); }
3524 | '(' type_parameter_ptr ')' array_parameter_dimension
3525 { $$ = $2->addArray( $4 ); }
3526 ;
3527
3528type_parameter_function:
3529 typedef_name '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3530 { $$ = $1->addParamList( $4 ); }
3531 | '(' type_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3532 { $$ = $2->addParamList( $6 ); }
3533 ;
3534
3535// This pattern parses a declaration of an abstract variable or function prototype, i.e., there is no identifier to
3536// which the type applies, e.g.:
3537//
3538// sizeof( int );
3539// sizeof( int * );
3540// sizeof( int [10] );
3541// sizeof( int (*)() );
3542// sizeof( int () );
3543//
3544// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3545// and functions versus pointers to arrays and functions.
3546
3547abstract_declarator:
3548 abstract_ptr
3549 | abstract_array attribute_list_opt
3550 { $$ = $1->addQualifiers( $2 ); }
3551 | abstract_function attribute_list_opt
3552 { $$ = $1->addQualifiers( $2 ); }
3553 ;
3554
3555abstract_ptr:
3556 ptrref_operator
3557 { $$ = DeclarationNode::newPointer( 0, $1 ); }
3558 | ptrref_operator type_qualifier_list
3559 { $$ = DeclarationNode::newPointer( $2, $1 ); }
3560 | ptrref_operator abstract_declarator
3561 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3562 | ptrref_operator type_qualifier_list abstract_declarator
3563 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3564 | '(' abstract_ptr ')' attribute_list_opt
3565 { $$ = $2->addQualifiers( $4 ); }
3566 ;
3567
3568abstract_array:
3569 array_dimension
3570 | '(' abstract_ptr ')' array_dimension
3571 { $$ = $2->addArray( $4 ); }
3572 | '(' abstract_array ')' multi_array_dimension // redundant parenthesis
3573 { $$ = $2->addArray( $4 ); }
3574 | '(' abstract_array ')' // redundant parenthesis
3575 { $$ = $2; }
3576 ;
3577
3578abstract_function:
3579 '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3580 { $$ = DeclarationNode::newFunction( nullptr, nullptr, $3, nullptr ); }
3581 | '(' abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3582 { $$ = $2->addParamList( $6 ); }
3583 | '(' abstract_function ')' // redundant parenthesis
3584 { $$ = $2; }
3585 ;
3586
3587array_dimension:
3588 // Only the first dimension can be empty.
3589 '[' ']'
3590 { $$ = DeclarationNode::newArray( 0, 0, false ); }
3591 | '[' ']' multi_array_dimension
3592 { $$ = DeclarationNode::newArray( 0, 0, false )->addArray( $3 ); }
3593 | '[' push assignment_expression pop ',' comma_expression ']'
3594 { $$ = DeclarationNode::newArray( $3, 0, false )->addArray( DeclarationNode::newArray( $6, 0, false ) ); }
3595 // { SemanticError( yylloc, "New array dimension is currently unimplemented." ); $$ = nullptr; }
3596 | multi_array_dimension
3597 ;
3598
3599multi_array_dimension:
3600 '[' push assignment_expression pop ']'
3601 { $$ = DeclarationNode::newArray( $3, 0, false ); }
3602 | '[' push '*' pop ']' // C99
3603 { $$ = DeclarationNode::newVarArray( 0 ); }
3604 | multi_array_dimension '[' push assignment_expression pop ']'
3605 { $$ = $1->addArray( DeclarationNode::newArray( $4, 0, false ) ); }
3606 | multi_array_dimension '[' push '*' pop ']' // C99
3607 { $$ = $1->addArray( DeclarationNode::newVarArray( 0 ) ); }
3608 ;
3609
3610// This pattern parses a declaration of a parameter abstract variable or function prototype, i.e., there is no
3611// identifier to which the type applies, e.g.:
3612//
3613// int f( int ); // not handled here
3614// int f( int * ); // abstract function-prototype parameter; no parameter name specified
3615// int f( int (*)() ); // abstract function-prototype parameter; no parameter name specified
3616// int f( int (int) ); // abstract function-prototype parameter; no parameter name specified
3617//
3618// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3619// and functions versus pointers to arrays and functions. In addition, the pattern handles the
3620// special meaning of parenthesis around a typedef name:
3621//
3622// ISO/IEC 9899:1999 Section 6.7.5.3(11) : "In a parameter declaration, a single typedef name in
3623// parentheses is taken to be an abstract declarator that specifies a function with a single parameter,
3624// not as redundant parentheses around the identifier."
3625//
3626// For example:
3627//
3628// typedef float T;
3629// int f( int ( T [5] ) ); // see abstract_parameter_declarator
3630// int g( int ( T ( int ) ) ); // see abstract_parameter_declarator
3631// int f( int f1( T a[5] ) ); // see identifier_parameter_declarator
3632// int g( int g1( T g2( int p ) ) ); // see identifier_parameter_declarator
3633//
3634// In essence, a '(' immediately to the left of typedef name, T, is interpreted as starting a parameter type list, and
3635// not as redundant parentheses around a redeclaration of T. Finally, the pattern also precludes declaring an array of
3636// functions versus a pointer to an array of functions, and returning arrays and functions versus pointers to arrays and
3637// functions.
3638
3639abstract_parameter_declarator:
3640 abstract_parameter_ptr
3641 | '&' MUTEX attribute_list_opt
3642 { $$ = DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf )->addQualifiers( $3 ); }
3643 | abstract_parameter_array attribute_list_opt
3644 { $$ = $1->addQualifiers( $2 ); }
3645 | abstract_parameter_function attribute_list_opt
3646 { $$ = $1->addQualifiers( $2 ); }
3647 ;
3648
3649abstract_parameter_ptr:
3650 ptrref_operator
3651 { $$ = DeclarationNode::newPointer( nullptr, $1 ); }
3652 | ptrref_operator type_qualifier_list
3653 { $$ = DeclarationNode::newPointer( $2, $1 ); }
3654 | ptrref_operator abstract_parameter_declarator
3655 { $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3656 | ptrref_operator type_qualifier_list abstract_parameter_declarator
3657 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3658 | '(' abstract_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3659 { $$ = $2->addQualifiers( $4 ); }
3660 ;
3661
3662abstract_parameter_array:
3663 array_parameter_dimension
3664 | '(' abstract_parameter_ptr ')' array_parameter_dimension
3665 { $$ = $2->addArray( $4 ); }
3666 | '(' abstract_parameter_array ')' multi_array_dimension // redundant parenthesis
3667 { $$ = $2->addArray( $4 ); }
3668 | '(' abstract_parameter_array ')' // redundant parenthesis
3669 { $$ = $2; }
3670 ;
3671
3672abstract_parameter_function:
3673 '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3674 { $$ = DeclarationNode::newFunction( nullptr, nullptr, $3, nullptr ); }
3675 | '(' abstract_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3676 { $$ = $2->addParamList( $6 ); }
3677 | '(' abstract_parameter_function ')' // redundant parenthesis
3678 { $$ = $2; }
3679 ;
3680
3681array_parameter_dimension:
3682 // Only the first dimension can be empty or have qualifiers.
3683 array_parameter_1st_dimension
3684 | array_parameter_1st_dimension multi_array_dimension
3685 { $$ = $1->addArray( $2 ); }
3686 | multi_array_dimension
3687 ;
3688
3689// The declaration of an array parameter has additional syntax over arrays in normal variable declarations:
3690//
3691// ISO/IEC 9899:1999 Section 6.7.5.2(1) : "The optional type qualifiers and the keyword static shall appear only in
3692// a declaration of a function parameter with an array type, and then only in the outermost array type derivation."
3693
3694array_parameter_1st_dimension:
3695 '[' ']'
3696 { $$ = DeclarationNode::newArray( 0, 0, false ); }
3697 // multi_array_dimension handles the '[' '*' ']' case
3698 | '[' push type_qualifier_list '*' pop ']' // remaining C99
3699 { $$ = DeclarationNode::newVarArray( $3 ); }
3700 | '[' push type_qualifier_list pop ']'
3701 { $$ = DeclarationNode::newArray( 0, $3, false ); }
3702 // multi_array_dimension handles the '[' assignment_expression ']' case
3703 | '[' push type_qualifier_list assignment_expression pop ']'
3704 { $$ = DeclarationNode::newArray( $4, $3, false ); }
3705 | '[' push STATIC type_qualifier_list_opt assignment_expression pop ']'
3706 { $$ = DeclarationNode::newArray( $5, $4, true ); }
3707 | '[' push type_qualifier_list STATIC assignment_expression pop ']'
3708 { $$ = DeclarationNode::newArray( $5, $3, true ); }
3709 ;
3710
3711// This pattern parses a declaration of an abstract variable, but does not allow "int ()" for a function pointer.
3712//
3713// struct S {
3714// int;
3715// int *;
3716// int [10];
3717// int (*)();
3718// };
3719
3720variable_abstract_declarator:
3721 variable_abstract_ptr
3722 | variable_abstract_array attribute_list_opt
3723 { $$ = $1->addQualifiers( $2 ); }
3724 | variable_abstract_function attribute_list_opt
3725 { $$ = $1->addQualifiers( $2 ); }
3726 ;
3727
3728variable_abstract_ptr:
3729 ptrref_operator
3730 { $$ = DeclarationNode::newPointer( 0, $1 ); }
3731 | ptrref_operator type_qualifier_list
3732 { $$ = DeclarationNode::newPointer( $2, $1 ); }
3733 | ptrref_operator variable_abstract_declarator
3734 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3735 | ptrref_operator type_qualifier_list variable_abstract_declarator
3736 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3737 | '(' variable_abstract_ptr ')' attribute_list_opt // redundant parenthesis
3738 { $$ = $2->addQualifiers( $4 ); }
3739 ;
3740
3741variable_abstract_array:
3742 array_dimension
3743 | '(' variable_abstract_ptr ')' array_dimension
3744 { $$ = $2->addArray( $4 ); }
3745 | '(' variable_abstract_array ')' multi_array_dimension // redundant parenthesis
3746 { $$ = $2->addArray( $4 ); }
3747 | '(' variable_abstract_array ')' // redundant parenthesis
3748 { $$ = $2; }
3749 ;
3750
3751variable_abstract_function:
3752 '(' variable_abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3753 { $$ = $2->addParamList( $6 ); }
3754 | '(' variable_abstract_function ')' // redundant parenthesis
3755 { $$ = $2; }
3756 ;
3757
3758// This pattern parses a new-style declaration for a parameter variable or function prototype that is either an
3759// identifier or typedef name and allows the C99 array options, which can only appear in a parameter list.
3760
3761cfa_identifier_parameter_declarator_tuple: // CFA
3762 cfa_identifier_parameter_declarator_no_tuple
3763 | cfa_abstract_tuple
3764 | type_qualifier_list cfa_abstract_tuple
3765 { $$ = $2->addQualifiers( $1 ); }
3766 ;
3767
3768cfa_identifier_parameter_declarator_no_tuple: // CFA
3769 cfa_identifier_parameter_ptr
3770 | cfa_identifier_parameter_array
3771 ;
3772
3773cfa_identifier_parameter_ptr: // CFA
3774 // No SUE declaration in parameter list.
3775 ptrref_operator type_specifier_nobody
3776 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3777 | type_qualifier_list ptrref_operator type_specifier_nobody
3778 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3779 | ptrref_operator cfa_abstract_function
3780 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3781 | type_qualifier_list ptrref_operator cfa_abstract_function
3782 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3783 | ptrref_operator cfa_identifier_parameter_declarator_tuple
3784 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3785 | type_qualifier_list ptrref_operator cfa_identifier_parameter_declarator_tuple
3786 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3787 ;
3788
3789cfa_identifier_parameter_array: // CFA
3790 // Only the first dimension can be empty or have qualifiers. Empty dimension must be factored out due to
3791 // shift/reduce conflict with new-style empty (void) function return type.
3792 '[' ']' type_specifier_nobody
3793 { $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3794 | cfa_array_parameter_1st_dimension type_specifier_nobody
3795 { $$ = $2->addNewArray( $1 ); }
3796 | '[' ']' multi_array_dimension type_specifier_nobody
3797 { $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3798 | cfa_array_parameter_1st_dimension multi_array_dimension type_specifier_nobody
3799 { $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
3800 | multi_array_dimension type_specifier_nobody
3801 { $$ = $2->addNewArray( $1 ); }
3802
3803 | '[' ']' cfa_identifier_parameter_ptr
3804 { $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3805 | cfa_array_parameter_1st_dimension cfa_identifier_parameter_ptr
3806 { $$ = $2->addNewArray( $1 ); }
3807 | '[' ']' multi_array_dimension cfa_identifier_parameter_ptr
3808 { $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3809 | cfa_array_parameter_1st_dimension multi_array_dimension cfa_identifier_parameter_ptr
3810 { $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
3811 | multi_array_dimension cfa_identifier_parameter_ptr
3812 { $$ = $2->addNewArray( $1 ); }
3813 ;
3814
3815cfa_array_parameter_1st_dimension:
3816 '[' push type_qualifier_list '*' pop ']' // remaining C99
3817 { $$ = DeclarationNode::newVarArray( $3 ); }
3818 | '[' push type_qualifier_list assignment_expression pop ']'
3819 { $$ = DeclarationNode::newArray( $4, $3, false ); }
3820 | '[' push declaration_qualifier_list assignment_expression pop ']'
3821 // declaration_qualifier_list must be used because of shift/reduce conflict with
3822 // assignment_expression, so a semantic check is necessary to preclude them as a type_qualifier cannot
3823 // appear in this context.
3824 { $$ = DeclarationNode::newArray( $4, $3, true ); }
3825 | '[' push declaration_qualifier_list type_qualifier_list assignment_expression pop ']'
3826 { $$ = DeclarationNode::newArray( $5, $4->addQualifiers( $3 ), true ); }
3827 ;
3828
3829// This pattern parses a new-style declaration of an abstract variable or function prototype, i.e., there is no
3830// identifier to which the type applies, e.g.:
3831//
3832// [int] f( int ); // abstract variable parameter; no parameter name specified
3833// [int] f( [int] (int) ); // abstract function-prototype parameter; no parameter name specified
3834//
3835// These rules need LR(3):
3836//
3837// cfa_abstract_tuple identifier_or_type_name
3838// '[' cfa_parameter_list ']' identifier_or_type_name '(' cfa_parameter_ellipsis_list_opt ')'
3839//
3840// since a function return type can be syntactically identical to a tuple type:
3841//
3842// [int, int] t;
3843// [int, int] f( int );
3844//
3845// Therefore, it is necessary to look at the token after identifier_or_type_name to know when to reduce
3846// cfa_abstract_tuple. To make this LR(1), several rules have to be flattened (lengthened) to allow the necessary
3847// lookahead. To accomplish this, cfa_abstract_declarator has an entry point without tuple, and tuple declarations are
3848// duplicated when appearing with cfa_function_specifier.
3849
3850cfa_abstract_declarator_tuple: // CFA
3851 cfa_abstract_tuple
3852 | type_qualifier_list cfa_abstract_tuple
3853 { $$ = $2->addQualifiers( $1 ); }
3854 | cfa_abstract_declarator_no_tuple
3855 ;
3856
3857cfa_abstract_declarator_no_tuple: // CFA
3858 cfa_abstract_ptr
3859 | cfa_abstract_array
3860 ;
3861
3862cfa_abstract_ptr: // CFA
3863 ptrref_operator type_specifier
3864 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3865 | type_qualifier_list ptrref_operator type_specifier
3866 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3867 | ptrref_operator cfa_abstract_function
3868 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3869 | type_qualifier_list ptrref_operator cfa_abstract_function
3870 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3871 | ptrref_operator cfa_abstract_declarator_tuple
3872 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3873 | type_qualifier_list ptrref_operator cfa_abstract_declarator_tuple
3874 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3875 ;
3876
3877cfa_abstract_array: // CFA
3878 // Only the first dimension can be empty. Empty dimension must be factored out due to shift/reduce conflict with
3879 // empty (void) function return type.
3880 '[' ']' type_specifier
3881 { $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3882 | '[' ']' multi_array_dimension type_specifier
3883 { $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3884 | multi_array_dimension type_specifier
3885 { $$ = $2->addNewArray( $1 ); }
3886 | '[' ']' cfa_abstract_ptr
3887 { $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3888 | '[' ']' multi_array_dimension cfa_abstract_ptr
3889 { $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3890 | multi_array_dimension cfa_abstract_ptr
3891 { $$ = $2->addNewArray( $1 ); }
3892 ;
3893
3894cfa_abstract_tuple: // CFA
3895 '[' push cfa_abstract_parameter_list pop ']'
3896 { $$ = DeclarationNode::newTuple( $3 ); }
3897 | '[' push type_specifier_nobody ELLIPSIS pop ']'
3898 { SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
3899 | '[' push type_specifier_nobody ELLIPSIS constant_expression pop ']'
3900 { SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
3901 ;
3902
3903cfa_abstract_function: // CFA
3904// '[' ']' '(' cfa_parameter_ellipsis_list_opt ')'
3905// { $$ = DeclarationNode::newFunction( nullptr, DeclarationNode::newTuple( nullptr ), $4, nullptr ); }
3906 cfa_abstract_tuple '(' push cfa_parameter_ellipsis_list_opt pop ')'
3907 { $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
3908 | cfa_function_return '(' push cfa_parameter_ellipsis_list_opt pop ')'
3909 { $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
3910 ;
3911
3912// 1) ISO/IEC 9899:1999 Section 6.7.2(2) : "At least one type specifier shall be given in the declaration specifiers in
3913// each declaration, and in the specifier-qualifier list in each structure declaration and type name."
3914//
3915// 2) ISO/IEC 9899:1999 Section 6.11.5(1) : "The placement of a storage-class specifier other than at the beginning of
3916// the declaration specifiers in a declaration is an obsolescent feature."
3917//
3918// 3) ISO/IEC 9899:1999 Section 6.11.6(1) : "The use of function declarators with empty parentheses (not
3919// prototype-format parameter type declarators) is an obsolescent feature."
3920//
3921// 4) ISO/IEC 9899:1999 Section 6.11.7(1) : "The use of function definitions with separate parameter identifier and
3922// declaration lists (not prototype-format parameter type and identifier declarators) is an obsolescent feature.
3923
3924//************************* MISCELLANEOUS ********************************
3925
3926comma_opt: // redundant comma
3927 // empty
3928 | ','
3929 ;
3930
3931default_initializer_opt:
3932 // empty
3933 { $$ = nullptr; }
3934 | '=' assignment_expression
3935 { $$ = $2; }
3936 ;
3937
3938%%
3939
3940// ----end of grammar----
3941
3942// Local Variables: //
3943// mode: c++ //
3944// tab-width: 4 //
3945// compile-command: "make install" //
3946// End: //
Note: See TracBrowser for help on using the repository browser.