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

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

   137

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

   138

 * but disallows them in user code...

   139

 */

   140

extern bool allow_function_overloading;

   141

   142

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

   143

 * by bison.

   144

 */

   145

extern symbol_c *tree_root;

   146

   147

   148

   149

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

   150

/* forward declarations */

   151

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

   152

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

   153

   154

/* Convert an il_operator_c into an identifier_c */

   155

symbol_c *il_operator_c_2_identifier_c(symbol_c *il_operator);

   156

   160

/* print an error message */

   162

                   int first_column,

   163

                   int last_line,

   164

                   int last_column,

   165

                   const char *additional_error_msg);

   166

%}

   167

   168

   169

   170

   171

// %glr-parser

   172

// %expect-rr 1

   173

   174

   175

   176

   177

%union {

   178

    symbol_c 	*leaf;

   179

    list_c	*list;

   180

    char 	*ID;	/* token value */

   181

}

   182

   183

/*

   184

 TODO: DO we need to define a destructor do free

   185

       memory when recovering from errors, or do the

   186

       class destructors already handle this?

   187

       Following is example on how to define

   188

       detructors, using the syntax:

   189

       %destructor { CODE } SYMBOLS

   190

%union

   191

      {

   192

        char *string;

   193

      }

   194

      %token <string> STRING

   195

      %type  <string> string

   196

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

   197

*/

   198

   199

   200

   201

   202

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

   203

/* Prelimenary constructs... */

   204

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

   205

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

   206

 * after all includes have already been processed.

   207

 *

   208

 * Flex automatically returns the token with value 0

   209

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

   210

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

   211

 * to detect the very end of the input files.

   212

 */

   213

%token END_OF_INPUT 0

   214

   215

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

   216

/* USE 1:

   217

 * ======

   218

 * This token is currently also being used as the default

   219

 * initialisation value of the token_id member in

   220

 * the symbol_c base class.

   221

 *

   222

 * USE 2

   223

 * =====

   224

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

   225

 * mysterious reduce/reduce conflicts due to the fact

   226

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

   227

 * This means that bison cannot handle it without some

   228

 * caoxing from ourselves. We will then need this token

   229

 * to do the coaxing...

   230

 */

   231

%token BOGUS_TOKEN_ID

   232

   233

%type <leaf>	start

   234

   235

%type <leaf>	any_identifier

   236

   237

%token <ID>	prev_declared_variable_name_token

   238

%token <ID>	prev_declared_fb_name_token

   239

%type <leaf>	prev_declared_variable_name

   240

%type <leaf>	prev_declared_fb_name

   241

   242

%token  <ID>	prev_declared_simple_type_name_token

   243

%token  <ID>	prev_declared_subrange_type_name_token

   244

%token  <ID>	prev_declared_enumerated_type_name_token

   245

%token  <ID>	prev_declared_array_type_name_token

   246

%token  <ID>	prev_declared_structure_type_name_token

   247

%token  <ID>	prev_declared_string_type_name_token

   248

   249

%type  <leaf>	prev_declared_simple_type_name

   250

%type  <leaf>	prev_declared_subrange_type_name

   251

%type  <leaf>	prev_declared_enumerated_type_name

   252

%type  <leaf>	prev_declared_array_type_name

   253

%type  <leaf>	prev_declared_structure_type_name

   254

%type  <leaf>	prev_declared_string_type_name

   255

   256

%token <ID>	prev_declared_derived_function_name_token

   257

%token <ID>	prev_declared_derived_function_block_name_token

   258

%token <ID>	prev_declared_program_type_name_token

   259

%type  <leaf>	prev_declared_derived_function_name

   260

%type  <leaf>	prev_declared_derived_function_block_name

   261

%type  <leaf>	prev_declared_program_type_name

   262

   263

   264

   265

   266

/* The pragmas... */

   267

%token <ID>	pragma_token

   268

%type <leaf>	pragma

   269

   270

   271

/* Where do these tokens belong ?? */

   272

/* TODO: get the syntax parser to handle these tokens... */

   273

