debase-ruby_core_source 0.10.17 → 3.2.0

data/lib/debase/ruby_core_source/ruby-3.2.0-preview2/mjit_unit.h

@@ -1,29 +0,0 @@
-#ifndef MJIT_UNIT_H
-#define MJIT_UNIT_H
-
-#include "ccan/list/list.h"
-
-// The unit structure that holds metadata of ISeq for MJIT.
-struct rb_mjit_unit {
-    struct ccan_list_node unode;
-    // Unique order number of unit.
-    int id;
-    // Dlopen handle of the loaded object file.
-    void *handle;
-    rb_iseq_t *iseq;
-#if defined(_WIN32)
-    // DLL cannot be removed while loaded on Windows. If this is set, it'll be lazily deleted.
-    char *so_file;
-#endif
-    // Only used by unload_units. Flag to check this unit is currently on stack or not.
-    bool used_code_p;
-    // True if it's a unit for JIT compaction
-    bool compact_p;
-    // mjit_compile's optimization switches
-    struct rb_mjit_compile_info compile_info;
-    // captured CC values, they should be marked with iseq.
-    const struct rb_callcache **cc_entries;
-    unsigned int cc_entries_size; // ISEQ_BODY(iseq)->ci_size + ones of inlined iseqs
-};
-
-#endif /* MJIT_UNIT_H */

data/lib/debase/ruby_core_source/ruby-3.2.0-preview2/node_name.inc

