equal
deleted
inserted
replaced
71 * We therefore need a counter to know how deep inside a parenthesis |
71 * We therefore need a counter to know how deep inside a parenthesis |
72 * structure we are. |
72 * structure we are. |
73 */ |
73 */ |
74 int il_parenthesis_level; |
74 int il_parenthesis_level; |
75 bool il_error; |
75 bool il_error; |
76 bool error_found; |
76 int error_count; |
77 bool warning_found; |
77 bool warning_found; |
78 |
78 |
79 /* the current data type of the data stored in the IL stack, i.e. the default variable */ |
79 /* the current data type of the data stored in the IL stack, i.e. the default variable */ |
80 il_instruction_c *fake_prev_il_instruction; |
80 il_instruction_c *fake_prev_il_instruction; |
81 /* the narrow algorithm will need access to the intersected candidate_datatype lists of all prev_il_instructions, as well as the |
81 /* the narrow algorithm will need access to the intersected candidate_datatype lists of all prev_il_instructions, as well as the |
97 |
97 |
98 |
98 |
99 public: |
99 public: |
100 print_datatypes_error_c(symbol_c *ignore); |
100 print_datatypes_error_c(symbol_c *ignore); |
101 virtual ~print_datatypes_error_c(void); |
101 virtual ~print_datatypes_error_c(void); |
102 int get_error_found(); |
102 int get_error_count(); |
103 |
103 |
104 |
104 |
105 /*********************/ |
105 /*********************/ |
106 /* B 1.2 - Constants */ |
106 /* B 1.2 - Constants */ |
107 /*********************/ |
107 /*********************/ |