depager 0.2.3 → 0.3.0.b20160729

data/examples/sample_calc/calc.atree.tab.rb

@@ -1,451 +0,0 @@
-
-begin; require 'rubygems'; rescue Exception; end
-require 'depager/parser.rb'
-
-
-module Depager::DecoratorUtils; end
-module D4TinyCalc;    end
-
-class TinyCalc < Depager::LALR::Basis
-  
-  include Depager
-
-  ### Reduce Table
-  reduce_table = [
-    [   -1,    1 ], # (  0) $start : expr
-    [    0,    3 ], # (  1) expr : expr '+' term
-    [    0,    3 ], # (  2) expr : expr '-' term
-    [    0,    1 ], # (  3) expr : term
-    [    1,    3 ], # (  4) term : term '*' fact
-    [    1,    3 ], # (  5) term : term '/' fact
-    [    1,    1 ], # (  6) term : fact
-    [    2,    1 ], # (  7) fact : NUM
-    [    2,    3 ], # (  8) fact : '(' expr ')'
-  ]
-  ### Extension Params
-  nparams = {
-    'ATreeBuilder' => 2, 
-  }
-  ### Term to Int
-  t2i = {
-    nil => 0, 
-    false => 1, 
-    "+" => 2, 
-    "-" => 3, 
-    "*" => 4, 
-    "/" => 5, 
-    :NUM => 6, 
-    "(" => 7, 
-    ")" => 8, 
-  }
-  ### Int to Term
-  i2t = [
-    nil, 
-    false, 
-    "+", 
-    "-", 
-    "*", 
-    "/", 
-    :NUM, 
-    "(", 
-    ")", 
-  ]
-  ### Action Table
-  action_table = [
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ ACC, nil, 7, 8, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, 9, 10, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, 7, 8, nil, nil, nil, nil, 11, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, 9, 10, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, 9, 10, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-  ]
-  ### Default Reduce Table
-  defred_table = [
-    nil, 
-    nil, 
-    nil, 
-    -3, 
-    -6, 
-    -7, 
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    -8, 
-    -1, 
-    -2, 
-    -4, 
-    -5, 
-  ]
-  defred_after_shift_table = [
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    -6, 
-    -7, 
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    -8, 
-    nil, 
-    nil, 
-    -4, 
-    -5, 
-  ]
-  ### Nonterm to Int
-  nt2i = { 
-    :expr => 0,  
-    :term => 1,  
-    :fact => 2, 
-  }
-  ### Int to Nonterm
-  i2nt = [
-    :expr, 
-    :term, 
-    :fact, 
-  ]
-  ### Goto Table
-  goto_table = [ 
-   [ 2, 3, 4, ], 
-   [ 6, 3, 4, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, 12, 4, ], 
-   [ nil, 13, 4, ], 
-   [ nil, nil, 14, ], 
-   [ nil, nil, 15, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-  ]
-
-
-  alias orig_error error
-  def error
-    orig_error
-    warn "current state: #{StateInfo[@stack.last]}"
-  end
-
-  ### States
-  StateInfo = [ 
-<<'----------',
-I000 = 
-  (  0) $start : _ expr
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I001 = 
-  (  8) fact : '(' _ expr ')'
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I002 = 
-  (  0) $start : expr _
-  (  1) expr : expr _ '+' term
-  (  2) expr : expr _ '-' term
-
-  '+'             shift, and goto to state 7
-  '-'             shift, and goto to state 8
-
-
-  $end            accept
-
-----------
-  
-<<'----------',
-I003 = 
-  (  3) expr : term _
-  (  4) term : term _ '*' fact
-  (  5) term : term _ '/' fact
-
-  '*'             shift, and goto to state 9
-  '/'             shift, and goto to state 10
-
-  $default       reduce using rule 3 (expr) 
-
-----------
-  
-<<'----------',
-I004 = 
-  (  6) term : fact _
-
-
-  $default       reduce using rule 6 (term)  [after shift]
-
-----------
-  
-<<'----------',
-I005 = 
-  (  7) fact : NUM _
-
-
-  $default       reduce using rule 7 (fact)  [after shift]
-
-----------
-  
-<<'----------',
-I006 = 
-  (  8) fact : '(' expr _ ')'
-  (  1) expr : expr _ '+' term
-  (  2) expr : expr _ '-' term
-
-  '+'             shift, and goto to state 7
-  '-'             shift, and goto to state 8
-  ')'             shift, and goto to state 11
-
-
-----------
-  
-<<'----------',
-I007 = 
-  (  1) expr : expr '+' _ term
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I008 = 
-  (  2) expr : expr '-' _ term
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I009 = 
-  (  4) term : term '*' _ fact
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I010 = 
-  (  5) term : term '/' _ fact
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I011 = 
-  (  8) fact : '(' expr ')' _
-
-
-  $default       reduce using rule 8 (fact)  [after shift]
-
-----------
-  
-<<'----------',
-I012 = 
-  (  1) expr : expr '+' term _
-  (  4) term : term _ '*' fact
-  (  5) term : term _ '/' fact
-
-  '*'             shift, and goto to state 9
-  '/'             shift, and goto to state 10
-
-  $default       reduce using rule 1 (expr) 
-
-----------
-  
-<<'----------',
-I013 = 
-  (  2) expr : expr '-' term _
-  (  4) term : term _ '*' fact
-  (  5) term : term _ '/' fact
-
-  '*'             shift, and goto to state 9
-  '/'             shift, and goto to state 10
-
-  $default       reduce using rule 2 (expr) 
-
-----------
-  
-<<'----------',
-I014 = 
-  (  4) term : term '*' fact _
-
-
-  $default       reduce using rule 4 (term)  [after shift]
-
-----------
-  
-<<'----------',
-I015 = 
-  (  5) term : term '/' fact _
-
-
-  $default       reduce using rule 5 (term)  [after shift]
-
-----------
-  ]
-
-
-  Tables = [ reduce_table, nparams, action_table,
-             defred_table, defred_after_shift_table, goto_table,
-             t2i, i2t, nt2i, i2nt ]
-
-  def self.createDecoratedParser
-    D4TinyCalc::ATreeBuilder.new(TinyCalc.new())
-  end
-
-  ### Inner Code
-
-          def lex
-            begin
-              until @line.empty?
-                case @line
-                
-          when /\A\s+/, /\A\#.*/
-            @oldline = @line; @line = $'
-                 
-
-        
-          when /\A[1-9][0-9]*/
-            @oldline = @line; @line = $'
-                 yield token(:NUM, $&.to_i) 
-
-        
-          when /\A./
-            @oldline = @line; @line = $'
-                 yield token($&, $&) 
-
-        
-                else
-                  raise RuntimeError, "must not happen #{@line}"
-                end
-              end
-            end while @line0 = @line = getline
-            yield nil, nil
-          end
-        
-end
-
-### Outer Code
-
-class D4TinyCalc::ATreeBuilder < Depager::LALR::Action #:nodoc:all
-  include Depager::DecoratorUtils
-  
-  on_reduce = [
-    nil,
-              :_atree_0,
-  :_atree_1,
-  :_atree_2,
-  :_atree_3,
-  :_atree_4,
-  :_atree_5,
-  :_atree_6,
-  :_atree_7,
-
-  ]
-  Tables = [on_reduce]
-  def initialize inside
-    super inside, 'ATreeBuilder'
-    @on_reduce, = self.class::Tables
-    init_parser
-  end
-  
-
-module_eval <<-'.,.,122745803830157.,.,', 'sample_calc/calc.atree.dr', 17
-def _atree_0 val
-[:add, val[0],val[2]]
-end
-.,.,122745803830157.,.,
-      
-module_eval <<-'.,.,122745803819966.,.,', 'sample_calc/calc.atree.dr', 19
-def _atree_1 val
-[:sub, val[0],val[2]]
-end
-.,.,122745803819966.,.,
-      
-module_eval <<-'.,.,122745803811215.,.,', 'sample_calc/calc.atree.dr', 21
-def _atree_2 val
-val[0]
-end
-.,.,122745803811215.,.,
-      
-module_eval <<-'.,.,122745803854915.,.,', 'sample_calc/calc.atree.dr', 25
-def _atree_3 val
-[:mul, val[0],val[2]]
-end
-.,.,122745803854915.,.,
-      
-module_eval <<-'.,.,12274580384152.,.,', 'sample_calc/calc.atree.dr', 27
-def _atree_4 val
-[:div, val[0],val[2]]
-end
-.,.,12274580384152.,.,
-      
-module_eval <<-'.,.,122745803842692.,.,', 'sample_calc/calc.atree.dr', 29
-def _atree_5 val
-val[0]
-end
-.,.,122745803842692.,.,
-      
-module_eval <<-'.,.,122745803834536.,.,', 'sample_calc/calc.atree.dr', 33
-def _atree_6 val
-[:literal, val[0]]
-end
-.,.,122745803834536.,.,
-      
-module_eval <<-'.,.,122745803843700.,.,', 'sample_calc/calc.atree.dr', 35
-def _atree_7 val
-val[1]
-end
-.,.,122745803843700.,.,
-      
-end
-      
-
-def createDecoratedTinyCalc
-  D4TinyCalc::ATreeBuilder.new(TinyCalc.new())
-end
-
-### main
-if __FILE__ == $0
-### Main Code
-require 'pp'
-parser = createDecoratedTinyCalc
-r, = parser.parse(STDIN)
-pp r
-
-end

data/examples/sample_calc/calc.cst.tab.rb

@@ -1,644 +0,0 @@
-
-begin; require 'rubygems'; rescue Exception; end
-require 'depager/parser.rb'
-
-
-module Depager::DecoratorUtils; end
-module D4TinyCalc;    end
-
-class TinyCalc < Depager::LALR::Basis
-  
-
-  ### Reduce Table
-  reduce_table = [
-    [   -1,    1 ], # (  0) $start : expr
-    [    0,    3 ], # (  1) expr : expr '+' term
-    [    0,    3 ], # (  2) expr : expr '-' term
-    [    0,    1 ], # (  3) expr : term
-    [    1,    3 ], # (  4) term : term '*' fact
-    [    1,    3 ], # (  5) term : term '/' fact
-    [    1,    1 ], # (  6) term : fact
-    [    2,    1 ], # (  7) fact : NUM
-    [    2,    3 ], # (  8) fact : '(' expr ')'
-  ]
-  ### Extension Params
-  nparams = {
-    'CSTBuilder' => 2, 
-  }
-  ### Term to Int
-  t2i = {
-    nil => 0, 
-    false => 1, 
-    "+" => 2, 
-    "-" => 3, 
-    "*" => 4, 
-    "/" => 5, 
-    :NUM => 6, 
-    "(" => 7, 
-    ")" => 8, 
-  }
-  ### Int to Term
-  i2t = [
-    nil, 
-    false, 
-    "+", 
-    "-", 
-    "*", 
-    "/", 
-    :NUM, 
-    "(", 
-    ")", 
-  ]
-  ### Action Table
-  action_table = [
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ ACC, nil, 7, 8, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, 9, 10, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, 7, 8, nil, nil, nil, nil, 11, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, 5, 1, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, 9, 10, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, 9, 10, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, nil, nil, nil, nil, ], 
-  ]
-  ### Default Reduce Table
-  defred_table = [
-    nil, 
-    nil, 
-    nil, 
-    -3, 
-    -6, 
-    -7, 
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    -8, 
-    -1, 
-    -2, 
-    -4, 
-    -5, 
-  ]
-  defred_after_shift_table = [
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    -6, 
-    -7, 
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    nil, 
-    -8, 
-    nil, 
-    nil, 
-    -4, 
-    -5, 
-  ]
-  ### Nonterm to Int
-  nt2i = { 
-    :expr => 0,  
-    :term => 1,  
-    :fact => 2, 
-  }
-  ### Int to Nonterm
-  i2nt = [
-    :expr, 
-    :term, 
-    :fact, 
-  ]
-  ### Goto Table
-  goto_table = [ 
-   [ 2, 3, 4, ], 
-   [ 6, 3, 4, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, 12, 4, ], 
-   [ nil, 13, 4, ], 
-   [ nil, nil, 14, ], 
-   [ nil, nil, 15, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-   [ nil, nil, nil, ], 
-  ]
-
-
-  alias orig_error error
-  def error
-    orig_error
-    warn "current state: #{StateInfo[@stack.last]}"
-  end
-
-  ### States
-  StateInfo = [ 
-<<'----------',
-I000 = 
-  (  0) $start : _ expr
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I001 = 
-  (  8) fact : '(' _ expr ')'
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I002 = 
-  (  0) $start : expr _
-  (  1) expr : expr _ '+' term
-  (  2) expr : expr _ '-' term
-
-  '+'             shift, and goto to state 7
-  '-'             shift, and goto to state 8
-
-
-  $end            accept
-
-----------
-  
-<<'----------',
-I003 = 
-  (  3) expr : term _
-  (  4) term : term _ '*' fact
-  (  5) term : term _ '/' fact
-
-  '*'             shift, and goto to state 9
-  '/'             shift, and goto to state 10
-
-  $default       reduce using rule 3 (expr) 
-
-----------
-  
-<<'----------',
-I004 = 
-  (  6) term : fact _
-
-
-  $default       reduce using rule 6 (term)  [after shift]
-
-----------
-  
-<<'----------',
-I005 = 
-  (  7) fact : NUM _
-
-
-  $default       reduce using rule 7 (fact)  [after shift]
-
-----------
-  
-<<'----------',
-I006 = 
-  (  8) fact : '(' expr _ ')'
-  (  1) expr : expr _ '+' term
-  (  2) expr : expr _ '-' term
-
-  '+'             shift, and goto to state 7
-  '-'             shift, and goto to state 8
-  ')'             shift, and goto to state 11
-
-
-----------
-  
-<<'----------',
-I007 = 
-  (  1) expr : expr '+' _ term
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I008 = 
-  (  2) expr : expr '-' _ term
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I009 = 
-  (  4) term : term '*' _ fact
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I010 = 
-  (  5) term : term '/' _ fact
-
-  NUM             shift, and goto to state 5
-  '('             shift, and goto to state 1
-
-
-----------
-  
-<<'----------',
-I011 = 
-  (  8) fact : '(' expr ')' _
-
-
-  $default       reduce using rule 8 (fact)  [after shift]
-
-----------
-  
-<<'----------',
-I012 = 
-  (  1) expr : expr '+' term _
-  (  4) term : term _ '*' fact
-  (  5) term : term _ '/' fact
-
-  '*'             shift, and goto to state 9
-  '/'             shift, and goto to state 10
-
-  $default       reduce using rule 1 (expr) 
-
-----------
-  
-<<'----------',
-I013 = 
-  (  2) expr : expr '-' term _
-  (  4) term : term _ '*' fact
-  (  5) term : term _ '/' fact
-
-  '*'             shift, and goto to state 9
-  '/'             shift, and goto to state 10
-
-  $default       reduce using rule 2 (expr) 
-
-----------
-  
-<<'----------',
-I014 = 
-  (  4) term : term '*' fact _
-
-
-  $default       reduce using rule 4 (term)  [after shift]
-
-----------
-  
-<<'----------',
-I015 = 
-  (  5) term : term '/' fact _
-
-
-  $default       reduce using rule 5 (term)  [after shift]
-
-----------
-  ]
-
-
-  Tables = [ reduce_table, nparams, action_table,
-             defred_table, defred_after_shift_table, goto_table,
-             t2i, i2t, nt2i, i2nt ]
-
-  def self.createDecoratedParser
-    D4TinyCalc::CSTBuilder.new(TinyCalc.new())
-  end
-
-  ### Inner Code
-
-          def lex
-            begin
-              until @line.empty?
-                case @line
-                
-          when /\A\s+/, /\A\#.*/
-            @oldline = @line; @line = $'
-                 
-
-        
-          when /\A[1-9][0-9]*/
-            @oldline = @line; @line = $'
-                 yield token(:NUM, $&.to_i) 
-
-        
-          when /\A./
-            @oldline = @line; @line = $'
-                 yield token($&, $&) 
-
-        
-                else
-                  raise RuntimeError, "must not happen #{@line}"
-                end
-              end
-            end while @line0 = @line = getline
-            yield nil, nil
-          end
-        
-end
-
-### Outer Code
-
-class Node
-  def accept
-  end
-end
-    
-class Visitor
-
-module_eval <<-'.,.,122745803928929.,.,', 'sample_calc/calc.cst.dr', 23
-def visit_Node_expr_0 node
-     node.value = node.expr.value + node.term.value 
-
-end
-.,.,122745803928929.,.,
-      
-module_eval <<-'.,.,12274580395023.,.,', 'sample_calc/calc.cst.dr', 24
-def visit_Node_expr_1 node
-     node.value = node.expr.value + node.term.value 
-
-end
-.,.,12274580395023.,.,
-      
-module_eval <<-'.,.,12274580391475.,.,', 'sample_calc/calc.cst.dr', 25
-def visit_Node_expr_2 node
-     node.value = node.term.value 
-
-end
-.,.,12274580391475.,.,
-      
-module_eval <<-'.,.,122745803963610.,.,', 'sample_calc/calc.cst.dr', 28
-def visit_Node_term_0 node
-     node.value = node.term.value * node.fact.value 
-
-end
-.,.,122745803963610.,.,
-      
-module_eval <<-'.,.,122745803936130.,.,', 'sample_calc/calc.cst.dr', 29
-def visit_Node_term_1 node
-     node.value = node.term.value / node.fact.value 
-
-end
-.,.,122745803936130.,.,
-      
-module_eval <<-'.,.,122745803926151.,.,', 'sample_calc/calc.cst.dr', 30
-def visit_Node_term_2 node
-     node.value = node.fact.value 
-
-end
-.,.,122745803926151.,.,
-      
-module_eval <<-'.,.,122745803911098.,.,', 'sample_calc/calc.cst.dr', 33
-def visit_Node_fact_0 node
-     node.value = node.num.value 
-
-end
-.,.,122745803911098.,.,
-      
-module_eval <<-'.,.,122745803942330.,.,', 'sample_calc/calc.cst.dr', 34
-def visit_Node_fact_1 node
-     node.value = node.expr 
-
-end
-.,.,122745803942330.,.,
-      
-end
-    
-class Node
-  
-    attr_accessor :value
-    def initialize
-      @value = nil
-    end
-
-end
-class Visitor
-  
-end
-        
-      class Node_expr < Node
-        def initialize
-super()
-        end
-      end
-    
-      class Node_expr_0 < Node_expr
-        attr_accessor :expr, :tx2b, :term
-        def initialize expr, tx2b, term
-super()
-@expr = expr; @tx2b = tx2b; @term = term
-        end
-        def accept v
-expr.accept(v); term.accept(v); 
-v.visit_Node_expr_0(self)
-        end
-      end
-    
-      class Node_expr_1 < Node_expr
-        attr_accessor :expr, :tx2d, :term
-        def initialize expr, tx2d, term
-super()
-@expr = expr; @tx2d = tx2d; @term = term
-        end
-        def accept v
-expr.accept(v); term.accept(v); 
-v.visit_Node_expr_1(self)
-        end
-      end
-    
-      class Node_expr_2 < Node_expr
-        attr_accessor :term
-        def initialize term
-super()
-@term = term
-        end
-        def accept v
-term.accept(v); 
-v.visit_Node_expr_2(self)
-        end
-      end
-    
-      class Node_term < Node
-        def initialize
-super()
-        end
-      end
-    
-      class Node_term_0 < Node_term
-        attr_accessor :term, :tx2a, :fact
-        def initialize term, tx2a, fact
-super()
-@term = term; @tx2a = tx2a; @fact = fact
-        end
-        def accept v
-term.accept(v); fact.accept(v); 
-v.visit_Node_term_0(self)
-        end
-      end
-    
-      class Node_term_1 < Node_term
-        attr_accessor :term, :tx2f, :fact
-        def initialize term, tx2f, fact
-super()
-@term = term; @tx2f = tx2f; @fact = fact
-        end
-        def accept v
-term.accept(v); fact.accept(v); 
-v.visit_Node_term_1(self)
-        end
-      end
-    
-      class Node_term_2 < Node_term
-        attr_accessor :fact
-        def initialize fact
-super()
-@fact = fact
-        end
-        def accept v
-fact.accept(v); 
-v.visit_Node_term_2(self)
-        end
-      end
-    
-      class Node_fact < Node
-        def initialize
-super()
-        end
-      end
-    
-      class Node_fact_0 < Node_fact
-        attr_accessor :num
-        def initialize num
-super()
-@num = num
-        end
-        def accept v
-
-v.visit_Node_fact_0(self)
-        end
-      end
-    
-      class Node_fact_1 < Node_fact
-        attr_accessor :tx28, :expr, :tx29
-        def initialize tx28, expr, tx29
-super()
-@tx28 = tx28; @expr = expr; @tx29 = tx29
-        end
-        def accept v
-expr.accept(v); 
-v.visit_Node_fact_1(self)
-        end
-      end
-    
-class D4TinyCalc::CSTBuilder < Depager::LALR::Action #:nodoc:all
-  include Depager::DecoratorUtils
-  
-  on_reduce = [
-    nil,
-              :_cst_0,
-  :_cst_1,
-  :_cst_2,
-  :_cst_3,
-  :_cst_4,
-  :_cst_5,
-  :_cst_6,
-  :_cst_7,
-
-  ]
-  Tables = [on_reduce]
-  def initialize inside
-    super inside, 'CSTBuilder'
-    @on_reduce, = self.class::Tables
-    init_parser
-  end
-  
-
-module_eval <<-'.,.,122745803958185.,.,', 'sample_calc/calc.cst.dr', 23
-def _cst_0 val
-Node_expr_0.new(val[0], val[1], val[2])
-end
-.,.,122745803958185.,.,
-      
-module_eval <<-'.,.,122745803928586.,.,', 'sample_calc/calc.cst.dr', 24
-def _cst_1 val
-Node_expr_1.new(val[0], val[1], val[2])
-end
-.,.,122745803928586.,.,
-      
-module_eval <<-'.,.,122745803930636.,.,', 'sample_calc/calc.cst.dr', 25
-def _cst_2 val
-Node_expr_2.new(val[0])
-end
-.,.,122745803930636.,.,
-      
-module_eval <<-'.,.,12274580392302.,.,', 'sample_calc/calc.cst.dr', 28
-def _cst_3 val
-Node_term_0.new(val[0], val[1], val[2])
-end
-.,.,12274580392302.,.,
-      
-module_eval <<-'.,.,122745803915548.,.,', 'sample_calc/calc.cst.dr', 29
-def _cst_4 val
-Node_term_1.new(val[0], val[1], val[2])
-end
-.,.,122745803915548.,.,
-      
-module_eval <<-'.,.,122745803944731.,.,', 'sample_calc/calc.cst.dr', 30
-def _cst_5 val
-Node_term_2.new(val[0])
-end
-.,.,122745803944731.,.,
-      
-module_eval <<-'.,.,122745803920542.,.,', 'sample_calc/calc.cst.dr', 33
-def _cst_6 val
-Node_fact_0.new(val[0])
-end
-.,.,122745803920542.,.,
-      
-module_eval <<-'.,.,12274580399969.,.,', 'sample_calc/calc.cst.dr', 34
-def _cst_7 val
-Node_fact_1.new(val[0], val[1], val[2])
-end
-.,.,12274580399969.,.,
-      
-end
-      
-
-def createDecoratedTinyCalc
-  D4TinyCalc::CSTBuilder.new(TinyCalc.new())
-end
-
-### main
-if __FILE__ == $0
-### Main Code
-require 'pp'
-parser = createDecoratedTinyCalc
-r, = parser.parse(STDIN)
-v = Visitor.new
-r.accept(v)
-pp r
-puts r.value
-
-end