%token	EN

   274

%token	ENO

   275

   276

   277

   278

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

   279

/* B 0 - Programming Model */

   280

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

   281

%type <list>	library

   282

%type <leaf>	library_element_declaration

   283

   284

   285

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

   286

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

   287

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

   288

/* Done totally within flex...

   289

  letter

   290

  digit

   291

  octal_digit

   292

  hex_digit

   293

*/

   294

%token <ID>	identifier_token

   295

%type  <leaf>	identifier

   297

   298

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

   299

/* B 1.2 - Constants */

   300

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

   301

%type <leaf>	constant

   302

/* a helper symbol for expression */

   303

%type  <leaf> non_negative_constant

   304

   305

   306

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

   307

/* B 1.2.1 - Numeric Literals */

   308

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

   309

/* Done totally within flex...

   310

  bit

   311

*/

   312

%type  <leaf> numeric_literal

   313

/* helper symbol for non_negative_constant */

   314

%type  <leaf> non_negative_numeric_literal

   315

%type  <leaf> integer_literal

   316

%type  <leaf> signed_integer

   317

/* a helper symbol for non_negative_constant */

   318

%type  <leaf> non_negative_signed_integer

   319

%token <ID>   integer_token

   320

%type  <leaf> integer

   321

%token <ID>   binary_integer_token

   322

%type  <leaf> binary_integer

   323

%token <ID>   octal_integer_token

   324

%type  <leaf> octal_integer

   325

%token <ID>   hex_integer_token

   326

%type  <leaf> hex_integer

   327

%token <ID>   real_token

   328

%type  <leaf> real

   329

%type  <leaf> signed_real

   330

/* helper symbol for non_negative_real_literal */

   331

%type  <leaf> non_negative_signed_real

   332

%type  <leaf> real_literal

   333

/* helper symbol for non_negative_numeric_literal */

   334

%type  <leaf> non_negative_real_literal

   335

// %type  <leaf> exponent

   336

%type  <leaf> bit_string_literal

   337

%type  <leaf> boolean_literal

   338

   339

%token FALSE

   340

%token TRUE

   341

   342

   343

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

   344

/* B 1.2.2 - Character Strings */

   345

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

   346

%token <ID>   single_byte_character_string_token

   347

%token <ID>   double_byte_character_string_token

   348

   349

%type  <leaf> character_string

   350

%type  <leaf> single_byte_character_string

   351

%type  <leaf> double_byte_character_string

   352

   353

   354

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

   355

/* B 1.2.3 - Time Literals */

   356

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

   357

%type  <leaf> time_literal

   358

   359

   360

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

   361

/* B 1.2.3.1 - Duration */

   362

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

   363

%type  <leaf>	duration

   364

%type  <leaf>	interval

   365

%type  <leaf>	days

   366

%type  <leaf>	fixed_point

   367

%type  <leaf>	hours

   368

%type  <leaf>	minutes

   369

%type  <leaf>	seconds

   370

%type  <leaf>	milliseconds

   371

   372

%type  <leaf>	integer_d

   373

%type  <leaf>	integer_h

   374

%type  <leaf>	integer_m

   375

%type  <leaf>	integer_s

   376

%type  <leaf>	integer_ms

   377

%type  <leaf>	fixed_point_d

   378

%type  <leaf>	fixed_point_h

   379

%type  <leaf>	fixed_point_m

   380

%type  <leaf>	fixed_point_s

   381

%type  <leaf>	fixed_point_ms

   382

   383

%token <ID>	fixed_point_token

   384

%token <ID>	fixed_point_d_token

   385

%token <ID>	integer_d_token

   386

%token <ID>	fixed_point_h_token

   387

%token <ID>	integer_h_token

   388

%token <ID>	fixed_point_m_token

   389

%token <ID>	integer_m_token

   390

%token <ID>	fixed_point_s_token

   391

%token <ID>	integer_s_token

   392

%token <ID>	fixed_point_ms_token

   393

