1

/*

     2

 * (c) 2003-2007 Mario de Sousa

     3

 *

     4

 * Offered to the public under the terms of the GNU General Public License

     5

 * as published by the Free Software Foundation; either version 2 of the

     6

 * License, or (at your option) any later version.

     7

 *

     8

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

     9

 * WITHOUT ANY WARRANTY; without even the implied warranty of

    10

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General

    11

 * Public License for more details.

    12

 *

    13

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

    14

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

    15

 */

    16

    17

/*

    18

 * An IEC 61131-3 IL, ST and SFC compiler.

    19

 *

    20

 * Based on the

    21

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

    22

 *

    23

 */

    24

    25

/*

    26

 * Stage 2

    27

 * =======

    28

 *

    29

 *  This file contains the syntax definition of the textual

    30

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

    31

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

    32

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

    33

 */

    34

    35

    36

    37

    38

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

    39

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

    40

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

    41

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

    42

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

    43

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

    44

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

    45

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

    46

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

    47

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

    48

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

    49

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

    50

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

    51

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

    52

    53

    54

    55

    56

%{

    57

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

    58

    59

    60

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

    61

int yylex(void);

    62

    63

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

    64

void yyerror (const char *error_msg);

    65

    66

/* produce a more verbose parsing error message */

    67

#define YYERROR_VERBOSE

    68

    69

/* Include debuging code.

    70

 * Printing of debug info must then be activated by setting

    71

 * the variable yydebug to 1.

    72

 */

    73

#define YYDEBUG 0

    74

    75

    76

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

    77

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

    78

    79

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

    80

#include "iec.y.hh"

    81

    82

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

    83

#include "stage1_2_priv.hh"

    84

    85

    86

/* an ugly hack!!

    87

 * We will probably not need it when we decide

    88

 *  to cut down the abstract syntax down to size.

    89

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

    90

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

    91

 *  we might just find out that we really do need

    92

 *  the abstract syntax tree to stay as it is

    93

 *  afterall!

    94

 */

    95

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

    96

 * execute the code <code>

    97

 */

    98

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

    99

  symbol_c *elem;					\

   100

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

   101

    elem = list->elements[i];				\

   102

    code;						\

   103

  }							\

   104

}

   105

   106

   107

   108

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

   109

 * creating a new object for the abstract syntax tree.

   110

 */

   111

#define locloc(foo) foo.first_line, foo.first_column, foo.last_line, foo.last_column

   112

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

   113

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

   114

   115

   116

   117

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

   118

#define ERROR error_exit(__FILE__,__LINE__)

   119

/* function defined in main.cc */

   120

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

   121

   122

   123

   124

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

   125

/* global variables...   */

   126

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

   127

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

   128

 *       in the iec.y.hh file, which is in turn included by flex.

   129

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

   130

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

   131

 *       would get a new variable defined each time iec.y.hh is included!).

   132

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

   133

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

   134

 */

   135

   136

   137

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

   138

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

   139

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

   140

 *       option is to use global variables! yuck!

   141

 */

   142

   143

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

   144

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

   145

 * but disallows them in user code...

   146

 */

   147

extern bool allow_function_overloading;

   148

   149

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

   150

 * when printing out error messages...

   151

 */

   152

extern bool full_token_loc;

   153

   154

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

   155

 * by bison.

   156

 */

   157

extern symbol_c *tree_root;

   158

   159

   160

   161

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

   162

/* forward declarations */

   163

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

   164

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

   165

   166

/* Convert an il_operator_c into an identifier_c */

   167

symbol_c *il_operator_c_2_identifier_c(symbol_c *il_operator);

   168

   169

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

   170

/* ERROR_CHECK_BEGIN */

   171

bool is_current_syntax_token();

   172

/* ERROR_CHECK_END */

   173

   174

/* print an error message */

   175

void print_err_msg(int first_line,

   176

                   int first_column,

   177

                   int last_line,

   178

                   int last_column,

   179

                   const char *additional_error_msg);

   180

%}

   181

   182

   183

   184

   185

// %glr-parser

   186

// %expect-rr 1

   187

   188

   189

   190

   191

%union {

   192

    symbol_c 	*leaf;

   193

    list_c	*list;

   194

    char 	*ID;	/* token value */

   195

}

   196

   197

/*

   198

 TODO: DO we need to define a destructor do free

   199

       memory when recovering from errors, or do the

   200

       class destructors already handle this?

   201

       Following is example on how to define

   202

       detructors, using the syntax:

   203

       %destructor { CODE } SYMBOLS

   204

%union

   205

      {

   206

        char *string;

   207

      }

   208

      %token <string> STRING

   209

      %type  <string> string

   210

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

   211

*/

   212

   213

   214

   215

   216

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

   217

/* Prelimenary helpful constructs... */

   218

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

   219

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

   220

 * after all includes have already been processed.

   221

 *

   222

 * Flex automatically returns the token with value 0

   223

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

   224

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

   225

 * to detect the very end of the input files.

   226

 */

   227

