source: src/Parser/parser.yy@ 8dcb832

ADT ast-experimental enum forall-pointer-decay pthread-emulation qualifiedEnum
Last change on this file since 8dcb832 was e16eb460, checked in by Peter A. Buhr <pabuhr@…>, 4 years ago

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