rubinius-melbourne 1.0.0.8

data/ext/rubinius/melbourne/lex.c.tab

@@ -0,0 +1,136 @@
+/* C code produced by gperf version 2.7.2 */
+/* Command-line: gperf -p -j1 -i 1 -g -o -t -N rb_reserved_word -k'1,3,$' ./keywords  */
+struct kwtable {
+  int id[2];
+  enum lex_state_e state;
+  char name[16];
+};
+
+#define TOTAL_KEYWORDS 40
+#define MIN_WORD_LENGTH 2
+#define MAX_WORD_LENGTH 8
+#define MIN_HASH_VALUE 6
+#define MAX_HASH_VALUE 55
+/* maximum key range = 50, duplicates = 0 */
+
+#ifdef __GNUC__
+__inline
+#else
+#ifdef __cplusplus
+inline
+#endif
+#endif
+static unsigned int
+hash (register const char *str, register unsigned int len)
+{
+  static const unsigned char asso_values[] =
+    {
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 11, 56, 56, 36, 56,  1, 37,
+      31,  1, 56, 56, 56, 56, 29, 56,  1, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56,  1, 56, 32,  1,  2,
+       1,  1,  4, 23, 56, 17, 56, 20,  9,  2,
+       9, 26, 14, 56,  5,  1,  1, 16, 56, 21,
+      20,  9, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56, 56, 56, 56, 56,
+      56, 56, 56, 56, 56, 56
+    };
+  register int hval = len;
+
+  switch (hval)
+    {
+      default:
+      case 3:
+        hval += asso_values[(unsigned char)str[2]];
+      case 2:
+      case 1:
+        hval += asso_values[(unsigned char)str[0]];
+        break;
+    }
+  return hval + asso_values[(unsigned char)str[len - 1]];
+}
+
+#ifdef __GNUC__
+__inline
+#endif
+const struct kwtable *
+mel_reserved_word (register const char *str, register unsigned int len)
+{
+  static const struct kwtable wordlist[] =
+    {
+      {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}},
+      {{kEND, kEND}, EXPR_END, "end"},
+      {{kELSE, kELSE}, EXPR_BEG, "else"},
+      {{kCASE, kCASE}, EXPR_BEG, "case"},
+      {{kENSURE, kENSURE}, EXPR_BEG, "ensure"},
+      {{kMODULE, kMODULE}, EXPR_BEG, "module"},
+      {{kELSIF, kELSIF}, EXPR_BEG, "elsif"},
+      {{kDEF, kDEF}, EXPR_FNAME, "def"},
+      {{kRESCUE, kRESCUE_MOD}, EXPR_MID, "rescue"},
+      {{kNOT, kNOT}, EXPR_BEG, "not"},
+      {{kTHEN, kTHEN}, EXPR_BEG, "then"},
+      {{kYIELD, kYIELD}, EXPR_ARG, "yield"},
+      {{kFOR, kFOR}, EXPR_BEG, "for"},
+      {{kSELF, kSELF}, EXPR_END, "self"},
+      {{kFALSE, kFALSE}, EXPR_END, "false"},
+      {{kRETRY, kRETRY}, EXPR_END, "retry"},
+      {{kRETURN, kRETURN}, EXPR_MID, "return"},
+      {{kTRUE, kTRUE}, EXPR_END, "true"},
+      {{kIF, kIF_MOD}, EXPR_BEG, "if"},
+      {{kDEFINED, kDEFINED}, EXPR_ARG, "defined?"},
+      {{kSUPER, kSUPER}, EXPR_ARG, "super"},
+      {{kUNDEF, kUNDEF}, EXPR_FNAME, "undef"},
+      {{kBREAK, kBREAK}, EXPR_MID, "break"},
+      {{kIN, kIN}, EXPR_BEG, "in"},
+      {{kDO, kDO}, EXPR_BEG, "do"},
+      {{kNIL, kNIL}, EXPR_END, "nil"},
+      {{kUNTIL, kUNTIL_MOD}, EXPR_BEG, "until"},
+      {{kUNLESS, kUNLESS_MOD}, EXPR_BEG, "unless"},
+      {{kOR, kOR}, EXPR_BEG, "or"},
+      {{kNEXT, kNEXT}, EXPR_MID, "next"},
+      {{kWHEN, kWHEN}, EXPR_BEG, "when"},
+      {{kREDO, kREDO}, EXPR_END, "redo"},
+      {{kAND, kAND}, EXPR_BEG, "and"},
+      {{kBEGIN, kBEGIN}, EXPR_BEG, "begin"},
+      {{k__LINE__, k__LINE__}, EXPR_END, "__LINE__"},
+      {{kCLASS, kCLASS}, EXPR_CLASS, "class"},
+      {{k__FILE__, k__FILE__}, EXPR_END, "__FILE__"},
+      {{klEND, klEND}, EXPR_END, "END"},
+      {{klBEGIN, klBEGIN}, EXPR_END, "BEGIN"},
+      {{kWHILE, kWHILE_MOD}, EXPR_BEG, "while"},
+      {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}},
+      {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}}, {{0, 0}},
+      {{kALIAS, kALIAS}, EXPR_FNAME, "alias"}
+    };
+
+  if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
+    {
+      register int key = hash (str, len);
+
+      if (key <= MAX_HASH_VALUE && key >= 0)
+        {
+          register const char *s = wordlist[key].name;
+
+          if (*str == *s && !strcmp (str + 1, s + 1))
+            return &wordlist[key];
+        }
+    }
+  return 0;
+}

