depager 0.1.9 → 0.2.0

data/lib/depager/grammar.rb

@@ -0,0 +1,136 @@
+module Depager::ParsingMethodCommon
+  class G
+    attr_accessor :rulelist, :gh, :syms, :nonterms, :terms, :closure, :ismap, :nssize, :tla
+    attr_accessor :precs, :epr, :epr2, :f0e, :first1, :eoi
+    Eps = 0x3fffffff #epsilon
+    #Eps = []
+    def initialize rulelist, ts, ns, precs = nil
+      @nssize = ns.size
+      @precs = precs
+      @eoi = ts[nil]
+      @syms = ns.invert.merge(ts.invert)
+      @tla = @syms.size
+
+      @rulelist = rulelist
+      @gh = []; @nssize.times{|i| @gh[i] = []}
+      @epr = {}
+      @f0e = {}
+      @rulelist.each_with_index do |rule, rx|
+        rule.g = self
+        rule.n = rx
+        @gh[rule.l].push rule
+        if rule.r.empty?
+          @epr[rule.l] = rule.n 
+          @f0e[rule.l] = { rule.n => [Eps] }
+        end
+      end
+      make_sym_first
+      initialize_depend
+    end
+
+    def initialize_depend
+    end
+
+    def make_sym_first
+      @first1 = {@tla => [@tla]}
+      @syms.each_key do |s|
+        if terms? s
+          @first1[s] = [s]
+        else
+          @first1[s] = []        
+          @first1[s].push Eps if @epr[s]
+        end
+      end
+      begin
+        cnt = false
+        @syms.each_key do |s|
+          @gh[s].each do |rule|
+            rule.r.each do |es|
+              ss = @first1[es] - @first1[s]
+              unless ss.empty?
+                @first1[s] |= ss
+                cnt = true
+              end
+              break unless @first1[es].include? Eps
+            end
+            unless @first1[s].include? Eps
+              if rule.r.all?{|i| @first1[i].include? Eps }
+                @first1.push Eps
+                cnt = true
+              end
+            end
+          end if nonterms? s
+        end
+      end while cnt
+    end
+
+    def first p
+      r = []
+      x = 0
+      p.each do |i|
+        if i == Eps
+        elsif i.class == Array
+          i.each do |j|
+            r |= @first1[j]
+          end
+          break unless i.any?{|j| @epr[j] || j==Eps }
+        else
+          r |= @first1[i]
+          break unless @epr[i]
+        end
+        x += 1
+      end
+      r -= [Eps]
+      r |= [Eps] if x == p.size
+      return r
+    end
+
+    def terms? i
+      i && i >= @nssize
+    end
+
+    def nonterms? i
+      i && i < @nssize
+    end
+
+    def [](n)
+      @rulelist[n]
+    end
+  end
+
+  class Rule
+    def self.[] l, r, prec = nil
+      self.new l, r, nil, nil, nil, prec
+    end
+
+    attr_accessor :l, :r, :g, :n, :act, :epr, :prec
+    def initialize l, r, g = nil, n = nil, act = nil, prec = nil
+      @l = l
+      @r = r
+      @g = g
+      @n = n
+      @act = act
+      @epr = []
+      @prec = prec
+      initialize_depend
+    end
+    def initialize_depend
+    end
+
+    alias lhs l
+    alias rhs r
+
+    def to_s
+      r = @r.map{|i| @g.syms[i]}.join(' ')    
+      "(#{'%03s'%@n}) #{@g.syms[@l]} : #{r}"
+    end
+
+    def hash
+      (@l.hash % 37) * (@r.hash % 37)
+    end
+    def eql? i
+      @l == i.l && @r == i.r
+    end
+    alias == eql?
+  end
+end

data/lib/depager/lex.dr

@@ -13,15 +13,20 @@
   end
   def lex
     until @file.eof?
-      until @line.empty? do
+      until @line.empty?
         case @line
         when /\A\s+/
           #skip blank
         when /\A%\}\s*\Z/
           @line = $'
           yield nil,nil
-        when /\A\/(([^\/\\]+|\\.)*)\//, /\A'([^'\\]+|\\.)*\'/
+        when /\A\/(([^\/\\]+|\\.)*)\//
           yield :LEX, "/\\A#{$1}/"
