source: src/Parser/parser.yy@ c93fd72

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

harmonize SynTree/LinkageSpec.* with AST/LinkageSpec.*

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