@@ -1,208 +0,0 @@
-      case NODE_SCOPE:
-	return "NODE_SCOPE";
-      case NODE_BLOCK:
-	return "NODE_BLOCK";
-      case NODE_IF:
-	return "NODE_IF";
-      case NODE_UNLESS:
-	return "NODE_UNLESS";
-      case NODE_CASE:
-	return "NODE_CASE";
-      case NODE_CASE2:
-	return "NODE_CASE2";
-      case NODE_CASE3:
-	return "NODE_CASE3";
-      case NODE_WHEN:
-	return "NODE_WHEN";
-      case NODE_IN:
-	return "NODE_IN";
-      case NODE_WHILE:
-	return "NODE_WHILE";
-      case NODE_UNTIL:
-	return "NODE_UNTIL";
-      case NODE_ITER:
-	return "NODE_ITER";
-      case NODE_FOR:
-	return "NODE_FOR";
-      case NODE_FOR_MASGN:
-	return "NODE_FOR_MASGN";
-      case NODE_BREAK:
-	return "NODE_BREAK";
-      case NODE_NEXT:
-	return "NODE_NEXT";
-      case NODE_REDO:
-	return "NODE_REDO";
-      case NODE_RETRY:
-	return "NODE_RETRY";
-      case NODE_BEGIN:
-	return "NODE_BEGIN";
-      case NODE_RESCUE:
-	return "NODE_RESCUE";
-      case NODE_RESBODY:
-	return "NODE_RESBODY";
-      case NODE_ENSURE:
-	return "NODE_ENSURE";
-      case NODE_AND:
-	return "NODE_AND";
-      case NODE_OR:
-	return "NODE_OR";
-      case NODE_MASGN:
-	return "NODE_MASGN";
-      case NODE_LASGN:
-	return "NODE_LASGN";
-      case NODE_DASGN:
-	return "NODE_DASGN";
-      case NODE_GASGN:
-	return "NODE_GASGN";
-      case NODE_IASGN:
-	return "NODE_IASGN";
-      case NODE_CDECL:
-	return "NODE_CDECL";
-      case NODE_CVASGN:
-	return "NODE_CVASGN";
-      case NODE_OP_ASGN1:
-	return "NODE_OP_ASGN1";
-      case NODE_OP_ASGN2:
-	return "NODE_OP_ASGN2";
-      case NODE_OP_ASGN_AND:
-	return "NODE_OP_ASGN_AND";
-      case NODE_OP_ASGN_OR:
-	return "NODE_OP_ASGN_OR";
-      case NODE_OP_CDECL:
-	return "NODE_OP_CDECL";
-      case NODE_CALL:
-	return "NODE_CALL";
-      case NODE_OPCALL:
-	return "NODE_OPCALL";
-      case NODE_FCALL:
-	return "NODE_FCALL";
-      case NODE_VCALL:
-	return "NODE_VCALL";
-      case NODE_QCALL:
-	return "NODE_QCALL";
-      case NODE_SUPER:
-	return "NODE_SUPER";
-      case NODE_ZSUPER:
-	return "NODE_ZSUPER";
-      case NODE_LIST:
-	return "NODE_LIST";
-      case NODE_ZLIST:
-	return "NODE_ZLIST";
-      case NODE_VALUES:
-	return "NODE_VALUES";
-      case NODE_HASH:
-	return "NODE_HASH";
-      case NODE_RETURN:
-	return "NODE_RETURN";
-      case NODE_YIELD:
-	return "NODE_YIELD";
-      case NODE_LVAR:
-	return "NODE_LVAR";
-      case NODE_DVAR:
-	return "NODE_DVAR";
-      case NODE_GVAR:
-	return "NODE_GVAR";
-      case NODE_IVAR:
-	return "NODE_IVAR";
-      case NODE_CONST:
-	return "NODE_CONST";
-      case NODE_CVAR:
-	return "NODE_CVAR";
-      case NODE_NTH_REF:
-	return "NODE_NTH_REF";
-      case NODE_BACK_REF:
-	return "NODE_BACK_REF";
-      case NODE_MATCH:
-	return "NODE_MATCH";
-      case NODE_MATCH2:
-	return "NODE_MATCH2";
-      case NODE_MATCH3:
-	return "NODE_MATCH3";
-      case NODE_LIT:
-	return "NODE_LIT";
-      case NODE_STR:
-	return "NODE_STR";
-      case NODE_DSTR:
-	return "NODE_DSTR";
-      case NODE_XSTR:
-	return "NODE_XSTR";
-      case NODE_DXSTR:
-	return "NODE_DXSTR";
-      case NODE_EVSTR:
-	return "NODE_EVSTR";
-      case NODE_DREGX:
-	return "NODE_DREGX";
-      case NODE_ONCE:
-	return "NODE_ONCE";
-      case NODE_ARGS:
-	return "NODE_ARGS";
-      case NODE_ARGS_AUX:
-	return "NODE_ARGS_AUX";
-      case NODE_OPT_ARG:
-	return "NODE_OPT_ARG";
-      case NODE_KW_ARG:
-	return "NODE_KW_ARG";
-      case NODE_POSTARG:
-	return "NODE_POSTARG";
-      case NODE_ARGSCAT:
-	return "NODE_ARGSCAT";
-      case NODE_ARGSPUSH:
-	return "NODE_ARGSPUSH";
-      case NODE_SPLAT:
-	return "NODE_SPLAT";
-      case NODE_BLOCK_PASS:
-	return "NODE_BLOCK_PASS";
-      case NODE_DEFN:
-	return "NODE_DEFN";
-      case NODE_DEFS:
-	return "NODE_DEFS";
-      case NODE_ALIAS:
-	return "NODE_ALIAS";
-      case NODE_VALIAS:
-	return "NODE_VALIAS";
-      case NODE_UNDEF:
-	return "NODE_UNDEF";
-      case NODE_CLASS:
-	return "NODE_CLASS";
-      case NODE_MODULE:
-	return "NODE_MODULE";
-      case NODE_SCLASS:
-	return "NODE_SCLASS";
-      case NODE_COLON2:
-	return "NODE_COLON2";
-      case NODE_COLON3:
-	return "NODE_COLON3";
-      case NODE_DOT2:
-	return "NODE_DOT2";
-      case NODE_DOT3:
-	return "NODE_DOT3";
-      case NODE_FLIP2:
-	return "NODE_FLIP2";
-      case NODE_FLIP3:
-	return "NODE_FLIP3";
-      case NODE_SELF:
-	return "NODE_SELF";
-      case NODE_NIL:
-	return "NODE_NIL";
-      case NODE_TRUE:
-	return "NODE_TRUE";
-      case NODE_FALSE:
-	return "NODE_FALSE";
-      case NODE_ERRINFO:
-	return "NODE_ERRINFO";
-      case NODE_DEFINED:
-	return "NODE_DEFINED";
-      case NODE_POSTEXE:
-	return "NODE_POSTEXE";
-      case NODE_DSYM:
-	return "NODE_DSYM";
-      case NODE_ATTRASGN:
-	return "NODE_ATTRASGN";
-      case NODE_LAMBDA:
-	return "NODE_LAMBDA";
-      case NODE_ARYPTN:
-	return "NODE_ARYPTN";
-      case NODE_HSHPTN:
-	return "NODE_HSHPTN";
-      case NODE_FNDPTN:
-	return "NODE_FNDPTN";

