1

/*

     2

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

     3

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

     4

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

     5

 *

     6

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

     7

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

     8

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

     9

 *  (at your option) any later version.

    10

 *

    11

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

    12

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

    13

 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    14

 *  GNU General Public License for more details.

    15

 *

    16

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

    17

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

    18

 *

    19

 *

    20

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

    21

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

    22

 */

    23

    24

/*

    25

 * An IEC 61131-3 compiler.

    26

 *

    27

 * Based on the

    28

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

    29

 *

    30

 */

    31

    32

/*

    33

 * Definition of the Abstract Syntax data structure components

    34

 */

    35

    36

#include <stdio.h>

    37

#include <stdlib.h>	/* required for exit() */

    38

#include <string.h>

    39

    40

#include "absyntax.hh"

    41

//#include "../stage1_2/iec.hh" /* required for BOGUS_TOKEN_ID, etc... */

    42

#include "visitor.hh"

    43

#include "../main.hh" // required for ERROR() and ERROR_MSG() macros.

    44

    45

    46

    47

    48

/* The base class of all symbols */

    49

symbol_c::symbol_c(

    50

                   int first_line, int first_column, const char *ffile, long int first_order,

    51

                   int last_line,  int last_column,  const char *lfile, long int last_order ) {

    52

  this->first_file   = ffile,

    53

  this->first_line   = first_line;

    54

  this->first_column = first_column;

    55

  this->first_order  = first_order;

    56

  this->last_file    = lfile,

    57

  this->last_line    = last_line;

    58

  this->last_column  = last_column;

    59

  this->last_order   = last_order;

    60

  this->parent       = NULL;

    62

  this->datatype     = NULL;

    63

  this->scope        = NULL;

    64

}

    65

    66

    67

    68

token_c::token_c(const char *value, 

    69

                 int fl, int fc, const char *ffile, long int forder,

    70

                 int ll, int lc, const char *lfile, long int lorder)

    71

  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {

    72

  this->value = value;

    74

//  printf("New token: %s\n", value);

    75

}

    76

    77

    78

    79

    80

# define LIST_CAP_INIT 8

    81

# define LIST_CAP_INCR 8

    82

    83

list_c::list_c(

    84

               int fl, int fc, const char *ffile, long int forder,

    85

               int ll, int lc, const char *lfile, long int lorder)

    86

  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder),c(LIST_CAP_INIT) {

    87

  n = 0;

    89

  if (NULL == elements) ERROR_MSG("out of memory");

    90

}

    91

    92

    93

list_c::list_c(symbol_c *elem, 

    94

               int fl, int fc, const char *ffile, long int forder,

    95

               int ll, int lc, const char *lfile, long int lorder)

    96

  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder),c(LIST_CAP_INIT) { 

    97

  n = 0;

    99

  if (NULL == elements) ERROR_MSG("out of memory");

   100

  add_element(elem); 

   101

}

   102

   103

   105

/* get element in position pos of the list */

   132

/* append a new element to the end of the list */

   142

  if (c <= n)

   144

      ERROR_MSG("out of memory");

   150

  if (NULL == elem) return;

   151

  /* Sometimes add_element() is called in stage3 or stage4 to temporarily add an AST symbol to the list.

   152

   * Since this symbol already belongs in some other place in the aST, it will have the 'parent' pointer set, 

   153

   * and so we must not overwrite it. We only set the 'parent' pointer on new symbols that have the 'parent'

   154

   * pointer still set to NULL.

   155

   */

   156

  if (NULL == elem->parent) elem->parent = this;  

   157

   158

  /* adjust the location parameters, taking into account the new element. */

   159

  if (NULL == first_file) {

   160

    first_file = elem->first_file;

   161

    first_line = elem->first_line;

   162

    first_column = elem->first_column;

   163

  }

   164

  if ((first_line == elem->first_line) && (first_column > elem->first_column)) {

   165

    first_column = elem->first_column;

   166

  }

   167

  if (first_line > elem->first_line) {

   168

    first_line = elem->first_line;

   169

    first_column = elem->first_column;

   170

  }

   171

  if (NULL == last_file) {

   172

    last_file = elem->last_file;

   173

    last_line = elem->last_line;

   174

    last_column = elem->last_column;

   175

  }

   176

  if ((last_line == elem->last_line) &&

   177

      (last_column < elem->last_column)) {

   178

    last_column = elem->last_column;

   179

  }

   180

  if (last_line < elem->last_line) {

   181

    last_line = elem->last_line;

   182

    last_column = elem->last_column;

   183

  }

   184

}

   185

   188