data/ext/rubinius/melbourne/local_state.hpp

@@ -0,0 +1,41 @@
+#ifndef MEL_LOCALSTATE_HPP
+#define MEL_LOCALSTATE_HPP
+
+#include "var_table.hpp"
+
+namespace MELBOURNE {
+  struct LocalState {
+    LocalState* prev;
+    var_table local_vars;
+    var_table block_vars;
+
+    LocalState(LocalState* prev)
+      : prev(prev)
+      , local_vars(var_table_create())
+      , block_vars(0)
+    {}
+
+    ~LocalState() {
+      var_table_destroy(local_vars);
+      if(block_vars) {
+        var_table_destroy(block_vars);
+      }
+    }
+
+    bool blocks_p() {
+      return block_vars != NULL;
+    }
+
+    static LocalState* push(LocalState* cur) {
+      return new LocalState(cur);
+    }
+
+    static LocalState* pop(LocalState* cur) {
+      LocalState* tmp = cur->prev;
+      delete cur;
+      return tmp;
+    }
+  };
+};
+
+#endif

data/ext/rubinius/melbourne/melbourne.cpp

@@ -0,0 +1,60 @@
+#include "namespace.h"
+#include "melbourne.hpp"
+#include "grammar.hpp"
+#include "symbols.hpp"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+VALUE MELBOURNE_STRING_TO_AST(VALUE self, VALUE source, VALUE name, VALUE line) {
+  StringValue(source);
+  StringValue(name);
+  bstring b_str = blk2bstr(RSTRING_PTR(source), (int)RSTRING_LEN(source));
+  VALUE result = MELBOURNE::string_to_ast(self,
+      RSTRING_PTR(name), b_str, FIX2INT(line));
+  bdestroy(b_str);
+
+  return result;
+}
+
+VALUE MELBOURNE_FILE_TO_AST(VALUE self, VALUE fname, VALUE start) {
+  StringValue(fname);
+
+  char* c_name = RSTRING_PTR(fname);
+
+  FILE *file = fopen(c_name, "r");
+  if(file) {
+    VALUE result = MELBOURNE::file_to_ast(self,
+        RSTRING_PTR(fname), file, FIX2INT(start));
+    fclose(file);
+
+    return result;
+  } else {
+    rb_raise(rb_eLoadError, "%s -- %s", strerror(errno), c_name);
+    return Qnil;
+  }
+}
+
+void Init_melbourne(void) {
+  VALUE rb_cMelbourne, rb_mToolSet, rb_mTScurrent, rb_mTS;
+
+  MELBOURNE::init_symbols();
+
+#ifndef RUBINIUS
+  VALUE rb_mRubinius = rb_const_get(rb_cObject, rb_intern("Rubinius"));
+#endif
+
+  rb_mToolSet = rb_const_get(rb_mRubinius, rb_intern("ToolSet"));
+  rb_mTScurrent = rb_funcall(rb_mToolSet, rb_intern("current"), 0);
+  rb_mTS = rb_define_module_under(rb_mTScurrent, "TS");
+  rb_cMelbourne = rb_define_class_under(rb_mTS, "Melbourne", rb_cObject);
+  rb_define_method(rb_cMelbourne, "string_to_ast",
+      RUBY_METHOD_FUNC(MELBOURNE_STRING_TO_AST), 3);
+  rb_define_method(rb_cMelbourne, "file_to_ast",
+      RUBY_METHOD_FUNC(MELBOURNE_FILE_TO_AST), 2);
+}
+
+#ifdef __cplusplus
+}  /* extern "C" { */
+#endif