+        when /\A'([^'\\]+|\\.)*'/, /\A"([^"\\]+|\\.)*"/
+          rest = $'
+          str = Regexp.escape($1).gsub('/', '\/')
+          rest.match(/^/)
+          yield :LEX, "/\\A#{str}/"
         when /\A\{/
           yield :ACTION, parse_action
           /./=~'.'
@@ -46,16 +51,14 @@
         g_parser.optinner << %{
           def lex
             begin
-              until @line.empty? do
+              until @line.empty?
                 case @line
-                  #{_lexactlist}
+                #{ _lexactlist }
                 else
                   raise RuntimeError, "must not happen \#{@line}"
                 end
-                @oldline = @line
-                @line = $'
               end
-            end while @line = getline
+            end while @line0 = @line = getline
             yield nil, nil
           end
         }; #code
@@ -66,7 +69,18 @@
     | lexactlist lexact { _lexactlist << _lexact }
   ;
   lexact:
-      lexlist ACTION    { "when #{_lexlist.join(', ')}\n#{_ACTION}" }
+      lexlist opt_noskip ACTION 
+      {
+        %{
+          when #{_lexlist.join(', ')}
+            #{ _opt_noskip ? '#' : "@oldline = @line; @line = $'" }
+            #{ _ACTION }
+        }; #code
+      }
+  ;
+  opt_noskip:          
+                        { false }
+    | '!'               { true  }
   ;
   lexlist:
       LEX               { [ _LEX ] }

data/lib/depager/lex.rb

@@ -44,7 +44,7 @@ end
 module D4LexerExtension_prerulelist #:nodoc:all
 end
 
-class LexerExtension_prerulelist < Basis #:nodoc:all
+class LexerExtension_prerulelist < Depager::LALR::Basis #:nodoc:all
   include Depager::ExtensionUtils
   
   include ActionParser
@@ -55,7 +55,9 @@ class LexerExtension_prerulelist < Basis #:nodoc:all
     [ 0, 1 ],
     [ 1, 1 ],
     [ 1, 2 ],
-    [ 2, 2 ],
+    [ 2, 3 ],
+    [ 4, 0 ],
+    [ 4, 1 ],
     [ 3, 1 ],
     [ 3, 3 ],
   ]
@@ -68,61 +70,70 @@ class LexerExtension_prerulelist < Basis #:nodoc:all
     nil => 0, 
     false => 1, 
     :ACTION => 2, 
-    :LEX => 3, 
-    "," => 4, 
+    "!" => 3, 
+    :LEX => 4, 
+    "," => 5, 
   }
   ### Int to Term
   i2t = [
     nil, 
     false, 
     :ACTION, 
+    "!", 
     :LEX, 
     ",", 
   ]
   ### Action Table
   action_table = [
-    [ nil, nil, nil, 3, nil, ], 
-    [ ACC, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, 3, nil, ], 
-    [ nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, ], 
-    [ nil, nil, 7, nil, 8, ], 
-    [ nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, nil, nil, ], 
-    [ nil, nil, nil, 9, nil, ], 
-    [ nil, nil, nil, nil, nil, ], 
+    [ nil, nil, nil, nil, 5, nil, ], 
+    [ ACC, nil, nil, nil, nil, nil, ], 
+    [ nil, nil, nil, nil, 5, nil, ], 
+    [ nil, nil, nil, nil, nil, nil, ], 
+    [ nil, nil, nil, 9, nil, 8, ], 
+    [ nil, nil, nil, nil, nil, nil, ], 
+    [ nil, nil, nil, nil, nil, nil, ], 
+    [ nil, nil, 10, nil, nil, nil, ], 
+    [ nil, nil, nil, nil, 11, 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, 
     -1, 
-    -5, 
     -2, 
-    nil, 
+    -5, 
+    -7, 
     -3, 
-    -4, 
+    nil, 
     nil, 
     -6, 
+    -4, 
+    -8, 
   ]
   defred_after_shift_table = [
     nil, 
     nil, 
     nil, 
-    -5, 
     -2, 
     nil, 
+    -7, 
     -3, 
-    -4, 
+    nil, 
     nil, 
     -6, 
+    -4, 
+    -8, 
   ]
   ### Nonterm to Int
   nt2i = { 
     :start => 0,  
     :lexactlist => 1,  
     :lexact => 2,  
-    :lexlist => 3, 
+    :lexlist => 3,  
+    :opt_noskip => 4, 
   }
   ### Int to Nonterm
   i2nt = [
@@ -130,19 +141,22 @@ class LexerExtension_prerulelist < Basis #:nodoc:all
     :lexactlist, 
     :lexact, 
     :lexlist, 
+    :opt_noskip, 
   ]
   ### Goto Table
   goto_table = [ 
-   [ 1, 2, 4, 5, ], 
-   [ nil, nil, nil, nil, ], 
-   [ nil, nil, 6, 5, ], 
-   [ nil, nil, nil, nil, ], 
-   [ nil, nil, nil, nil, ], 
-   [ nil, nil, nil, nil, ], 
-   [ nil, nil, nil, nil, ], 
-   [ nil, nil, nil, nil, ], 
-   [ nil, nil, nil, nil, ], 
-   [ nil, nil, nil, nil, ], 
+   [ 1, 2, 3, 4, nil, ], 
+   [ nil, nil, nil, nil, nil, ], 
+   [ nil, nil, 6, 4, nil, ], 
+   [ nil, nil, nil, nil, nil, ], 
+   [ nil, nil, nil, nil, 7, ], 
+   [ nil, nil, nil, nil, nil, ], 
+   [ nil, nil, nil, nil, nil, ], 
+   [ nil, nil, nil, nil, nil, ], 
+   [ nil, nil, nil, nil, nil, ], 
+   [ nil, nil, nil, nil, nil, ], 
+   [ nil, nil, nil, nil, nil, ], 
+   [ nil, nil, nil, nil, nil, ], 
   ]
 
   Tables = [ reduce_table, nparams, action_table,
@@ -181,15 +195,20 @@ class LexerExtension_prerulelist < Basis #:nodoc:all
   end
   def lex
     until @file.eof?
-      until @line.empty? do
+      until @line.empty?
         case @line
         when /\A\s+/
           #skip blank
         when /\A%\}\s*\Z/
           @line = $'
           yield nil,nil
-        when /\A\/(([^\/\\]+|\\.)*)\//, /\A'([^'\\]+|\\.)*\'/
+        when /\A\/(([^\/\\]+|\\.)*)\//
           yield :LEX, "/\\A#{$1}/"
+        when /\A'([^'\\]+|\\.)*'/, /\A"([^"\\]+|\\.)*"/
+          rest = $'
+          str = Regexp.escape($1).gsub('/', '\/')
+          rest.match(/^/)
+          yield :LEX, "/\\A#{str}/"
         when /\A\{/
           yield :ACTION, parse_action
           /./=~'.'
@@ -209,7 +228,7 @@ end
 
 ### Outer Code
 
-class D4LexerExtension_prerulelist::NVAction < Depager::Action #:nodoc:all
+class D4LexerExtension_prerulelist::NVAction < Depager::LALR::Action #:nodoc:all
   include Depager::DecoratorUtils
           include ActionParser
 
@@ -221,6 +240,8 @@ class D4LexerExtension_prerulelist::NVAction < Depager::Action #:nodoc:all
   :_act_3,
   :_act_4,
   :_act_5,
+  :_act_6,
+  :_act_7,
 
   ]
   Tables = [on_reduce]
