ParseTreeReloaded 0.0.1

data/GPL.txt

@@ -0,0 +1,342 @@
+The GNU General Public License (GPL)
+Version 2, June 1991
+
+Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+
+59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Everyone is permitted to copy and distribute verbatim copies
+of this license document, but changing it is not allowed.
+
+Preamble
+
+The licenses for most software are designed to take away your
+freedom to share and change it. By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users. This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it. (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.) You can apply it to
+your programs, too.
+
+When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have. You must make sure that they, too, receive or can get the
+source code. And you must show them these terms so they know their
+rights.
+
+We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software. If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+Finally, any free program is threatened constantly by software
+patents. We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary. To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+The precise terms and conditions for copying, distribution and
+modification follow.
+
+TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License. The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language. (Hereinafter, translation is included without limitation in
+the term "modification".) Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope. The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License. (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole. If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works. But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code. (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it. For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable. However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License. Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+5. You are not required to accept this License, since you have not
+signed it. However, nothing else grants you permission to modify or
+distribute the Program or its derivative works. These actions are
+prohibited by law if you do not accept this License. Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions. You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all. For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices. Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded. In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number. If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation. If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission. For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this. Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+NO WARRANTY
+
+11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+END OF TERMS AND CONDITIONS
+
+How to Apply These Terms to Your New Programs
+
+If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    One line to give the program's name and a brief idea of what it does.
+
+    Copyright (C) <year> <name of author>
+
+    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 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, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary. Here is a sample; alter the names:
+
+    Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+    `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+    signature of Ty Coon, 1 April 1989
+
+    Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs. If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library. If this is what you want to do, use the GNU Library General
+Public License instead of this License.

data/lib/parse_tree_reloaded.rb

@@ -0,0 +1,372 @@
+# Copyright (C) 2007 Richard Musiol
+#
+# 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 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, write to the Free Software
+# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+require 'inline_acceleration'
+require 'sexp'
+
+class ParseTree
+  inline do |builder|
+    builder.include('"ruby.h"')
+    builder.include('"st.h"')
+    builder.include('"node.h"')
+    builder.include('"env.h"')
+    
+    builder.prefix <<-CODE_END
+      #define nd_3rd  u3.node
+      #define nd_u1id u1.id
+      #define nd_u2id u2.id
+      
+      struct BLOCK {
+        NODE *var;
+        NODE *body;
+        VALUE self;
+        struct FRAME frame;
+        struct SCOPE *scope;
+        VALUE klass;
+        NODE *cref;
+        int iter;
+        int vmode;
+        int flags;
+        int uniq;
+        struct RVarmap *dyna_vars;
+        VALUE orig_thread;
+        VALUE wrapper;
+        VALUE block_obj;
+        struct BLOCK *outer;
+        struct BLOCK *prev;
+      };
+    CODE_END
+    
+    builder.link_function('NODE *',           'rb_compile_string',  ['char *', 'VALUE', 'int'])
+    builder.link_function('ID',               'rb_to_id',           ['VALUE'])
+    builder.link_function('struct RClass *',  'RCLASS',             ['VALUE'])
+    builder.link_function('NODE *',           'RNODE',              ['long'])
+    builder.link_function('int',              'st_lookup',          ['st_table *', 'st_data_t', 'st_data_t *']);
+    builder.link_function('int',              'nd_type',            ['NODE *']);
+    builder.link_function('int',              'nd_line',            ['NODE *']);
+    builder.link_function('VALUE',            'ID2SYM',             ['ID']);
+    builder.link_function('NODE *',           'NEW_SELF',           []);
+    builder.link_function('void *',           'DATA_PTR',           ['VALUE']);
+        
+    builder.link_fields('struct RClass', {'m_tbl' => 'st_table *'})
+    builder.link_fields('struct BLOCK',  {'var' => 'NODE *', 'body' => 'NODE *'})
+    builder.link_fields('NODE',          {'nd_file' => 'char *', 'nd_mid' => 'ID', 'nd_vid' => 'ID', 'nd_u1id' => 'ID', 'nd_u2id' => 'ID', 'nd_lit' => 'VALUE', 'nd_cnt' => 'long', 'nd_rest' => 'long', 'nd_nth' => 'long', 'nd_tbl' => 'ID *', 'nd_body' => 'NODE *', 'nd_next' => 'NODE *', 'nd_head' => 'NODE *', 'nd_cpath' => 'NODE *', 'nd_super' => 'NODE *', 'nd_defn' => 'NODE *', 'nd_recv' => 'NODE *', 'nd_value' => 'NODE *', 'nd_args' => 'NODE *', 'nd_cond' => 'NODE *', 'nd_else' => 'NODE *', 'nd_iter' => 'NODE *', 'nd_var' => 'NODE *', 'nd_opt' => 'NODE *', 'nd_stts' => 'NODE *', 'nd_1st' => 'NODE *', 'nd_2nd' => 'NODE *', 'nd_3rd' => 'NODE *', 'nd_cval' => 'VALUE'})
+    
+    builder.link_constants('int', ['NODE_METHOD', 'NODE_FBODY', 'NODE_CFUNC', 'NODE_SCOPE', 'NODE_BLOCK', 'NODE_IF', 'NODE_CASE', 'NODE_WHEN', 'NODE_OPT_N', 'NODE_WHILE', 'NODE_UNTIL', 'NODE_ITER', 'NODE_FOR', 'NODE_BREAK', 'NODE_NEXT', 'NODE_REDO', 'NODE_RETRY', 'NODE_BEGIN', 'NODE_RESCUE', 'NODE_RESBODY', 'NODE_ENSURE', 'NODE_AND', 'NODE_OR', 'NODE_NOT', 'NODE_MASGN', 'NODE_LASGN', 'NODE_DASGN', 'NODE_DASGN_CURR', 'NODE_GASGN', 'NODE_IASGN', 'NODE_CDECL', 'NODE_CVASGN', 'NODE_CVDECL', 'NODE_OP_ASGN1', 'NODE_OP_ASGN2', 'NODE_OP_ASGN_AND', 'NODE_OP_ASGN_OR', 'NODE_CALL', 'NODE_FCALL', 'NODE_VCALL', 'NODE_SUPER', 'NODE_ZSUPER', 'NODE_ARRAY', 'NODE_ZARRAY', 'NODE_HASH', 'NODE_RETURN', 'NODE_YIELD', 'NODE_LVAR', 'NODE_DVAR', 'NODE_GVAR', 'NODE_IVAR', 'NODE_CONST', 'NODE_CVAR', 'NODE_NTH_REF', 'NODE_BACK_REF', 'NODE_MATCH', 'NODE_MATCH2', 'NODE_MATCH3', 'NODE_LIT', 'NODE_STR', 'NODE_DSTR', 'NODE_XSTR', 'NODE_DXSTR', 'NODE_EVSTR', 'NODE_DREGX', 'NODE_DREGX_ONCE', 'NODE_ARGS', 'NODE_ARGSCAT', 'NODE_ARGSPUSH', 'NODE_SPLAT', 'NODE_TO_ARY', 'NODE_SVALUE', 'NODE_BLOCK_ARG', 'NODE_BLOCK_PASS', 'NODE_DEFN', 'NODE_DEFS', 'NODE_ALIAS', 'NODE_VALIAS', 'NODE_UNDEF', 'NODE_CLASS', 'NODE_MODULE', 'NODE_SCLASS', 'NODE_COLON2', 'NODE_COLON3', 'NODE_CREF', 'NODE_DOT2', 'NODE_DOT3', 'NODE_FLIP2', 'NODE_FLIP3', 'NODE_ATTRSET', 'NODE_SELF', 'NODE_NIL', 'NODE_TRUE', 'NODE_FALSE', 'NODE_DEFINED', 'NODE_NEWLINE', 'NODE_POSTEXE', 'NODE_ALLOCA', 'NODE_DMETHOD', 'NODE_BMETHOD', 'NODE_MEMO', 'NODE_IFUNC', 'NODE_DSYM', 'NODE_ATTRASGN', 'NODE_LAST'])
+  end
+  
+  node_symbols = []
+  constants.each do |name|
+    next if name[0..4] != 'NODE_'
+    node_symbols[const_get(name)] = name.to_s[5..-1].downcase.to_sym
+  end
+  NODE_SYMBOLS = node_symbols
+  
+  @include_newlines = false;
+  @level = 0
+ 
+  def initialize(include_newlines = false)
+    @include_newlines = include_newlines
+  end
+  
+  def parse_tree_for_method(klass, method, is_cls_method = false, newlines = @include_newlines)
+    @newlines = newlines
+    @locals = []
+    @current_sexp = nil
+    method = method.to_sym
+    id = rb_to_id(method)
+    table = RCLASS(klass).m_tbl
+    if (r, n = st_lookup(table, id))[0]
+      sexp = [:defn, method, to_sexp(n.dereference.to_NODE.nd_body)]
+      sexp.extend Sexp
+      sexp
+    else
+      [nil]
+    end
+  end
+  
+  def parse_tree_for_string(string, filename = nil, line = nil, newlines = @include_newlines)
+    filename ||= '(string)'
+    line ||= 1
+    @newlines = newlines
+    @locals = []
+    @current_sexp = nil
+    
+    node = rb_compile_string(filename, string, line)
+    [to_sexp(node)]
+  end
+  
+  def to_sexp(node)
+    return nil if node.nil?
+    c_type = nd_type(node)
+    type = NODE_SYMBOLS[c_type]
+    
+    if type == :newline
+      if @newlines
+        newline_sexp = []
+        newline_sexp << :newline      
+        newline_sexp << nd_line(node)
+        newline_sexp << node.nd_file
+        @current_sexp << newline_sexp
+      end
+      return to_sexp(node.nd_next)
+    end
+    
+    sexp = []
+    sexp.extend Sexp
+    last_current_sexp = @current_sexp
+    @current_sexp = sexp
+    sexp << type
+    
+    #    puts(('  ' * @level) + type.to_s)
+    #    @level += 1
+    
+    case type
+    when :block, :array
+      begin
+        sexp << to_sexp(node.nd_head)
+      end while node = node.nd_next
+    when :method
+    when :fbody
+    when :cfunc
+    when :scope
+      locals_before = @locals
+      @locals = node.nd_tbl
+      nd_next = node.nd_next
+      sexp << to_sexp(nd_next) unless nd_next.nil?
+      @locals = locals_before
+    when :if
+      sexp << to_sexp(node.nd_cond)
+      sexp << to_sexp(node.nd_body)
+      sexp << to_sexp(node.nd_else)
+    when :case
+      sexp << to_sexp(node.nd_head)
+      child = node.nd_body
+      loop do
+        child_sexp = to_sexp(child)
+        sexp << child_sexp
+        if child_sexp[0] == :when #when clause
+          child = child.nd_next
+          if child.nil? #no else clause used
+            sexp << nil
+            break
+          end
+        else #else clause
+          break
+        end
+      end
+    when :when
+      #    if (!case_level) { /* when without case, ie, no expr in case */
+      #      rb_ary_pop(ary); /* reset what current is pointing at */
+      #      node = NEW_CASE(0, node);
+      #      goto again;
+      #    }
+      sexp << to_sexp(node.nd_head)
+      sexp << to_sexp(node.nd_body)
+    when :while, :until
+      sexp << to_sexp(node.nd_cond)
+      sexp << to_sexp(node.nd_body)
+      sexp << !node.nd_3rd.nil?
+    when :iter, :for
+      sexp << to_sexp(node.nd_iter)
+      #            if (node->nd_var != (NODE *)1
+      #        && node->nd_var != (NODE *)2
+      #        && node->nd_var != NULL) {
+      if node.nd_var
+        sexp << to_sexp(node.nd_var)
+      else
+        sexp << nil
+      end
+      sexp << to_sexp(node.nd_body)
+    when :break, :next, :return, :yield
+      stts = node.nd_stts
+      sexp << to_sexp(stts) unless stts.nil?
+    when :begin, :opt_n, :not
+      sexp << to_sexp(node.nd_body)
+    when :rescue
+      sexp << to_sexp(node.nd_1st)
+      sexp << to_sexp(node.nd_2nd)
+      nd_3rd = node.nd_3rd
+      sexp << to_sexp(nd_3rd) unless nd_3rd.nil?
+    when :resbody
+      sexp << to_sexp(node.nd_3rd)
+      nd_2nd = node.nd_2nd
+      sexp << to_sexp(nd_2nd) unless nd_2nd.nil?
+      nd_1st = node.nd_1st
+      sexp << to_sexp(nd_1st) unless nd_1st.nil?
+    when :ensure
+      sexp << to_sexp(node.nd_head)
+      ensr = node.nd_ensr
+      sexp << zo_sexp(ensr) unless ensr.nil?
+    when :and, :or
+      sexp << to_sexp(node.nd_1st)
+      sexp << to_sexp(node.nd_2nd)
+    when :masgn
+      sexp << to_sexp(node.nd_head)
+      args = node.nd_args
+      sexp << to_sexp(args) unless args.nil?
+      value = node.nd_value
+      sexp << to_sexp(node.nd_value) unless value.nil?
+    when :lasgn, :dasgn, :dasgn_curr, :gasgn, :iasgn, :cdecl, :cvasgn, :cvdecl
+      sexp << ID2SYM(node.nd_vid)
+      value = node.nd_value
+      sexp << to_sexp(value) unless value.nil?
+    when :op_asgn1
+    when :op_asgn2
+    when :op_asgn_and, :op_asgn_or
+      sexp << to_sexp(node.nd_head)
+      sexp << to_sexp(node.nd_value)
+    when :call, :fcall, :vcall
+      sexp << to_sexp(node.nd_recv) if type == :call
+      sexp << ID2SYM(node.nd_mid)
+      if type == :call || type == :fcall
+        args = node.nd_args
+        sexp << to_sexp(args) if args
+      end
+    when :super
+      
+    when :hash
+      list = node.nd_head
+      while list
+        sexp << to_sexp(list.nd_head)
+        list = list.nd_next
+        raise "ParseTree error: Odd number list for Hash" if list.nil?
+        sexp << to_sexp(list.nd_head)
+        list = list.nd_next
+      end
+    when :lvar, :dvar, :gvar, :ivar, :const, :cvar, :attrset
+      sexp << ID2SYM(node.nd_vid)
+    when :nth_ref
+      sexp << node.nd_nth
+    when :back_ref
+    when :match
+    when :match2, :match3
+      sexp << to_sexp(node.nd_recv)
+      sexp << to_sexp(node.nd_value)
+    when :lit, :str, :xstr
+      sexp << node.nd_lit
+    when :dstr, :dxstr, :dregx, :dregx_once, :dsym
+      sexp << node.nd_lit
+      list = node.nd_next
+      while list
+        head = list.nd_head
+        if head
+          child_sexp = to_sexp(head)
+          child_sexp = child_sexp[1] if child_sexp[0] == :evstr
+          sexp << child_sexp
+        end
+        list = list.nd_next
+      end
+    when :evstr
+      sexp << to_sexp(node.nd_body)
+    when :args
+      arg_flag = node.nd_rest
+      if @locals
+        #regular args
+        i = 0
+        while i < node.nd_cnt do
+          sexp << ID2SYM(@locals[i + 3])
+          i += 1
+        end
+        #optional args
+        optnode = node.nd_opt
+        while optnode do
+          sexp << ID2SYM(@locals[i + 3])
+          i += 1
+          optnode = optnode.nd_next
+        end
+        #special args
+        case
+        when arg_flag > 0: sexp << "*#{locals[i + 3].to_s}".to_sym #*arg
+        when arg_flag == 0: #empty list
+        when arg_flag == -1: #all handled above
+        when arg_flag == -2: #no name
+        else raise "ParseTree error: Unknown arg flag #{arg_flag}"
+        end
+        #assigns of optional args
+        opt = node.nd_opt;
+        if opt
+          sexp << to_sexp(opt)
+        end
+      end
+    when :argscat, :argspush
+      sexp << to_sexp(node.nd_head)
+      sexp << to_sexp(node.nd_body)
+    when :splat, :to_ary, :svalue
+      sexp << to_sexp(node.nd_head)
+    when :block_arg
+      sexp << ID2SYM(node.nd_u1id)
+    when :block_pass
+      sexp << to_sexp(node.nd_body)
+      sexp << to_sexp(node.nd_iter)
+    when :defn, :defs
+      defn = node.nd_defn
+      if defn
+        sexp << to_sexp(node.nd_recv) if type == :defs
+        sexp << ID2SYM(node.nd_mid)
+        sexp << to_sexp(defn)
+      end
+    when :alias
+    when :valias
+    when :undef
+    when :class, :module
+      sexp << ID2SYM(node.nd_cpath.nd_mid)
+      sexp << to_sexp(node.nd_super) if type == :class
+      sexp << to_sexp(node.nd_body)
+    when :sclass
+    when :colon2
+    when :colon3
+    when :cref
+    when :dot2
+    when :dot3
+    when :flip2
+    when :flip3
+    when :defined
+    when :postexe
+    when :alloca
+    when :dmethod
+    when :bmethod
+      block = DATA_PTR(node.nd_cval).to_struct_BLOCK
+      var = block.var
+      sexp << to_sexp(var) unless var.nil?
+      sexp << to_sexp(block.body)
+    when :memo
+    when :ifunc
+    when :attrasgn
+      nd_1st = node.nd_1st
+      if nd_1st == RNODE(1)
+        sexp << to_sexp(NEW_SELF())
+      else
+        sexp << to_sexp(nd_1st)
+      end
+      sexp << ID2SYM(node.nd_u2id)
+      sexp << to_sexp(node.nd_3rd)
+    when :last
+    when :retry, :redo, :self, :nil, :true, :false, :zsuper, :zarray
+      # empty nodes
+    when :last
+      raise "ParseTree error: Unsupported node type '#{type}'"
+    else
+      raise "ParseTree error: Unknown node type '#{c_type}'"
+    end
+    
+    #    @level -= 1
+    #    puts(('  ' * @level) + type.to_s + ' end')
+    
+    @current_sexp = last_current_sexp
+    sexp
+  end
+end

data/lib/sexp.rb

@@ -0,0 +1,20 @@
+module Sexp
+  
+  def type
+    self[0]
+  end
+  
+  def perform_process_call(target_class)
+    exp = self[1..-1]
+    exp.extend Clonable
+    target_class.send("process_#{type}", exp)
+  end
+
+end
+
+# Should not be used, for compatibility only.
+module Clonable
+  def deep_clone
+    Marshal.load(Marshal.dump(self))
+  end
+end

data/lib/sexp_processor.rb

@@ -0,0 +1,12 @@
+class SexpProcessor
+  
+  attr_accessor :auto_shift_type, :strict, :expected
+  
+  def process(sexp)
+    return nil if sexp.nil?
+    
+    sexp.extend Sexp if !sexp.is_a?(Sexp)
+    sexp.perform_process_call(self)
+  end
+  
+end

metadata

@@ -0,0 +1,57 @@
+--- !ruby/object:Gem::Specification 
+rubygems_version: 0.9.3
+specification_version: 1
+name: ParseTreeReloaded
+version: !ruby/object:Gem::Version 
+  version: 0.0.1
+date: 2007-05-21 00:00:00 +02:00
+summary: ParseTree based on RubyInlineAccelerated
+require_paths: 
+- lib
+email: mail@richard-musiol.de
+homepage: http://rubyforge.org/projects/ptreloaded/
+rubyforge_project: 
+description: ParseTreeReloaded is a reimplementation of ParseTree using RubyInlineAcceleration. The goal is to provide full compatibility to ParseTree while making it easier to build and extend.
+autorequire: 
+default_executable: 
+bindir: bin
+has_rdoc: false
+required_ruby_version: !ruby/object:Gem::Version::Requirement 
+  requirements: 
+  - - ">"
+    - !ruby/object:Gem::Version 
+      version: 0.0.0
+  version: 
+platform: ruby
+signing_key: 
+cert_chain: 
+post_install_message: 
+authors: 
+- Richard Musiol
+files: 
+- GPL.txt
+- lib/parse_tree_reloaded.rb
+- lib/sexp.rb
+- lib/sexp_processor.rb
+test_files: []
+
+rdoc_options: []
+
+extra_rdoc_files: []
+
+executables: []
+
+extensions: []
+
+requirements: []
+
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: RubyInlineAcceleration
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Version::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 0.0.1
+    version: