1

/*

     3

 *

     6

 *

    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"

    36

    37

    38

    39

/* A macro for printing out internal parser errors... */

    40

#define ERROR error_exit(__FILE__,__LINE__)

    41

/* function defined in main.cc */

    42

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

    43

    44

    45

    46

    47

 /* clear all entries... */

    48

template<typename value_type, value_type null_value>

    49

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

    50

  _base.clear();

    51

}

    52

    53

    54

template<typename value_type, value_type null_value>

    55

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

    56

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

    57

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

    58

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

    59

}

    60

    61

    62

template<typename value_type, value_type null_value>

    63

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

    64

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

    65

  if (name == NULL)

    66

    ERROR;

    67

  insert(name->value, new_value);

    68

}

    69

    70

    71

#if 0

    72

template<typename value_type, value_type null_value>

    73

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

    74

  if (find_value(identifier_str) != null_value)

    75

    /* already present in the set! */

    76

    ERROR;

    77

    78

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

    79

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

    80

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

    81

}

    82

    83

    84

template<typename value_type, value_type null_value>

    85

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

    86

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

    87

  if (name == NULL)

    88

    ERROR;

    89

  insert_noduplicate(name->value, new_value);

    90

}

    91

#endif

    92

    93

    94

/* returns null_value if not found! */

    95

template<typename value_type, value_type null_value>

    96

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

    97

  iterator i = _base.find(identifier_str);

    98

    99

  if (i == _base.end())

   100

    return null_value;

   101

  else

   102

    return i->second;

   103

}

   104

   105

   106

template<typename value_type, value_type null_value>

   107

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

   108

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

   109

  if (name == NULL)

   110

    ERROR;

   111

  return find_value(name->value);

   112

}

   113

   114

   115

/* debuging function... */

   116

template<typename value_type, value_type null_value>

   117

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

   118

  for(iterator i = _base.begin();

   119

      i != _base.end();

   120

      i++)

   121

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

   122

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

   123

}

   124

   125

   126

   127

   128

   129

   130

   131

   132