symbol_t *errtoken = NULL;
symbol_t *undeftoken = NULL;
-symbol_t *eoftoken = NULL;
-symbol_t *axiom = NULL;
+symbol_t *endtoken = NULL;
+symbol_t *accept = NULL;
symbol_t *startsymbol = NULL;
location_t startsymbol_location;
res->number = NUMBER_UNDEFINED;
res->prec = 0;
- res->assoc = right_assoc;
+ res->assoc = undef_assoc;
res->user_token_number = USER_NUMBER_UNDEFINED;
res->alias = NULL;
void
symbol_precedence_set (symbol_t *symbol,
- int prec, associativity assoc, location_t location)
+ int prec, assoc_t assoc, location_t location)
{
if (assoc != undef_assoc)
{
symbol->tag);
symbol->user_token_number = user_token_number;
- /* User defined EOF token? */
+ /* User defined $end token? */
if (user_token_number == 0)
{
- eoftoken = symbol;
- eoftoken->number = 0;
+ endtoken = symbol;
+ endtoken->number = 0;
/* It is always mapped to 0, so it was already counted in
NTOKENS. */
--ntokens;
this->number = nvars++;
}
- return TRUE;
+ return true;
}
if (this->assoc != this->alias->assoc)
{
- /* FIXME: For some reason (probably the S/R => keep the S),
- the right assoc is chosen has the ``not set''. This is
- not nice, fix this! */
- if (this->assoc != right_assoc
- && this->alias->assoc != right_assoc)
+ if (this->assoc != undef_assoc && this->alias->assoc != undef_assoc)
complain_at (this->alias->location,
- _("conflicting associativities for %s and %s"),
- this->tag, this->alias->tag);
- if (this->assoc != 0)
+ _("conflicting associativities for %s (%s) and %s (%s)"),
+ this->tag, assoc_to_string (this->assoc),
+ this->alias->tag, assoc_to_string (this->alias->assoc));
+ if (this->assoc != undef_assoc)
this->alias->assoc = this->assoc;
else
this->assoc = this->alias->assoc;
}
}
- return TRUE;
+ return true;
}
prec and assoc fields and make both the same */
if (this->number == NUMBER_UNDEFINED)
{
- if (this == eoftoken || this->alias == eoftoken)
+ if (this == endtoken || this->alias == endtoken)
this->number = this->alias->number = 0;
else
{
}
/* Do not do processing below for USER_NUMBER_ALIASs. */
if (this->user_token_number == USER_NUMBER_ALIAS)
- return TRUE;
+ return true;
}
else /* this->class == token_sym */
{
}
symbols[this->number] = this;
- return TRUE;
+ return true;
}
token_translations[this->user_token_number] = this->number;
}
- return TRUE;
+ return true;
}
static bool
hash_compare_symbol_t (const symbol_t *m1, const symbol_t *m2)
{
- return strcmp (m1->tag, m2->tag) ? FALSE : TRUE;
+ return strcmp (m1->tag, m2->tag) == 0;
}
static unsigned int
/* Keep the symbol in a printable form. */
key = quotearg_style (escape_quoting_style, key);
- (const char *) probe.tag = key;
+ *(char const **) &probe.tag = key;
entry = hash_lookup (symbol_table, &probe);
if (!entry)
static void
symbols_token_translations_init (void)
{
- int num_256_available_p = TRUE;
+ bool num_256_available_p = true;
int i;
/* Find the highest user token number, and whether 256, the POSIX
if (this->user_token_number > max_user_token_number)
max_user_token_number = this->user_token_number;
if (this->user_token_number == 256)
- num_256_available_p = FALSE;
+ num_256_available_p = false;
}
}
token_translations = XCALLOC (symbol_number_t, max_user_token_number + 1);
/* Initialize all entries for literal tokens to 2, the internal
- token number for $undefined., which represents all invalid
- inputs. */
+ token number for $undefined, which represents all invalid inputs.
+ */
for (i = 0; i < max_user_token_number + 1; i++)
token_translations[i] = undeftoken->number;
symbols_do (symbol_translation, NULL);