%token END_OF_INPUT 0

   228

   229

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

   230

/* USE 1:

   231

 * ======

   232

 * This token is currently also being used as the default

   233

 * initialisation value of the token_id member in

   234

 * the symbol_c base class.

   235

 *

   236

 * USE 2

   237

 * =====

   238

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

   239

 * mysterious reduce/reduce conflicts due to the fact

   240

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

   241

 * This means that bison cannot handle it without some

   242

 * caoxing from ourselves. We will then need this token

   243

 * to do the coaxing...

   244

 */

   245

%token BOGUS_TOKEN_ID

   246

   247

%type <leaf>	start

   248

   249

%type <leaf>	any_identifier

   250

   251

%token <ID>	prev_declared_variable_name_token

   252

%token <ID>	prev_declared_direct_variable_token

   253

%token <ID>	prev_declared_fb_name_token

   254

%type <leaf>	prev_declared_variable_name

   255

%type <leaf>	prev_declared_direct_variable

   256

%type <leaf>	prev_declared_fb_name

   257

   258

%token  <ID>	prev_declared_simple_type_name_token

   259

%token  <ID>	prev_declared_subrange_type_name_token

   260

%token  <ID>	prev_declared_enumerated_type_name_token

   261

%token  <ID>	prev_declared_array_type_name_token

   262

%token  <ID>	prev_declared_structure_type_name_token

   263

%token  <ID>	prev_declared_string_type_name_token

   264

   265

%type  <leaf>	prev_declared_simple_type_name

   266

%type  <leaf>	prev_declared_subrange_type_name

   267

%type  <leaf>	prev_declared_enumerated_type_name

   268

%type  <leaf>	prev_declared_array_type_name

   269

%type  <leaf>	prev_declared_structure_type_name

   270

%type  <leaf>	prev_declared_string_type_name

   271

   272

%token <ID>	prev_declared_derived_function_name_token

   273

%token <ID>	prev_declared_derived_function_block_name_token

   274

%token <ID>	prev_declared_program_type_name_token

   275

%type  <leaf>	prev_declared_derived_function_name

   276

%type  <leaf>	prev_declared_derived_function_block_name

   277

%type  <leaf>	prev_declared_program_type_name

   278

   279

   280

   281

   282

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

   283

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

   284

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

   285

   286

   287

/* The pragmas... */

   288

%token <ID>	pragma_token

   289

%type <leaf>	pragma

   290

   291

   292

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

   293

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

   294

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

   295

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

   296

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

   297

 */

   298

%token	EN

   299

%token	ENO

   300

%type <leaf>	en_identifier

   301

%type <leaf>	eno_identifier

   302

   303

   304

   305

   306

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

   307

/* B 0 - Programming Model */

   308

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

   309

%type <list>	library

   310

%type <leaf>	library_element_declaration

   311

   312

   313

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

   314

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

   315

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

   316

/* Done totally within flex...

   317

  letter

   318

  digit

   319

  octal_digit

   320

  hex_digit

   321

*/

   322

%token <ID>	identifier_token

   323

%type  <leaf>	identifier

   324

   325

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

   326

/* B 1.2 - Constants */

   327

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

   328

%type <leaf>	constant

   329

/* a helper symbol for expression */

   330

%type  <leaf> non_negative_constant

   331

   332

   333

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

   334

/* B 1.2.1 - Numeric Literals */

   335

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

   336

/* Done totally within flex...

   337

  bit

   338

*/

   339

%type  <leaf> numeric_literal

   340

/* helper symbol for non_negative_constant */

   341

%type  <leaf> non_negative_numeric_literal

   342

%type  <leaf> integer_literal

   343

%type  <leaf> signed_integer

   344

/* a helper symbol for non_negative_constant */

   345

%type  <leaf> non_negative_signed_integer

   346

%token <ID>   integer_token

   347

%type  <leaf> integer

   348

%token <ID>   binary_integer_token

   349

%type  <leaf> binary_integer

   350

%token <ID>   octal_integer_token

   351

%type  <leaf> octal_integer

   352

%token <ID>   hex_integer_token

   353

%type  <leaf> hex_integer

   354

%token <ID>   real_token

   355

%type  <leaf> real

   356

%type  <leaf> signed_real

   357

/* helper symbol for non_negative_real_literal */

   358

%type  <leaf> non_negative_signed_real

   359

%type  <leaf> real_literal

   360

/* helper symbol for non_negative_numeric_literal */

   361

%type  <leaf> non_negative_real_literal

   362

// %type  <leaf> exponent

   363

%type  <leaf> bit_string_literal

   364

%type  <leaf> boolean_literal

   365

   366

%token FALSE

   367

%token TRUE

   368

   369

   370

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

   371

/* B 1.2.2 - Character Strings */

   372

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

   373

%token <ID>   single_byte_character_string_token

   374

%token <ID>   double_byte_character_string_token

   375

   376

%type  <leaf> character_string

   377

%type  <leaf> single_byte_character_string

   378

%type  <leaf> double_byte_character_string

   379

   380

   381

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

   382

