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
44 /* machine-dependent definitions */
45 /* the following definitions are for the Tahoe */
46 /* they might have to be changed for other machines */
48 /* MAXCHAR is the largest unsigned character value */
49 /* MAXSHORT is the largest value of a C short */
50 /* MINSHORT is the most negative value of a C short */
51 /* MAXTABLE is the maximum table size */
52 /* BITS_PER_WORD is the number of bits in a C unsigned */
53 /* WORDSIZE computes the number of words needed to */
55 /* BIT returns the value of the n-th bit starting */
56 /* from r (0-indexed) */
57 /* SETBIT sets the n-th bit starting from r */
60 #define MAXSHORT 32767
61 #define MINSHORT -32768
62 #define MAXTABLE 32500
63 #define BITS_PER_WORD 32
64 #define WORDSIZE(n) (((n)+(BITS_PER_WORD-1))/BITS_PER_WORD)
65 #define BIT(r, n) ((((r)[(n)>>5])>>((n)&31))&1)
66 #define SETBIT(r, n) ((r)[(n)>>5]|=((unsigned)1<<((n)&31)))
71 #define NUL '\0' /* the null character */
72 #define NEWLINE '\n' /* line feed */
73 #define SP ' ' /* space */
74 #define BS '\b' /* backspace */
75 #define HT '\t' /* horizontal tab */
76 #define VT '\013' /* vertical tab */
77 #define CR '\r' /* carriage return */
78 #define FF '\f' /* form feed */
79 #define QUOTE '\'' /* single quote */
80 #define DOUBLE_QUOTE '\"' /* double quote */
81 #define BACKSLASH '\\' /* backslash */
84 /* defines for constructing filenames */
86 #define CODE_SUFFIX ".code.c"
87 #define DEFINES_SUFFIX ".tab.h"
88 #define OUTPUT_SUFFIX ".tab.c"
89 #define VERBOSE_SUFFIX ".output"
111 /* the undefined value */
113 #define UNDEFINED (-1)
122 /* character macros */
124 #define IS_IDENT(c) (isalnum(c) || (c) == '_' || (c) == '.' || (c) == '$')
125 #define IS_OCTAL(c) ((c) >= '0' && (c) <= '7')
126 #define NUMERIC_VALUE(c) ((c) - '0')
131 #define ISTOKEN(s) ((s) < start_symbol)
132 #define ISVAR(s) ((s) >= start_symbol)
135 /* storage allocation macros */
137 #define CALLOC(k,n) (calloc((unsigned)(k),(unsigned)(n)))
138 #define FREE(x) (free((char*)(x)))
139 #define MALLOC(n) (malloc((unsigned)(n)))
140 #define NEW(t) ((t*)allocate(sizeof(t)))
141 #define NEW2(n,t) ((t*)allocate((unsigned)((n)*sizeof(t))))
142 #define REALLOC(p,n) (realloc((char*)(p),(unsigned)(n)))
145 /* the structure of a symbol table entry */
147 typedef struct bucket bucket;
162 /* the structure of the LR(0) state machine */
164 typedef struct core core;
170 short accessing_symbol;
176 /* the structure used to record shifts */
178 typedef struct shifts shifts;
188 /* the structure used to store reductions */
190 typedef struct reductions reductions;
193 struct reductions *next;
200 /* the structure used to represent parser actions */
202 typedef struct action action;
215 /* global variables */
226 extern char *action_file_name;
227 extern char *input_file_name;
228 extern char *prolog_file_name;
229 extern char *local_file_name;
230 extern char *verbose_file_name;
232 extern FILE *action_file;
233 extern FILE *input_file;
234 extern FILE *prolog_file;
235 extern FILE *local_file;
236 extern FILE *verbose_file;
245 extern char *line_format;
246 extern char *default_line_format;
248 extern int start_symbol;
249 extern char **symbol_name;
250 extern short *symbol_value;
251 extern short *symbol_prec;
252 extern char *symbol_assoc;
260 extern short **derives;
261 extern char *nullable;
263 extern bucket *first_symbol;
264 extern bucket *last_symbol;
267 extern core *first_state;
268 extern shifts *first_shift;
269 extern reductions *first_reduction;
270 extern short *accessing_symbol;
271 extern core **state_table;
272 extern shifts **shift_table;
273 extern reductions **reduction_table;
275 extern short *LAruleno;
276 extern short *lookaheads;
277 extern short *goto_map;
278 extern short *from_state;
279 extern short *to_state;
281 extern action **parser;
284 extern short *SRconflicts;
285 extern short *RRconflicts;
286 extern short *defred;
287 extern short *rules_used;
288 extern short nunused;
289 extern short final_state;
291 /* global functions */
293 extern char *allocate();
294 extern bucket *lookup();
295 extern bucket *make_bucket();
298 /* system variables */
303 /* system functions */
306 extern char *calloc();
307 extern char *malloc();
308 extern char *realloc();
309 extern char *strcpy();