1

/*

     2

 *  matiec - a compiler for the programming languages defined in IEC 61131-3

     3

 *

     4

 *  Copyright (C) 2003-2011  Mario de Sousa (msousa@fe.up.pt)

     5

 *  Copyright (C) 2007-2011  Laurent Bessard and Edouard Tisserant

     6

 *

     7

 *  This program is free software: you can redistribute it and/or modify

     8

 *  it under the terms of the GNU General Public License as published by

     9

 *  the Free Software Foundation, either version 3 of the License, or

    10

 *  (at your option) any later version.

    11

 *

    12

 *  This program is distributed in the hope that it will be useful,

    13

 *  but WITHOUT ANY WARRANTY; without even the implied warranty of

    14

 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    15

 *  GNU General Public License for more details.

    16

 *

    17

 *  You should have received a copy of the GNU General Public License

    18

 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.

    19

 *

    20

 *

    21

 * This code is made available on the understanding that it will not be

    22

 * used in safety-critical situations without a full and competent review.

    23

 */

    24

    25

/*

    26

 * An IEC 61131-3 compiler.

    27

 *

    28

 * Based on the

    29

 * FINAL DRAFT - IEC 61131-3, 2nd Ed. (2001-12-10)

    30

 *

    31

 */

    32

    33

/*

    34

 * Stage 2

    35

 * =======

    36

 *

    37

 *  This file contains the syntax definition of the textual

    38

 *  languages IL and ST, as well as the textual version of SFC.

    39

 *  The syntax parser, comprising the 2nd stage of the overall 

    40

 *  compiler, is generated by runing bison on this file.

    41

 */

    42

    43

    44

    45

    46

/**********************************************************************/

    47

/**********************************************************************/

    48

/**********************************************************************/

    49

/**********************************************************************/

    50

/*******                                                        *******/

    51

/*******   The following syntax does not have any conflicts.    *******/

    52

/*******                                                        *******/

    53

/*******   P L E A S E    K E E P    I T    T H A T    W A Y !  *******/

    54

/*******   ===================================================  *******/

    55

/*******                                                        *******/

    56

/**********************************************************************/

    57

/**********************************************************************/

    58

/**********************************************************************/

    59

/**********************************************************************/

    60

    61

    62

    63

    64

%{

    65

#include <string.h>	/* required for strdup()  */

    66

    67

    68

/* declare the token parser generated by flex... */

    69

int yylex(void);

    70

    71

/* declare the error handler defined at the end of this file */

    72

void yyerror (const char *error_msg);

    73

    74

/* produce a more verbose parsing error message */

    75

#define YYERROR_VERBOSE

    76

    77

/* Include debuging code.

    78

 * Printing of debug info must then be activated by setting

    79

 * the variable yydebug to 1.

    80

 */

    81

#define YYDEBUG 0

    82

    83

    84

/* file with declaration of absyntax classes... */

    85

#include "../absyntax/absyntax.hh"

    86

    87

/* file with declaration of token constants. Generated by bison! */

    89

    90

/* The interface through which bison and flex interact. */

    91

#include "stage1_2_priv.hh"

    92

    93

    94

#include "../absyntax_utils/add_en_eno_param_decl.hh"	/* required for  add_en_eno_param_decl_c */

    95

    96

/* an ugly hack!!

    97

 * We will probably not need it when we decide

    98

 *  to cut down the abstract syntax down to size.

    99

 *  We keep it as it is until we get to write

   100

 *  stages 3 and 4 of the compiler. Who knows,

   101

 *  we might just find out that we really do need

   102

 *  the abstract syntax tree to stay as it is

   103

 *  afterall!

   104

 */

   105

/* for each element <elem> in list_c * <list>

   106

 * execute the code <code>

   107

 */

   108

#define FOR_EACH_ELEMENT(elem, list, code) {		\

   109

  symbol_c *elem;					\

   110

  for(int i = 0; i < list->n; i++) {			\

   111

    elem = list->elements[i];				\

   112

    code;						\

   113

  }							\

   114

}

   115

   116

   117

   118

/* Macros used to pass the line and column locations when

   119

 * creating a new object for the abstract syntax tree.

   120

 */

   121

#define locloc(foo) foo.first_line, foo.first_column, foo.first_file, foo.first_order, foo.last_line, foo.last_column, foo.last_file, foo.last_order

   122

#define   locf(foo) foo.first_line, foo.first_column, foo.first_file, foo.first_order

   123

#define   locl(foo) foo.last_line,  foo.last_column,  foo.last_file,  foo.last_order

   124

   125

/* Redefine the default action to take for each rule, so that the filenames are correctly processed... */

   126

