2 * Copyright (c) 1989 The Regents of the University of California.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)defs.h 5.6 (Berkeley) 5/24/93
46 /* machine-dependent definitions */
47 /* the following definitions are for the Tahoe */
48 /* they might have to be changed for other machines */
50 /* MAXTABLE is the maximum table size */
51 /* BITS_PER_WORD is the number of bits in a C unsigned */
52 /* WORDSIZE computes the number of words needed to */
54 /* BIT returns the value of the n-th bit starting */
55 /* from r (0-indexed) */
56 /* SETBIT sets the n-th bit starting from r */
58 #define MAXTABLE 32500
59 #define BITS_PER_WORD 32
60 #define WORDSIZE(n) (((n)+(BITS_PER_WORD-1))/BITS_PER_WORD)
61 #define BIT(r, n) ((((r)[(n)>>5])>>((n)&31))&1)
62 #define SETBIT(r, n) ((r)[(n)>>5]|=((unsigned)1<<((n)&31)))
67 #define NUL '\0' /* the null character */
68 #define NEWLINE '\n' /* line feed */
69 #define SP ' ' /* space */
70 #define BS '\b' /* backspace */
71 #define HT '\t' /* horizontal tab */
72 #define VT '\013' /* vertical tab */
73 #define CR '\r' /* carriage return */
74 #define FF '\f' /* form feed */
75 #define QUOTE '\'' /* single quote */
76 #define DOUBLE_QUOTE '\"' /* double quote */
77 #define BACKSLASH '\\' /* backslash */
80 /* defines for constructing filenames */
82 #define CODE_SUFFIX ".code.c"
83 #define DEFINES_SUFFIX ".tab.h"
84 #define OUTPUT_SUFFIX ".tab.c"
85 #define VERBOSE_SUFFIX ".output"
110 /* the undefined value */
112 #define UNDEFINED (-1)
121 /* character macros */
123 #define IS_IDENT(c) (isalnum(c) || (c) == '_' || (c) == '.' || (c) == '$')
124 #define IS_OCTAL(c) ((c) >= '0' && (c) <= '7')
125 #define NUMERIC_VALUE(c) ((c) - '0')
130 #define ISTOKEN(s) ((s) < start_symbol)
131 #define ISVAR(s) ((s) >= start_symbol)
134 /* storage allocation macros */
136 #define CALLOC(k,n) (calloc((unsigned)(k),(unsigned)(n)))
137 #define FREE(x) (free((char*)(x)))
138 #define MALLOC(n) (malloc((unsigned)(n)))
139 #define NEW(t) ((t*)allocate(sizeof(t)))
140 #define NEW2(n,t) ((t*)allocate((unsigned)((n)*sizeof(t))))
141 #define REALLOC(p,n) (realloc((char*)(p),(unsigned)(n)))
144 /* the structure of a symbol table entry */
146 typedef struct bucket bucket;
161 /* the structure of the LR(0) state machine */
163 typedef struct core core;
169 short accessing_symbol;
175 /* the structure used to record shifts */
177 typedef struct shifts shifts;
187 /* the structure used to store reductions */
189 typedef struct reductions reductions;
192 struct reductions *next;
199 /* the structure used to represent parser actions */
201 typedef struct action action;
214 /* global variables */
221 extern const char *symbol_prefix;
228 extern const char *banner[];
229 extern const char *tables[];
230 extern const char *header[];
231 extern const char *body[];
232 extern const char *trailer[];
234 extern char *action_file_name;
235 extern char *code_file_name;
236 extern char *defines_file_name;
237 extern const char *input_file_name;
238 extern char *output_file_name;
239 extern char *text_file_name;
240 extern char *union_file_name;
241 extern char *verbose_file_name;
243 extern FILE *action_file;
244 extern FILE *code_file;
245 extern FILE *defines_file;
246 extern FILE *input_file;
247 extern FILE *output_file;
248 extern FILE *text_file;
249 extern FILE *union_file;
250 extern FILE *verbose_file;
259 extern char unionized;
261 extern int start_symbol;
262 extern char **symbol_name;
263 extern short *symbol_value;
264 extern short *symbol_prec;
265 extern char *symbol_assoc;
273 extern short **derives;
274 extern char *nullable;
276 extern bucket *first_symbol;
277 extern bucket *last_symbol;
280 extern core *first_state;
281 extern shifts *first_shift;
282 extern reductions *first_reduction;
283 extern short *accessing_symbol;
284 extern core **state_table;
285 extern shifts **shift_table;
286 extern reductions **reduction_table;
288 extern short *LAruleno;
289 extern short *lookaheads;
290 extern short *goto_map;
291 extern short *from_state;
292 extern short *to_state;
294 extern action **parser;
298 extern short *SRconflicts;
299 extern short *RRconflicts;
300 extern short *defred;
301 extern short *rules_used;
302 extern short nunused;
303 extern short final_state;
305 /* global functions */
307 char *allocate(unsigned);
308 void closure(short *, int);
309 void create_symbol_table(void);
310 void default_action_warning(void);
311 void dollar_error(int, char *, char *) __dead2;
312 void dollar_warning(int, int);
313 void done(int) __dead2;
314 void fatal(const char *msg) __dead2;
315 void finalize_closure(void);
316 void free_parser(void);
317 void free_symbols(void);
318 void free_symbol_table(void);
319 void illegal_character(char *) __dead2;
320 void illegal_tag(int, char *, char *) __dead2;
322 bucket *lookup(char *);
324 bucket *make_bucket(const char *);
325 void make_parser(void);
326 void no_grammar(void) __dead2;
327 void no_space(void) __dead2;
328 void open_error(const char *) __dead2;
330 void over_unionized(char *) __dead2;
331 void prec_redeclared(void);
333 void reflexive_transitive_closure(unsigned *, int);
334 void reprec_warning(char *);
335 void restarted_warning(void);
336 void retyped_warning(char *);
337 void revalued_warning(char *);
338 void set_first_derives(void);
339 void syntax_error(int, char *, char *) __dead2;
340 void terminal_lhs(int) __dead2;
341 void terminal_start(char *) __dead2;
342 void tokenized_start(char *) __dead2;
343 void undefined_goal(char *) __dead2;
344 void undefined_symbol_warning(char *);
345 void unexpected_EOF(void) __dead2;
346 void unknown_rhs(int) __dead2;
347 void unterminated_action(int, char *, char *) __dead2;
348 void unterminated_comment(int, char *, char *) __dead2;
349 void unterminated_string(int, char *, char *) __dead2;
350 void unterminated_text(int, char *, char *) __dead2;
351 void unterminated_union(int, char *, char *) __dead2;
352 void untyped_lhs(void) __dead2;
353 void untyped_rhs(int, char *) __dead2;
354 void used_reserved(char *) __dead2;
356 void write_section(const char **);