/* insert a new element before position pos. */

   190

/* To insert into the begining of list, call with pos=0  */

   191

/* To insert into the end of list, call with pos=list->n */

   201

  if((pos<0) || (n<pos)) ERROR;

   202

   203

  /* add new element to end of list. Basically alocate required memory... */

   204

  /* will also increment n by 1 ! */

   205

  add_element(elem);

   206

  /* if not inserting into end position, shift all elements up one position, to open up a slot in pos for new element */

   207

  if(pos < (n-1)){ 

   208

    for(int i=n-2 ; i>=pos ; --i) elements[i+1] = elements[i];

   216

/* remove element at position pos. */

   218

void list_c::remove_element(int pos) {

   219

  if((pos<0) || (n<=pos)) ERROR;

   220

   221

  /* Shift all elements down one position, starting at the entry to delete. */

   222

  for (int i = pos; i < n-1; i++) elements[i] = elements[i+1];

   223

  /* corrent the new size */

   224

  n--;

   226

  /* TODO: adjust the location parameters, taking into account the removed element. */

   227

}

   228

   229

   233

void list_c::clear(void) {

   234

  n = 0;

   235

  /* TODO: adjust the location parameters, taking into account the removed element. */

   236

}

   237

   238

   239

#define SYM_LIST(class_name_c, ...)								\

   240

class_name_c::class_name_c(									\

   241

                           int fl, int fc, const char *ffile, long int forder,			\

   242

                           int ll, int lc, const char *lfile, long int lorder)			\

   243

                        :list_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {}		\

   244

class_name_c::class_name_c(symbol_c *elem, 							\

   245

                           int fl, int fc, const char *ffile, long int forder,			\

   246

                           int ll, int lc, const char *lfile, long int lorder)			\

   247

			:list_c(elem, fl, fc, ffile, forder, ll, lc, lfile, lorder) {}		\

   248

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   249

   250

#define SYM_TOKEN(class_name_c, ...)								\

   251

class_name_c::class_name_c(const char *value, 							\

   252

                           int fl, int fc, const char *ffile, long int forder,			\

   253

                           int ll, int lc, const char *lfile, long int lorder)			\

   254

			:token_c(value, fl, fc, ffile, forder, ll, lc, lfile, lorder) {}	\

   255

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   256

   257

#define SYM_REF0(class_name_c, ...)								\

   258

class_name_c::class_name_c(									\

   259

                           int fl, int fc, const char *ffile, long int forder,			\

   260

                           int ll, int lc, const char *lfile, long int lorder)			\

   261

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {}		\

   262

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   263

   264

   265

#define SYM_REF1(class_name_c, ref1, ...)							\

   266

class_name_c::class_name_c(symbol_c *ref1,							\

   267

                           int fl, int fc, const char *ffile, long int forder,			\

   268

                           int ll, int lc, const char *lfile, long int lorder)			\

   269

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   270

  this->ref1 = ref1;										\

   271

  if  (NULL != ref1)   ref1->parent = this;							\

   272

}												\

   273

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   274

   275

   276

#define SYM_REF2(class_name_c, ref1, ref2, ...)							\

   277

class_name_c::class_name_c(symbol_c *ref1,							\

   278

			   symbol_c *ref2,							\

   279

                           int fl, int fc, const char *ffile, long int forder,			\

   280

                           int ll, int lc, const char *lfile, long int lorder)			\

   281

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   282

  this->ref1 = ref1;										\

   283

  this->ref2 = ref2;										\

   284

  if  (NULL != ref1)   ref1->parent = this;							\

   285

  if  (NULL != ref2)   ref2->parent = this;										\

   286

}												\

   287

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   288

   289

   290

#define SYM_REF3(class_name_c, ref1, ref2, ref3, ...)						\

   291

class_name_c::class_name_c(symbol_c *ref1,							\

   292

			   symbol_c *ref2,							\

   293

			   symbol_c *ref3,							\

   294

                           int fl, int fc, const char *ffile, long int forder,			\

   295

                           int ll, int lc, const char *lfile, long int lorder)			\

   296

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   297

  this->ref1 = ref1;										\

   298

  this->ref2 = ref2;										\

   299

  this->ref3 = ref3;										\

   300

  if  (NULL != ref1)   ref1->parent = this;							\

   301

  if  (NULL != ref2)   ref2->parent = this;							\

   302

  if  (NULL != ref3)   ref3->parent = this;							\

   303

}												\

   304

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   305

   306

   307

