Canola
0.8.D001
|
00001 /* A Bison parser, made by GNU Bison 2.5. */ 00002 00003 /* Bison interface for Yacc-like parsers in C 00004 00005 Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc. 00006 00007 This program is free software: you can redistribute it and/or modify 00008 it under the terms of the GNU General Public License as published by 00009 the Free Software Foundation, either version 3 of the License, or 00010 (at your option) any later version. 00011 00012 This program is distributed in the hope that it will be useful, 00013 but WITHOUT ANY WARRANTY; without even the implied warranty of 00014 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00015 GNU General Public License for more details. 00016 00017 You should have received a copy of the GNU General Public License 00018 along with this program. If not, see <http://www.gnu.org/licenses/>. */ 00019 00020 /* As a special exception, you may create a larger work that contains 00021 part or all of the Bison parser skeleton and distribute that work 00022 under terms of your choice, so long as that work isn't itself a 00023 parser generator using the skeleton or a modified version thereof 00024 as a parser skeleton. Alternatively, if you modify or redistribute 00025 the parser skeleton itself, you may (at your option) remove this 00026 special exception, which will cause the skeleton and the resulting 00027 Bison output files to be licensed under the GNU General Public 00028 License without this special exception. 00029 00030 This special exception was added by the Free Software Foundation in 00031 version 2.2 of Bison. */ 00032 00033 00034 /* Tokens. */ 00035 #ifndef grammar_TOKENTYPE 00036 # define grammar_TOKENTYPE 00037 /* Put the tokens into the symbol table, so that GDB and other debuggers 00038 know about them. */ 00039 enum grammar_tokentype { 00040 DIV = 258, 00041 EOLN = 259, 00042 EQ = 260, 00043 GE = 261, 00044 GT = 262, 00045 JUNK = 263, 00046 LE = 264, 00047 LP = 265, 00048 LT = 266, 00049 MINUS = 267, 00050 MOD = 268, 00051 MUL = 269, 00052 NE = 270, 00053 NUMBER = 271, 00054 PLUS = 272, 00055 RP = 273, 00056 unary = 274 00057 }; 00058 #endif 00059 /* Tokens. */ 00060 #define DIV 258 00061 #define EOLN 259 00062 #define EQ 260 00063 #define GE 261 00064 #define GT 262 00065 #define JUNK 263 00066 #define LE 264 00067 #define LP 265 00068 #define LT 266 00069 #define MINUS 267 00070 #define MOD 268 00071 #define MUL 269 00072 #define NE 270 00073 #define NUMBER 271 00074 #define PLUS 272 00075 #define RP 273 00076 #define unary 274 00077 00078 00079 00080 00081 #if ! defined grammar_STYPE && ! defined grammar_STYPE_IS_DECLARED 00082 typedef union grammar_STYPE 00083 { 00084 00085 /* Line 2068 of yacc.c */ 00086 #line 55 "test_number_z/grammar.y" 00087 00088 number_z *lv_number; 00089 00090 00091 00092 /* Line 2068 of yacc.c */ 00093 #line 94 "y.tab.h" 00094 } grammar_STYPE; 00095 # define grammar_STYPE_IS_TRIVIAL 1 00096 # define grammar_stype grammar_STYPE /* obsolescent; will be withdrawn */ 00097 # define grammar_STYPE_IS_DECLARED 1 00098 #endif 00099 00100 extern grammar_STYPE grammar_lval; 00101 00102