@@ -231,75 +252,95 @@ class D4LexerExtension_prerulelist::NVAction < Depager::Action #:nodoc:all
   end
   
 
-module_eval <<-'.,.,118028145942522.,.,', 'lex.dr', 43
+module_eval <<-'.,.,118754107729449.,.,', 'lex.dr', 48
   def _act_0 val
     _lexactlist = *val 
 
         g_parser.optinner << %{
           def lex
             begin
-              until @line.empty? do
+              until @line.empty?
                 case @line
-                  #{_lexactlist}
+                #{ _lexactlist }
                 else
                   raise RuntimeError, "must not happen \#{@line}"
                 end
-                @oldline = @line
-                @line = $'
               end
-            end while @line = getline
+            end while @line0 = @line = getline
             yield nil, nil
           end
         }; #code
 
   end
 
-.,.,118028145942522.,.,
+.,.,118754107729449.,.,
       
-module_eval <<-'.,.,118028145936749.,.,', 'lex.dr', 63
+module_eval <<-'.,.,118754107760430.,.,', 'lex.dr', 66
   def _act_1 val
     _lexact = *val 
      [ _lexact ] 
 
   end
 
-.,.,118028145936749.,.,
+.,.,118754107760430.,.,
       
-module_eval <<-'.,.,118028145915595.,.,', 'lex.dr', 64
+module_eval <<-'.,.,118754107730115.,.,', 'lex.dr', 67
   def _act_2 val
     _lexactlist, _lexact = *val 
      _lexactlist << _lexact 
 
   end
 
-.,.,118028145915595.,.,
+.,.,118754107730115.,.,
       
-module_eval <<-'.,.,118028145922278.,.,', 'lex.dr', 67
+module_eval <<-'.,.,118754107747000.,.,', 'lex.dr', 71
   def _act_3 val
-    _lexlist, _ACTION = *val 
-     "when #{_lexlist.join(', ')}\n#{_ACTION}" 
+    _lexlist, _opt_noskip, _ACTION = *val 
+
+        %{
+          when #{_lexlist.join(', ')}
+            #{ _opt_noskip ? '#' : "@oldline = @line; @line = $'" }
+            #{ _ACTION }
+        }; #code
 
   end
 
-.,.,118028145922278.,.,
+.,.,118754107747000.,.,
       
-module_eval <<-'.,.,118028145957906.,.,', 'lex.dr', 70
+module_eval <<-'.,.,118754107727512.,.,', 'lex.dr', 80
   def _act_4 val
+     false 
+
+  end
+
+.,.,118754107727512.,.,
+      
+module_eval <<-'.,.,118754107710888.,.,', 'lex.dr', 81
+  def _act_5 val
+    _ = *val 
+     true  
+
+  end
+
+.,.,118754107710888.,.,
+      
+module_eval <<-'.,.,118754107743010.,.,', 'lex.dr', 84
+  def _act_6 val
     _LEX = *val 
      [ _LEX ] 
 
   end
 
-.,.,118028145957906.,.,
+.,.,118754107743010.,.,
       
-module_eval <<-'.,.,1180281459420.,.,', 'lex.dr', 71
-  def _act_5 val
+module_eval <<-'.,.,118754107718606.,.,', 'lex.dr', 85
+  def _act_7 val
     _lexlist, _, _LEX = *val 
      _lexlist << _LEX 
 
   end
 
-.,.,1180281459420.,.,
+.,.,118754107718606.,.,
       
 end