_space_before_paren_exempt =? \\n\\$$
_space_before_paren_exempt = \
- (^ *\#|\\n\\$$|%s\(to %s|(date|group|character)\(s\))
+ (^ *\#|(LA)?LR\([01]\)|percent_(code|define)|b4_syncline|m4_(define|init)|symbol)
# Ensure that there is a space before each open parenthesis in C code.
sc_space_before_open_paren:
@if $(VC_LIST_EXCEPT) | grep -l '\.[ch]$$' > /dev/null; then \
prohibit_strcmp=^doc/bison\.texi|tests/local\.at$$ \
prohibit_tab_based_indentation=\.(am|mk)$$|^djgpp/|^\.git \
require_config_h_first=^(lib/yyerror|data/(glr|yacc))\.c$$ \
+ space_before_open_paren=^(data/|djgpp/) \
unmarked_diagnostics=^(djgpp/|doc/bison.texi$$|tests/c\+\+\.at$$) \
)
#endif
/* The semantic value of the lookahead symbol. */
-YYSTYPE yylval YY_INITIAL_VALUE(yyval_default);]b4_locations_if([[
+YYSTYPE yylval YY_INITIAL_VALUE (yyval_default);]b4_locations_if([[
/* Location data for the lookahead symbol. */
YYLTYPE yylloc]b4_pure_if([ = yyloc_default], [b4_yyloc_default])[;
}
void
-Sbitset__fprint(Sbitset self, Sbitset__Index nbits, FILE *file)
+Sbitset__fprint (Sbitset self, Sbitset__Index nbits, FILE *file)
{
Sbitset__Index i;
Sbitset itr;
bool Sbitset__isEmpty (Sbitset self, Sbitset__Index nbits);
-void Sbitset__fprint(Sbitset self, Sbitset__Index nbits, FILE *file);
+void Sbitset__fprint (Sbitset self, Sbitset__Index nbits, FILE *file);
# define Sbitset__set(SELF, INDEX) \
do { \
*Sbitset__byteAddress ((SELF), (INDEX)) = \
*Sbitset__byteAddress ((SELF), (INDEX)) | Sbitset__bit_mask (INDEX); \
- } while(0)
+ } while (0)
# define Sbitset__reset(SELF, INDEX) \
do { \
*Sbitset__byteAddress ((SELF), (INDEX)) = \
*Sbitset__byteAddress ((SELF), (INDEX)) & ~Sbitset__bit_mask (INDEX); \
- } while(0)
+ } while (0)
/* NBITS is the size of the bitset. More than NBITS bits might be reset. */
# define Sbitset__zero(SELF, NBITS) \
do { \
memset (SELF, 0, Sbitset__nbytes (NBITS)); \
- } while(0)
+ } while (0)
/* NBITS is the size of the bitset. More than NBITS bits might be set. */
# define Sbitset__ones(SELF, NBITS) \
do { \
memset (SELF, UCHAR_MAX, Sbitset__nbytes (NBITS)); \
- } while(0)
+ } while (0)
/* NBITS is the size of every bitset. More than NBITS bits might be set. */
# define Sbitset__or(SELF, OTHER1, OTHER2, NBITS) \
Sbitset end_self = ptr_self + Sbitset__nbytes (NBITS); \
for (; ptr_self < end_self; ++ptr_self, ++ptr_other1, ++ptr_other2) \
*ptr_self = *ptr_other1 | *ptr_other2; \
- } while(0)
+ } while (0)
# define SBITSET__FOR_EACH(SELF, NBITS, ITER, INDEX) \
for ((ITER) = (SELF); (ITER) < (SELF) + Sbitset__nbytes (NBITS); ++(ITER)) \
} while (0)
# define MUSCLE_INSERT_INT(Key, Value) \
- MUSCLE_INSERTF(Key, "%d", Value)
+ MUSCLE_INSERTF (Key, "%d", Value)
# define MUSCLE_INSERT_LONG_INT(Key, Value) \
- MUSCLE_INSERTF(Key, "%ld", Value)
+ MUSCLE_INSERTF (Key, "%ld", Value)
/* Key -> Value, but don't apply escaping to Value. */
# define MUSCLE_INSERT_STRING_RAW(Key, Value) \
- MUSCLE_INSERTF(Key, "%s", Value)
+ MUSCLE_INSERTF (Key, "%s", Value)
/* Key -> Value, applying M4 escaping to Value. */
# define MUSCLE_INSERT_STRING(Key, Value) \
/* Key -> Value, applying C escaping to Value (and then M4). */
# define MUSCLE_INSERT_C_STRING(Key, Value) \
- MUSCLE_INSERT_STRING(Key, quotearg_style (c_quoting_style, Value))
+ MUSCLE_INSERT_STRING (Key, quotearg_style (c_quoting_style, Value))
/* Append VALUE to the current value of KEY, using muscle_grow. But
MUSCLE_INSERT_LONG_INT (obstack_finish0 (&format_obstack), lmax); \
}
-GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_unsigned_int_table, unsigned int)
-GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_int_table, int)
-GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_base_table, base_number)
-GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_rule_number_table, rule_number)
-GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_symbol_number_table, symbol_number)
-GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_state_number_table, state_number)
-
+GENERATE_MUSCLE_INSERT_TABLE (muscle_insert_unsigned_int_table, unsigned int)
+GENERATE_MUSCLE_INSERT_TABLE (muscle_insert_int_table, int)
+GENERATE_MUSCLE_INSERT_TABLE (muscle_insert_base_table, base_number)
+GENERATE_MUSCLE_INSERT_TABLE (muscle_insert_rule_number_table, rule_number)
+GENERATE_MUSCLE_INSERT_TABLE (muscle_insert_symbol_number_table, symbol_number)
+GENERATE_MUSCLE_INSERT_TABLE (muscle_insert_state_number_table, state_number)
/*----------------------------------------------------------------.
| Print to OUT a representation of CP quoted and escaped for M4. |
/* LHS of the rule R. */
r1[r] = rules[r].lhs->number;
/* Length of rule R's RHS. */
- r2[r] = rule_rhs_length(&rules[r]);
+ r2[r] = rule_rhs_length (&rules[r]);
/* Line where rule was defined. */
rline[r] = rules[r].location.start.line;
/* Dynamic precedence (GLR). */
/* Whether the symbol has an identifier. */
value = symbol_id_get (sym);
- SET_KEY("has_id");
+ SET_KEY ("has_id");
MUSCLE_INSERT_INT (key, !!value);
/* Its identifier. */
- SET_KEY("id");
+ SET_KEY ("id");
MUSCLE_INSERT_STRING (key, value ? value : "");
/* Its tag. Typically for documentation purpose. */
- SET_KEY("tag");
+ SET_KEY ("tag");
MUSCLE_INSERT_STRING (key, sym->tag);
- SET_KEY("user_number");
+ SET_KEY ("user_number");
MUSCLE_INSERT_INT (key, sym->user_token_number);
- SET_KEY("is_token");
+ SET_KEY ("is_token");
MUSCLE_INSERT_INT (key,
i < ntokens && sym != errtoken && sym != undeftoken);
- SET_KEY("number");
+ SET_KEY ("number");
MUSCLE_INSERT_INT (key, sym->number);
- SET_KEY("has_type");
+ SET_KEY ("has_type");
MUSCLE_INSERT_INT (key, !!sym->type_name);
- SET_KEY("type");
+ SET_KEY ("type");
MUSCLE_INSERT_STRING (key, sym->type_name ? sym->type_name : "");
{
/* "printer", not "%printer". */
char const *pname = code_props_type_string (j) + 1;
code_props const *p = symbol_code_props_get (sym, j);
- SET_KEY2("has", pname);
+ SET_KEY2 ("has", pname);
MUSCLE_INSERT_INT (key, !!p->code);
if (p->code)
{
- SET_KEY2(pname, "file");
+ SET_KEY2 (pname, "file");
MUSCLE_INSERT_STRING (key, p->location.start.file);
- SET_KEY2(pname, "line");
+ SET_KEY2 (pname, "line");
MUSCLE_INSERT_INT (key, p->location.start.line);
- SET_KEY(pname);
+ SET_KEY (pname);
MUSCLE_INSERT_STRING_RAW (key, p->code);
}
}
-/* A Bison parser, made by GNU Bison 2.7.1.1188-e7178. */
+/* A Bison parser, made by GNU Bison 2.7.90. */
/* Bison implementation for Yacc-like parsers in C
#define YYBISON 1
/* Bison version. */
-#define YYBISON_VERSION "2.7.1.1188-e7178"
+#define YYBISON_VERSION "2.7.90"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
#endif
/* The semantic value of the lookahead symbol. */
-YYSTYPE yylval YY_INITIAL_VALUE(yyval_default);
+YYSTYPE yylval YY_INITIAL_VALUE (yyval_default);
/* Location data for the lookahead symbol. */
YYLTYPE yylloc = yyloc_default;
case 96:
#line 630 "src/parse-gram.y" /* yacc.c:1663 */
- { (yyval.named_ref) = named_ref_new((yyvsp[0].uniqstr), (yylsp[0])); }
+ { (yyval.named_ref) = named_ref_new ((yyvsp[0].uniqstr), (yylsp[0])); }
#line 2629 "src/parse-gram.c" /* yacc.c:1663 */
break;
static
char *strip_braces (char *code)
{
- code[strlen(code) - 1] = 0;
+ code[strlen (code) - 1] = 0;
return code + 1;
}
-/* A Bison parser, made by GNU Bison 2.7.1.1188-e7178. */
+/* A Bison parser, made by GNU Bison 2.7.90. */
/* Bison interface for Yacc-like parsers in C
named_ref.opt:
%empty { $$ = 0; }
-| BRACKETED_ID { $$ = named_ref_new($1, @1); }
+| BRACKETED_ID { $$ = named_ref_new ($1, @1); }
;
/*---------------------.
static
char *strip_braces (char *code)
{
- code[strlen(code) - 1] = 0;
+ code[strlen (code) - 1] = 0;
return code + 1;
}
grammar_midrule_action ();
p = grammar_symbol_append (sym, loc);
if (name)
- assign_named_ref(p, name);
+ assign_named_ref (p, name);
if (sym->status == undeclared || sym->status == used)
sym->status = needed;
}
/* <*> and <> do not have to be "declared". */
if (sem_type->status == declared
|| !*sem_type->tag
- || STREQ(sem_type->tag, "*"))
+ || STREQ (sem_type->tag, "*"))
{
int i;
for (i = 0; i < 2; ++i)
init_assoc (void)
{
graphid i;
- used_assoc = xcalloc(nsyms, sizeof(*used_assoc));
+ used_assoc = xcalloc (nsyms, sizeof *used_assoc);
for (i = 0; i < nsyms; ++i)
used_assoc[i] = false;
}
int
-uniqstr_cmp(uniqstr l, uniqstr r)
+uniqstr_cmp (uniqstr l, uniqstr r)
{
return (l == r ? 0
: !l ? -1
/* Compare two uniqstr a la strcmp: negative for <, nul for =, and
positive for >. Undefined order, relies on addresses. */
-int uniqstr_cmp(uniqstr u1, uniqstr u2);
+int uniqstr_cmp (uniqstr u1, uniqstr u2);
/* Die if STR is not a uniqstr. */
void uniqstr_assert (char const *str);