# define YYLLOC_DEFAULT(Current, Rhs, N)                                \

   127

         do                                                                  \

   128

           if (N)                                                            \

   129

             {                                                               \

   130

               (Current).first_line   = YYRHSLOC(Rhs, 1).first_line;         \

   131

               (Current).first_column = YYRHSLOC(Rhs, 1).first_column;       \

   132

               (Current).first_file   = YYRHSLOC(Rhs, 1).first_file;         \

   133

               (Current).first_order  = YYRHSLOC(Rhs, 1).first_order;        \

   134

               (Current).last_line    = YYRHSLOC(Rhs, N).last_line;          \

   135

               (Current).last_column  = YYRHSLOC(Rhs, N).last_column;        \

   136

               (Current).last_file    = YYRHSLOC(Rhs, 1).last_file;          \

   137

               (Current).last_order   = YYRHSLOC(Rhs, 1).last_order;         \

   138

             }                                                               \

   139

           else                                                              \

   140

             {                                                               \

   141

               (Current).first_line   = (Current).last_line   =              \

   142

                 YYRHSLOC(Rhs, 0).last_line;                                 \

   143

               (Current).first_column = (Current).last_column =              \

   144

                 YYRHSLOC(Rhs, 0).last_column;                               \

   145

               (Current).first_file   = (Current).last_file   =              \

   146

                 YYRHSLOC(Rhs, 0).last_file;                                 \

   147

               (Current).first_order  = (Current).last_order  =              \

   148

                 YYRHSLOC(Rhs, 0).last_order;                                \

   149

             }                                                               \

   150

         while (0)

   151

   152

   153

/* A macro for printing out internal parser errors... */

   154

#define ERROR error_exit(__FILE__,__LINE__)

   155

/* function defined in main.cc */

   156

extern void error_exit(const char *file_name, int line_no);

   157

   158

   159

   160

/*************************/

   161

/* global variables...   */

   162

/*************************/

   163

/* NOTE: For some strange reason bison ver 2.3 is including these declarations

   165

 *       We cannot therefore define any variables over here, but merely declare 

   166

 *       their existance (otherwise we get errors when linking the code, since we

   168

 *       Even though the variables are declared 'extern' over here, they will in

   169

 *       fact be defined towards the end of this same file (i.e. in the prologue)

   170

 */

   171

   172

   173

/* NOTE: These variable are really parameters we would like the stage2__ function to pass

   174

 *       to the yyparse() function. However, the yyparse() function is created automatically

   175

 *       by bison, so we cannot add parameters to this function. The only other

   176

 *       option is to use global variables! yuck!

   177

 */

   178

   179

/* A global flag used to tell the parser if overloaded funtions should be allowed.

   180

 * The IEC 61131-3 standard allows overloaded funtions in the standard library,

   181

 * but disallows them in user code...

   182

 */

   183

extern bool allow_function_overloading;

   184

   185

/* A flag to tell the compiler whether to allow the declaration

   186

 * of extensible function (i.e. functions that may have a variable number of

   187

 * input parameters, such as AND(word#33, word#44, word#55, word#66).

   188

 * This is an extension to the standard syntax.

   189

 * See comments below for details why we support this!

   190

 */

   191

extern bool allow_extensible_function_parameters;

   192

   193

/* A global flag used to tell the parser whether to include the full variable location

   194

 * when printing out error messages...

   195

 */

   196

extern bool full_token_loc;

   197

   198

/* A pointer to the root of the parsing tree that will be generated 

   199

 * by bison.

   200

 */

   201

extern symbol_c *tree_root;

   202

   203

   204

   205

/************************/

   206

/* forward declarations */

   207

/************************/

   208

/* The functions declared here are defined at the end of this file... */

   209

   210

/* Convert an il_operator_c into an identifier_c */

   211

symbol_c *il_operator_c_2_identifier_c(symbol_c *il_operator);

   212

   213

/* return if current token is a syntax element */

   214

/* ERROR_CHECK_BEGIN */

   215

bool is_current_syntax_token();

   216

/* ERROR_CHECK_END */

   217

   218

/* print an error message */

   219

void print_err_msg(int first_line,

   220

                   int first_column,

   221

                   const char *first_filename,

   222

                   long int first_order,

   223

                   int last_line,

   224

                   int last_column,

   225

                   const char *last_filename,

   226

                   long int last_order,

   227

                   const char *additional_error_msg);

   228

%}

   229

   230

   231

   232

   233

// %glr-parser

   234

// %expect-rr 1

   235

   236

   237

/* The following definitions need to be inside a '%code requires' 

   238

 * so that they are also included in the header files. If this were not the case,

   239

 * YYLTYPE would be delcared as something in the iec.cc file, and another thing

   241

 */

   242

