source: src/Parser/parser.yy@ c19bc90

ADT arm-eh ast-experimental enum forall-pointer-decay jacob/cs343-translation new-ast new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since c19bc90 was cbbd8fd7, checked in by Peter A. Buhr <pabuhr@…>, 6 years ago

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