%token <ID>	integer_ms_token

   394

   395

%token TIME

   396

%token T_SHARP

   397

   398

   399

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

   400

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

   401

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

   402

%type  <leaf>	time_of_day

   403

%type  <leaf>	daytime

   404

%type  <leaf>	day_hour

   405

%type  <leaf>	day_minute

   406

%type  <leaf>	day_second

   407

%type  <leaf>	date

   408

%type  <leaf>	date_literal

   409

%type  <leaf>	year

   410

%type  <leaf>	month

   411

%type  <leaf>	day

   412

%type  <leaf>	date_and_time

   413

   414

%token TIME_OF_DAY

   415

%token DATE

   416

%token D_SHARP

   417

%token DATE_AND_TIME

   418

   419

   420

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

   421

/* B 1.3 - Data Types */

   422

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

   423

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

   424

// %type  <leaf> data_type_name

   425

%type  <leaf> non_generic_type_name

   426

   427

   428

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

   429

/* B 1.3.1 - Elementary Data Types */

   430

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

   431

/* NOTES:

   432

 *

   433

 *    - To make the definition of bit_string_literal more

   434

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

   435

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

   436

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

   437

 *      Note that the definition of bit_string_type_name

   438

 *      (according to the spec) includes the above elements

   439

 *      and an extra BOOL.

   440

 *      We could use an extra construct with the first four

   441

 *      elements to be used solely in the definition of

   442

 *      bit_string_literal, but with the objective of not

   443

 *      having to replicate the actions (if we ever need

   444

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

   445

 *      bit_string_type_name and the extra grouping), we

   446

 *      have re-defined bit_string_type_name as only including

   447

 *      the first four elements.

   448

 *      In order to have our parser implement the specification

   449

 *      correctly we have augmented every occurence of

   450

 *      bit_string_type_name in other rules with the BOOL

   451

 *      token. Since bit_string_type_name only appears in

   452

 *      the rule for elementary_type_name, this does not

   453

 *      seem to be a big concession to make!

   454

 *

   455

 *    - We have added a helper symbol to concentrate the

   456

 *      instantiation of STRING and WSTRING into a single

   457

 *      location (elementary_string_type_name).

   458

 *      These two elements show up in several other rules,

   459

 *      but we want to create the equivalent abstract syntax

   460

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

   461

 *      possible future changes easier to edit...

   462

 */

   463

%type  <leaf>	elementary_type_name

   464

%type  <leaf>	numeric_type_name

   465

%type  <leaf>	integer_type_name

   466

%type  <leaf>	signed_integer_type_name

   467

%type  <leaf>	unsigned_integer_type_name

   468

%type  <leaf>	real_type_name

   469

%type  <leaf>	date_type_name

   470

%type  <leaf>	bit_string_type_name

   471

/* helper symbol to concentrate the instantiation

   472

 * of STRING and WSTRING into a single location

   473

 */

   474

%type  <leaf>	elementary_string_type_name

   475

   476

%token BYTE

   477

%token WORD

   478

%token DWORD

   479

%token LWORD

   480

   481

%token LREAL

   482

%token REAL

   483

   484

%token SINT

   485

%token INT

   486

%token DINT

   487

%token LINT

   488

   489

%token USINT

   490

%token UINT

   491

%token UDINT

   492

%token ULINT

   493

   494

%token WSTRING

   495

%token STRING

   496

%token BOOL

   497

   498

// %token TIME

   499

// %token DATE

   500

// %token DATE_AND_TIME

   501

%token DT

   502

// %token TIME_OF_DAY

   503

%token TOD

   504

   505

   506

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

   507

/* B 1.3.2 - Generic data types */

   508

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

   509

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

   510

// %type  <leaf>	generic_type_name

   511

   512

/* The following tokens do not seem to be used either

   513

 * but we declare them so they become reserved words...

   514

 */

   515

%token ANY

   516

%token ANY_DERIVED

   517

%token ANY_ELEMENTARY

   518

%token ANY_MAGNITUDE

   519

%token ANY_NUM