data/ext/rubinius/melbourne/melbourne.hpp

@@ -0,0 +1,19 @@
+#include <stdio.h>
+#include <errno.h>
+#include <ctype.h>
+#include <string.h>
+#include <strings.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include <assert.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <fcntl.h>
+#include <sys/types.h>
+#ifdef HAVE_ALLOCA_H
+#include <alloca.h>
+#endif
+
+#define RSTRING_NOT_MODIFIED 1
+
+#include "ruby.h"

data/ext/rubinius/melbourne/node.hpp

@@ -0,0 +1,261 @@
+/**********************************************************************
+
+  node.h -
+
+  $Author: nobu $
+  $Date: 2004/10/02 11:34:29 $
+  created at: Fri May 28 15:14:02 JST 1993
+
+  Copyright (C) 1993-2003 Yukihiro Matsumoto
+
+**********************************************************************/
+
+#ifndef MEL_NODE_HPP
+#define MEL_NODE_HPP
+
+#include "namespace.h"
+#include "bstrlib.h"
+#include "melbourne.hpp"
+#include "quark.hpp"
+
+namespace MELBOURNE {
+
+#define QUID    quark
+
+  typedef struct RNode {
+    unsigned long flags;
+    char *nd_file;
+    union {
+      RNode *node;
+      QUID id;
+      VALUE value;
+      QUID *tbl;
+      bstring string;
+    } u1;
+    union {
+      struct RNode *node;
+      QUID id;
+      long argc;
+      VALUE value;
+    } u2;
+    union {
+      struct RNode *node;
+      QUID id;
+      long state;
+      long cnt;
+      VALUE value;
+      bstring string;
+    } u3;
+  } NODE;
+
+#define RNODE(obj)  ((NODE*)(obj))
+
+#ifndef FL_USHIFT
+#define FL_USHIFT 11
+#endif
+
+#define FL_UMASK (0xff<<FL_USHIFT)
+
+#define nd_type(n) ((int)(((RNODE(n))->flags>>FL_USHIFT)&0xff))
+#define nd_set_type(n,t) \
+    RNODE(n)->flags=((RNODE(n)->flags&~FL_UMASK)|(((t)<<FL_USHIFT)&FL_UMASK))
+
+#define NODE_LSHIFT (FL_USHIFT+8)
+#define NODE_LMASK  (((long)1<<(sizeof(NODE*)*CHAR_BIT-NODE_LSHIFT))-1)
+#define nd_line(n) ((unsigned int)(((RNODE(n))->flags>>NODE_LSHIFT)&NODE_LMASK))
+#define nd_set_line(n,l) \
+    RNODE(n)->flags=((RNODE(n)->flags&~(-1<<NODE_LSHIFT))|(((l)&NODE_LMASK)<<NODE_LSHIFT))
+
+#define nd_head  u1.node
+#define nd_alen  u2.argc
+#define nd_next  u3.node
+
+#define nd_cond  u1.node
+#define nd_body  u2.node
+#define nd_else  u3.node
+
+#define nd_orig  u3.string
+
+#define nd_resq  u2.node
+#define nd_ensr  u3.node
+
+#define nd_1st   u1.node
+#define nd_2nd   u2.node
+
+#define nd_stts  u1.node
+
+#define nd_entry u3.entry
+#define nd_vid   u1.id
+#define nd_cflag u2.id
+#define nd_cval  u3.value
+
+#define nd_cnt   u3.cnt
+#define nd_tbl   u1.tbl
+
+#define nd_var   u1.node
+#define nd_ibdy  u2.node
+#define nd_iter  u3.node
+
+#define nd_value u2.node
+#define nd_aid   u3.id
+
+#define nd_str   u1.string
+#define nd_lit   u1.value
+
+#define nd_frml  u1.node
+#define nd_rest  u2.argc
+#define nd_opt   u1.node
+#define nd_pid   u1.id
+#define nd_plen  u2.argc
+
+#define nd_recv  u1.node
+#define nd_mid   u2.id
+#define nd_args  u3.node
+
+#define nd_noex  u1.id
+#define nd_defn  u3.node
+
+#define nd_old   u1.id
+#define nd_new   u2.id
+
+#define nd_cfnc  u1.cfunc
+#define nd_argc  u2.argc
+
+#define nd_cpath u1.node
+#define nd_super u3.node
+
+#define nd_modl  u1.id
+#define nd_clss  u1.value
+
+#define nd_beg   u1.node
+#define nd_end   u2.node
+#define nd_state u3.state
+#define nd_rval  u2.value
+
+#define nd_nth   u2.argc
+
+#define nd_tag   u1.id
+#define nd_tval  u2.value
+
+#define NEW_NODE(t,a0,a1,a2)    node_newnode((t),(VALUE)(a0),(VALUE)(a1),(VALUE)(a2))
+
+#define NEW_METHOD(n,x)         NEW_NODE(NODE_METHOD,x,n,0)
+#define NEW_FBODY(n,i,o)        NEW_NODE(NODE_FBODY,n,i,o)
+#define NEW_DEFN(i,a,d,p)       NEW_NODE(NODE_DEFN,p,i,NEW_RFUNC(a,d))
+#define NEW_DEFS(r,i,a,d)       NEW_NODE(NODE_DEFS,r,i,NEW_RFUNC(a,d))
+#define NEW_RFUNC(b1,b2)        NEW_SCOPE(block_append(vps, b1,b2))
+#define NEW_SCOPE(b)            NEW_NODE(NODE_SCOPE,mel_local_tbl(vps),0,(b))
+#define NEW_BLOCK(a)            NEW_NODE(NODE_BLOCK,a,0,0)
+#define NEW_IF(c,t,e)           NEW_NODE(NODE_IF,c,t,e)
+#define NEW_UNLESS(c,t,e)       NEW_IF(c,e,t)
+#define NEW_CASE(h,b)           NEW_NODE(NODE_CASE,h,b,0)
+#define NEW_WHEN(c,t,e)         NEW_NODE(NODE_WHEN,c,t,e)
+#define NEW_OPT_N(b)            NEW_NODE(NODE_OPT_N,0,b,0)
+#define NEW_WHILE(c,b,n)        NEW_NODE(NODE_WHILE,c,b,n)
+#define NEW_UNTIL(c,b,n)        NEW_NODE(NODE_UNTIL,c,b,n)
+#define NEW_FOR(v,i,b)          NEW_NODE(NODE_FOR,v,b,i)
+#define NEW_ITER(v,i,b)         NEW_NODE(NODE_ITER,v,b,i)
+#define NEW_BREAK(s)            NEW_NODE(NODE_BREAK,s,0,0)
+#define NEW_NEXT(s)             NEW_NODE(NODE_NEXT,s,0,0)
+#define NEW_REDO()              NEW_NODE(NODE_REDO,0,0,0)
+#define NEW_RETRY()             NEW_NODE(NODE_RETRY,0,0,0)
+#define NEW_BEGIN(b)            NEW_NODE(NODE_BEGIN,0,b,0)
+#define NEW_RESCUE(b,res,e)     NEW_NODE(NODE_RESCUE,b,res,e)
+#define NEW_RESBODY(a,ex,n)     NEW_NODE(NODE_RESBODY,n,ex,a)
+#define NEW_ENSURE(b,en)        NEW_NODE(NODE_ENSURE,b,0,en)
+#define NEW_RETURN(s)           NEW_NODE(NODE_RETURN,s,0,0)
+#define NEW_YIELD(a,s)          NEW_NODE(NODE_YIELD,a,0,s)
+#define NEW_LIST(a)             NEW_ARRAY(a)
+#define NEW_ARRAY(a)            NEW_NODE(NODE_ARRAY,a,1,0)
+#define NEW_ZARRAY()            NEW_NODE(NODE_ZARRAY,0,0,0)
+#define NEW_HASH(a)             NEW_NODE(NODE_HASH,a,0,0)
+#define NEW_POSITIONAL(a)       NEW_NODE(NODE_HASH,a,1,0)
+#define NEW_NOT(a)              NEW_NODE(NODE_NOT,0,a,0)
+#define NEW_MASGN(l,r)          NEW_NODE(NODE_MASGN,l,0,r)
+#define NEW_GASGN(v,val)        NEW_NODE(NODE_GASGN,v,val,0)
+#define NEW_LASGN(v,val)        NEW_NODE(NODE_LASGN,v,val,local_cnt(v))
+#define NEW_DASGN(v,val)        NEW_NODE(NODE_DASGN,v,val,0)
+#define NEW_DASGN_CURR(v,val)   NEW_NODE(NODE_DASGN_CURR,v,val,0)
+#define NEW_IASGN(v,val)        NEW_NODE(NODE_IASGN,v,val,0)
+#define NEW_CDECL(v,val,path)   NEW_NODE(NODE_CDECL,v,val,path)
+#define NEW_CVASGN(v,val)       NEW_NODE(NODE_CVASGN,v,val,0)
+#define NEW_CVDECL(v,val)       NEW_NODE(NODE_CVDECL,v,val,0)
+#define NEW_OP_ASGN1(p,id,a)    NEW_NODE(NODE_OP_ASGN1,p,id,a)
+#define NEW_OP_ASGN2(r,i,o,val) NEW_NODE(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o))
+#define NEW_OP_ASGN22(i,o)      NEW_NODE(NODE_OP_ASGN2,i,o,rb_id_attrset((rb_parser_state*) parser_state, i))
+#define NEW_OP_ASGN_OR(i,val)   NEW_NODE(NODE_OP_ASGN_OR,i,val,0)
+#define NEW_OP_ASGN_AND(i,val)  NEW_NODE(NODE_OP_ASGN_AND,i,val,0)
+#define NEW_GVAR(v)             NEW_NODE(NODE_GVAR,v,0,0)
+#define NEW_LVAR(v)             NEW_NODE(NODE_LVAR,v,0,local_cnt(v))
+#define NEW_DVAR(v)             NEW_NODE(NODE_DVAR,v,0,0)
+#define NEW_IVAR(v)             NEW_NODE(NODE_IVAR,v,0,0)
+#define NEW_CONST(v)            NEW_NODE(NODE_CONST,v,0,0)
+#define NEW_CVAR(v)             NEW_NODE(NODE_CVAR,v,0,0)
+#define NEW_NTH_REF(n)          NEW_NODE(NODE_NTH_REF,0,n,local_cnt('~'))
+#define NEW_BACK_REF(n)         NEW_NODE(NODE_BACK_REF,0,n,local_cnt('~'))
+#define NEW_MATCH(c)            NEW_NODE(NODE_MATCH,c,0,0)
+#define NEW_MATCH2(n1,n2)       NEW_NODE(NODE_MATCH2,n1,n2,0)
+#define NEW_MATCH3(r,n2)        NEW_NODE(NODE_MATCH3,r,n2,0)
+#define NEW_LIT(l)              NEW_NODE(NODE_LIT,l,0,0)
+#define NEW_STR(s)              NEW_NODE(NODE_STR,s,0,0)
+#define NEW_DSTR(s)             NEW_NODE(NODE_DSTR,s,1,0)
+#define NEW_XSTR(s)             NEW_NODE(NODE_XSTR,s,0,0)
+#define NEW_DXSTR(s)            NEW_NODE(NODE_DXSTR,s,0,0)
+#define NEW_DSYM(s)             NEW_NODE(NODE_DSYM,s,0,0)
+#define NEW_EVSTR(n)            NEW_NODE(NODE_EVSTR,0,(n),0)
+#define NEW_CALL(r,m,a)         NEW_NODE(NODE_CALL,r,m,a)
+#define NEW_FCALL(m,a)          NEW_NODE(NODE_FCALL,0,m,a)
+#define NEW_VCALL(m)            NEW_NODE(NODE_VCALL,0,m,0)
+#define NEW_SUPER(a)            NEW_NODE(NODE_SUPER,0,0,a)
+#define NEW_ZSUPER()            NEW_NODE(NODE_ZSUPER,0,0,0)
+#define NEW_ARGS(f,o,r)         NEW_NODE(NODE_ARGS,o,r,f)
+#define NEW_ARGSCAT(a,b)        NEW_NODE(NODE_ARGSCAT,a,b,0)
+#define NEW_ARGSPUSH(a,b)       NEW_NODE(NODE_ARGSPUSH,a,b,0)
+#define NEW_SPLAT(a)            NEW_NODE(NODE_SPLAT,a,0,0)
+#define NEW_TO_ARY(a)           NEW_NODE(NODE_TO_ARY,a,0,0)
+#define NEW_SVALUE(a)           NEW_NODE(NODE_SVALUE,a,0,0)
+#define NEW_BLOCK_ARG(v)        NEW_NODE(NODE_BLOCK_ARG,v,0,local_cnt(v))
+#define NEW_BLOCK_PASS(b)       NEW_NODE(NODE_BLOCK_PASS,0,b,0)
+#define NEW_ALIAS(n,o)          NEW_NODE(NODE_ALIAS,o,n,0)
+#define NEW_VALIAS(n,o)         NEW_NODE(NODE_VALIAS,o,n,0)
+#define NEW_UNDEF(i)            NEW_NODE(NODE_UNDEF,0,i,0)
+#define NEW_CLASS(n,b,s)        NEW_NODE(NODE_CLASS,n,NEW_SCOPE(b),(s))
+#define NEW_SCLASS(r,b)         NEW_NODE(NODE_SCLASS,r,NEW_SCOPE(b),0)
+#define NEW_MODULE(n,b)         NEW_NODE(NODE_MODULE,n,NEW_SCOPE(b),0)
+#define NEW_COLON2(c,i)         NEW_NODE(NODE_COLON2,c,i,0)
+#define NEW_COLON3(i)           NEW_NODE(NODE_COLON3,0,i,0)
+#define NEW_CREF(c)             (NEW_NODE(NODE_CREF,0,0,c))
+#define NEW_DOT2(b,e)           NEW_NODE(NODE_DOT2,b,e,0)
+#define NEW_DOT3(b,e)           NEW_NODE(NODE_DOT3,b,e,0)
+#define NEW_ATTRSET(a)          NEW_NODE(NODE_ATTRSET,a,0,0)
+#define NEW_SELF()              NEW_NODE(NODE_SELF,0,0,0)
+#define NEW_NIL()               NEW_NODE(NODE_NIL,0,0,0)
+#define NEW_TRUE()              NEW_NODE(NODE_TRUE,0,0,0)
+#define NEW_FALSE()             NEW_NODE(NODE_FALSE,0,0,0)
+#define NEW_DEFINED(e)          NEW_NODE(NODE_DEFINED,e,0,0)
+#define NEW_NEWLINE(n)          NEW_NODE(NODE_NEWLINE,0,0,n)
+#define NEW_PREEXE(b)           NEW_NODE(NODE_PREEXE,0,0,0)
+#define NEW_POSTEXE()           NEW_NODE(NODE_POSTEXE,0,0,0)
+#define NEW_DMETHOD(b)          NEW_NODE(NODE_DMETHOD,0,0,b)
+#define NEW_BMETHOD(b)          NEW_NODE(NODE_BMETHOD,0,0,b)
+#define NEW_ATTRASGN(r,m,a)     NEW_NODE(NODE_ATTRASGN,r,m,a)
+#define NEW_FIXNUM(l)           NEW_NODE(NODE_FIXNUM,0,0,l)
+#define NEW_NUMBER(l)           NEW_NODE(NODE_NUMBER,l,0,0)
+#define NEW_HEXNUM(l)           NEW_NODE(NODE_HEXNUM,l,0,0)
+#define NEW_OCTNUM(l)           NEW_NODE(NODE_OCTNUM,l,0,0)
+#define NEW_BINNUM(l)           NEW_NODE(NODE_BINNUM,l,0,0)
+#define NEW_FLOAT(l)            NEW_NODE(NODE_FLOAT,l,0,0)
+#define NEW_NEGATE(l)           NEW_NODE(NODE_NEGATE,l,0,0)
+#define NEW_REGEX(l,o)          NEW_NODE(NODE_REGEX,l,0,o)
+#define NEW_FILE()              NEW_NODE(NODE_FILE,0,0,0)
+#define NOEX_PUBLIC             0
+#define NOEX_NOSUPER            1
+#define NOEX_PRIVATE            2
+#define NOEX_PROTECTED          4
+#define NOEX_MASK               6
+
+#define NOEX_UNDEF              NOEX_NOSUPER
+
+};
+
+#endif