data/lib/debase/ruby_core_source/ruby-3.2.0-preview2/opt_sc.inc

@@ -1,109 +0,0 @@
-/* -*- C -*- */
-
-/* This is  an auto-generated file  and is a  part of the  programming language
- * Ruby.   The person  who  created  a program  to  generate  this file  (``I''
- * hereafter) would like  to refrain from defining licensing  of this generated
- * source code.
- *
- * This file consists of many small  parts of codes copyrighted by each author,
- * not  only  the  ``I''  person.   Those  original  authors  agree  with  some
- * open-source license.  I  believe that the license we agree  is the condition
- * mentioned in  the file COPYING.  It  states "4.  You may  modify and include
- * the part of the software into any  other software ...".  But the problem is,
- * the license never makes it clear if  such modified parts still remain in the
- * same  license, or  not.   The fact  that  we agree  with  the source  code's
- * licensing terms does not automatically  define that of generated ones.  This
- * is the reason why this file is  under an unclear situation.  All what I know
- * is that above provision guarantees this file to exist.
- *
- * Please let me hesitate to declare  something about this nuanced contract.  I
- * am not in the position to take  over other authors' license to merge into my
- * one.  Changing them to (say) GPLv3 is not doable by myself.  Perhaps someday
- * it might turn  out to be okay to  say this file is under a  license.  I wish
- * the situation would become more clear in the future. */
-
-/*******************************************************************/
-/*******************************************************************/
-/*******************************************************************/
-/**
-  This file is for threaded code.
-
-  ----
-  This file is auto generated by insns2vm.rb
-  DO NOT TOUCH!
-
-  If you want to fix something, you must edit "tool/ruby_vm/views/opt_sc.inc.erb"
-  or tool/insns2vm.rb
- */
-
-#define SC_STATE_SIZE 6
-
-#define SCS_XX 1
-#define SCS_AX 2
-#define SCS_BX 3
-#define SCS_AB 4
-#define SCS_BA 5
-
-#define SC_ERROR 0xffffffff
-
-static const VALUE sc_insn_info[][SC_STATE_SIZE] = {
-#define NO_SC { SC_ERROR, SC_ERROR, SC_ERROR, SC_ERROR, SC_ERROR, SC_ERROR }
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC, NO_SC,
-    NO_SC, NO_SC,
-#undef NO_SC
-};
-
-static const VALUE sc_insn_next[] = {
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX, SCS_XX,
-    SCS_XX, SCS_XX,
-};
-
-ASSERT_VM_INSTRUCTION_SIZE(sc_insn_next);

data/lib/debase/ruby_core_source/ruby-3.2.0-preview2/optunifs.inc