#define SYM_REF4(class_name_c, ref1, ref2, ref3, ref4, ...)					\

   308

class_name_c::class_name_c(symbol_c *ref1,							\

   309

			   symbol_c *ref2,							\

   310

			   symbol_c *ref3,							\

   311

			   symbol_c *ref4,							\

   312

                           int fl, int fc, const char *ffile, long int forder,			\

   313

                           int ll, int lc, const char *lfile, long int lorder)			\

   314

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   315

  this->ref1 = ref1;										\

   316

  this->ref2 = ref2;										\

   317

  this->ref3 = ref3;										\

   318

  this->ref4 = ref4;										\

   319

  if  (NULL != ref1)   ref1->parent = this;							\

   320

  if  (NULL != ref2)   ref2->parent = this;							\

   321

  if  (NULL != ref3)   ref3->parent = this;							\

   322

  if  (NULL != ref4)   ref4->parent = this;							\

   323

}												\

   324

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   325

   326

   327

#define SYM_REF5(class_name_c, ref1, ref2, ref3, ref4, ref5, ...)				\

   328

class_name_c::class_name_c(symbol_c *ref1,							\

   329

			   symbol_c *ref2,							\

   330

			   symbol_c *ref3,							\

   331

			   symbol_c *ref4,							\

   332

			   symbol_c *ref5,							\

   333

                           int fl, int fc, const char *ffile, long int forder,			\

   334

                           int ll, int lc, const char *lfile, long int lorder)			\

   335

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   336

  this->ref1 = ref1;										\

   337

  this->ref2 = ref2;										\

   338

  this->ref3 = ref3;										\

   339

  this->ref4 = ref4;										\

   340

  this->ref5 = ref5;										\

   341

  if  (NULL != ref1)   ref1->parent = this;							\

   342

  if  (NULL != ref2)   ref2->parent = this;							\

   343

  if  (NULL != ref3)   ref3->parent = this;							\

   344

  if  (NULL != ref4)   ref4->parent = this;							\

   345

  if  (NULL != ref5)   ref5->parent = this;							\

   346

}												\

   347

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   348

   349

   350

   351

#define SYM_REF6(class_name_c, ref1, ref2, ref3, ref4, ref5, ref6, ...)				\

   352

class_name_c::class_name_c(symbol_c *ref1,							\

   353

			   symbol_c *ref2,							\

   354

			   symbol_c *ref3,							\

   355

			   symbol_c *ref4,							\

   356

			   symbol_c *ref5,							\

   357

			   symbol_c *ref6,							\

   358

                           int fl, int fc, const char *ffile, long int forder,			\

   359

                           int ll, int lc, const char *lfile, long int lorder)			\

   360

			  :symbol_c(fl, fc, ffile, forder, ll, lc, lfile, lorder) {		\

   361

  this->ref1 = ref1;										\

   362

  this->ref2 = ref2;										\

   363

  this->ref3 = ref3;										\

   364

  this->ref4 = ref4;										\

   365

  this->ref5 = ref5;										\

   366

  this->ref6 = ref6;										\

   367

  if  (NULL != ref1)   ref1->parent = this;							\

   368

  if  (NULL != ref2)   ref2->parent = this;							\

   369

  if  (NULL != ref3)   ref3->parent = this;							\

   370

  if  (NULL != ref4)   ref4->parent = this;							\

   371

  if  (NULL != ref5)   ref5->parent = this;							\

   372

  if  (NULL != ref6)   ref6->parent = this;							\

   373

}												\

   374

void *class_name_c::accept(visitor_c &visitor) {return visitor.visit(this);}

   375

   376

   377

   378

#include "absyntax.def"

   379

   380

   381

   382

   383

#undef SYM_LIST

   384

#undef SYM_TOKEN

   385

#undef SYM_TOKEN

   386

#undef SYM_REF0

   387

#undef SYM_REF1

   388

#undef SYM_REF2

   389

#undef SYM_REF3

   390

#undef SYM_REF4

   391

#undef SYM_REF5

   392

#undef SYM_REF6

   393

   394

   395

   396

   397