%code requires {

   243

/* define a new data type to store the locations, so we can also store

   244

 * the filename in which the token is expressed.

   245

 */

   248

 * declaring the typedef struct yyltype__local here would result in a 

   249

 * compilation error when compiling iec.cc, as this struct would be

   250

 * declared twice.

   251

 * We therefore use the #if !defined YYLTYPE ...

   252

 * to make sure only the first declaration is parsed by the C++ compiler.

   253

 *

   254

 * At first glance it seems that what we really should do is delcare the

   255

 * YYLTYPE directly as an anonymous struct, thus:

   256

 * #define YYLTYPE struct{ ...}

   257

 * however, this also results in compilation errors.

   258

 *

   259

 * I (Mario) think this is kind of a hack. If you know how to

   260

 * do this re-declaration of YYLTYPE properly, please let me know!

   261

 */

   262

#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED

   263

  typedef struct {

   264

    int         first_line;

   265

    int         first_column;

   266

    const char *first_file;

   267

    long int    first_order;

   268

    int         last_line;

   269

    int         last_column;

   270

    const char *last_file;

   271

    long int    last_order;

   272

  } yyltype__local;

   273

  #define YYLTYPE yyltype__local

   274

#endif

   275

}

   276

   277

   278

   279

%union {

   280

    symbol_c 	*leaf;

   281

    list_c	*list;

   282

    char 	*ID;	/* token value */

   283

}

   284

   285

/*

   286

 TODO: DO we need to define a destructor do free

   287

       memory when recovering from errors, or do the

   288

       class destructors already handle this?

   289

       Following is example on how to define

   290

       detructors, using the syntax:

   291

       %destructor { CODE } SYMBOLS

   292

%union

   293

      {

   294

        char *string;

   295

      }

   296

      %token <string> STRING

   297

      %type  <string> string

   298

      %destructor { free ($$); } STRING string

   299

*/

   300

   301

   302

   303

   304

/*************************************/

   305

/* Prelimenary helpful constructs... */

   306

/*************************************/

   307

/* A token used to identify the very end of the input file

   308

 * after all includes have already been processed.

   309

 *

   310

 * Flex automatically returns the token with value 0

   311

 * at the end of the file. We therefore specify here

   312

 * a token with that exact same value here, so we can use it

   313

 * to detect the very end of the input files.

   314

 */

   315

%token END_OF_INPUT 0

   316

   317

/* A bogus token that, in principle, flex MUST NEVER generate */

   318

/* USE 1:

   319

 * ======

   320

 * This token is currently also being used as the default

   321

 * initialisation value of the token_id member in

   322

 * the symbol_c base class.

   323

 *

   324

 * USE 2

   325

 * =====

   326

 * This token may also be used in the future to remove

   327

 * mysterious reduce/reduce conflicts due to the fact

   328

 * that our grammar may not be LALR(1) but merely LR(1).

   329

 * This means that bison cannot handle it without some

   330

 * caoxing from ourselves. We will then need this token

   331

 * to do the coaxing...

   332

 */

   333

%token BOGUS_TOKEN_ID

   334

   335

%type <leaf>	start

   336

   337

%type <leaf>	any_identifier

   338

   339

%token <ID>	prev_declared_variable_name_token

   340

%token <ID>	prev_declared_direct_variable_token

   341

%token <ID>	prev_declared_fb_name_token

   342

%type <leaf>	prev_declared_variable_name

   343

%type <leaf>	prev_declared_direct_variable

   344

%type <leaf>	prev_declared_fb_name

   345

   346

%token  <ID>	prev_declared_simple_type_name_token

   347

%token  <ID>	prev_declared_subrange_type_name_token

   348

%token  <ID>	prev_declared_enumerated_type_name_token

   349

%token  <ID>	prev_declared_array_type_name_token

   350

%token  <ID>	prev_declared_structure_type_name_token

   351

%token  <ID>	prev_declared_string_type_name_token

   352

   353

%type  <leaf>	prev_declared_simple_type_name

   354

%type  <leaf>	prev_declared_subrange_type_name

   355

%type  <leaf>	prev_declared_enumerated_type_name

   356

%type  <leaf>	prev_declared_array_type_name

   357

%type  <leaf>	prev_declared_structure_type_name

   358

%type  <leaf>	prev_declared_string_type_name

   359

   360

%token <ID>	prev_declared_derived_function_name_token

   361

%token <ID>	prev_declared_derived_function_block_name_token

   362

%token <ID>	prev_declared_program_type_name_token

   363

%type  <leaf>	prev_declared_derived_function_name

   364

%type  <leaf>	prev_declared_derived_function_block_name

   365

%type  <leaf>	prev_declared_program_type_name

   366

   367

   368

   369

   370

/**********************************************************************************/

   371

