1

/*

     2

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

     3

 *

     4

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

     5

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

     6

 *

     7

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

     8

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

     9

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

    10

 *  (at your option) any later version.

    11

 *

    12

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

    13

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

    14

 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    15

 *  GNU General Public License for more details.

    16

 *

    17

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

    18

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

    19

 *

    20

 *

    21

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

    22

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

    23

 */

    24

    25

/*

    26

 * A generic symbol table that allows duplicate values.

    27

 *

    28

 * This is used to create a symbol table of previously defined

    29

 * functions. Duplicate are allowed since the standard permits function\

    30

 * overloading in the standard library.

    31

 */

    32

    33

    34

#include <iostream>

    35

#include "symtable.hh"

    37

    38

    39

    40

    41

    42

    43

 /* clear all entries... */

    44

template<typename value_type, value_type null_value>

    45

void dsymtable_c<value_type, null_value>::reset(void) {

    46

  _base.clear();

    47

}

    48

    49

    50

template<typename value_type, value_type null_value>

    51

void dsymtable_c<value_type, null_value>::insert(const char *identifier_str, value_t new_value) {

    52

  // std::cout << "store_identifier(" << identifier_str << "): \n";

    53

  std::pair<const char *, value_t> new_element(identifier_str, new_value);

    54

  /* iterator res = */ _base.insert(new_element);

    55

}

    56

    57

    58

template<typename value_type, value_type null_value>

    59

void dsymtable_c<value_type, null_value>::insert(const symbol_c *symbol, value_t new_value) {

    60

  const token_c *name = dynamic_cast<const token_c *>(symbol);

    61

  if (name == NULL)

    62

    ERROR;

    63

  insert(name->value, new_value);

    64

}

    65

    66

    67

#if 0

    68

template<typename value_type, value_type null_value>

    69

void dsymtable_c<value_type, null_value>::insert_noduplicate(const char *identifier_str, value_t new_value) {

    70

  if (find_value(identifier_str) != null_value)

    71

    /* already present in the set! */

    72

    ERROR;

    73

    74

  // std::cout << "store_identifier(" << identifier_str << "): \n";

    75

  std::pair<const char *, value_t> new_element(identifier_str, new_value);

    76

  /* iterator res = */ _base.insert(new_element);

    77

}

    78

    79

    80

template<typename value_type, value_type null_value>

    81

void dsymtable_c<value_type, null_value>::insert_noduplicate(const symbol_c *symbol, value_t new_value) {

    82

  const token_c *name = dynamic_cast<const token_c *>(symbol);

    83

  if (name == NULL)

    84

    ERROR;

    85

  insert_noduplicate(name->value, new_value);

    86

}

    87

#endif

    88

    89

    90

    91

/* Determine how many entries are associated to key identifier_str */ 

    92

/* returns:

    93

 *         0: if no entry is found

    94

 *         1: if 1 entry is found

    95

 *         2: if more than 1 entry is found 

    96

 */

    97

template<typename value_type, value_type null_value>

    98

int dsymtable_c<value_type, null_value>::multiplicity(const char *identifier_str) {

    99

  iterator lower = _base.lower_bound(identifier_str);

   100

  if (lower == _base.end()) return 0;

   101

   102

  iterator upper = _base.upper_bound(identifier_str);

   103

  iterator second = lower;

   104

  second++;

   105

   106

  if (second == upper) return 1;

   107

   108

  return 2;

   109

}

   110

   111

   112

/* returns null_value if not found! */

   113

template<typename value_type, value_type null_value>

   114

value_type dsymtable_c<value_type, null_value>::find_value(const char *identifier_str) {

   115

  iterator i = _base.find(identifier_str);

   116

   117

  if (i == _base.end())

   118

    return null_value;

   119

  else

   120

    return i->second;

   121

}

   122

   123

   124

template<typename value_type, value_type null_value>

   125

const char * dsymtable_c<value_type, null_value>::symbol_to_string(const symbol_c *symbol) {

   126

  const token_c *name = dynamic_cast<const token_c *>(symbol);

   127

  if (name == NULL)

   128

    ERROR;

   129

  return name->value;

   130

}

   131

   132

   133

/* debuging function... */

   134

template<typename value_type, value_type null_value>

   135

void dsymtable_c<value_type, null_value>::print(void) {

   136

  for(iterator i = _base.begin();

   137

      i != _base.end();

   138

      i++)

   139

    std::cout << i->second << ":" << i->first << "\n";

   140

  std::cout << "=====================\n";

   141

}

   142

   143

   144

   145

   146

   147

   148

   149

   150