/* B 1.2.3 - Time Literals */

   383

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

   384

%type  <leaf> time_literal

   385

   386

   387

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

   388

/* B 1.2.3.1 - Duration */

   389

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

   390

%type  <leaf>	duration

   391

%type  <leaf>	interval

   392

%type  <leaf>	days

   393

%type  <leaf>	fixed_point

   394

%type  <leaf>	hours

   395

%type  <leaf>	minutes

   396

%type  <leaf>	seconds

   397

%type  <leaf>	milliseconds

   398

   399

%type  <leaf>	integer_d

   400

%type  <leaf>	integer_h

   401

%type  <leaf>	integer_m

   402

%type  <leaf>	integer_s

   403

%type  <leaf>	integer_ms

   404

%type  <leaf>	fixed_point_d

   405

%type  <leaf>	fixed_point_h

   406

%type  <leaf>	fixed_point_m

   407

%type  <leaf>	fixed_point_s

   408

%type  <leaf>	fixed_point_ms

   409

   410

%token <ID>	fixed_point_token

   411

%token <ID>	fixed_point_d_token

   412

%token <ID>	integer_d_token

   413

%token <ID>	fixed_point_h_token

   414

%token <ID>	integer_h_token

   415

%token <ID>	fixed_point_m_token

   416

%token <ID>	integer_m_token

   417

%token <ID>	fixed_point_s_token

   418

%token <ID>	integer_s_token

   419

%token <ID>	fixed_point_ms_token

   420

%token <ID>	integer_ms_token

   421

   422

%token TIME

   423

%token T_SHARP

   424

   425

   426

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

   427

/* B 1.2.3.2 - Time of day and Date */

   428

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

   429

%type  <leaf>	time_of_day

   430

%type  <leaf>	daytime

   431

%type  <leaf>	day_hour

   432

%type  <leaf>	day_minute

   433

%type  <leaf>	day_second

   434

%type  <leaf>	date

   435

%type  <leaf>	date_literal

   436

%type  <leaf>	year

   437

%type  <leaf>	month

   438

%type  <leaf>	day

   439

%type  <leaf>	date_and_time

   440

   441

%token TIME_OF_DAY

   442

%token DATE

   443

%token D_SHARP

   444

%token DATE_AND_TIME

   445

   446

   447

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

   448

/* B 1.3 - Data Types */

   449

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

   450

/* Strangely, the following symbol does seem to be required! */

   451

// %type  <leaf> data_type_name

   452

%type  <leaf> non_generic_type_name

   453

   454

   455

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

   456

/* B 1.3.1 - Elementary Data Types */

   457

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

   458

/* NOTES:

   459

 *

   460

 *    - To make the definition of bit_string_literal more

   461

 *      concise, it is useful to use an extra non-terminal

   462

 *      symbol (i.e. a grouping or construct) that groups the

   463

 *      following elements (BYTE, WORD, DWORD, LWORD).

   464

 *      Note that the definition of bit_string_type_name

   465

 *      (according to the spec) includes the above elements

   466

 *      and an extra BOOL.

   467

 *      We could use an extra construct with the first four

   468

 *      elements to be used solely in the definition of

   469

 *      bit_string_literal, but with the objective of not

   470

 *      having to replicate the actions (if we ever need

   471

 *      to change them, they would need to be changed in both

   472

 *      bit_string_type_name and the extra grouping), we

   473

 *      have re-defined bit_string_type_name as only including

   474

 *      the first four elements.

   475

 *      In order to have our parser implement the specification

   476

 *      correctly we have augmented every occurence of

   477

 *      bit_string_type_name in other rules with the BOOL

   478

 *      token. Since bit_string_type_name only appears in

   479

 *      the rule for elementary_type_name, this does not

   480

 *      seem to be a big concession to make!

   481

 *

   482

 *    - We have added a helper symbol to concentrate the

   483

 *      instantiation of STRING and WSTRING into a single

   484

 *      location (elementary_string_type_name).

   485

 *      These two elements show up in several other rules,

   486

 *      but we want to create the equivalent abstract syntax

   487

 *      in a single location of this file, in order to make

   488

 *      possible future changes easier to edit...

   489

 */

   490

%type  <leaf>	elementary_type_name

   491

%type  <leaf>	numeric_type_name

   492

%type  <leaf>	integer_type_name

   493

%type  <leaf>	signed_integer_type_name

   494

%type  <leaf>	unsigned_integer_type_name

   495

%type  <leaf>	real_type_name

   496

%type  <leaf>	date_type_name

   497

%type  <leaf>	bit_string_type_name

   498

/* helper symbol to concentrate the instantiation

   499

 * of STRING and WSTRING into a single location

   500

 */

   501

%type  <leaf>	elementary_string_type_name

   502

   503

%token BYTE

   504

%token WORD

   505

%token DWORD

   506

%token LWORD

   507

   508

%token LREAL

   509

%token REAL

   510

   511

%token SINT

   512

%token INT

   513

%token DINT

   514

%token LINT

   515

   516

%token USINT