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

/* The base class of all symbols */

    48

symbol_c::symbol_c(

    49

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

    50

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

    51

  this->first_file   = ffile,

    52

  this->first_line   = first_line;

    53

  this->first_column = first_column;

    54

  this->first_order  = first_order;

    55

  this->last_file    = lfile,

    56

  this->last_line    = last_line;

    57

  this->last_column  = last_column;

    58

  this->last_order   = last_order;

    59

  this->datatype     = NULL;

    60

  this->const_value._real64.status   = cs_undefined;

    61

  this->const_value._int64.status    = cs_undefined;

    62

  this->const_value._uint64.status   = cs_undefined;

    63

  this->const_value._bool.status     = cs_undefined;

    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;

    73

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

    74

}

    75

    76

    77

    78

    79

    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) {

    85

  n = 0;

    86

  elements = NULL;

    87

}

    88

    89

list_c::list_c(symbol_c *elem, 

    90

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

    91

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

    92

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

    93

  n = 0;

    94

  elements = NULL;

    95

  add_element(elem);

    96

}

    97

    98

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

    99

void list_c::add_element(symbol_c *elem) {

   100

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

   101

  n++;

   102

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

   103

  if (elements == NULL)

   104

    ERROR_MSG("Out of memory");

   105

  elements[n - 1] = elem;

   106

   107

  if (elem == NULL)

   108

    return;

   109

   110

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

   111

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

   112

      (first_column > elem->first_column)) {

   113

    first_column = elem->first_column;

   114

  }

   115

  if (first_line > elem->first_line) {

   116

    first_line = elem->first_line;

   117

    first_column = elem->first_column;

   118

  }

   119

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

   120

      (last_column < elem->last_column)) {

   121

    last_column = elem->last_column;

   122

  }

   123

  if (last_line < elem->last_line) {

   124

    last_line = elem->last_line;

   125

    last_column = elem->last_column;

   126

  }

   127

}

   128

   129

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

   130

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

   131

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

   132

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

   133

  if (pos > n) ERROR;

   134

   135

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

   136

  /* will also increment n by 1 ! */

   137

  add_element(elem);

   138

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

   139

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

   140

  elements[pos] = elem;

   141

}

   142

   143

   144

/* remove element at position pos. */

   145

void list_c::remove_element(int pos) {

   146

  if (pos > n) ERROR;

   147

   148

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

   149

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

   150

  /* corrent the new size, and free unused memory */

   151

  n--;

   152

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

   153

}

   154

   155

#define SYM_LIST(class_name_c, ...)								\

   156

class_name_c::class_name_c(									\

   157

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

   158

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

   159

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

   160

class_name_c::class_name_c(symbol_c *elem, 							\

   161

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

   162

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

   163

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

   164

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

   165

   166

#define SYM_TOKEN(class_name_c, ...)								\

   167

class_name_c::class_name_c(const char *value, 							\

   168

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

   169

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

   170

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

   171

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

   172

   173

#define SYM_REF0(class_name_c, ...)								\

   174

class_name_c::class_name_c(									\

   175

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

   176

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

   177

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

   178

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

   179

   180

   181

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

   182

class_name_c::class_name_c(symbol_c *ref1,							\

   183

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

   184

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

   185

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

   186

  this->ref1 = ref1;										\

   187

}												\

   188

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

   189

   190

   191

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

   192

class_name_c::class_name_c(symbol_c *ref1,							\

   193

			   symbol_c *ref2,							\

   194

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

   195

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

   196

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

   197

  this->ref1 = ref1;										\

   198

  this->ref2 = ref2;										\

   199

}												\

   200

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

   201

   202

   203

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

   204

class_name_c::class_name_c(symbol_c *ref1,							\

   205

			   symbol_c *ref2,							\

   206

			   symbol_c *ref3,							\

   207

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

   208

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

   209

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

   210

  this->ref1 = ref1;										\

   211

  this->ref2 = ref2;										\

   212

  this->ref3 = ref3;										\

   213

}												\

   214

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

   215

   216

   217

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

   218

class_name_c::class_name_c(symbol_c *ref1,							\

   219

			   symbol_c *ref2,							\

   220

			   symbol_c *ref3,							\

   221

			   symbol_c *ref4,							\

   222

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

   223

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

   224

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

   225

  this->ref1 = ref1;										\

   226

  this->ref2 = ref2;										\

   227

  this->ref3 = ref3;										\

   228

  this->ref4 = ref4;										\

   229

}												\

   230

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

   231

   232

   233

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

   234

class_name_c::class_name_c(symbol_c *ref1,							\

   235

			   symbol_c *ref2,							\

   236

			   symbol_c *ref3,							\

   237

			   symbol_c *ref4,							\

   238

			   symbol_c *ref5,							\

   239

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

   240

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

   241

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

   242

  this->ref1 = ref1;										\

   243

  this->ref2 = ref2;										\

   244

  this->ref3 = ref3;										\

   245

  this->ref4 = ref4;										\

   246

  this->ref5 = ref5;										\

   247

}												\

   248

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

   249

   250

   251

   252

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

   253

class_name_c::class_name_c(symbol_c *ref1,							\

   254

			   symbol_c *ref2,							\

   255

			   symbol_c *ref3,							\

   256

			   symbol_c *ref4,							\

   257

			   symbol_c *ref5,							\

   258

			   symbol_c *ref6,							\

   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

  this->ref1 = ref1;										\

   263

  this->ref2 = ref2;										\

   264

  this->ref3 = ref3;										\

   265

  this->ref4 = ref4;										\

   266

  this->ref5 = ref5;										\

   267

  this->ref6 = ref6;										\

   268

}												\

   269

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

   270

   271

   272

   273

#include "absyntax.def"

   274

   275

   276

   277

   278

#undef SYM_LIST

   279

#undef SYM_TOKEN

   280

#undef SYM_TOKEN

   281

#undef SYM_REF0

   282

#undef SYM_REF1

   283

#undef SYM_REF2

   284

#undef SYM_REF3

   285

#undef SYM_REF4

   286

#undef SYM_REF5

   287

#undef SYM_REF6

   288

   289

   290

   291

   292