@@ -1,43 +0,0 @@
-/* -*- C -*- */
-
-/* This is  an auto-generated file  and is a  part of the  programming language
- * Ruby.   The person  who  created  a program  to  generate  this file  (``I''
- * hereafter) would like  to refrain from defining licensing  of this generated
- * source code.
- *
- * This file consists of many small  parts of codes copyrighted by each author,
- * not  only  the  ``I''  person.   Those  original  authors  agree  with  some
- * open-source license.  I  believe that the license we agree  is the condition
- * mentioned in  the file COPYING.  It  states "4.  You may  modify and include
- * the part of the software into any  other software ...".  But the problem is,
- * the license never makes it clear if  such modified parts still remain in the
- * same  license, or  not.   The fact  that  we agree  with  the source  code's
- * licensing terms does not automatically  define that of generated ones.  This
- * is the reason why this file is  under an unclear situation.  All what I know
- * is that above provision guarantees this file to exist.
- *
- * Please let me hesitate to declare  something about this nuanced contract.  I
- * am not in the position to take  over other authors' license to merge into my
- * one.  Changing them to (say) GPLv3 is not doable by myself.  Perhaps someday
- * it might turn  out to be okay to  say this file is under a  license.  I wish
- * the situation would become more clear in the future. */
-
-/*******************************************************************/
-/*******************************************************************/
-/*******************************************************************/
-/**
-  This file is for threaded code.
-
-  ----
-  This file is auto generated by insns2vm.rb
-  DO NOT TOUCH!
-
-  If you want to fix something, you must edit "tool/ruby_vm/views/optunifs.inc.erb"
-  or tool/insns2vm.rb
- */
-
-/* Let .bss section automatically initialize this variable */
-/* cf. Section 6.7.8 of ISO/IEC 9899:1999 */
-static const int *const *const unified_insns_data[202];
-
-ASSERT_VM_INSTRUCTION_SIZE(unified_insns_data);

data/lib/debase/ruby_core_source/ruby-3.2.0-preview2/parse.h

