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

    44

#define ERROR error_exit(__FILE__,__LINE__)

    45

/* function defined in main.cc */

    46

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

    47

    48

#define ABORT(str) {printf("ERROR: %s\n", str); ERROR;}

    49

    50

    51

    52

/* The base class of all symbols */

    53

symbol_c::symbol_c(

    54

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

    55

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

    56

  this->first_file   = ffile,

    57

  this->first_line   = first_line;

    58

  this->first_column = first_column;

    59

  this->first_order  = first_order;

    60

  this->last_file    = lfile,

    61

  this->last_line    = last_line;

    62

  this->last_column  = last_column;

    63

  this->last_order   = last_order;

    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

    ABORT("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

  int i;

   134

  if (pos > n) ERROR;

   135

   136

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

   137

  /* will also increment n by 1 ! */

   138

  add_element(elem);

   139

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

   140

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

   141

  elements[pos] = elem;

   142

}

   143

   144

   145

   146

#define SYM_LIST(class_name_c, ...)								\

   147

class_name_c::class_name_c(									\

   148

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

   149

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

   150

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

   151

class_name_c::class_name_c(symbol_c *elem, 							\

   152

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

   153

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

   154

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

   155

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

   156

   157

#define SYM_TOKEN(class_name_c, ...)								\

   158

class_name_c::class_name_c(const char *value, 							\

   159

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

   160

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

   161

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

   162

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

   163

   164

#define SYM_REF0(class_name_c, ...)								\

   165

class_name_c::class_name_c(									\

   166

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

   167

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

   168

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

   169

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

   170

   171

   172

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

   173

class_name_c::class_name_c(symbol_c *ref1,							\

   174

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

   175

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

   176

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

   177

  this->ref1 = ref1;										\

   178

}												\

   179

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

   180

   181

   182

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

   183

class_name_c::class_name_c(symbol_c *ref1,							\

   184

			   symbol_c *ref2,							\

   185

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

   186

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

   187

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

   188

  this->ref1 = ref1;										\

   189

  this->ref2 = ref2;										\

   190

}												\

   191

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

   192

   193

   194

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

   195

class_name_c::class_name_c(symbol_c *ref1,							\

   196

			   symbol_c *ref2,							\

   197

			   symbol_c *ref3,							\

   198

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

   199

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

   200

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

   201

  this->ref1 = ref1;										\

   202

  this->ref2 = ref2;										\

   203

  this->ref3 = ref3;										\

   204

}												\

   205

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

   206

   207

   208

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

   209

class_name_c::class_name_c(symbol_c *ref1,							\

   210

			   symbol_c *ref2,							\

   211

			   symbol_c *ref3,							\

   212

			   symbol_c *ref4,							\

   213

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

   214

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

   215

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

   216

  this->ref1 = ref1;										\

   217

  this->ref2 = ref2;										\

   218

  this->ref3 = ref3;										\

   219

  this->ref4 = ref4;										\

   220

}												\

   221

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

   222

   223

   224

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

   225

class_name_c::class_name_c(symbol_c *ref1,							\

   226

			   symbol_c *ref2,							\

   227

			   symbol_c *ref3,							\

   228

			   symbol_c *ref4,							\

   229

			   symbol_c *ref5,							\

   230

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

   231

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

   232

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

   233

  this->ref1 = ref1;										\

   234

  this->ref2 = ref2;										\

   235

  this->ref3 = ref3;										\

   236

  this->ref4 = ref4;										\

   237

  this->ref5 = ref5;										\

   238

}												\

   239

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

   240

   241

   242

   243

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

   244

class_name_c::class_name_c(symbol_c *ref1,							\

   245

			   symbol_c *ref2,							\

   246

			   symbol_c *ref3,							\

   247

			   symbol_c *ref4,							\

   248

			   symbol_c *ref5,							\

   249

			   symbol_c *ref6,							\

   250

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

   251

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

   252

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

   253

  this->ref1 = ref1;										\

   254

  this->ref2 = ref2;										\

   255

  this->ref3 = ref3;										\

   256

  this->ref4 = ref4;										\

   257

  this->ref5 = ref5;										\

   258

  this->ref6 = ref6;										\

   259

}												\

   260

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

   261

   262

   263

   264

#include "absyntax.def"

   265

   266

   267

   268

   269

#undef SYM_LIST

   270

#undef SYM_TOKEN

   271

#undef SYM_TOKEN

   272

#undef SYM_REF0

   273

#undef SYM_REF1

   274

#undef SYM_REF2

   275

#undef SYM_REF3

   276

#undef SYM_REF4

   277

#undef SYM_REF5

   278

#undef SYM_REF6

   279

   280

   281

   282

   283