/* B XXX - Things that are missing from the standard, but should have been there! */

   372

/**********************************************************************************/

   373

   374

/* Pragmas that our compiler will accept.

   375

 * See the comment in iec.flex for why these pragmas exist. 

   376

 */

   377

%token          disable_code_generation_pragma_token

   378

%token          enable_code_generation_pragma_token

   379

%type <leaf>	disable_code_generation_pragma

   380

%type <leaf>	enable_code_generation_pragma

   381

   382

   383

/* All other pragmas that we do not support... */

   384

/* In most stage 4, the text inside the pragmas will simply be copied to the output file.

   385

 * This allows us to insert C code (if using stage 4 generating C code) 

   386

 * inside/interningled with the IEC 61131-3 code!

   387

 */

   388

%token <ID>	pragma_token

   389

%type <leaf>	pragma

   390

   391

/* The joining of all previous pragmas, i.e. any possible pragma */

   392

%type <leaf>	any_pragma

   393

   394

   395

/* Where do these tokens belong?? They are missing from the standard! */

   396

/* NOTE: There are other tokens related to these 'EN' ENO', that are also 

   397

 * missing from the standard. However, their location in the annex B is 

   398

 * relatively obvious, so they have been inserted in what seems to us their 

   399

 * correct place in order to ease understanding of the parser...

   400

 *

   401

 * please read the comment above the definition of 'variable' in section B1.4 for details.

   402

 */

   403

%token	EN

   404

%token	ENO

   405

%type <leaf>	en_identifier

   406

%type <leaf>	eno_identifier

   407

   408

   409

   410

   411

/***************************/

   412

/* B 0 - Programming Model */

   413

/***************************/

   414

%type <list>	library

   415

%type <leaf>	library_element_declaration

   416

   417

   418

/*******************************************/

   419

/* B 1.1 - Letters, digits and identifiers */

   420

/*******************************************/

   421

/* Done totally within flex...

   422

  letter

   423

  digit

   424

  octal_digit

   425

  hex_digit

   426

*/

   427

%token <ID>	identifier_token

   428

%type  <leaf>	identifier

   429

   430

/*********************/

   431

/* B 1.2 - Constants */

   432

/*********************/

   433

%type <leaf>	constant

   434

%type <leaf>	non_negative_constant

   435

   436

/******************************/

   437

/* B 1.2.1 - Numeric Literals */

   438

/******************************/

   439

/* Done totally within flex...

   440

  bit

   441

*/

   442

%type  <leaf> numeric_literal

   443

%type  <leaf> integer_literal

   444

%type  <leaf> signed_integer

   445

%token <ID>   integer_token

   446

%type  <leaf> integer

   447

%token <ID>   binary_integer_token

   448

%type  <leaf> binary_integer

   449

%token <ID>   octal_integer_token

   450

%type  <leaf> octal_integer

   451

%token <ID>   hex_integer_token

   452

%type  <leaf> hex_integer

   453

%token <ID>   real_token

   454

%type  <leaf> real

   455

%type  <leaf> signed_real

   456

%type  <leaf> real_literal

   457

// %type  <leaf> exponent

   458

%type  <leaf> bit_string_literal

   459

%type  <leaf> boolean_literal

   460

   461

%token safeboolean_true_literal_token

   462

%token safeboolean_false_literal_token

   463

%token boolean_true_literal_token

   464

%token boolean_false_literal_token

   465

   466

%token FALSE

   467

%token TRUE

   468

   469

   470

/*******************************/

   471

/* B 1.2.2 - Character Strings */

   472

/*******************************/

   473

%token <ID>   single_byte_character_string_token

   474

%token <ID>   double_byte_character_string_token

   475

   476

%type  <leaf> character_string

   477

%type  <leaf> single_byte_character_string

   478

%type  <leaf> double_byte_character_string

   479

   480

   481

/***************************/

   482

/* B 1.2.3 - Time Literals */

   483

/***************************/

   484

%type  <leaf> time_literal

   485

   486

   487

/************************/

   488

/* B 1.2.3.1 - Duration */

   489

/************************/

   490

%type  <leaf>	duration

   491

%type  <leaf>	interval

   492

%type  <leaf>	days

   493

%type  <leaf>	fixed_point

   494

%type  <leaf>	hours

   495

%type  <leaf>	minutes

   496

%type  <leaf>	seconds

   497

%type  <leaf>	milliseconds

   498

   499

%type  <leaf>	integer_d

   500

%type  <leaf>	integer_h

   501

%type  <leaf>	integer_m

   502

%type  <leaf>	integer_s

   503

%type  <leaf>	integer_ms

   504

%type  <leaf>	fixed_point_d

   505

%type  <leaf>	fixed_point_h