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;

    61

  this->datatype     = NULL;

    62

  this->scope        = NULL;

    63

}

    64

    65

    66

    67

token_c::token_c(const char *value, 

    68

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

    69

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

    70

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

    71

  this->value = value;

    72

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

    73

}

    74

    75

    76

    77

    78

# define LIST_CAP_INIT 8

    79

# define LIST_CAP_INCR 8

    80

    81

list_c::list_c(

    82

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

    83

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

    84

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

    85

  n = 0;

    86

  elements = (symbol_c**)malloc(LIST_CAP_INIT*sizeof(symbol_c*));

    87

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

    88

}

    89

    90

    91

list_c::list_c(symbol_c *elem, 

    92

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

    93

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

    94

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

    95

  n = 0;

    96

  elements = (symbol_c**)malloc(LIST_CAP_INIT*sizeof(symbol_c*));

    97

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

    98

  add_element(elem); 

    99

}

   100

   101

   102

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

   103

void list_c::add_element(symbol_c *elem) {

   104

  // printf("list_c::add_element()\n");

   105

  if (c <= n)

   106

    if (!(elements=(symbol_c**)realloc(elements,(c+=LIST_CAP_INCR)*sizeof(symbol_c *))))

   107

      ERROR_MSG("out of memory");

   108

  elements[n++] = elem;

   109

   110

  if (NULL == elem) return;

   111

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

   112

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

   113

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

   114

   * pointer still set to NULL.

   115

   */

   116

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

   117

   118

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

   119

  if (NULL == first_file) {

   120

    first_file = elem->first_file;

   121

    first_line = elem->first_line;

   122

    first_column = elem->first_column;

   123

  }

   124

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

   125

    first_column = elem->first_column;

   126

  }

   127

  if (first_line > elem->first_line) {

   128

    first_line = elem->first_line;

   129

    first_column = elem->first_column;

   130

  }

   131

  if (NULL == last_file) {

   132

    last_file = elem->last_file;

   133

    last_line = elem->last_line;

   134

    last_column = elem->last_column;

   135

  }

   136

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

   137

      (last_column < elem->last_column)) {

   138

    last_column = elem->last_column;

   139

  }

   140

  if (last_line < elem->last_line) {

   141

    last_line = elem->last_line;

   142

    last_column = elem->last_column;

   143

  }

   144

}

   145

   146

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

   147

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

   148

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

   149

void list_c::insert_element(symbol_c *elem, int pos) {

   150

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

   151

   152

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

   153

  /* will also increment n by 1 ! */

   154

  add_element(elem);

   155

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

   156

  if(pos < (n-1)){ 

   157

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

   158

    elements[pos] = elem;

   159

  }

   160

}

   161

   162

   163

/* remove element at position pos. */

   164

void list_c::remove_element(int pos) {

   165

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

   166

   167

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

   168

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

   169

  /* corrent the new size */

   170

  n--;

   171

  /* elements = (symbol_c **)realloc(elements, n * sizeof(symbol_c *)); */

   172

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

   173

}

   174

   175

   176

/* remove element at position pos. */

   177

void list_c::clear(void) {

   178

  n = 0;

   179

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

   180

}

   181

   182

   183

#define SYM_LIST(class_name_c, ...)								\

   184

class_name_c::class_name_c(									\

   185

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

   186

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

   187

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

   188

class_name_c::class_name_c(symbol_c *elem, 							\

   189

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

   190

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

   191

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

   192

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

   193

   194

#define SYM_TOKEN(class_name_c, ...)								\

   195

class_name_c::class_name_c(const char *value, 							\

   196

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

   197

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

   198

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

   199

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

   200

   201

#define SYM_REF0(class_name_c, ...)								\

   202

class_name_c::class_name_c(									\

   203

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

   204

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

   205

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

   206

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

   207

   208

   209

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

   210

class_name_c::class_name_c(symbol_c *ref1,							\

   211

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

   212

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

   213

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

   214

  this->ref1 = ref1;										\

   215

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

   216

}												\

   217

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

   218

   219

   220

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

   221

class_name_c::class_name_c(symbol_c *ref1,							\

   222

			   symbol_c *ref2,							\

   223

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

   224

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

   225

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

   226

  this->ref1 = ref1;										\

   227

  this->ref2 = ref2;										\

   228

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

   229

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

   230

}												\

   231

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

   232

   233

   234

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

   235

class_name_c::class_name_c(symbol_c *ref1,							\

   236

			   symbol_c *ref2,							\

   237

			   symbol_c *ref3,							\

   238

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

   239

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

   240

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

   241

  this->ref1 = ref1;										\

   242

  this->ref2 = ref2;										\

   243

  this->ref3 = ref3;										\

   244

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

   245

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

   246

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

   247

}												\

   248

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

   249

   250

   251

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

   252

class_name_c::class_name_c(symbol_c *ref1,							\

   253

			   symbol_c *ref2,							\

   254

			   symbol_c *ref3,							\

   255

			   symbol_c *ref4,							\

   256

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

   257

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

   258

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

   259

  this->ref1 = ref1;										\

   260

  this->ref2 = ref2;										\

   261

  this->ref3 = ref3;										\

   262

  this->ref4 = ref4;										\

   263

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

   264

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

   265

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

   266

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

   267

}												\

   268

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

   269

   270

   271

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

   272

class_name_c::class_name_c(symbol_c *ref1,							\

   273

			   symbol_c *ref2,							\

   274

			   symbol_c *ref3,							\

   275

			   symbol_c *ref4,							\

   276

			   symbol_c *ref5,							\

   277

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

   278

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

   279

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

   280

  this->ref1 = ref1;										\

   281

  this->ref2 = ref2;										\

   282

  this->ref3 = ref3;										\

   283

  this->ref4 = ref4;										\

   284

  this->ref5 = ref5;										\

   285

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

   286

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

   287

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

   288

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

   289

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

   290

}												\

   291

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

   292

   293

   294

   295

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

   296

class_name_c::class_name_c(symbol_c *ref1,							\

   297

			   symbol_c *ref2,							\

   298

			   symbol_c *ref3,							\

   299

			   symbol_c *ref4,							\

   300

			   symbol_c *ref5,							\

   301

			   symbol_c *ref6,							\

   302

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

   303

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

   304

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

   305

  this->ref1 = ref1;										\

   306

  this->ref2 = ref2;										\

   307

  this->ref3 = ref3;										\

   308

  this->ref4 = ref4;										\

   309

  this->ref5 = ref5;										\

   310

  this->ref6 = ref6;										\

   311

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

   312

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

   313

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

   314

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

   315

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

   316

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

   317

}												\

   318

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

   319

   320

   321

   322

#include "absyntax.def"

   323

   324

   325

   326

   327

#undef SYM_LIST

   328

#undef SYM_TOKEN

   329

#undef SYM_TOKEN

   330

#undef SYM_REF0

   331

#undef SYM_REF1

   332

#undef SYM_REF2

   333

#undef SYM_REF3

   334

#undef SYM_REF4

   335

#undef SYM_REF5

   336

#undef SYM_REF6

   337

   338

   339

   340

   341