/* Data definitions for internal representation of Bison's input.
- Copyright (C) 1984, 1986, 1989, 1992, 2001, 2002
- Free Software Foundation, Inc.
+ Copyright (C) 1984, 1986, 1989, 1992, 2001, 2002, 2003, 2004, 2005, 2006
+ 2007 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
- Bison is free software; you can redistribute it and/or modify
+ This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2, or (at your option)
- any later version.
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
- Bison is distributed in the hope that it will be useful,
+ This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
- along with Bison; see the file COPYING. If not, write to
- the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
- Boston, MA 02111-1307, USA. */
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifndef GRAM_H_
# define GRAM_H_
# include "location.h"
# include "symtab.h"
-# define ISTOKEN(s) ((s) < ntokens)
-# define ISVAR(s) ((s) >= ntokens)
+# define ISTOKEN(i) ((i) < ntokens)
+# define ISVAR(i) ((i) >= ntokens)
extern int nsyms;
extern int ntokens;
extern int nvars;
typedef int item_number;
+#define ITEM_NUMBER_MAX INT_MAX
extern item_number *ritem;
extern unsigned int nritems;
sometimes have to perform the converse transformation. */
static inline item_number
-symbol_number_as_item_number (symbol_number s)
+symbol_number_as_item_number (symbol_number sym)
{
- return s;
+ return sym;
}
static inline symbol_number
return i;
}
-extern symbol_number start_symbol;
+static inline bool
+item_number_is_symbol_number (item_number i)
+{
+ return i >= 0;
+}
/* Rule numbers. */
-typedef short rule_number;
+typedef int rule_number;
+#define RULE_NUMBER_MAX INT_MAX
extern rule_number nrules;
static inline item_number
return -1 - i;
}
+static inline bool
+item_number_is_rule_number (item_number i)
+{
+ return i < 0;
+}
/*--------.
| Rules. |
/* This symbol provides both the associativity, and the precedence. */
symbol *prec;
- short dprec;
- short merger;
+ int dprec;
+ int merger;
/* This symbol was attached to the rule via %prec. */
symbol *precsym;
already displayed (by a previous call for another rule), avoid
useless repetitions. */
void rule_lhs_print (rule *r, symbol *previous_lhs, FILE *out);
+void rule_lhs_print_xml (rule *r, FILE *out, int level);
/* Return the length of the RHS. */
int rule_rhs_length (rule *r);
-/* GLR_PARSER is nonzero if the input file says to use the GLR
- (Generalized LR) parser, and to output some additional
- information used by the GLR algorithm. */
-
-extern int glr_parser;
-
-/* PURE_PARSER is nonzero if should generate a parser that is all pure
- and reentrant. */
-
-extern int pure_parser;
-
/* Dump RITEM for traces. */
void ritem_print (FILE *out);
(exclusive) on OUT under TITLE. */
void grammar_rules_partial_print (FILE *out, const char *title,
rule_filter filter);
+void grammar_rules_partial_print_xml (FILE *out, int level, bool rtag,
+ rule_filter filter);
/* Print the grammar's rules on OUT. */
void grammar_rules_print (FILE *out);
+void grammar_rules_print_xml (FILE *out, int level);
/* Dump the grammar. */
void grammar_dump (FILE *out, const char *title);