@@ -1,214 +0,0 @@
-/* A Bison parser, made by GNU Bison 3.5.1.  */
-
-/* Bison interface for Yacc-like parsers in C
-
-   Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2020 Free Software Foundation,
-   Inc.
-
-   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 3 of the License, or
-   (at your option) any later version.
-
-   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 this program.  If not, see <http://www.gnu.org/licenses/>.  */
-
-/* As a special exception, you may create a larger work that contains
-   part or all of the Bison parser skeleton and distribute that work
-   under terms of your choice, so long as that work isn't itself a
-   parser generator using the skeleton or a modified version thereof
-   as a parser skeleton.  Alternatively, if you modify or redistribute
-   the parser skeleton itself, you may (at your option) remove this
-   special exception, which will cause the skeleton and the resulting
-   Bison output files to be licensed under the GNU General Public
-   License without this special exception.
-
-   This special exception was added by the Free Software Foundation in
-   version 2.2 of Bison.  */
-
-/* Undocumented macros, especially those whose name start with YY_,
-   are private implementation details.  Do not rely on them.  */
-
-#ifndef YY_YY_Y_TAB_H_INCLUDED
-# define YY_YY_Y_TAB_H_INCLUDED
-/* Debug traces.  */
-#ifndef YYDEBUG
-# define YYDEBUG 0
-#endif
-#if YYDEBUG
-extern int yydebug;
-#endif
-
-/* Token type.  */
-#ifndef YYTOKENTYPE
-# define YYTOKENTYPE
-  enum yytokentype
-  {
-    END_OF_INPUT = 0,
-    keyword_class = 258,
-    keyword_module = 259,
-    keyword_def = 260,
-    keyword_undef = 261,
-    keyword_begin = 262,
-    keyword_rescue = 263,
-    keyword_ensure = 264,
-    keyword_end = 265,
-    keyword_if = 266,
-    keyword_unless = 267,
-    keyword_then = 268,
-    keyword_elsif = 269,
-    keyword_else = 270,
-    keyword_case = 271,
-    keyword_when = 272,
-    keyword_while = 273,
-    keyword_until = 274,
-    keyword_for = 275,
-    keyword_break = 276,
-    keyword_next = 277,
-    keyword_redo = 278,
-    keyword_retry = 279,
-    keyword_in = 280,
-    keyword_do = 281,
-    keyword_do_cond = 282,
-    keyword_do_block = 283,
-    keyword_do_LAMBDA = 284,
-    keyword_return = 285,
-    keyword_yield = 286,
-    keyword_super = 287,
-    keyword_self = 288,
-    keyword_nil = 289,
-    keyword_true = 290,
-    keyword_false = 291,
-    keyword_and = 292,
-    keyword_or = 293,
-    keyword_not = 294,
-    modifier_if = 295,
-    modifier_unless = 296,
-    modifier_while = 297,
-    modifier_until = 298,
-    modifier_rescue = 299,
-    keyword_alias = 300,
-    keyword_defined = 301,
-    keyword_BEGIN = 302,
-    keyword_END = 303,
-    keyword__LINE__ = 304,
-    keyword__FILE__ = 305,
-    keyword__ENCODING__ = 306,
-    tIDENTIFIER = 307,
-    tFID = 308,
-    tGVAR = 309,
-    tIVAR = 310,
-    tCONSTANT = 311,
-    tCVAR = 312,
-    tLABEL = 313,
-    tINTEGER = 314,
-    tFLOAT = 315,
-    tRATIONAL = 316,
-    tIMAGINARY = 317,
-    tCHAR = 318,
-    tNTH_REF = 319,
-    tBACK_REF = 320,
-    tSTRING_CONTENT = 321,
-    tREGEXP_END = 322,
-    tSP = 323,
-    tUPLUS = 132,
-    tUMINUS = 133,
-    tPOW = 134,
-    tCMP = 135,
-    tEQ = 140,
-    tEQQ = 141,
-    tNEQ = 142,
-    tGEQ = 139,
-    tLEQ = 138,
-    tANDOP = 148,
-    tOROP = 149,
-    tMATCH = 143,
-    tNMATCH = 144,
-    tDOT2 = 128,
-    tDOT3 = 129,
-    tBDOT2 = 130,
-    tBDOT3 = 131,
-    tAREF = 145,
-    tASET = 146,
-    tLSHFT = 136,
-    tRSHFT = 137,
-    tANDDOT = 150,
-    tCOLON2 = 147,
-    tCOLON3 = 324,
-    tOP_ASGN = 325,
-    tASSOC = 326,
-    tLPAREN = 327,
-    tLPAREN_ARG = 328,
-    tRPAREN = 329,
-    tLBRACK = 330,
-    tLBRACE = 331,
-    tLBRACE_ARG = 332,
-    tSTAR = 333,
-    tDSTAR = 334,
-    tAMPER = 335,
-    tLAMBDA = 336,
-    tSYMBEG = 337,
-    tSTRING_BEG = 338,
-    tXSTRING_BEG = 339,
-    tREGEXP_BEG = 340,
-    tWORDS_BEG = 341,
-    tQWORDS_BEG = 342,
-    tSYMBOLS_BEG = 343,
-    tQSYMBOLS_BEG = 344,
-    tSTRING_END = 345,
-    tSTRING_DEND = 346,
-    tSTRING_DBEG = 347,
-    tSTRING_DVAR = 348,
-    tLAMBEG = 349,
-    tLABEL_END = 350,
-    tLOWEST = 351,
-    tUMINUS_NUM = 352,
-    tLAST_TOKEN = 353
-  };
-#endif
-
-/* Value type.  */
-#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
-union YYSTYPE
-{
-
-    VALUE val;
-    NODE *node;
-    ID id;
-    int num;
-    st_table *tbl;
-    const struct vtable *vars;
-    struct rb_strterm_struct *strterm;
-    struct lex_context ctxt;
-
-
-};
-typedef union YYSTYPE YYSTYPE;
-# define YYSTYPE_IS_TRIVIAL 1
-# define YYSTYPE_IS_DECLARED 1
-#endif
-
-/* Location type.  */
-#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
-typedef struct YYLTYPE YYLTYPE;
-struct YYLTYPE
-{
-  int first_line;
-  int first_column;
-  int last_line;
-  int last_column;
-};
-# define YYLTYPE_IS_DECLARED 1
-# define YYLTYPE_IS_TRIVIAL 1
-#endif
-
-
-
-int yyparse (struct parser_params *p);
-
-#endif /* !YY_YY_Y_TAB_H_INCLUDED  */