source: src/Parser/parser.yy@ b56ad5e

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

change class name WhileStmt to WhileDoStmt, add else clause to WhileDoStmt and ForStmt, change names thenPart/ElsePart to then/else_

  • Property mode set to 100644
File size: 146.6 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 : Tue Feb 1 11:06:13 2022
13// Update Count : 5167
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 // e.g., 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 CondCtl * 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> conditional_declaration
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( $4 ) ) ) ); }
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 '(' conditional_declaration ')' 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 '(' conditional_declaration ')' statement ELSE statement
1129 { $$ = new StatementNode( build_if( $3, maybe_build_compound( $5 ), maybe_build_compound( $7 ) ) ); }
1130 ;
1131
1132conditional_declaration:
1133 comma_expression
1134 { $$ = new CondCtl( nullptr, $1 ); }
1135 | c_declaration // no semi-colon
1136 { $$ = new CondCtl( $1, nullptr ); }
1137 | cfa_declaration // no semi-colon
1138 { $$ = new CondCtl( $1, nullptr ); }
1139 | declaration comma_expression // semi-colon separated
1140 { $$ = new CondCtl( $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 '(' ')' statement // CFA => while ( 1 )
1195 { $$ = new StatementNode( build_while( new CondCtl( nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ), maybe_build_compound( $4 ) ) ); }
1196 | WHILE '(' conditional_declaration ')' statement %prec THEN
1197 { $$ = new StatementNode( build_while( $3, maybe_build_compound( $5 ) ) ); }
1198 | WHILE '(' conditional_declaration ')' statement ELSE statement // CFA
1199 // { SemanticError( yylloc, "Loop default block is currently unimplemented." ); $$ = nullptr; }
1200 { $$ = new StatementNode( build_while( $3, maybe_build_compound( $5 ), $7 ) ); }
1201 | DO statement WHILE '(' ')' ';' // CFA => do while( 1 )
1202 { $$ = new StatementNode( build_do_while( new ExpressionNode( build_constantInteger( *new string( "1" ) ) ), maybe_build_compound( $2 ) ) ); }
1203 | DO statement WHILE '(' comma_expression ')' ';' %prec THEN
1204 { $$ = new StatementNode( build_do_while( $5, maybe_build_compound( $2 ) ) ); }
1205 | DO statement WHILE '(' comma_expression ')' ELSE statement // CFA
1206 // { SemanticError( yylloc, "Loop default block is currently unimplemented." ); $$ = nullptr; }
1207 { $$ = new StatementNode( build_do_while( $5, maybe_build_compound( $2 ), $8 ) ); }
1208 | FOR '(' ')' statement // CFA => for ( ;; )
1209 { $$ = new StatementNode( build_for( new ForCtrl( (ExpressionNode * )nullptr, (ExpressionNode * )nullptr, (ExpressionNode * )nullptr ), maybe_build_compound( $4 ) ) ); }
1210 | FOR '(' for_control_expression_list ')' statement %prec THEN
1211 { $$ = new StatementNode( build_for( $3, maybe_build_compound( $5 ) ) ); }
1212 | FOR '(' for_control_expression_list ')' statement ELSE statement // CFA
1213 // { SemanticError( yylloc, "Loop default block is currently unimplemented." ); $$ = nullptr; }
1214 { $$ = new StatementNode( build_for( $3, maybe_build_compound( $5 ), $7 ) ); }
1215 ;
1216
1217for_control_expression_list:
1218 for_control_expression
1219 | for_control_expression_list ':' for_control_expression
1220 // ForCtrl + ForCtrl:
1221 // init + init => multiple declaration statements that are hoisted
1222 // condition + condition => (expression) && (expression)
1223 // change + change => (expression), (expression)
1224 {
1225 $1->init->set_last( $3->init );
1226 if ( $1->condition ) {
1227 if ( $3->condition ) {
1228 $1->condition->expr.reset( new LogicalExpr( $1->condition->expr.release(), $3->condition->expr.release(), true ) );
1229 } // if
1230 } else $1->condition = $3->condition;
1231 if ( $1->change ) {
1232 if ( $3->change ) {
1233 $1->change->expr.reset( new CommaExpr( $1->change->expr.release(), $3->change->expr.release() ) );
1234 } // if
1235 } else $1->change = $3->change;
1236 $$ = $1;
1237 }
1238 ;
1239
1240for_control_expression:
1241 ';' comma_expression_opt ';' comma_expression_opt
1242 { $$ = new ForCtrl( (ExpressionNode * )nullptr, $2, $4 ); }
1243 | comma_expression ';' comma_expression_opt ';' comma_expression_opt
1244 { $$ = new ForCtrl( $1, $3, $5 ); }
1245 | declaration comma_expression_opt ';' comma_expression_opt // C99, declaration has ';'
1246 { $$ = new ForCtrl( $1, $2, $4 ); }
1247
1248 | comma_expression // CFA
1249 { $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1250 OperKinds::LThan, $1->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1251 | '=' comma_expression // CFA
1252 { $$ = forCtrl( $2, new string( DeclarationNode::anonymous.newName() ), new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1253 OperKinds::LEThan, $2->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1254 | comma_expression inclexcl comma_expression // CFA
1255 { $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), $1->clone(), $2, $3, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1256 | comma_expression inclexcl comma_expression '~' comma_expression // CFA
1257 { $$ = forCtrl( $1, new string( DeclarationNode::anonymous.newName() ), $1->clone(), $2, $3, $5 ); }
1258 | comma_expression ';' // CFA
1259 { $$ = forCtrl( new ExpressionNode( build_constantInteger( *new string( "0u" ) ) ), $1, nullptr, OperKinds::LThan, nullptr, nullptr ); }
1260 | comma_expression ';' comma_expression // CFA
1261 { $$ = forCtrl( $3, $1, new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1262 OperKinds::LThan, $3->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1263 | comma_expression ';' '=' comma_expression // CFA
1264 { $$ = forCtrl( $4, $1, new ExpressionNode( build_constantInteger( *new string( "0" ) ) ),
1265 OperKinds::LEThan, $4->clone(), new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1266 | comma_expression ';' comma_expression inclexcl comma_expression // CFA
1267 { $$ = forCtrl( $3, $1, $3->clone(), $4, $5, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1268 | comma_expression ';' comma_expression inclexcl comma_expression '~' comma_expression // CFA
1269 { $$ = forCtrl( $3, $1, $3->clone(), $4, $5, $7 ); }
1270
1271 | comma_expression ';' TYPEDEFname // CFA, array type
1272 {
1273 SemanticError( yylloc, "Array interator is currently unimplemented." ); $$ = nullptr;
1274 $$ = forCtrl( new ExpressionNode( build_varref( $3 ) ), $1, nullptr, OperKinds::Range, nullptr, nullptr );
1275 }
1276
1277 // There is a S/R conflicit if ~ and -~ are factored out.
1278 | comma_expression ';' comma_expression '~' '@' // CFA
1279 { $$ = forCtrl( $3, $1, $3->clone(), OperKinds::LThan, nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1280 | comma_expression ';' comma_expression ErangeDown '@' // CFA
1281 { $$ = forCtrl( $3, $1, $3->clone(), OperKinds::GThan, nullptr, new ExpressionNode( build_constantInteger( *new string( "1" ) ) ) ); }
1282 | comma_expression ';' comma_expression '~' '@' '~' comma_expression // CFA
1283 { $$ = forCtrl( $3, $1, $3->clone(), OperKinds::LThan, nullptr, $7 ); }
1284 | comma_expression ';' comma_expression ErangeDown '@' '~' comma_expression // CFA
1285 { $$ = forCtrl( $3, $1, $3->clone(), OperKinds::GThan, nullptr, $7 ); }
1286 | comma_expression ';' comma_expression '~' '@' '~' '@' // CFA
1287 { $$ = forCtrl( $3, $1, $3->clone(), OperKinds::LThan, nullptr, nullptr ); }
1288 ;
1289
1290inclexcl:
1291 '~'
1292 { $$ = OperKinds::LThan; }
1293 | ErangeUpEq
1294 { $$ = OperKinds::LEThan; }
1295 | ErangeDown
1296 { $$ = OperKinds::GThan; }
1297 | ErangeDownEq
1298 { $$ = OperKinds::GEThan; }
1299 ;
1300
1301jump_statement:
1302 GOTO identifier_or_type_name ';'
1303 { $$ = new StatementNode( build_branch( $2, BranchStmt::Goto ) ); }
1304 | GOTO '*' comma_expression ';' // GCC, computed goto
1305 // The syntax for the GCC computed goto violates normal expression precedence, e.g., goto *i+3; => goto *(i+3);
1306 // whereas normal operator precedence yields goto (*i)+3;
1307 { $$ = new StatementNode( build_computedgoto( $3 ) ); }
1308 // A semantic check is required to ensure fallthru appears only in the body of a choose statement.
1309 | fall_through_name ';' // CFA
1310 { $$ = new StatementNode( build_branch( BranchStmt::FallThrough ) ); }
1311 | fall_through_name identifier_or_type_name ';' // CFA
1312 { $$ = new StatementNode( build_branch( $2, BranchStmt::FallThrough ) ); }
1313 | fall_through_name DEFAULT ';' // CFA
1314 { $$ = new StatementNode( build_branch( BranchStmt::FallThroughDefault ) ); }
1315 | CONTINUE ';'
1316 // A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1317 { $$ = new StatementNode( build_branch( BranchStmt::Continue ) ); }
1318 | CONTINUE identifier_or_type_name ';' // CFA, multi-level continue
1319 // A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1320 // the target of the transfer appears only at the start of an iteration statement.
1321 { $$ = new StatementNode( build_branch( $2, BranchStmt::Continue ) ); }
1322 | BREAK ';'
1323 // A semantic check is required to ensure this statement appears only in the body of an iteration statement.
1324 { $$ = new StatementNode( build_branch( BranchStmt::Break ) ); }
1325 | BREAK identifier_or_type_name ';' // CFA, multi-level exit
1326 // A semantic check is required to ensure this statement appears only in the body of an iteration statement, and
1327 // the target of the transfer appears only at the start of an iteration statement.
1328 { $$ = new StatementNode( build_branch( $2, BranchStmt::Break ) ); }
1329 | RETURN comma_expression_opt ';'
1330 { $$ = new StatementNode( build_return( $2 ) ); }
1331 | RETURN '{' initializer_list_opt comma_opt '}' ';'
1332 { SemanticError( yylloc, "Initializer return is currently unimplemented." ); $$ = nullptr; }
1333 | SUSPEND ';'
1334 { $$ = new StatementNode( build_suspend( nullptr ) ); }
1335 | SUSPEND compound_statement
1336 { $$ = new StatementNode( build_suspend( $2 ) ); }
1337 | SUSPEND COROUTINE ';'
1338 { $$ = new StatementNode( build_suspend( nullptr, SuspendStmt::Coroutine ) ); }
1339 | SUSPEND COROUTINE compound_statement
1340 { $$ = new StatementNode( build_suspend( $3, SuspendStmt::Coroutine ) ); }
1341 | SUSPEND GENERATOR ';'
1342 { $$ = new StatementNode( build_suspend( nullptr, SuspendStmt::Generator ) ); }
1343 | SUSPEND GENERATOR compound_statement
1344 { $$ = new StatementNode( build_suspend( $3, SuspendStmt::Generator ) ); }
1345 | THROW assignment_expression_opt ';' // handles rethrow
1346 { $$ = new StatementNode( build_throw( $2 ) ); }
1347 | THROWRESUME assignment_expression_opt ';' // handles reresume
1348 { $$ = new StatementNode( build_resume( $2 ) ); }
1349 | THROWRESUME assignment_expression_opt AT assignment_expression ';' // handles reresume
1350 { $$ = new StatementNode( build_resume_at( $2, $4 ) ); }
1351 ;
1352
1353fall_through_name: // CFA
1354 FALLTHRU
1355 | FALLTHROUGH
1356 ;
1357
1358with_statement:
1359 WITH '(' tuple_expression_list ')' statement
1360 { $$ = new StatementNode( build_with( $3, $5 ) ); }
1361 ;
1362
1363// If MUTEX becomes a general qualifier, there are shift/reduce conflicts, so change syntax to "with mutex".
1364mutex_statement:
1365 MUTEX '(' argument_expression_list ')' statement
1366 { $$ = new StatementNode( build_mutex( $3, $5 ) ); }
1367 ;
1368
1369when_clause:
1370 WHEN '(' comma_expression ')' { $$ = $3; }
1371 ;
1372
1373when_clause_opt:
1374 // empty
1375 { $$ = nullptr; }
1376 | when_clause
1377 ;
1378
1379waitfor:
1380 WAITFOR '(' cast_expression ')'
1381 { $$ = $3; }
1382// | WAITFOR '(' cast_expression ',' argument_expression_list_opt ')'
1383// { $$ = (ExpressionNode *)$3->set_last( $5 ); }
1384 | WAITFOR '(' cast_expression_list ':' argument_expression_list_opt ')'
1385 { $$ = (ExpressionNode *)($3->set_last( $5 )); }
1386 ;
1387
1388cast_expression_list:
1389 cast_expression
1390 | cast_expression_list ',' cast_expression
1391 // { $$ = (ExpressionNode *)($1->set_last( $3 )); }
1392 { SemanticError( yylloc, "List of mutex member is currently unimplemented." ); $$ = nullptr; }
1393 ;
1394
1395timeout:
1396 TIMEOUT '(' comma_expression ')' { $$ = $3; }
1397 ;
1398
1399waitfor_clause:
1400 when_clause_opt waitfor statement %prec THEN
1401 { $$ = build_waitfor( $2, maybe_build_compound( $3 ), $1 ); }
1402 | when_clause_opt waitfor statement WOR waitfor_clause
1403 { $$ = build_waitfor( $2, maybe_build_compound( $3 ), $1, $5 ); }
1404 | when_clause_opt timeout statement %prec THEN
1405 { $$ = build_waitfor_timeout( $2, maybe_build_compound( $3 ), $1 ); }
1406 | when_clause_opt ELSE statement
1407 { $$ = build_waitfor_timeout( nullptr, maybe_build_compound( $3 ), $1 ); }
1408 // "else" must be conditional after timeout or timeout is never triggered (i.e., it is meaningless)
1409 | when_clause_opt timeout statement WOR ELSE statement
1410 { SemanticError( yylloc, "else clause must be conditional after timeout or timeout never triggered." ); $$ = nullptr; }
1411 | when_clause_opt timeout statement WOR when_clause ELSE statement
1412 { $$ = build_waitfor_timeout( $2, maybe_build_compound( $3 ), $1, maybe_build_compound( $7 ), $5 ); }
1413 ;
1414
1415waitfor_statement:
1416 when_clause_opt waitfor statement %prec THEN
1417 { $$ = new StatementNode( build_waitfor( $2, $3, $1 ) ); }
1418 | when_clause_opt waitfor statement WOR waitfor_clause
1419 { $$ = new StatementNode( build_waitfor( $2, $3, $1, $5 ) ); }
1420 ;
1421
1422exception_statement:
1423 TRY compound_statement handler_clause %prec THEN
1424 { $$ = new StatementNode( build_try( $2, $3, 0 ) ); }
1425 | TRY compound_statement finally_clause
1426 { $$ = new StatementNode( build_try( $2, 0, $3 ) ); }
1427 | TRY compound_statement handler_clause finally_clause
1428 { $$ = new StatementNode( build_try( $2, $3, $4 ) ); }
1429 ;
1430
1431handler_clause:
1432 handler_key '(' push exception_declaration pop handler_predicate_opt ')' compound_statement
1433 { $$ = new StatementNode( build_catch( $1, $4, $6, $8 ) ); }
1434 | handler_clause handler_key '(' push exception_declaration pop handler_predicate_opt ')' compound_statement
1435 { $$ = (StatementNode *)$1->set_last( new StatementNode( build_catch( $2, $5, $7, $9 ) ) ); }
1436 ;
1437
1438handler_predicate_opt:
1439 // empty
1440 { $$ = nullptr; }
1441 | ';' conditional_expression { $$ = $2; }
1442 ;
1443
1444handler_key:
1445 CATCH { $$ = CatchStmt::Terminate; }
1446 | RECOVER { $$ = CatchStmt::Terminate; }
1447 | CATCHRESUME { $$ = CatchStmt::Resume; }
1448 | FIXUP { $$ = CatchStmt::Resume; }
1449 ;
1450
1451finally_clause:
1452 FINALLY compound_statement { $$ = new StatementNode( build_finally( $2 ) ); }
1453 ;
1454
1455exception_declaration:
1456 // No SUE declaration in parameter list.
1457 type_specifier_nobody
1458 | type_specifier_nobody declarator
1459 { $$ = $2->addType( $1 ); }
1460 | type_specifier_nobody variable_abstract_declarator
1461 { $$ = $2->addType( $1 ); }
1462 | cfa_abstract_declarator_tuple identifier // CFA
1463 { $$ = $1->addName( $2 ); }
1464 | cfa_abstract_declarator_tuple // CFA
1465 ;
1466
1467enable_disable_statement:
1468 enable_disable_key identifier_list compound_statement
1469 ;
1470
1471enable_disable_key:
1472 ENABLE
1473 | DISABLE
1474 ;
1475
1476asm_statement:
1477 ASM asm_volatile_opt '(' string_literal ')' ';'
1478 { $$ = new StatementNode( build_asm( $2, $4, 0 ) ); }
1479 | ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ')' ';' // remaining GCC
1480 { $$ = new StatementNode( build_asm( $2, $4, $6 ) ); }
1481 | ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ')' ';'
1482 { $$ = new StatementNode( build_asm( $2, $4, $6, $8 ) ); }
1483 | ASM asm_volatile_opt '(' string_literal ':' asm_operands_opt ':' asm_operands_opt ':' asm_clobbers_list_opt ')' ';'
1484 { $$ = new StatementNode( build_asm( $2, $4, $6, $8, $10 ) ); }
1485 | ASM asm_volatile_opt GOTO '(' string_literal ':' ':' asm_operands_opt ':' asm_clobbers_list_opt ':' label_list ')' ';'
1486 { $$ = new StatementNode( build_asm( $2, $5, 0, $8, $10, $12 ) ); }
1487 ;
1488
1489asm_volatile_opt: // GCC
1490 // empty
1491 { $$ = false; }
1492 | VOLATILE
1493 { $$ = true; }
1494 ;
1495
1496asm_operands_opt: // GCC
1497 // empty
1498 { $$ = nullptr; } // use default argument
1499 | asm_operands_list
1500 ;
1501
1502asm_operands_list: // GCC
1503 asm_operand
1504 | asm_operands_list ',' asm_operand
1505 { $$ = (ExpressionNode *)($1->set_last( $3 )); }
1506 ;
1507
1508asm_operand: // GCC
1509 string_literal '(' constant_expression ')'
1510 { $$ = new ExpressionNode( new AsmExpr( nullptr, $1, maybeMoveBuild<Expression>( $3 ) ) ); }
1511 | '[' IDENTIFIER ']' string_literal '(' constant_expression ')'
1512 { $$ = new ExpressionNode( new AsmExpr( $2, $4, maybeMoveBuild<Expression>( $6 ) ) ); }
1513 ;
1514
1515asm_clobbers_list_opt: // GCC
1516 // empty
1517 { $$ = nullptr; } // use default argument
1518 | string_literal
1519 { $$ = new ExpressionNode( $1 ); }
1520 | asm_clobbers_list_opt ',' string_literal
1521 { $$ = (ExpressionNode *)($1->set_last( new ExpressionNode( $3 ) )); }
1522 ;
1523
1524label_list:
1525 identifier
1526 {
1527 $$ = new LabelNode(); $$->labels.push_back( *$1 );
1528 delete $1; // allocated by lexer
1529 }
1530 | label_list ',' identifier
1531 {
1532 $$ = $1; $1->labels.push_back( *$3 );
1533 delete $3; // allocated by lexer
1534 }
1535 ;
1536
1537//******************************* DECLARATIONS *********************************
1538
1539declaration_list_opt: // used at beginning of switch statement
1540 // empty
1541 { $$ = nullptr; }
1542 | declaration_list
1543 ;
1544
1545declaration_list:
1546 declaration
1547 | declaration_list declaration
1548 { $$ = $1->appendList( $2 ); }
1549 ;
1550
1551KR_parameter_list_opt: // used to declare parameter types in K&R style functions
1552 // empty
1553 { $$ = nullptr; }
1554 | KR_parameter_list
1555 ;
1556
1557KR_parameter_list:
1558 push c_declaration pop ';'
1559 { $$ = $2; }
1560 | KR_parameter_list push c_declaration pop ';'
1561 { $$ = $1->appendList( $3 ); }
1562 ;
1563
1564local_label_declaration_opt: // GCC, local label
1565 // empty
1566 | local_label_declaration_list
1567 ;
1568
1569local_label_declaration_list: // GCC, local label
1570 LABEL local_label_list ';'
1571 | local_label_declaration_list LABEL local_label_list ';'
1572 ;
1573
1574local_label_list: // GCC, local label
1575 identifier_or_type_name
1576 | local_label_list ',' identifier_or_type_name
1577 ;
1578
1579declaration: // old & new style declarations
1580 c_declaration ';'
1581 | cfa_declaration ';' // CFA
1582 | static_assert // C11
1583 ;
1584
1585static_assert:
1586 STATICASSERT '(' constant_expression ',' string_literal ')' ';' // C11
1587 { $$ = DeclarationNode::newStaticAssert( $3, $5 ); }
1588 | STATICASSERT '(' constant_expression ')' ';' // CFA
1589 { $$ = DeclarationNode::newStaticAssert( $3, build_constantStr( *new string( "\"\"" ) ) ); }
1590
1591// C declaration syntax is notoriously confusing and error prone. Cforall provides its own type, variable and function
1592// declarations. CFA declarations use the same declaration tokens as in C; however, CFA places declaration modifiers to
1593// the left of the base type, while C declarations place modifiers to the right of the base type. CFA declaration
1594// modifiers are interpreted from left to right and the entire type specification is distributed across all variables in
1595// the declaration list (as in Pascal). ANSI C and the new CFA declarations may appear together in the same program
1596// block, but cannot be mixed within a specific declaration.
1597//
1598// CFA C
1599// [10] int x; int x[10]; // array of 10 integers
1600// [10] * char y; char *y[10]; // array of 10 pointers to char
1601
1602cfa_declaration: // CFA
1603 cfa_variable_declaration
1604 | cfa_typedef_declaration
1605 | cfa_function_declaration
1606 | type_declaring_list
1607 { SemanticError( yylloc, "otype declaration is currently unimplemented." ); $$ = nullptr; }
1608 | trait_specifier
1609 ;
1610
1611cfa_variable_declaration: // CFA
1612 cfa_variable_specifier initializer_opt
1613 { $$ = $1->addInitializer( $2 ); }
1614 | declaration_qualifier_list cfa_variable_specifier initializer_opt
1615 // declaration_qualifier_list also includes type_qualifier_list, so a semantic check is necessary to preclude
1616 // them as a type_qualifier cannot appear in that context.
1617 { $$ = $2->addQualifiers( $1 )->addInitializer( $3 ); }
1618 | cfa_variable_declaration pop ',' push identifier_or_type_name initializer_opt
1619 { $$ = $1->appendList( $1->cloneType( $5 )->addInitializer( $6 ) ); }
1620 ;
1621
1622cfa_variable_specifier: // CFA
1623 // A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1624 // storage-class
1625 cfa_abstract_declarator_no_tuple identifier_or_type_name asm_name_opt
1626 { $$ = $1->addName( $2 )->addAsmName( $3 ); }
1627 | cfa_abstract_tuple identifier_or_type_name asm_name_opt
1628 { $$ = $1->addName( $2 )->addAsmName( $3 ); }
1629 | type_qualifier_list cfa_abstract_tuple identifier_or_type_name asm_name_opt
1630 { $$ = $2->addQualifiers( $1 )->addName( $3 )->addAsmName( $4 ); }
1631 ;
1632
1633cfa_function_declaration: // CFA
1634 cfa_function_specifier
1635 | type_qualifier_list cfa_function_specifier
1636 { $$ = $2->addQualifiers( $1 ); }
1637 | declaration_qualifier_list cfa_function_specifier
1638 { $$ = $2->addQualifiers( $1 ); }
1639 | declaration_qualifier_list type_qualifier_list cfa_function_specifier
1640 { $$ = $3->addQualifiers( $1 )->addQualifiers( $2 ); }
1641 | cfa_function_declaration ',' identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')'
1642 {
1643 // Append the return type at the start (left-hand-side) to each identifier in the list.
1644 DeclarationNode * ret = new DeclarationNode;
1645 ret->type = maybeClone( $1->type->base );
1646 $$ = $1->appendList( DeclarationNode::newFunction( $3, ret, $6, nullptr ) );
1647 }
1648 ;
1649
1650cfa_function_specifier: // CFA
1651// '[' ']' identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' // S/R conflict
1652// {
1653// $$ = DeclarationNode::newFunction( $3, DeclarationNode::newTuple( 0 ), $6, 0, true );
1654// }
1655// '[' ']' identifier '(' push cfa_parameter_ellipsis_list_opt pop ')'
1656// {
1657// typedefTable.setNextIdentifier( *$5 );
1658// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1659// }
1660// | '[' ']' TYPEDEFname '(' push cfa_parameter_ellipsis_list_opt pop ')'
1661// {
1662// typedefTable.setNextIdentifier( *$5 );
1663// $$ = DeclarationNode::newFunction( $5, DeclarationNode::newTuple( 0 ), $8, 0, true );
1664// }
1665// | '[' ']' typegen_name
1666 // identifier_or_type_name must be broken apart because of the sequence:
1667 //
1668 // '[' ']' identifier_or_type_name '(' cfa_parameter_ellipsis_list_opt ')'
1669 // '[' ']' type_specifier
1670 //
1671 // type_specifier can resolve to just TYPEDEFname (e.g., typedef int T; int f( T );). Therefore this must be
1672 // flattened to allow lookahead to the '(' without having to reduce identifier_or_type_name.
1673 cfa_abstract_tuple identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' attribute_list_opt
1674 // To obtain LR(1 ), this rule must be factored out from function return type (see cfa_abstract_declarator).
1675 { $$ = DeclarationNode::newFunction( $2, $1, $5, 0 )->addQualifiers( $8 ); }
1676 | cfa_function_return identifier_or_type_name '(' push cfa_parameter_ellipsis_list_opt pop ')' attribute_list_opt
1677 { $$ = DeclarationNode::newFunction( $2, $1, $5, 0 )->addQualifiers( $8 ); }
1678 ;
1679
1680cfa_function_return: // CFA
1681 '[' push cfa_parameter_list pop ']'
1682 { $$ = DeclarationNode::newTuple( $3 ); }
1683 | '[' push cfa_parameter_list pop ',' push cfa_abstract_parameter_list pop ']'
1684 // To obtain LR(1 ), the last cfa_abstract_parameter_list is added into this flattened rule to lookahead to the ']'.
1685 { $$ = DeclarationNode::newTuple( $3->appendList( $7 ) ); }
1686 ;
1687
1688cfa_typedef_declaration: // CFA
1689 TYPEDEF cfa_variable_specifier
1690 {
1691 typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "1" );
1692 $$ = $2->addTypedef();
1693 }
1694 | TYPEDEF cfa_function_specifier
1695 {
1696 typedefTable.addToEnclosingScope( *$2->name, TYPEDEFname, "2" );
1697 $$ = $2->addTypedef();
1698 }
1699 | cfa_typedef_declaration pop ',' push identifier
1700 {
1701 typedefTable.addToEnclosingScope( *$5, TYPEDEFname, "3" );
1702 $$ = $1->appendList( $1->cloneType( $5 ) );
1703 }
1704 ;
1705
1706// Traditionally typedef is part of storage-class specifier for syntactic convenience only. Here, it is factored out as
1707// a separate form of declaration, which syntactically precludes storage-class specifiers and initialization.
1708
1709typedef_declaration:
1710 TYPEDEF type_specifier declarator
1711 {
1712 typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "4" );
1713 $$ = $3->addType( $2 )->addTypedef();
1714 }
1715 | typedef_declaration pop ',' push declarator
1716 {
1717 typedefTable.addToEnclosingScope( *$5->name, TYPEDEFname, "5" );
1718 $$ = $1->appendList( $1->cloneBaseType( $5 )->addTypedef() );
1719 }
1720 | type_qualifier_list TYPEDEF type_specifier declarator // remaining OBSOLESCENT (see 2 )
1721 {
1722 typedefTable.addToEnclosingScope( *$4->name, TYPEDEFname, "6" );
1723 $$ = $4->addType( $3 )->addQualifiers( $1 )->addTypedef();
1724 }
1725 | type_specifier TYPEDEF declarator
1726 {
1727 typedefTable.addToEnclosingScope( *$3->name, TYPEDEFname, "7" );
1728 $$ = $3->addType( $1 )->addTypedef();
1729 }
1730 | type_specifier TYPEDEF type_qualifier_list declarator
1731 {
1732 typedefTable.addToEnclosingScope( *$4->name, TYPEDEFname, "8" );
1733 $$ = $4->addQualifiers( $1 )->addTypedef()->addType( $1 );
1734 }
1735 ;
1736
1737typedef_expression:
1738 // deprecated GCC, naming expression type: typedef name = exp; gives a name to the type of an expression
1739 TYPEDEF identifier '=' assignment_expression
1740 {
1741 SemanticError( yylloc, "Typedef expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
1742 }
1743 | typedef_expression pop ',' push identifier '=' assignment_expression
1744 {
1745 SemanticError( yylloc, "Typedef expression is deprecated, use typeof(...) instead." ); $$ = nullptr;
1746 }
1747 ;
1748
1749c_declaration:
1750 declaration_specifier declaring_list
1751 { $$ = distAttr( $1, $2 ); }
1752 | typedef_declaration
1753 | typedef_expression // deprecated GCC, naming expression type
1754 | sue_declaration_specifier
1755 ;
1756
1757declaring_list:
1758 // A semantic check is required to ensure asm_name only appears on declarations with implicit or explicit static
1759 // storage-class
1760 declarator asm_name_opt initializer_opt
1761 { $$ = $1->addAsmName( $2 )->addInitializer( $3 ); }
1762 | declaring_list ',' attribute_list_opt declarator asm_name_opt initializer_opt
1763 { $$ = $1->appendList( $4->addQualifiers( $3 )->addAsmName( $5 )->addInitializer( $6 ) ); }
1764 ;
1765
1766declaration_specifier: // type specifier + storage class
1767 basic_declaration_specifier
1768 | sue_declaration_specifier
1769 | type_declaration_specifier
1770 ;
1771
1772declaration_specifier_nobody: // type specifier + storage class - {...}
1773 // Preclude SUE declarations in restricted scopes:
1774 //
1775 // int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
1776 //
1777 // because it is impossible to call f due to name equivalence.
1778 basic_declaration_specifier
1779 | sue_declaration_specifier_nobody
1780 | type_declaration_specifier
1781 ;
1782
1783type_specifier: // type specifier
1784 basic_type_specifier
1785 | sue_type_specifier
1786 | type_type_specifier
1787 ;
1788
1789type_specifier_nobody: // type specifier - {...}
1790 // Preclude SUE declarations in restricted scopes:
1791 //
1792 // int f( struct S { int i; } s1, Struct S s2 ) { struct S s3; ... }
1793 //
1794 // because it is impossible to call f due to name equivalence.
1795 basic_type_specifier
1796 | sue_type_specifier_nobody
1797 | type_type_specifier
1798 ;
1799
1800type_qualifier_list_opt: // GCC, used in asm_statement
1801 // empty
1802 { $$ = nullptr; }
1803 | type_qualifier_list
1804 ;
1805
1806type_qualifier_list:
1807 // A semantic check is necessary to ensure a type qualifier is appropriate for the kind of declaration.
1808 //
1809 // ISO/IEC 9899:1999 Section 6.7.3(4 ) : If the same qualifier appears more than once in the same
1810 // specifier-qualifier-list, either directly or via one or more typedefs, the behavior is the same as if it
1811 // appeared only once.
1812 type_qualifier
1813 | type_qualifier_list type_qualifier
1814 { $$ = $1->addQualifiers( $2 ); }
1815 ;
1816
1817type_qualifier:
1818 type_qualifier_name
1819 | attribute // trick handles most atrribute locations
1820 ;
1821
1822type_qualifier_name:
1823 CONST
1824 { $$ = DeclarationNode::newTypeQualifier( Type::Const ); }
1825 | RESTRICT
1826 { $$ = DeclarationNode::newTypeQualifier( Type::Restrict ); }
1827 | VOLATILE
1828 { $$ = DeclarationNode::newTypeQualifier( Type::Volatile ); }
1829 | ATOMIC
1830 { $$ = DeclarationNode::newTypeQualifier( Type::Atomic ); }
1831 | forall
1832 ;
1833
1834forall:
1835 FORALL '(' type_parameter_list ')' // CFA
1836 { $$ = DeclarationNode::newForall( $3 ); }
1837 ;
1838
1839declaration_qualifier_list:
1840 storage_class_list
1841 | type_qualifier_list storage_class_list // remaining OBSOLESCENT (see 2 )
1842 { $$ = $1->addQualifiers( $2 ); }
1843 | declaration_qualifier_list type_qualifier_list storage_class_list
1844 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1845 ;
1846
1847storage_class_list:
1848 // A semantic check is necessary to ensure a storage class is appropriate for the kind of declaration and that
1849 // only one of each is specified, except for inline, which can appear with the others.
1850 //
1851 // ISO/IEC 9899:1999 Section 6.7.1(2) : At most, one storage-class specifier may be given in the declaration
1852 // specifiers in a declaration.
1853 storage_class
1854 | storage_class_list storage_class
1855 { $$ = $1->addQualifiers( $2 ); }
1856 ;
1857
1858storage_class:
1859 EXTERN
1860 { $$ = DeclarationNode::newStorageClass( Type::Extern ); }
1861 | STATIC
1862 { $$ = DeclarationNode::newStorageClass( Type::Static ); }
1863 | AUTO
1864 { $$ = DeclarationNode::newStorageClass( Type::Auto ); }
1865 | REGISTER
1866 { $$ = DeclarationNode::newStorageClass( Type::Register ); }
1867 | THREADLOCAL // C11
1868 { $$ = DeclarationNode::newStorageClass( Type::Threadlocal ); }
1869 // Put function specifiers here to simplify parsing rules, but separate them semantically.
1870 | INLINE // C99
1871 { $$ = DeclarationNode::newFuncSpecifier( Type::Inline ); }
1872 | FORTRAN // C99
1873 { $$ = DeclarationNode::newFuncSpecifier( Type::Fortran ); }
1874 | NORETURN // C11
1875 { $$ = DeclarationNode::newFuncSpecifier( Type::Noreturn ); }
1876 ;
1877
1878basic_type_name:
1879 VOID
1880 { $$ = DeclarationNode::newBasicType( DeclarationNode::Void ); }
1881 | BOOL // C99
1882 { $$ = DeclarationNode::newBasicType( DeclarationNode::Bool ); }
1883 | CHAR
1884 { $$ = DeclarationNode::newBasicType( DeclarationNode::Char ); }
1885 | INT
1886 { $$ = DeclarationNode::newBasicType( DeclarationNode::Int ); }
1887 | INT128
1888 { $$ = DeclarationNode::newBasicType( DeclarationNode::Int128 ); }
1889 | UINT128
1890 { $$ = DeclarationNode::newBasicType( DeclarationNode::Int128 )->addType( DeclarationNode::newSignedNess( DeclarationNode::Unsigned ) ); }
1891 | FLOAT
1892 { $$ = DeclarationNode::newBasicType( DeclarationNode::Float ); }
1893 | DOUBLE
1894 { $$ = DeclarationNode::newBasicType( DeclarationNode::Double ); }
1895 | uuFLOAT80
1896 { $$ = DeclarationNode::newBasicType( DeclarationNode::uuFloat80 ); }
1897 | uuFLOAT128
1898 { $$ = DeclarationNode::newBasicType( DeclarationNode::uuFloat128 ); }
1899 | uFLOAT16
1900 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat16 ); }
1901 | uFLOAT32
1902 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat32 ); }
1903 | uFLOAT32X
1904 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat32x ); }
1905 | uFLOAT64
1906 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat64 ); }
1907 | uFLOAT64X
1908 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat64x ); }
1909 | uFLOAT128
1910 { $$ = DeclarationNode::newBasicType( DeclarationNode::uFloat128 ); }
1911 | DECIMAL32
1912 { SemanticError( yylloc, "_Decimal32 is currently unimplemented." ); $$ = nullptr; }
1913 | DECIMAL64
1914 { SemanticError( yylloc, "_Decimal64 is currently unimplemented." ); $$ = nullptr; }
1915 | DECIMAL128
1916 { SemanticError( yylloc, "_Decimal128 is currently unimplemented." ); $$ = nullptr; }
1917 | COMPLEX // C99
1918 { $$ = DeclarationNode::newComplexType( DeclarationNode::Complex ); }
1919 | IMAGINARY // C99
1920 { $$ = DeclarationNode::newComplexType( DeclarationNode::Imaginary ); }
1921 | SIGNED
1922 { $$ = DeclarationNode::newSignedNess( DeclarationNode::Signed ); }
1923 | UNSIGNED
1924 { $$ = DeclarationNode::newSignedNess( DeclarationNode::Unsigned ); }
1925 | SHORT
1926 { $$ = DeclarationNode::newLength( DeclarationNode::Short ); }
1927 | LONG
1928 { $$ = DeclarationNode::newLength( DeclarationNode::Long ); }
1929 | VALIST // GCC, __builtin_va_list
1930 { $$ = DeclarationNode::newBuiltinType( DeclarationNode::Valist ); }
1931 | AUTO_TYPE
1932 { $$ = DeclarationNode::newBuiltinType( DeclarationNode::AutoType ); }
1933 | vtable
1934 ;
1935
1936vtable_opt:
1937 // empty
1938 { $$ = nullptr; }
1939 | vtable
1940 ;
1941
1942vtable:
1943 VTABLE '(' type_name ')' default_opt
1944 { $$ = DeclarationNode::newVtableType( $3 ); }
1945 // { SemanticError( yylloc, "vtable is currently unimplemented." ); $$ = nullptr; }
1946 ;
1947
1948default_opt:
1949 // empty
1950 { $$ = nullptr; }
1951 | DEFAULT
1952 { SemanticError( yylloc, "vtable default is currently unimplemented." ); $$ = nullptr; }
1953 ;
1954
1955basic_declaration_specifier:
1956 // A semantic check is necessary for conflicting storage classes.
1957 basic_type_specifier
1958 | declaration_qualifier_list basic_type_specifier
1959 { $$ = $2->addQualifiers( $1 ); }
1960 | basic_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
1961 { $$ = $1->addQualifiers( $2 ); }
1962 | basic_declaration_specifier storage_class type_qualifier_list
1963 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
1964 | basic_declaration_specifier storage_class basic_type_specifier
1965 { $$ = $3->addQualifiers( $2 )->addType( $1 ); }
1966 ;
1967
1968basic_type_specifier:
1969 direct_type
1970 // Cannot have type modifiers, e.g., short, long, etc.
1971 | type_qualifier_list_opt indirect_type type_qualifier_list_opt
1972 { $$ = $2->addQualifiers( $1 )->addQualifiers( $3 ); }
1973 ;
1974
1975direct_type:
1976 basic_type_name
1977 | type_qualifier_list basic_type_name
1978 { $$ = $2->addQualifiers( $1 ); }
1979 | direct_type type_qualifier
1980 { $$ = $1->addQualifiers( $2 ); }
1981 | direct_type basic_type_name
1982 { $$ = $1->addType( $2 ); }
1983 ;
1984
1985indirect_type:
1986 TYPEOF '(' type ')' // GCC: typeof( x ) y;
1987 { $$ = $3; }
1988 | TYPEOF '(' comma_expression ')' // GCC: typeof( a+b ) y;
1989 { $$ = DeclarationNode::newTypeof( $3 ); }
1990 | BASETYPEOF '(' type ')' // CFA: basetypeof( x ) y;
1991 { $$ = DeclarationNode::newTypeof( new ExpressionNode( new TypeExpr( maybeMoveBuildType( $3 ) ) ), true ); }
1992 | BASETYPEOF '(' comma_expression ')' // CFA: basetypeof( a+b ) y;
1993 { $$ = DeclarationNode::newTypeof( $3, true ); }
1994 | ZERO_T // CFA
1995 { $$ = DeclarationNode::newBuiltinType( DeclarationNode::Zero ); }
1996 | ONE_T // CFA
1997 { $$ = DeclarationNode::newBuiltinType( DeclarationNode::One ); }
1998 ;
1999
2000sue_declaration_specifier: // struct, union, enum + storage class + type specifier
2001 sue_type_specifier
2002 | declaration_qualifier_list sue_type_specifier
2003 { $$ = $2->addQualifiers( $1 ); }
2004 | sue_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2005 { $$ = $1->addQualifiers( $2 ); }
2006 | sue_declaration_specifier storage_class type_qualifier_list
2007 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2008 ;
2009
2010sue_type_specifier: // struct, union, enum + type specifier
2011 elaborated_type
2012 | type_qualifier_list
2013 { if ( $1->type != nullptr && $1->type->forall ) forall = true; } // remember generic type
2014 elaborated_type
2015 { $$ = $3->addQualifiers( $1 ); }
2016 | sue_type_specifier type_qualifier
2017 {
2018 if ( $2->type != nullptr && $2->type->forall ) forall = true; // remember generic type
2019 $$ = $1->addQualifiers( $2 );
2020 }
2021 ;
2022
2023sue_declaration_specifier_nobody: // struct, union, enum - {...} + storage class + type specifier
2024 sue_type_specifier_nobody
2025 | declaration_qualifier_list sue_type_specifier_nobody
2026 { $$ = $2->addQualifiers( $1 ); }
2027 | sue_declaration_specifier_nobody storage_class // remaining OBSOLESCENT (see 2)
2028 { $$ = $1->addQualifiers( $2 ); }
2029 | sue_declaration_specifier_nobody storage_class type_qualifier_list
2030 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2031 ;
2032
2033sue_type_specifier_nobody: // struct, union, enum - {...} + type specifier
2034 elaborated_type_nobody
2035 | type_qualifier_list elaborated_type_nobody
2036 { $$ = $2->addQualifiers( $1 ); }
2037 | sue_type_specifier_nobody type_qualifier
2038 { $$ = $1->addQualifiers( $2 ); }
2039 ;
2040
2041type_declaration_specifier:
2042 type_type_specifier
2043 | declaration_qualifier_list type_type_specifier
2044 { $$ = $2->addQualifiers( $1 ); }
2045 | type_declaration_specifier storage_class // remaining OBSOLESCENT (see 2)
2046 { $$ = $1->addQualifiers( $2 ); }
2047 | type_declaration_specifier storage_class type_qualifier_list
2048 { $$ = $1->addQualifiers( $2 )->addQualifiers( $3 ); }
2049 ;
2050
2051type_type_specifier: // typedef types
2052 type_name
2053 | type_qualifier_list type_name
2054 { $$ = $2->addQualifiers( $1 ); }
2055 | type_type_specifier type_qualifier
2056 { $$ = $1->addQualifiers( $2 ); }
2057 ;
2058
2059type_name:
2060 TYPEDEFname
2061 { $$ = DeclarationNode::newFromTypedef( $1 ); }
2062 | '.' TYPEDEFname
2063 { $$ = DeclarationNode::newQualifiedType( DeclarationNode::newFromGlobalScope(), DeclarationNode::newFromTypedef( $2 ) ); }
2064 | type_name '.' TYPEDEFname
2065 { $$ = DeclarationNode::newQualifiedType( $1, DeclarationNode::newFromTypedef( $3 ) ); }
2066 | typegen_name
2067 | '.' typegen_name
2068 { $$ = DeclarationNode::newQualifiedType( DeclarationNode::newFromGlobalScope(), $2 ); }
2069 | type_name '.' typegen_name
2070 { $$ = DeclarationNode::newQualifiedType( $1, $3 ); }
2071 ;
2072
2073typegen_name: // CFA
2074 TYPEGENname
2075 { $$ = DeclarationNode::newFromTypeGen( $1, nullptr ); }
2076 | TYPEGENname '(' ')'
2077 { $$ = DeclarationNode::newFromTypeGen( $1, nullptr ); }
2078 | TYPEGENname '(' type_list ')'
2079 { $$ = DeclarationNode::newFromTypeGen( $1, $3 ); }
2080 ;
2081
2082elaborated_type: // struct, union, enum
2083 aggregate_type
2084 | enum_type
2085 ;
2086
2087elaborated_type_nobody: // struct, union, enum - {...}
2088 aggregate_type_nobody
2089 | enum_type_nobody
2090 ;
2091
2092aggregate_type: // struct, union
2093 aggregate_key attribute_list_opt
2094 { forall = false; } // reset
2095 '{' field_declaration_list_opt '}' type_parameters_opt
2096 { $$ = DeclarationNode::newAggregate( $1, nullptr, $7, $5, true )->addQualifiers( $2 ); }
2097 | aggregate_key attribute_list_opt identifier
2098 {
2099 typedefTable.makeTypedef( *$3, forall || typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2100 forall = false; // reset
2101 }
2102 '{' field_declaration_list_opt '}' type_parameters_opt
2103 { $$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 ); }
2104 | aggregate_key attribute_list_opt TYPEDEFname // unqualified type name
2105 {
2106 typedefTable.makeTypedef( *$3, forall || typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2107 forall = false; // reset
2108 }
2109 '{' field_declaration_list_opt '}' type_parameters_opt
2110 {
2111 DeclarationNode::newFromTypedef( $3 );
2112 $$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2113 }
2114 | aggregate_key attribute_list_opt TYPEGENname // unqualified type name
2115 {
2116 typedefTable.makeTypedef( *$3, forall || typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname ); // create typedef
2117 forall = false; // reset
2118 }
2119 '{' field_declaration_list_opt '}' type_parameters_opt
2120 {
2121 DeclarationNode::newFromTypeGen( $3, nullptr );
2122 $$ = DeclarationNode::newAggregate( $1, $3, $8, $6, true )->addQualifiers( $2 );
2123 }
2124 | aggregate_type_nobody
2125 ;
2126
2127type_parameters_opt:
2128 // empty
2129 { $$ = nullptr; } %prec '}'
2130 | '(' type_list ')'
2131 { $$ = $2; }
2132 ;
2133
2134aggregate_type_nobody: // struct, union - {...}
2135 aggregate_key attribute_list_opt identifier
2136 {
2137 typedefTable.makeTypedef( *$3, forall || typedefTable.getEnclForall() ? TYPEGENname : TYPEDEFname );
2138 forall = false; // reset
2139 $$ = DeclarationNode::newAggregate( $1, $3, nullptr, nullptr, false )->addQualifiers( $2 );
2140 }
2141 | aggregate_key attribute_list_opt type_name
2142 {
2143 forall = false; // reset
2144 // Create new generic declaration with same name as previous forward declaration, where the IDENTIFIER is
2145 // switched to a TYPEGENname. Link any generic arguments from typegen_name to new generic declaration and
2146 // delete newFromTypeGen.
2147 $$ = DeclarationNode::newAggregate( $1, $3->type->symbolic.name, $3->type->symbolic.actuals, nullptr, false )->addQualifiers( $2 );
2148 $3->type->symbolic.name = nullptr;
2149 $3->type->symbolic.actuals = nullptr;
2150 delete $3;
2151 }
2152 ;
2153
2154aggregate_key:
2155 aggregate_data
2156 | aggregate_control
2157 ;
2158
2159aggregate_data:
2160 STRUCT vtable_opt
2161 { $$ = AggregateDecl::Struct; }
2162 | UNION
2163 { $$ = AggregateDecl::Union; }
2164 | EXCEPTION // CFA
2165 { $$ = AggregateDecl::Exception; }
2166 // { SemanticError( yylloc, "exception aggregate is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2167 ;
2168
2169aggregate_control: // CFA
2170 MONITOR
2171 { $$ = AggregateDecl::Monitor; }
2172 | MUTEX STRUCT
2173 { $$ = AggregateDecl::Monitor; }
2174 | GENERATOR
2175 { $$ = AggregateDecl::Generator; }
2176 | MUTEX GENERATOR
2177 { SemanticError( yylloc, "monitor generator is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2178 | COROUTINE
2179 { $$ = AggregateDecl::Coroutine; }
2180 | MUTEX COROUTINE
2181 { SemanticError( yylloc, "monitor coroutine is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2182 | THREAD
2183 { $$ = AggregateDecl::Thread; }
2184 | MUTEX THREAD
2185 { SemanticError( yylloc, "monitor thread is currently unimplemented." ); $$ = AggregateDecl::NoAggregate; }
2186 ;
2187
2188field_declaration_list_opt:
2189 // empty
2190 { $$ = nullptr; }
2191 | field_declaration_list_opt field_declaration
2192 { $$ = $1 ? $1->appendList( $2 ) : $2; }
2193 ;
2194
2195field_declaration:
2196 type_specifier field_declaring_list_opt ';'
2197 { $$ = fieldDecl( $1, $2 ); }
2198 | EXTENSION type_specifier field_declaring_list_opt ';' // GCC
2199 { $$ = fieldDecl( $2, $3 ); distExt( $$ ); }
2200 | INLINE type_specifier field_abstract_list_opt ';' // CFA
2201 {
2202 if ( ! $3 ) { // field declarator ?
2203 $3 = DeclarationNode::newName( nullptr );
2204 } // if
2205 $3->inLine = true;
2206 $$ = distAttr( $2, $3 ); // mark all fields in list
2207 distInl( $3 );
2208 }
2209 | INLINE aggregate_control ';' // CFA
2210 { SemanticError( yylloc, "INLINE aggregate control currently unimplemented." ); $$ = nullptr; }
2211 | typedef_declaration ';' // CFA
2212 | cfa_field_declaring_list ';' // CFA, new style field declaration
2213 | EXTENSION cfa_field_declaring_list ';' // GCC
2214 { distExt( $2 ); $$ = $2; } // mark all fields in list
2215 | INLINE cfa_field_abstract_list ';' // CFA, new style field declaration
2216 { $$ = $2; } // mark all fields in list
2217 | cfa_typedef_declaration ';' // CFA
2218 | static_assert // C11
2219 ;
2220
2221field_declaring_list_opt:
2222 // empty
2223 { $$ = nullptr; }
2224 | field_declarator
2225 | field_declaring_list_opt ',' attribute_list_opt field_declarator
2226 { $$ = $1->appendList( $4->addQualifiers( $3 ) ); }
2227 ;
2228
2229field_declarator:
2230 bit_subrange_size // C special case, no field name
2231 { $$ = DeclarationNode::newBitfield( $1 ); }
2232 | variable_declarator bit_subrange_size_opt
2233 // A semantic check is required to ensure bit_subrange only appears on integral types.
2234 { $$ = $1->addBitfield( $2 ); }
2235 | variable_type_redeclarator bit_subrange_size_opt
2236 // A semantic check is required to ensure bit_subrange only appears on integral types.
2237 { $$ = $1->addBitfield( $2 ); }
2238 ;
2239
2240field_abstract_list_opt:
2241 // empty
2242 { $$ = nullptr; }
2243 | field_abstract
2244 | field_abstract_list_opt ',' attribute_list_opt field_abstract
2245 { $$ = $1->appendList( $4->addQualifiers( $3 ) ); }
2246 ;
2247
2248field_abstract:
2249 // no bit fields
2250 variable_abstract_declarator
2251 ;
2252
2253cfa_field_declaring_list: // CFA, new style field declaration
2254 // bit-fields are handled by C declarations
2255 cfa_abstract_declarator_tuple identifier_or_type_name
2256 { $$ = $1->addName( $2 ); }
2257 | cfa_field_declaring_list ',' identifier_or_type_name
2258 { $$ = $1->appendList( $1->cloneType( $3 ) ); }
2259 ;
2260
2261cfa_field_abstract_list: // CFA, new style field declaration
2262 // bit-fields are handled by C declarations
2263 cfa_abstract_declarator_tuple
2264 | cfa_field_abstract_list ','
2265 { $$ = $1->appendList( $1->cloneType( 0 ) ); }
2266 ;
2267
2268bit_subrange_size_opt:
2269 // empty
2270 { $$ = nullptr; }
2271 | bit_subrange_size
2272 ;
2273
2274bit_subrange_size:
2275 ':' assignment_expression
2276 { $$ = $2; }
2277 ;
2278
2279enum_type: // enum
2280 ENUM attribute_list_opt '{' enumerator_list comma_opt '}'
2281 { $$ = DeclarationNode::newEnum( nullptr, $4, true )->addQualifiers( $2 ); }
2282 | ENUM attribute_list_opt identifier
2283 { typedefTable.makeTypedef( *$3 ); }
2284 '{' enumerator_list comma_opt '}'
2285 { $$ = DeclarationNode::newEnum( $3, $6, true )->addQualifiers( $2 ); }
2286 | ENUM attribute_list_opt typedef_name // unqualified type name
2287 '{' enumerator_list comma_opt '}'
2288 { $$ = DeclarationNode::newEnum( $3->name, $5, true )->addQualifiers( $2 ); }
2289 | ENUM '(' cfa_abstract_parameter_declaration ')' attribute_list_opt '{' enumerator_list comma_opt '}'
2290 {
2291 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." ); }
2292 SemanticError( yylloc, "Typed enumeration is currently unimplemented." ); $$ = nullptr;
2293 }
2294 | ENUM '(' cfa_abstract_parameter_declaration ')' attribute_list_opt identifier attribute_list_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 );
2298 }
2299 '{' enumerator_list comma_opt '}'
2300 {
2301 SemanticError( yylloc, "Typed enumeration is currently unimplemented." ); $$ = nullptr;
2302 }
2303 | ENUM '(' cfa_abstract_parameter_declaration ')' attribute_list_opt typedef_name attribute_list_opt '{' enumerator_list comma_opt '}'
2304 {
2305 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." ); }
2306 typedefTable.makeTypedef( *$6->name );
2307 SemanticError( yylloc, "Typed enumeration is currently unimplemented." ); $$ = nullptr;
2308 }
2309 | enum_type_nobody
2310 ;
2311
2312enum_type_nobody: // enum - {...}
2313 ENUM attribute_list_opt identifier
2314 { typedefTable.makeTypedef( *$3 ); $$ = DeclarationNode::newEnum( $3, 0, false )->addQualifiers( $2 ); }
2315 | ENUM attribute_list_opt type_name // qualified type name
2316 { typedefTable.makeTypedef( *$3->type->symbolic.name ); $$ = DeclarationNode::newEnum( $3->type->symbolic.name, 0, false )->addQualifiers( $2 ); }
2317 ;
2318
2319enumerator_list:
2320 identifier_or_type_name enumerator_value_opt
2321 { $$ = DeclarationNode::newEnumConstant( $1, $2 ); }
2322 | INLINE type_name
2323 { $$ = DeclarationNode::newEnumConstant( new string("inline"), nullptr ); }
2324 | enumerator_list ',' identifier_or_type_name enumerator_value_opt
2325 { $$ = $1->appendList( DeclarationNode::newEnumConstant( $3, $4 ) ); }
2326 | enumerator_list ',' INLINE type_name enumerator_value_opt
2327 { $$ = $1->appendList( DeclarationNode::newEnumConstant( new string("inline"), nullptr ) ); }
2328 ;
2329
2330enumerator_value_opt:
2331 // empty
2332 { $$ = nullptr; }
2333 // | '=' constant_expression
2334 // { $$ = $2; }
2335 | simple_assignment_operator initializer
2336 { $$ = $2->get_expression(); } // FIX ME: enum only deals with constant_expression
2337 ;
2338
2339cfa_parameter_ellipsis_list_opt: // CFA, abstract + real
2340 // empty
2341 { $$ = DeclarationNode::newBasicType( DeclarationNode::Void ); }
2342 | ELLIPSIS
2343 { $$ = nullptr; }
2344 | cfa_abstract_parameter_list
2345 | cfa_parameter_list
2346 | cfa_parameter_list pop ',' push cfa_abstract_parameter_list
2347 { $$ = $1->appendList( $5 ); }
2348 | cfa_abstract_parameter_list pop ',' push ELLIPSIS
2349 { $$ = $1->addVarArgs(); }
2350 | cfa_parameter_list pop ',' push ELLIPSIS
2351 { $$ = $1->addVarArgs(); }
2352 ;
2353
2354cfa_parameter_list: // CFA
2355 // To obtain LR(1) between cfa_parameter_list and cfa_abstract_tuple, the last cfa_abstract_parameter_list is
2356 // factored out from cfa_parameter_list, flattening the rules to get lookahead to the ']'.
2357 cfa_parameter_declaration
2358 | cfa_abstract_parameter_list pop ',' push cfa_parameter_declaration
2359 { $$ = $1->appendList( $5 ); }
2360 | cfa_parameter_list pop ',' push cfa_parameter_declaration
2361 { $$ = $1->appendList( $5 ); }
2362 | cfa_parameter_list pop ',' push cfa_abstract_parameter_list pop ',' push cfa_parameter_declaration
2363 { $$ = $1->appendList( $5 )->appendList( $9 ); }
2364 ;
2365
2366cfa_abstract_parameter_list: // CFA, new & old style abstract
2367 cfa_abstract_parameter_declaration
2368 | cfa_abstract_parameter_list pop ',' push cfa_abstract_parameter_declaration
2369 { $$ = $1->appendList( $5 ); }
2370 ;
2371
2372parameter_type_list_opt:
2373 // empty
2374 { $$ = nullptr; }
2375 | ELLIPSIS
2376 { $$ = nullptr; }
2377 | parameter_list
2378 | parameter_list pop ',' push ELLIPSIS
2379 { $$ = $1->addVarArgs(); }
2380 ;
2381
2382parameter_list: // abstract + real
2383 abstract_parameter_declaration
2384 | parameter_declaration
2385 | parameter_list pop ',' push abstract_parameter_declaration
2386 { $$ = $1->appendList( $5 ); }
2387 | parameter_list pop ',' push parameter_declaration
2388 { $$ = $1->appendList( $5 ); }
2389 ;
2390
2391// Provides optional identifier names (abstract_declarator/variable_declarator), no initialization, different semantics
2392// for typedef name by using type_parameter_redeclarator instead of typedef_redeclarator, and function prototypes.
2393
2394cfa_parameter_declaration: // CFA, new & old style parameter declaration
2395 parameter_declaration
2396 | cfa_identifier_parameter_declarator_no_tuple identifier_or_type_name default_initializer_opt
2397 { $$ = $1->addName( $2 ); }
2398 | cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2399 // To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2400 { $$ = $1->addName( $2 ); }
2401 | type_qualifier_list cfa_abstract_tuple identifier_or_type_name default_initializer_opt
2402 { $$ = $2->addName( $3 )->addQualifiers( $1 ); }
2403 | cfa_function_specifier
2404 ;
2405
2406cfa_abstract_parameter_declaration: // CFA, new & old style parameter declaration
2407 abstract_parameter_declaration
2408 | cfa_identifier_parameter_declarator_no_tuple
2409 | cfa_abstract_tuple
2410 // To obtain LR(1), these rules must be duplicated here (see cfa_abstract_declarator).
2411 | type_qualifier_list cfa_abstract_tuple
2412 { $$ = $2->addQualifiers( $1 ); }
2413 | cfa_abstract_function
2414 ;
2415
2416parameter_declaration:
2417 // No SUE declaration in parameter list.
2418 declaration_specifier_nobody identifier_parameter_declarator default_initializer_opt
2419 { $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2420 | declaration_specifier_nobody type_parameter_redeclarator default_initializer_opt
2421 { $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2422 ;
2423
2424abstract_parameter_declaration:
2425 declaration_specifier_nobody default_initializer_opt
2426 { $$ = $1->addInitializer( $2 ? new InitializerNode( $2 ) : nullptr ); }
2427 | declaration_specifier_nobody abstract_parameter_declarator default_initializer_opt
2428 { $$ = $2->addType( $1 )->addInitializer( $3 ? new InitializerNode( $3 ) : nullptr ); }
2429 ;
2430
2431// ISO/IEC 9899:1999 Section 6.9.1(6) : "An identifier declared as a typedef name shall not be redeclared as a
2432// parameter." Because the scope of the K&R-style parameter-list sees the typedef first, the following is based only on
2433// identifiers. The ANSI-style parameter-list can redefine a typedef name.
2434
2435identifier_list: // K&R-style parameter list => no types
2436 identifier
2437 { $$ = DeclarationNode::newName( $1 ); }
2438 | identifier_list ',' identifier
2439 { $$ = $1->appendList( DeclarationNode::newName( $3 ) ); }
2440 ;
2441
2442identifier_or_type_name:
2443 identifier
2444 | TYPEDEFname
2445 | TYPEGENname
2446 ;
2447
2448type_no_function: // sizeof, alignof, cast (constructor)
2449 cfa_abstract_declarator_tuple // CFA
2450 | type_specifier
2451 | type_specifier abstract_declarator
2452 { $$ = $2->addType( $1 ); }
2453 ;
2454
2455type: // typeof, assertion
2456 type_no_function
2457 | cfa_abstract_function // CFA
2458 ;
2459
2460initializer_opt:
2461 // empty
2462 { $$ = nullptr; }
2463 | simple_assignment_operator initializer { $$ = $1 == OperKinds::Assign ? $2 : $2->set_maybeConstructed( false ); }
2464 | '=' VOID { $$ = new InitializerNode( true ); }
2465 | '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $2, true ); }
2466 ;
2467
2468initializer:
2469 assignment_expression { $$ = new InitializerNode( $1 ); }
2470 | '{' initializer_list_opt comma_opt '}' { $$ = new InitializerNode( $2, true ); }
2471 ;
2472
2473initializer_list_opt:
2474 // empty
2475 { $$ = nullptr; }
2476 | initializer
2477 | designation initializer { $$ = $2->set_designators( $1 ); }
2478 | initializer_list_opt ',' initializer { $$ = (InitializerNode *)( $1->set_last( $3 ) ); }
2479 | initializer_list_opt ',' designation initializer { $$ = (InitializerNode *)($1->set_last( $4->set_designators( $3 ) )); }
2480 ;
2481
2482// There is an unreconcileable parsing problem between C99 and CFA with respect to designators. The problem is use of
2483// '=' to separator the designator from the initializer value, as in:
2484//
2485// int x[10] = { [1] = 3 };
2486//
2487// The string "[1] = 3" can be parsed as a designator assignment or a tuple assignment. To disambiguate this case, CFA
2488// changes the syntax from "=" to ":" as the separator between the designator and initializer. GCC does uses ":" for
2489// field selection. The optional use of the "=" in GCC, or in this case ":", cannot be supported either due to
2490// shift/reduce conflicts
2491
2492designation:
2493 designator_list ':' // C99, CFA uses ":" instead of "="
2494 | identifier_at ':' // GCC, field name
2495 { $$ = new ExpressionNode( build_varref( $1 ) ); }
2496 ;
2497
2498designator_list: // C99
2499 designator
2500 | designator_list designator
2501 { $$ = (ExpressionNode *)($1->set_last( $2 )); }
2502 //| designator_list designator { $$ = new ExpressionNode( $1, $2 ); }
2503 ;
2504
2505designator:
2506 '.' identifier_at // C99, field name
2507 { $$ = new ExpressionNode( build_varref( $2 ) ); }
2508 | '[' push assignment_expression pop ']' // C99, single array element
2509 // assignment_expression used instead of constant_expression because of shift/reduce conflicts with tuple.
2510 { $$ = $3; }
2511 | '[' push subrange pop ']' // CFA, multiple array elements
2512 { $$ = $3; }
2513 | '[' push constant_expression ELLIPSIS constant_expression pop ']' // GCC, multiple array elements
2514 { $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild<Expression>( $3 ), maybeMoveBuild<Expression>( $5 ) ) ); }
2515 | '.' '[' push field_name_list pop ']' // CFA, tuple field selector
2516 { $$ = $4; }
2517 ;
2518
2519// The CFA type system is based on parametric polymorphism, the ability to declare functions with type parameters,
2520// rather than an object-oriented type system. This required four groups of extensions:
2521//
2522// Overloading: function, data, and operator identifiers may be overloaded.
2523//
2524// Type declarations: "otype" is used to generate new types for declaring objects. Similarly, "dtype" is used for object
2525// and incomplete types, and "ftype" is used for function types. Type declarations with initializers provide
2526// definitions of new types. Type declarations with storage class "extern" provide opaque types.
2527//
2528// Polymorphic functions: A forall clause declares a type parameter. The corresponding argument is inferred at the call
2529// site. A polymorphic function is not a template; it is a function, with an address and a type.
2530//
2531// Specifications and Assertions: Specifications are collections of declarations parameterized by one or more
2532// types. They serve many of the purposes of abstract classes, and specification hierarchies resemble subclass
2533// hierarchies. Unlike classes, they can define relationships between types. Assertions declare that a type or
2534// types provide the operations declared by a specification. Assertions are normally used to declare requirements
2535// on type arguments of polymorphic functions.
2536
2537type_parameter_list: // CFA
2538 type_parameter
2539 | type_parameter_list ',' type_parameter
2540 { $$ = $1->appendList( $3 ); }
2541 ;
2542
2543type_initializer_opt: // CFA
2544 // empty
2545 { $$ = nullptr; }
2546 | '=' type
2547 { $$ = $2; }
2548 ;
2549
2550type_parameter: // CFA
2551 type_class identifier_or_type_name
2552 {
2553 typedefTable.addToScope( *$2, TYPEDEFname, "9" );
2554 if ( $1 == TypeDecl::Otype ) { SemanticError( yylloc, "otype keyword is deprecated, use T " ); }
2555 if ( $1 == TypeDecl::Dtype ) { SemanticError( yylloc, "dtype keyword is deprecated, use T &" ); }
2556 if ( $1 == TypeDecl::Ttype ) { SemanticError( yylloc, "ttype keyword is deprecated, use T ..." ); }
2557 }
2558 type_initializer_opt assertion_list_opt
2559 { $$ = DeclarationNode::newTypeParam( $1, $2 )->addTypeInitializer( $4 )->addAssertions( $5 ); }
2560 | identifier_or_type_name new_type_class
2561 { typedefTable.addToScope( *$1, TYPEDEFname, "9" ); }
2562 type_initializer_opt assertion_list_opt
2563 { $$ = DeclarationNode::newTypeParam( $2, $1 )->addTypeInitializer( $4 )->addAssertions( $5 ); }
2564 | '[' identifier_or_type_name ']'
2565 {
2566 typedefTable.addToScope( *$2, TYPEDIMname, "9" );
2567 $$ = DeclarationNode::newTypeParam( TypeDecl::Dimension, $2 );
2568 }
2569 // | type_specifier identifier_parameter_declarator
2570 | assertion_list
2571 { $$ = DeclarationNode::newTypeParam( TypeDecl::Dtype, new string( DeclarationNode::anonymous.newName() ) )->addAssertions( $1 ); }
2572 ;
2573
2574new_type_class: // CFA
2575 // empty
2576 { $$ = TypeDecl::Otype; }
2577 | '&'
2578 { $$ = TypeDecl::Dtype; }
2579 | '*'
2580 { $$ = TypeDecl::DStype; } // dtype + sized
2581 // | '(' '*' ')'
2582 // { $$ = TypeDecl::Ftype; }
2583 | ELLIPSIS
2584 { $$ = TypeDecl::Ttype; }
2585 ;
2586
2587type_class: // CFA
2588 OTYPE
2589 { $$ = TypeDecl::Otype; }
2590 | DTYPE
2591 { $$ = TypeDecl::Dtype; }
2592 | FTYPE
2593 { $$ = TypeDecl::Ftype; }
2594 | TTYPE
2595 { $$ = TypeDecl::Ttype; }
2596 ;
2597
2598assertion_list_opt: // CFA
2599 // empty
2600 { $$ = nullptr; }
2601 | assertion_list
2602 ;
2603
2604assertion_list: // CFA
2605 assertion
2606 | assertion_list assertion
2607 { $$ = $1->appendList( $2 ); }
2608 ;
2609
2610assertion: // CFA
2611 '|' identifier_or_type_name '(' type_list ')'
2612 { $$ = DeclarationNode::newTraitUse( $2, $4 ); }
2613 | '|' '{' push trait_declaration_list pop '}'
2614 { $$ = $4; }
2615 // | '|' '(' push type_parameter_list pop ')' '{' push trait_declaration_list pop '}' '(' type_list ')'
2616 // { SemanticError( yylloc, "Generic data-type assertion is currently unimplemented." ); $$ = nullptr; }
2617 ;
2618
2619type_list: // CFA
2620 type
2621 { $$ = new ExpressionNode( new TypeExpr( maybeMoveBuildType( $1 ) ) ); }
2622 | assignment_expression
2623 | type_list ',' type
2624 { $$ = (ExpressionNode *)($1->set_last( new ExpressionNode( new TypeExpr( maybeMoveBuildType( $3 ) ) ) )); }
2625 | type_list ',' assignment_expression
2626 { $$ = (ExpressionNode *)( $1->set_last( $3 )); }
2627 ;
2628
2629type_declaring_list: // CFA
2630 OTYPE type_declarator
2631 { $$ = $2; }
2632 | storage_class_list OTYPE type_declarator
2633 { $$ = $3->addQualifiers( $1 ); }
2634 | type_declaring_list ',' type_declarator
2635 { $$ = $1->appendList( $3->copySpecifiers( $1 ) ); }
2636 ;
2637
2638type_declarator: // CFA
2639 type_declarator_name assertion_list_opt
2640 { $$ = $1->addAssertions( $2 ); }
2641 | type_declarator_name assertion_list_opt '=' type
2642 { $$ = $1->addAssertions( $2 )->addType( $4 ); }
2643 ;
2644
2645type_declarator_name: // CFA
2646 identifier_or_type_name
2647 {
2648 typedefTable.addToEnclosingScope( *$1, TYPEDEFname, "10" );
2649 $$ = DeclarationNode::newTypeDecl( $1, 0 );
2650 }
2651 | identifier_or_type_name '(' type_parameter_list ')'
2652 {
2653 typedefTable.addToEnclosingScope( *$1, TYPEGENname, "11" );
2654 $$ = DeclarationNode::newTypeDecl( $1, $3 );
2655 }
2656 ;
2657
2658trait_specifier: // CFA
2659 TRAIT identifier_or_type_name '(' type_parameter_list ')' '{' '}'
2660 { $$ = DeclarationNode::newTrait( $2, $4, 0 ); }
2661 | TRAIT identifier_or_type_name '(' type_parameter_list ')' '{' push trait_declaration_list pop '}'
2662 { $$ = DeclarationNode::newTrait( $2, $4, $8 ); }
2663 ;
2664
2665trait_declaration_list: // CFA
2666 trait_declaration
2667 | trait_declaration_list pop push trait_declaration
2668 { $$ = $1->appendList( $4 ); }
2669 ;
2670
2671trait_declaration: // CFA
2672 cfa_trait_declaring_list ';'
2673 | trait_declaring_list ';'
2674 ;
2675
2676cfa_trait_declaring_list: // CFA
2677 cfa_variable_specifier
2678 | cfa_function_specifier
2679 | cfa_trait_declaring_list pop ',' push identifier_or_type_name
2680 { $$ = $1->appendList( $1->cloneType( $5 ) ); }
2681 ;
2682
2683trait_declaring_list: // CFA
2684 type_specifier declarator
2685 { $$ = $2->addType( $1 ); }
2686 | trait_declaring_list pop ',' push declarator
2687 { $$ = $1->appendList( $1->cloneBaseType( $5 ) ); }
2688 ;
2689
2690//***************************** EXTERNAL DEFINITIONS *****************************
2691
2692translation_unit:
2693 // empty, input file
2694 | external_definition_list
2695 { parseTree = parseTree ? parseTree->appendList( $1 ) : $1; }
2696 ;
2697
2698external_definition_list:
2699 push external_definition pop
2700 { $$ = $2; }
2701 | external_definition_list push external_definition pop
2702 { $$ = $1 ? $1->appendList( $3 ) : $3; }
2703 ;
2704
2705external_definition_list_opt:
2706 // empty
2707 { $$ = nullptr; }
2708 | external_definition_list
2709 ;
2710
2711up:
2712 { typedefTable.up( forall ); forall = false; }
2713 ;
2714
2715down:
2716 { typedefTable.down(); }
2717 ;
2718
2719external_definition:
2720 DIRECTIVE
2721 { $$ = DeclarationNode::newDirectiveStmt( new StatementNode( build_directive( $1 ) ) ); }
2722 | declaration
2723 | external_function_definition
2724 | EXTENSION external_definition // GCC, multiple __extension__ allowed, meaning unknown
2725 {
2726 distExt( $2 ); // mark all fields in list
2727 $$ = $2;
2728 }
2729 | ASM '(' string_literal ')' ';' // GCC, global assembler statement
2730 { $$ = DeclarationNode::newAsmStmt( new StatementNode( build_asm( false, $3, 0 ) ) ); }
2731 | EXTERN STRINGliteral // C++-style linkage specifier
2732 {
2733 linkageStack.push( linkage ); // handle nested extern "C"/"Cforall"
2734 linkage = LinkageSpec::update( yylloc, linkage, $2 );
2735 }
2736 '{' up external_definition_list_opt down '}'
2737 {
2738 linkage = linkageStack.top();
2739 linkageStack.pop();
2740 $$ = $6;
2741 }
2742 | type_qualifier_list
2743 {
2744 if ( $1->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
2745 if ( $1->type->forall ) forall = true; // remember generic type
2746 }
2747 '{' up external_definition_list_opt down '}' // CFA, namespace
2748 {
2749 distQual( $5, $1 );
2750 forall = false;
2751 $$ = $5;
2752 }
2753 | declaration_qualifier_list
2754 {
2755 if ( $1->type && $1->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
2756 if ( $1->type && $1->type->forall ) forall = true; // remember generic type
2757 }
2758 '{' up external_definition_list_opt down '}' // CFA, namespace
2759 {
2760 distQual( $5, $1 );
2761 forall = false;
2762 $$ = $5;
2763 }
2764 | declaration_qualifier_list type_qualifier_list
2765 {
2766 if ( ($1->type && $1->type->qualifiers.val) || $2->type->qualifiers.val ) { SemanticError( yylloc, "CV qualifiers cannot be distributed; only storage-class and forall qualifiers." ); }
2767 if ( ($1->type && $1->type->forall) || $2->type->forall ) forall = true; // remember generic type
2768 }
2769 '{' up external_definition_list_opt down '}' // CFA, namespace
2770 {
2771 distQual( $6, $1->addQualifiers( $2 ) );
2772 forall = false;
2773 $$ = $6;
2774 }
2775 ;
2776
2777external_function_definition:
2778 function_definition
2779 // These rules are a concession to the "implicit int" type_specifier because there is a significant amount of
2780 // legacy code with global functions missing the type-specifier for the return type, and assuming "int".
2781 // Parsing is possible because function_definition does not appear in the context of an expression (nested
2782 // functions preclude this concession, i.e., all nested function must have a return type). A function prototype
2783 // declaration must still have a type_specifier. OBSOLESCENT (see 1)
2784 | function_declarator compound_statement
2785 { $$ = $1->addFunctionBody( $2 ); }
2786 | KR_function_declarator KR_parameter_list_opt compound_statement
2787 { $$ = $1->addOldDeclList( $2 )->addFunctionBody( $3 ); }
2788 ;
2789
2790with_clause_opt:
2791 // empty
2792 { $$ = nullptr; forall = false; }
2793 | WITH '(' tuple_expression_list ')'
2794 { $$ = $3; forall = false; }
2795 ;
2796
2797function_definition:
2798 cfa_function_declaration with_clause_opt compound_statement // CFA
2799 {
2800 // Add the function body to the last identifier in the function definition list, i.e., foo3:
2801 // [const double] foo1(), foo2( int ), foo3( double ) { return 3.0; }
2802 $1->get_last()->addFunctionBody( $3, $2 );
2803 $$ = $1;
2804 }
2805 | declaration_specifier function_declarator with_clause_opt compound_statement
2806 {
2807 rebindForall( $1, $2 );
2808 $$ = $2->addFunctionBody( $4, $3 )->addType( $1 );
2809 }
2810 | declaration_specifier variable_type_redeclarator with_clause_opt compound_statement
2811 {
2812 rebindForall( $1, $2 );
2813 $$ = $2->addFunctionBody( $4, $3 )->addType( $1 );
2814 }
2815 // handles default int return type, OBSOLESCENT (see 1)
2816 | type_qualifier_list function_declarator with_clause_opt compound_statement
2817 { $$ = $2->addFunctionBody( $4, $3 )->addQualifiers( $1 ); }
2818 // handles default int return type, OBSOLESCENT (see 1)
2819 | declaration_qualifier_list function_declarator with_clause_opt compound_statement
2820 { $$ = $2->addFunctionBody( $4, $3 )->addQualifiers( $1 ); }
2821 // handles default int return type, OBSOLESCENT (see 1)
2822 | declaration_qualifier_list type_qualifier_list function_declarator with_clause_opt compound_statement
2823 { $$ = $3->addFunctionBody( $5, $4 )->addQualifiers( $2 )->addQualifiers( $1 ); }
2824
2825 // Old-style K&R function definition, OBSOLESCENT (see 4)
2826 | declaration_specifier KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2827 {
2828 rebindForall( $1, $2 );
2829 $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addType( $1 );
2830 }
2831 // handles default int return type, OBSOLESCENT (see 1)
2832 | type_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2833 { $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addQualifiers( $1 ); }
2834 // handles default int return type, OBSOLESCENT (see 1)
2835 | declaration_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2836 { $$ = $2->addOldDeclList( $3 )->addFunctionBody( $5, $4 )->addQualifiers( $1 ); }
2837 // handles default int return type, OBSOLESCENT (see 1)
2838 | declaration_qualifier_list type_qualifier_list KR_function_declarator KR_parameter_list_opt with_clause_opt compound_statement
2839 { $$ = $3->addOldDeclList( $4 )->addFunctionBody( $6, $5 )->addQualifiers( $2 )->addQualifiers( $1 ); }
2840 ;
2841
2842declarator:
2843 variable_declarator
2844 | variable_type_redeclarator
2845 | function_declarator
2846 ;
2847
2848subrange:
2849 constant_expression '~' constant_expression // CFA, integer subrange
2850 { $$ = new ExpressionNode( new RangeExpr( maybeMoveBuild<Expression>( $1 ), maybeMoveBuild<Expression>( $3 ) ) ); }
2851 ;
2852
2853asm_name_opt: // GCC
2854 // empty
2855 { $$ = nullptr; }
2856 | ASM '(' string_literal ')' attribute_list_opt
2857 {
2858 DeclarationNode * name = new DeclarationNode();
2859 name->asmName = $3;
2860 $$ = name->addQualifiers( $5 );
2861 }
2862 ;
2863
2864attribute_list_opt: // GCC
2865 // empty
2866 { $$ = nullptr; }
2867 | attribute_list
2868 ;
2869
2870attribute_list: // GCC
2871 attribute
2872 | attribute_list attribute
2873 { $$ = $2->addQualifiers( $1 ); }
2874 ;
2875
2876attribute: // GCC
2877 ATTRIBUTE '(' '(' attribute_name_list ')' ')'
2878 { $$ = $4; }
2879 ;
2880
2881attribute_name_list: // GCC
2882 attribute_name
2883 | attribute_name_list ',' attribute_name
2884 { $$ = $3->addQualifiers( $1 ); }
2885 ;
2886
2887attribute_name: // GCC
2888 // empty
2889 { $$ = nullptr; }
2890 | attr_name
2891 { $$ = DeclarationNode::newAttribute( $1 ); }
2892 | attr_name '(' argument_expression_list_opt ')'
2893 { $$ = DeclarationNode::newAttribute( $1, $3 ); }
2894 ;
2895
2896attr_name: // GCC
2897 IDENTIFIER
2898 | quasi_keyword
2899 | TYPEDEFname
2900 | TYPEGENname
2901 | FALLTHROUGH
2902 { $$ = Token{ new string( "fallthrough" ), { nullptr, -1 } }; }
2903 | CONST
2904 { $$ = Token{ new string( "__const__" ), { nullptr, -1 } }; }
2905 ;
2906
2907// ============================================================================
2908// The following sections are a series of grammar patterns used to parse declarators. Multiple patterns are necessary
2909// because the type of an identifier in wrapped around the identifier in the same form as its usage in an expression, as
2910// in:
2911//
2912// int (*f())[10] { ... };
2913// ... (*f())[3] += 1; // definition mimics usage
2914//
2915// Because these patterns are highly recursive, changes at a lower level in the recursion require copying some or all of
2916// the pattern. Each of these patterns has some subtle variation to ensure correct syntax in a particular context.
2917// ============================================================================
2918
2919// ----------------------------------------------------------------------------
2920// The set of valid declarators before a compound statement for defining a function is less than the set of declarators
2921// to define a variable or function prototype, e.g.:
2922//
2923// valid declaration invalid definition
2924// ----------------- ------------------
2925// int f; int f {}
2926// int *f; int *f {}
2927// int f[10]; int f[10] {}
2928// int (*f)(int); int (*f)(int) {}
2929//
2930// To preclude this syntactic anomaly requires separating the grammar rules for variable and function declarators, hence
2931// variable_declarator and function_declarator.
2932// ----------------------------------------------------------------------------
2933
2934// This pattern parses a declaration of a variable that is not redefining a typedef name. The pattern precludes
2935// declaring an array of functions versus a pointer to an array of functions.
2936
2937paren_identifier:
2938 identifier_at
2939 { $$ = DeclarationNode::newName( $1 ); }
2940 | '(' paren_identifier ')' // redundant parenthesis
2941 { $$ = $2; }
2942 ;
2943
2944variable_declarator:
2945 paren_identifier attribute_list_opt
2946 { $$ = $1->addQualifiers( $2 ); }
2947 | variable_ptr
2948 | variable_array attribute_list_opt
2949 { $$ = $1->addQualifiers( $2 ); }
2950 | variable_function attribute_list_opt
2951 { $$ = $1->addQualifiers( $2 ); }
2952 ;
2953
2954variable_ptr:
2955 ptrref_operator variable_declarator
2956 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
2957 | ptrref_operator type_qualifier_list variable_declarator
2958 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
2959 | '(' variable_ptr ')' attribute_list_opt // redundant parenthesis
2960 { $$ = $2->addQualifiers( $4 ); }
2961 | '(' attribute_list variable_ptr ')' attribute_list_opt // redundant parenthesis
2962 { $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
2963 ;
2964
2965variable_array:
2966 paren_identifier array_dimension
2967 { $$ = $1->addArray( $2 ); }
2968 | '(' variable_ptr ')' array_dimension
2969 { $$ = $2->addArray( $4 ); }
2970 | '(' attribute_list variable_ptr ')' array_dimension
2971 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
2972 | '(' variable_array ')' multi_array_dimension // redundant parenthesis
2973 { $$ = $2->addArray( $4 ); }
2974 | '(' attribute_list variable_array ')' multi_array_dimension // redundant parenthesis
2975 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
2976 | '(' variable_array ')' // redundant parenthesis
2977 { $$ = $2; }
2978 | '(' attribute_list variable_array ')' // redundant parenthesis
2979 { $$ = $3->addQualifiers( $2 ); }
2980 ;
2981
2982variable_function:
2983 '(' variable_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2984 { $$ = $2->addParamList( $6 ); }
2985 | '(' attribute_list variable_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
2986 { $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
2987 | '(' variable_function ')' // redundant parenthesis
2988 { $$ = $2; }
2989 | '(' attribute_list variable_function ')' // redundant parenthesis
2990 { $$ = $3->addQualifiers( $2 ); }
2991 ;
2992
2993// This pattern parses a function declarator that is not redefining a typedef name. For non-nested functions, there is
2994// no context where a function definition can redefine a typedef name, i.e., the typedef and function name cannot exist
2995// is the same scope. The pattern precludes returning arrays and functions versus pointers to arrays and functions.
2996
2997function_declarator:
2998 function_no_ptr attribute_list_opt
2999 { $$ = $1->addQualifiers( $2 ); }
3000 | function_ptr
3001 | function_array attribute_list_opt
3002 { $$ = $1->addQualifiers( $2 ); }
3003 ;
3004
3005function_no_ptr:
3006 paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3007 { $$ = $1->addParamList( $4 ); }
3008 | '(' function_ptr ')' '(' push parameter_type_list_opt pop ')'
3009 { $$ = $2->addParamList( $6 ); }
3010 | '(' attribute_list function_ptr ')' '(' push parameter_type_list_opt pop ')'
3011 { $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3012 | '(' function_no_ptr ')' // redundant parenthesis
3013 { $$ = $2; }
3014 | '(' attribute_list function_no_ptr ')' // redundant parenthesis
3015 { $$ = $3->addQualifiers( $2 ); }
3016 ;
3017
3018function_ptr:
3019 ptrref_operator function_declarator
3020 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3021 | ptrref_operator type_qualifier_list function_declarator
3022 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3023 | '(' function_ptr ')' attribute_list_opt
3024 { $$ = $2->addQualifiers( $4 ); }
3025 | '(' attribute_list function_ptr ')' attribute_list_opt
3026 { $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3027 ;
3028
3029function_array:
3030 '(' function_ptr ')' array_dimension
3031 { $$ = $2->addArray( $4 ); }
3032 | '(' attribute_list function_ptr ')' array_dimension
3033 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3034 | '(' function_array ')' multi_array_dimension // redundant parenthesis
3035 { $$ = $2->addArray( $4 ); }
3036 | '(' attribute_list function_array ')' multi_array_dimension // redundant parenthesis
3037 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3038 | '(' function_array ')' // redundant parenthesis
3039 { $$ = $2; }
3040 | '(' attribute_list function_array ')' // redundant parenthesis
3041 { $$ = $3->addQualifiers( $2 ); }
3042 ;
3043
3044// This pattern parses an old-style K&R function declarator (OBSOLESCENT, see 4)
3045//
3046// f( a, b, c ) int a, *b, c[]; {}
3047//
3048// that is not redefining a typedef name (see function_declarator for additional comments). The pattern precludes
3049// returning arrays and functions versus pointers to arrays and functions.
3050
3051KR_function_declarator:
3052 KR_function_no_ptr
3053 | KR_function_ptr
3054 | KR_function_array
3055 ;
3056
3057KR_function_no_ptr:
3058 paren_identifier '(' identifier_list ')' // function_declarator handles empty parameter
3059 { $$ = $1->addIdList( $3 ); }
3060 | '(' KR_function_ptr ')' '(' push parameter_type_list_opt pop ')'
3061 { $$ = $2->addParamList( $6 ); }
3062 | '(' attribute_list KR_function_ptr ')' '(' push parameter_type_list_opt pop ')'
3063 { $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3064 | '(' KR_function_no_ptr ')' // redundant parenthesis
3065 { $$ = $2; }
3066 | '(' attribute_list KR_function_no_ptr ')' // redundant parenthesis
3067 { $$ = $3->addQualifiers( $2 ); }
3068 ;
3069
3070KR_function_ptr:
3071 ptrref_operator KR_function_declarator
3072 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3073 | ptrref_operator type_qualifier_list KR_function_declarator
3074 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3075 | '(' KR_function_ptr ')'
3076 { $$ = $2; }
3077 | '(' attribute_list KR_function_ptr ')'
3078 { $$ = $3->addQualifiers( $2 ); }
3079 ;
3080
3081KR_function_array:
3082 '(' KR_function_ptr ')' array_dimension
3083 { $$ = $2->addArray( $4 ); }
3084 | '(' attribute_list KR_function_ptr ')' array_dimension
3085 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3086 | '(' KR_function_array ')' multi_array_dimension // redundant parenthesis
3087 { $$ = $2->addArray( $4 ); }
3088 | '(' attribute_list KR_function_array ')' multi_array_dimension // redundant parenthesis
3089 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3090 | '(' KR_function_array ')' // redundant parenthesis
3091 { $$ = $2; }
3092 | '(' attribute_list KR_function_array ')' // redundant parenthesis
3093 { $$ = $3->addQualifiers( $2 ); }
3094 ;
3095
3096// This pattern parses a declaration for a variable or function prototype that redefines a type name, e.g.:
3097//
3098// typedef int foo;
3099// {
3100// int foo; // redefine typedef name in new scope
3101// }
3102//
3103// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3104// and functions versus pointers to arrays and functions.
3105
3106paren_type:
3107 typedef_name
3108 {
3109 // hide type name in enclosing scope by variable name
3110 typedefTable.addToEnclosingScope( *$1->name, IDENTIFIER, "ID" );
3111 }
3112 | '(' paren_type ')'
3113 { $$ = $2; }
3114 ;
3115
3116variable_type_redeclarator:
3117 paren_type attribute_list_opt
3118 { $$ = $1->addQualifiers( $2 ); }
3119 | type_ptr
3120 | type_array attribute_list_opt
3121 { $$ = $1->addQualifiers( $2 ); }
3122 | type_function attribute_list_opt
3123 { $$ = $1->addQualifiers( $2 ); }
3124 ;
3125
3126type_ptr:
3127 ptrref_operator variable_type_redeclarator
3128 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3129 | ptrref_operator type_qualifier_list variable_type_redeclarator
3130 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3131 | '(' type_ptr ')' attribute_list_opt // redundant parenthesis
3132 { $$ = $2->addQualifiers( $4 ); }
3133 | '(' attribute_list type_ptr ')' attribute_list_opt // redundant parenthesis
3134 { $$ = $3->addQualifiers( $2 )->addQualifiers( $5 ); }
3135 ;
3136
3137type_array:
3138 paren_type array_dimension
3139 { $$ = $1->addArray( $2 ); }
3140 | '(' type_ptr ')' array_dimension
3141 { $$ = $2->addArray( $4 ); }
3142 | '(' attribute_list type_ptr ')' array_dimension
3143 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3144 | '(' type_array ')' multi_array_dimension // redundant parenthesis
3145 { $$ = $2->addArray( $4 ); }
3146 | '(' attribute_list type_array ')' multi_array_dimension // redundant parenthesis
3147 { $$ = $3->addQualifiers( $2 )->addArray( $5 ); }
3148 | '(' type_array ')' // redundant parenthesis
3149 { $$ = $2; }
3150 | '(' attribute_list type_array ')' // redundant parenthesis
3151 { $$ = $3->addQualifiers( $2 ); }
3152 ;
3153
3154type_function:
3155 paren_type '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3156 { $$ = $1->addParamList( $4 ); }
3157 | '(' type_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3158 { $$ = $2->addParamList( $6 ); }
3159 | '(' attribute_list type_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3160 { $$ = $3->addQualifiers( $2 )->addParamList( $7 ); }
3161 | '(' type_function ')' // redundant parenthesis
3162 { $$ = $2; }
3163 | '(' attribute_list type_function ')' // redundant parenthesis
3164 { $$ = $3->addQualifiers( $2 ); }
3165 ;
3166
3167// This pattern parses a declaration for a parameter variable of a function prototype or actual that is not redefining a
3168// typedef name and allows the C99 array options, which can only appear in a parameter list. The pattern precludes
3169// declaring an array of functions versus a pointer to an array of functions, and returning arrays and functions versus
3170// pointers to arrays and functions.
3171
3172identifier_parameter_declarator:
3173 paren_identifier attribute_list_opt
3174 { $$ = $1->addQualifiers( $2 ); }
3175 | '&' MUTEX paren_identifier attribute_list_opt
3176 { $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3177 | identifier_parameter_ptr
3178 | identifier_parameter_array attribute_list_opt
3179 { $$ = $1->addQualifiers( $2 ); }
3180 | identifier_parameter_function attribute_list_opt
3181 { $$ = $1->addQualifiers( $2 ); }
3182 ;
3183
3184identifier_parameter_ptr:
3185 ptrref_operator identifier_parameter_declarator
3186 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3187 | ptrref_operator type_qualifier_list identifier_parameter_declarator
3188 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3189 | '(' identifier_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3190 { $$ = $2->addQualifiers( $4 ); }
3191 ;
3192
3193identifier_parameter_array:
3194 paren_identifier array_parameter_dimension
3195 { $$ = $1->addArray( $2 ); }
3196 | '(' identifier_parameter_ptr ')' array_dimension
3197 { $$ = $2->addArray( $4 ); }
3198 | '(' identifier_parameter_array ')' multi_array_dimension // redundant parenthesis
3199 { $$ = $2->addArray( $4 ); }
3200 | '(' identifier_parameter_array ')' // redundant parenthesis
3201 { $$ = $2; }
3202 ;
3203
3204identifier_parameter_function:
3205 paren_identifier '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3206 { $$ = $1->addParamList( $4 ); }
3207 | '(' identifier_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3208 { $$ = $2->addParamList( $6 ); }
3209 | '(' identifier_parameter_function ')' // redundant parenthesis
3210 { $$ = $2; }
3211 ;
3212
3213// This pattern parses a declaration for a parameter variable or function prototype that is redefining a typedef name,
3214// e.g.:
3215//
3216// typedef int foo;
3217// forall( otype T ) struct foo;
3218// int f( int foo ); // redefine typedef name in new scope
3219//
3220// and allows the C99 array options, which can only appear in a parameter list.
3221
3222type_parameter_redeclarator:
3223 typedef_name attribute_list_opt
3224 { $$ = $1->addQualifiers( $2 ); }
3225 | '&' MUTEX typedef_name attribute_list_opt
3226 { $$ = $3->addPointer( DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf ) )->addQualifiers( $4 ); }
3227 | type_parameter_ptr
3228 | type_parameter_array attribute_list_opt
3229 { $$ = $1->addQualifiers( $2 ); }
3230 | type_parameter_function attribute_list_opt
3231 { $$ = $1->addQualifiers( $2 ); }
3232 ;
3233
3234typedef_name:
3235 TYPEDEFname
3236 { $$ = DeclarationNode::newName( $1 ); }
3237 | TYPEGENname
3238 { $$ = DeclarationNode::newName( $1 ); }
3239 ;
3240
3241type_parameter_ptr:
3242 ptrref_operator type_parameter_redeclarator
3243 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3244 | ptrref_operator type_qualifier_list type_parameter_redeclarator
3245 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3246 | '(' type_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3247 { $$ = $2->addQualifiers( $4 ); }
3248 ;
3249
3250type_parameter_array:
3251 typedef_name array_parameter_dimension
3252 { $$ = $1->addArray( $2 ); }
3253 | '(' type_parameter_ptr ')' array_parameter_dimension
3254 { $$ = $2->addArray( $4 ); }
3255 ;
3256
3257type_parameter_function:
3258 typedef_name '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3259 { $$ = $1->addParamList( $4 ); }
3260 | '(' type_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3261 { $$ = $2->addParamList( $6 ); }
3262 ;
3263
3264// This pattern parses a declaration of an abstract variable or function prototype, i.e., there is no identifier to
3265// which the type applies, e.g.:
3266//
3267// sizeof( int );
3268// sizeof( int * );
3269// sizeof( int [10] );
3270// sizeof( int (*)() );
3271// sizeof( int () );
3272//
3273// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3274// and functions versus pointers to arrays and functions.
3275
3276abstract_declarator:
3277 abstract_ptr
3278 | abstract_array attribute_list_opt
3279 { $$ = $1->addQualifiers( $2 ); }
3280 | abstract_function attribute_list_opt
3281 { $$ = $1->addQualifiers( $2 ); }
3282 ;
3283
3284abstract_ptr:
3285 ptrref_operator
3286 { $$ = DeclarationNode::newPointer( 0, $1 ); }
3287 | ptrref_operator type_qualifier_list
3288 { $$ = DeclarationNode::newPointer( $2, $1 ); }
3289 | ptrref_operator abstract_declarator
3290 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3291 | ptrref_operator type_qualifier_list abstract_declarator
3292 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3293 | '(' abstract_ptr ')' attribute_list_opt
3294 { $$ = $2->addQualifiers( $4 ); }
3295 ;
3296
3297abstract_array:
3298 array_dimension
3299 | '(' abstract_ptr ')' array_dimension
3300 { $$ = $2->addArray( $4 ); }
3301 | '(' abstract_array ')' multi_array_dimension // redundant parenthesis
3302 { $$ = $2->addArray( $4 ); }
3303 | '(' abstract_array ')' // redundant parenthesis
3304 { $$ = $2; }
3305 ;
3306
3307abstract_function:
3308 '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3309 { $$ = DeclarationNode::newFunction( nullptr, nullptr, $3, nullptr ); }
3310 | '(' abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3311 { $$ = $2->addParamList( $6 ); }
3312 | '(' abstract_function ')' // redundant parenthesis
3313 { $$ = $2; }
3314 ;
3315
3316array_dimension:
3317 // Only the first dimension can be empty.
3318 '[' ']'
3319 { $$ = DeclarationNode::newArray( 0, 0, false ); }
3320 | '[' ']' multi_array_dimension
3321 { $$ = DeclarationNode::newArray( 0, 0, false )->addArray( $3 ); }
3322 | '[' push assignment_expression pop ',' comma_expression ']'
3323 { $$ = DeclarationNode::newArray( $3, 0, false )->addArray( DeclarationNode::newArray( $6, 0, false ) ); }
3324 // { SemanticError( yylloc, "New array dimension is currently unimplemented." ); $$ = nullptr; }
3325 | multi_array_dimension
3326 ;
3327
3328multi_array_dimension:
3329 '[' push assignment_expression pop ']'
3330 { $$ = DeclarationNode::newArray( $3, 0, false ); }
3331 | '[' push '*' pop ']' // C99
3332 { $$ = DeclarationNode::newVarArray( 0 ); }
3333 | multi_array_dimension '[' push assignment_expression pop ']'
3334 { $$ = $1->addArray( DeclarationNode::newArray( $4, 0, false ) ); }
3335 | multi_array_dimension '[' push '*' pop ']' // C99
3336 { $$ = $1->addArray( DeclarationNode::newVarArray( 0 ) ); }
3337 ;
3338
3339// This pattern parses a declaration of a parameter abstract variable or function prototype, i.e., there is no
3340// identifier to which the type applies, e.g.:
3341//
3342// int f( int ); // not handled here
3343// int f( int * ); // abstract function-prototype parameter; no parameter name specified
3344// int f( int (*)() ); // abstract function-prototype parameter; no parameter name specified
3345// int f( int (int) ); // abstract function-prototype parameter; no parameter name specified
3346//
3347// The pattern precludes declaring an array of functions versus a pointer to an array of functions, and returning arrays
3348// and functions versus pointers to arrays and functions. In addition, the pattern handles the
3349// special meaning of parenthesis around a typedef name:
3350//
3351// ISO/IEC 9899:1999 Section 6.7.5.3(11) : "In a parameter declaration, a single typedef name in
3352// parentheses is taken to be an abstract declarator that specifies a function with a single parameter,
3353// not as redundant parentheses around the identifier."
3354//
3355// For example:
3356//
3357// typedef float T;
3358// int f( int ( T [5] ) ); // see abstract_parameter_declarator
3359// int g( int ( T ( int ) ) ); // see abstract_parameter_declarator
3360// int f( int f1( T a[5] ) ); // see identifier_parameter_declarator
3361// int g( int g1( T g2( int p ) ) ); // see identifier_parameter_declarator
3362//
3363// In essence, a '(' immediately to the left of typedef name, T, is interpreted as starting a parameter type list, and
3364// not as redundant parentheses around a redeclaration of T. Finally, the pattern also precludes declaring an array of
3365// functions versus a pointer to an array of functions, and returning arrays and functions versus pointers to arrays and
3366// functions.
3367
3368abstract_parameter_declarator:
3369 abstract_parameter_ptr
3370 | '&' MUTEX attribute_list_opt
3371 { $$ = DeclarationNode::newPointer( DeclarationNode::newTypeQualifier( Type::Mutex ), OperKinds::AddressOf )->addQualifiers( $3 ); }
3372 | abstract_parameter_array attribute_list_opt
3373 { $$ = $1->addQualifiers( $2 ); }
3374 | abstract_parameter_function attribute_list_opt
3375 { $$ = $1->addQualifiers( $2 ); }
3376 ;
3377
3378abstract_parameter_ptr:
3379 ptrref_operator
3380 { $$ = DeclarationNode::newPointer( nullptr, $1 ); }
3381 | ptrref_operator type_qualifier_list
3382 { $$ = DeclarationNode::newPointer( $2, $1 ); }
3383 | ptrref_operator abstract_parameter_declarator
3384 { $$ = $2->addPointer( DeclarationNode::newPointer( nullptr, $1 ) ); }
3385 | ptrref_operator type_qualifier_list abstract_parameter_declarator
3386 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3387 | '(' abstract_parameter_ptr ')' attribute_list_opt // redundant parenthesis
3388 { $$ = $2->addQualifiers( $4 ); }
3389 ;
3390
3391abstract_parameter_array:
3392 array_parameter_dimension
3393 | '(' abstract_parameter_ptr ')' array_parameter_dimension
3394 { $$ = $2->addArray( $4 ); }
3395 | '(' abstract_parameter_array ')' multi_array_dimension // redundant parenthesis
3396 { $$ = $2->addArray( $4 ); }
3397 | '(' abstract_parameter_array ')' // redundant parenthesis
3398 { $$ = $2; }
3399 ;
3400
3401abstract_parameter_function:
3402 '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3403 { $$ = DeclarationNode::newFunction( nullptr, nullptr, $3, nullptr ); }
3404 | '(' abstract_parameter_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3405 { $$ = $2->addParamList( $6 ); }
3406 | '(' abstract_parameter_function ')' // redundant parenthesis
3407 { $$ = $2; }
3408 ;
3409
3410array_parameter_dimension:
3411 // Only the first dimension can be empty or have qualifiers.
3412 array_parameter_1st_dimension
3413 | array_parameter_1st_dimension multi_array_dimension
3414 { $$ = $1->addArray( $2 ); }
3415 | multi_array_dimension
3416 ;
3417
3418// The declaration of an array parameter has additional syntax over arrays in normal variable declarations:
3419//
3420// ISO/IEC 9899:1999 Section 6.7.5.2(1) : "The optional type qualifiers and the keyword static shall appear only in
3421// a declaration of a function parameter with an array type, and then only in the outermost array type derivation."
3422
3423array_parameter_1st_dimension:
3424 '[' ']'
3425 { $$ = DeclarationNode::newArray( 0, 0, false ); }
3426 // multi_array_dimension handles the '[' '*' ']' case
3427 | '[' push type_qualifier_list '*' pop ']' // remaining C99
3428 { $$ = DeclarationNode::newVarArray( $3 ); }
3429 | '[' push type_qualifier_list pop ']'
3430 { $$ = DeclarationNode::newArray( 0, $3, false ); }
3431 // multi_array_dimension handles the '[' assignment_expression ']' case
3432 | '[' push type_qualifier_list assignment_expression pop ']'
3433 { $$ = DeclarationNode::newArray( $4, $3, false ); }
3434 | '[' push STATIC type_qualifier_list_opt assignment_expression pop ']'
3435 { $$ = DeclarationNode::newArray( $5, $4, true ); }
3436 | '[' push type_qualifier_list STATIC assignment_expression pop ']'
3437 { $$ = DeclarationNode::newArray( $5, $3, true ); }
3438 ;
3439
3440// This pattern parses a declaration of an abstract variable, but does not allow "int ()" for a function pointer.
3441//
3442// struct S {
3443// int;
3444// int *;
3445// int [10];
3446// int (*)();
3447// };
3448
3449variable_abstract_declarator:
3450 variable_abstract_ptr
3451 | variable_abstract_array attribute_list_opt
3452 { $$ = $1->addQualifiers( $2 ); }
3453 | variable_abstract_function attribute_list_opt
3454 { $$ = $1->addQualifiers( $2 ); }
3455 ;
3456
3457variable_abstract_ptr:
3458 ptrref_operator
3459 { $$ = DeclarationNode::newPointer( 0, $1 ); }
3460 | ptrref_operator type_qualifier_list
3461 { $$ = DeclarationNode::newPointer( $2, $1 ); }
3462 | ptrref_operator variable_abstract_declarator
3463 { $$ = $2->addPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3464 | ptrref_operator type_qualifier_list variable_abstract_declarator
3465 { $$ = $3->addPointer( DeclarationNode::newPointer( $2, $1 ) ); }
3466 | '(' variable_abstract_ptr ')' attribute_list_opt // redundant parenthesis
3467 { $$ = $2->addQualifiers( $4 ); }
3468 ;
3469
3470variable_abstract_array:
3471 array_dimension
3472 | '(' variable_abstract_ptr ')' array_dimension
3473 { $$ = $2->addArray( $4 ); }
3474 | '(' variable_abstract_array ')' multi_array_dimension // redundant parenthesis
3475 { $$ = $2->addArray( $4 ); }
3476 | '(' variable_abstract_array ')' // redundant parenthesis
3477 { $$ = $2; }
3478 ;
3479
3480variable_abstract_function:
3481 '(' variable_abstract_ptr ')' '(' push parameter_type_list_opt pop ')' // empty parameter list OBSOLESCENT (see 3)
3482 { $$ = $2->addParamList( $6 ); }
3483 | '(' variable_abstract_function ')' // redundant parenthesis
3484 { $$ = $2; }
3485 ;
3486
3487// This pattern parses a new-style declaration for a parameter variable or function prototype that is either an
3488// identifier or typedef name and allows the C99 array options, which can only appear in a parameter list.
3489
3490cfa_identifier_parameter_declarator_tuple: // CFA
3491 cfa_identifier_parameter_declarator_no_tuple
3492 | cfa_abstract_tuple
3493 | type_qualifier_list cfa_abstract_tuple
3494 { $$ = $2->addQualifiers( $1 ); }
3495 ;
3496
3497cfa_identifier_parameter_declarator_no_tuple: // CFA
3498 cfa_identifier_parameter_ptr
3499 | cfa_identifier_parameter_array
3500 ;
3501
3502cfa_identifier_parameter_ptr: // CFA
3503 // No SUE declaration in parameter list.
3504 ptrref_operator type_specifier_nobody
3505 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3506 | type_qualifier_list ptrref_operator type_specifier_nobody
3507 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3508 | ptrref_operator cfa_abstract_function
3509 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3510 | type_qualifier_list ptrref_operator cfa_abstract_function
3511 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3512 | ptrref_operator cfa_identifier_parameter_declarator_tuple
3513 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3514 | type_qualifier_list ptrref_operator cfa_identifier_parameter_declarator_tuple
3515 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3516 ;
3517
3518cfa_identifier_parameter_array: // CFA
3519 // Only the first dimension can be empty or have qualifiers. Empty dimension must be factored out due to
3520 // shift/reduce conflict with new-style empty (void) function return type.
3521 '[' ']' type_specifier_nobody
3522 { $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3523 | cfa_array_parameter_1st_dimension type_specifier_nobody
3524 { $$ = $2->addNewArray( $1 ); }
3525 | '[' ']' multi_array_dimension type_specifier_nobody
3526 { $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3527 | cfa_array_parameter_1st_dimension multi_array_dimension type_specifier_nobody
3528 { $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
3529 | multi_array_dimension type_specifier_nobody
3530 { $$ = $2->addNewArray( $1 ); }
3531
3532 | '[' ']' cfa_identifier_parameter_ptr
3533 { $$ = $3->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3534 | cfa_array_parameter_1st_dimension cfa_identifier_parameter_ptr
3535 { $$ = $2->addNewArray( $1 ); }
3536 | '[' ']' multi_array_dimension cfa_identifier_parameter_ptr
3537 { $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( 0, 0, false ) ); }
3538 | cfa_array_parameter_1st_dimension multi_array_dimension cfa_identifier_parameter_ptr
3539 { $$ = $3->addNewArray( $2 )->addNewArray( $1 ); }
3540 | multi_array_dimension cfa_identifier_parameter_ptr
3541 { $$ = $2->addNewArray( $1 ); }
3542 ;
3543
3544cfa_array_parameter_1st_dimension:
3545 '[' push type_qualifier_list '*' pop ']' // remaining C99
3546 { $$ = DeclarationNode::newVarArray( $3 ); }
3547 | '[' push type_qualifier_list assignment_expression pop ']'
3548 { $$ = DeclarationNode::newArray( $4, $3, false ); }
3549 | '[' push declaration_qualifier_list assignment_expression pop ']'
3550 // declaration_qualifier_list must be used because of shift/reduce conflict with
3551 // assignment_expression, so a semantic check is necessary to preclude them as a type_qualifier cannot
3552 // appear in this context.
3553 { $$ = DeclarationNode::newArray( $4, $3, true ); }
3554 | '[' push declaration_qualifier_list type_qualifier_list assignment_expression pop ']'
3555 { $$ = DeclarationNode::newArray( $5, $4->addQualifiers( $3 ), true ); }
3556 ;
3557
3558// This pattern parses a new-style declaration of an abstract variable or function prototype, i.e., there is no
3559// identifier to which the type applies, e.g.:
3560//
3561// [int] f( int ); // abstract variable parameter; no parameter name specified
3562// [int] f( [int] (int) ); // abstract function-prototype parameter; no parameter name specified
3563//
3564// These rules need LR(3):
3565//
3566// cfa_abstract_tuple identifier_or_type_name
3567// '[' cfa_parameter_list ']' identifier_or_type_name '(' cfa_parameter_ellipsis_list_opt ')'
3568//
3569// since a function return type can be syntactically identical to a tuple type:
3570//
3571// [int, int] t;
3572// [int, int] f( int );
3573//
3574// Therefore, it is necessary to look at the token after identifier_or_type_name to know when to reduce
3575// cfa_abstract_tuple. To make this LR(1), several rules have to be flattened (lengthened) to allow the necessary
3576// lookahead. To accomplish this, cfa_abstract_declarator has an entry point without tuple, and tuple declarations are
3577// duplicated when appearing with cfa_function_specifier.
3578
3579cfa_abstract_declarator_tuple: // CFA
3580 cfa_abstract_tuple
3581 | type_qualifier_list cfa_abstract_tuple
3582 { $$ = $2->addQualifiers( $1 ); }
3583 | cfa_abstract_declarator_no_tuple
3584 ;
3585
3586cfa_abstract_declarator_no_tuple: // CFA
3587 cfa_abstract_ptr
3588 | cfa_abstract_array
3589 ;
3590
3591cfa_abstract_ptr: // CFA
3592 ptrref_operator type_specifier
3593 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3594 | type_qualifier_list ptrref_operator type_specifier
3595 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3596 | ptrref_operator cfa_abstract_function
3597 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3598 | type_qualifier_list ptrref_operator cfa_abstract_function
3599 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3600 | ptrref_operator cfa_abstract_declarator_tuple
3601 { $$ = $2->addNewPointer( DeclarationNode::newPointer( 0, $1 ) ); }
3602 | type_qualifier_list ptrref_operator cfa_abstract_declarator_tuple
3603 { $$ = $3->addNewPointer( DeclarationNode::newPointer( $1, $2 ) ); }
3604 ;
3605
3606cfa_abstract_array: // CFA
3607 // Only the first dimension can be empty. Empty dimension must be factored out due to shift/reduce conflict with
3608 // empty (void) function return type.
3609 '[' ']' type_specifier
3610 { $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3611 | '[' ']' multi_array_dimension type_specifier
3612 { $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3613 | multi_array_dimension type_specifier
3614 { $$ = $2->addNewArray( $1 ); }
3615 | '[' ']' cfa_abstract_ptr
3616 { $$ = $3->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3617 | '[' ']' multi_array_dimension cfa_abstract_ptr
3618 { $$ = $4->addNewArray( $3 )->addNewArray( DeclarationNode::newArray( nullptr, nullptr, false ) ); }
3619 | multi_array_dimension cfa_abstract_ptr
3620 { $$ = $2->addNewArray( $1 ); }
3621 ;
3622
3623cfa_abstract_tuple: // CFA
3624 '[' push cfa_abstract_parameter_list pop ']'
3625 { $$ = DeclarationNode::newTuple( $3 ); }
3626 | '[' push type_specifier_nobody ELLIPSIS pop ']'
3627 { SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
3628 | '[' push type_specifier_nobody ELLIPSIS constant_expression pop ']'
3629 { SemanticError( yylloc, "Tuple array currently unimplemented." ); $$ = nullptr; }
3630 ;
3631
3632cfa_abstract_function: // CFA
3633// '[' ']' '(' cfa_parameter_ellipsis_list_opt ')'
3634// { $$ = DeclarationNode::newFunction( nullptr, DeclarationNode::newTuple( nullptr ), $4, nullptr ); }
3635 cfa_abstract_tuple '(' push cfa_parameter_ellipsis_list_opt pop ')'
3636 { $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
3637 | cfa_function_return '(' push cfa_parameter_ellipsis_list_opt pop ')'
3638 { $$ = DeclarationNode::newFunction( nullptr, $1, $4, nullptr ); }
3639 ;
3640
3641// 1) ISO/IEC 9899:1999 Section 6.7.2(2) : "At least one type specifier shall be given in the declaration specifiers in
3642// each declaration, and in the specifier-qualifier list in each structure declaration and type name."
3643//
3644// 2) ISO/IEC 9899:1999 Section 6.11.5(1) : "The placement of a storage-class specifier other than at the beginning of
3645// the declaration specifiers in a declaration is an obsolescent feature."
3646//
3647// 3) ISO/IEC 9899:1999 Section 6.11.6(1) : "The use of function declarators with empty parentheses (not
3648// prototype-format parameter type declarators) is an obsolescent feature."
3649//
3650// 4) ISO/IEC 9899:1999 Section 6.11.7(1) : "The use of function definitions with separate parameter identifier and
3651// declaration lists (not prototype-format parameter type and identifier declarators) is an obsolescent feature.
3652
3653//************************* MISCELLANEOUS ********************************
3654
3655comma_opt: // redundant comma
3656 // empty
3657 | ','
3658 ;
3659
3660default_initializer_opt:
3661 // empty
3662 { $$ = nullptr; }
3663 | '=' assignment_expression
3664 { $$ = $2; }
3665 ;
3666
3667%%
3668
3669// ----end of grammar----
3670
3671// Local Variables: //
3672// mode: c++ //
3673// tab-width: 4 //
3674// compile-command: "make install" //
3675// End: //
Note: See TracBrowser for help on using the repository browser.