lrama 0.1.0 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 1d7cf0f612d3e1ac4aea0b45db6c0533beadd6412f10a85dd17aceefcfb104a9
-  data.tar.gz: 9e60878988696b8d300700a442cb93bb7d7919be94be80a4bd96cbfe689dad1a
+  metadata.gz: 2ba620aa365e3ce11d757da653bd6677ca8bec28ca1b6a5df745d37da6784f59
+  data.tar.gz: 2ab03daa03cbb925826f2ca8053dcb04d9648c5c31bd85b1e6fbfe6f9b4cec70
 SHA512:
-  metadata.gz: 0fa702fd65a2b84c3d426c45ea6d09a5129391409408604d50767c71f8f2d059db45bbde0b8fd96f093caf3741479add35e8cb1434bdd763c38761f70a994d93
-  data.tar.gz: d2d5ed81585710107200595b38316120ccc5e01718247c08b6c7de7708ae619de1ec7e37d4ce987b6c21c31d81d5f5c812ecb385d7a6d2838be26e4cf52621f1
+  metadata.gz: 05c3e37259997144afe3191d573416c25746c80a7ef0ebc12411f1c126cedf7a8cb8113981c64f1c48e421f517790aa31a14f7ec35ded0f4a7fd4ad83a065e23
+  data.tar.gz: 6493c2a94e4681f65f76428c4327dc26be9c14643aadc371400db7def3eb1566f7b4bec091ca719a88c6949d3f46bec0fad87ec73298c69da4906a3c40b28079

data/README.md

@@ -14,6 +14,12 @@ Lrama is LALR (1) parser generator written by Ruby. The first goal of this proje
 
 ## Installation
 
+```shell
+$ gem install lrama
+```
+
+From source codes,
+
 ```shell
 $ bundle exec rake install
 $ lrama --version
@@ -23,10 +29,15 @@ $ lrama --version
 ## Usage
 
 ```shell
-# "y.tab.c" is generated
-$ lrama parse.y
+# "y.tab.c" and "y.tab.h" are generated
+$ lrama -d sample/parse.y
 ```
 
+## Build Ruby
+
+1. Install Lrama
+2. Run `make YACC=lrama`
+
 ## License
 
 See LEGAL.md file.

data/doc/TODO.md

@@ -20,6 +20,9 @@
   * [x] Precedence support
   * [x] Conflict check
   * [x] Algorithm Digraph
+  * [ ] Conflict resolution
+    * [x] Do not generate default action if states have conflicts
+    * [ ] Fix number of s/r conflicts of basic.y. See basic.output file generated by Bison.
 * Rendering
   * [x] Table compaction
   * [x] -d option
@@ -41,6 +44,7 @@
   * [x] Write down something about licenses
 * Reporting
   * [ ] Bison style
+    * [ ] Wrap not selected reduce with "[]". See basic.output file generated by Bison.
 * Error Tolerance
   * [x] Subset of Corchuelo et al.
 * Lex state

data/lib/lrama/bitmap.rb

@@ -0,0 +1,29 @@
+module Lrama
+  module Bitmap
+    def self.from_array(ary)
+      bit = 0
+
+      ary.each do |int|
+        bit |= (1 << int)
+      end
+
+      bit
+    end
+
+    def self.to_array(int)
+      a = []
+      i = 0
+
+      while int > 0 do
+        if int & 1 == 1
+          a << i
+        end
+
+        i += 1
+        int >>= 1
+      end
+
+      a
+    end
+  end
+end

data/lib/lrama/command.rb

@@ -63,9 +63,10 @@ module Lrama
 
       Report::Duration.enable if trace_opts[:time]
 
+      warning = Lrama::Warning.new
       y = File.read(grammar_file)
       grammar = Lrama::Parser.new(y).parse
-      states = Lrama::States.new(grammar, trace_state: (trace_opts[:automaton] || trace_opts[:closure]))
+      states = Lrama::States.new(grammar, warning, trace_state: (trace_opts[:automaton] || trace_opts[:closure]))
       states.compute
       context = Lrama::Context.new(states)
 
@@ -87,14 +88,20 @@ module Lrama
           grammar: grammar,
         ).render
       end
+
+      if warning.has_error?
+        exit 1
+      end
     end
 
     private
 
     def validate_report(report)
-      list = %w[states itemsets lookaheads solved counterexamples cex all none]
-      not_supported = %w[counterexamples cex all none]
-      h = {}
+      bison_list = %w[states itemsets lookaheads solved counterexamples cex all none]
+      others = %w[verbose]
+      list = bison_list + others
+      not_supported = %w[counterexamples cex none]
+      h = { grammar: true }
 
       report.each do |r|
         if list.include?(r) && !not_supported.include?(r)
@@ -104,6 +111,14 @@ module Lrama
         end
       end
 
+      if h[:all]
+        (bison_list - not_supported).each do |r|
+          h[r.to_sym] = true
+        end
+
+        h.delete(:all)
+      end
+
       return h
     end
 

data/lib/lrama/context.rb

@@ -18,7 +18,7 @@ module Lrama
       # Array of array
       @_actions = []
 
-      report_duration(:compute_tables) { compute_tables }
+      compute_tables
     end
 
     # enum yytokentype
@@ -187,11 +187,11 @@ module Lrama
     # * yypact_ninf
     # * yytable_ninf
     def compute_tables
-      compute_yydefact
-      compute_yydefgoto
-      sort_actions
+      report_duration(:compute_yydefact) { compute_yydefact }
+      report_duration(:compute_yydefgoto) { compute_yydefgoto }
+      report_duration(:sort_actions) { sort_actions }
       # debug_sorted_actions
-      compute_packed_table
+      report_duration(:compute_packed_table) { compute_packed_table }
     end
 
     def vectors_count
@@ -438,10 +438,11 @@ module Lrama
             if @table[loc]
               # If the cell of table is set, can not use the cell.
               ok = false
+              break
             end
           end
 
-          if userd_res[res]
+          if ok && userd_res[res]
             ok = false
           end
 

data/lib/lrama/digraph.rb

@@ -0,0 +1,53 @@
+module Lrama
+  # Algorithm Digraph of https://dl.acm.org/doi/pdf/10.1145/69622.357187 (P. 625)
+  class Digraph
+    def initialize(sets, relation, base_function)
+      # X in the paper
+      @sets = sets
+      # R in the paper
+      @relation = relation
+      # F' in the paper
+      @base_function = base_function
+      # S in the paper
+      @stack = []
+      # N in the paper
+      @h = Hash.new(0)
+      # F in the paper
+      @result = {}
+    end
+
+    def compute
+      @sets.each do |x|
+        next if @h[x] != 0
+        traverse(x)
+      end
+
+      return @result
+    end
+
+    private
+
+    def traverse(x)
+      @stack.push(x)
+      d = @stack.count
+      @h[x] = d
+      @result[x] = @base_function[x] # F x = F' x
+
+      @relation[x] && @relation[x].each do |y|
+        traverse(y) if @h[y] == 0
+        @h[x] = [@h[x], @h[y]].min
+        @result[x] |= @result[y] # F x = F x + F y
+      end
+
+      if @h[x] == d
+        while true do
+          z = @stack.pop
+          @h[z] = Float::INFINITY
+          @result[z] = @result[x] # F (Top of S) = F x
+
+          break if z == x
+        end
+      end
+    end
+  end
+end

data/lib/lrama/output.rb

@@ -27,14 +27,14 @@ module Lrama
 
     def render
       report_duration(:render) do
-        erb = ERB.new(File.read(template_file), nil, '-')
+        erb = ERB.new(File.read(template_file), trim_mode: '-')
         erb.filename = template_file
         tmp = erb.result_with_hash(context: @context, output: self)
         tmp = replace_special_variables(tmp, @output_file_path)
         @out << tmp
 
         if @header_file_path
-          erb = ERB.new(File.read(header_template_file), nil, '-')
+          erb = ERB.new(File.read(header_template_file), trim_mode: '-')
           erb.filename = header_template_file
           tmp = erb.result_with_hash(context: @context, output: self)
           tmp = replace_special_variables(tmp, @header_file_path)
@@ -135,6 +135,17 @@ module Lrama
       str
     end
 
+    # b4_user_initial_action
+    def user_initial_action(comment = "")
+      return "" unless @grammar.initial_action
+
+      <<-STR
+        #{comment}
+        #line #{@grammar.initial_action.line} "#{@grammar_file_path}"
+        #{@grammar.initial_action.translated_code}
+      STR
+    end
+
     # b4_user_actions
     def user_actions
       str = ""
@@ -164,10 +175,25 @@ module Lrama
       str
     end
 
+    def omit_braces_and_blanks(param)
+      param[1..-2].strip
+    end
+
     # b4_parse_param
     def parse_param
-      # Omit "{}"
-      @grammar.parse_param[1..-2]
+      if @grammar.parse_param
+        omit_braces_and_blanks(@grammar.parse_param)
+      else
+        ""
+      end
+    end
+
+    def lex_param
+      if @grammar.lex_param
+        omit_braces_and_blanks(@grammar.lex_param)
+      else
+        ""
+      end
     end
 
     # b4_user_formals
@@ -179,6 +205,60 @@ module Lrama
       end
     end
 
+    # b4_user_args
+    def user_args
+      if @grammar.parse_param
+        ", #{parse_param_name}"
+      else
+        ""
+      end
+    end
+
+    def extract_param_name(param)
+      /\A(.)+([a-zA-Z0-9_]+)\z/.match(param)[2]
+    end
+
+    def parse_param_name
+      if @grammar.parse_param
+        extract_param_name(parse_param)
+      else
+        ""
+      end
+    end
+
+    def lex_param_name
+      if @grammar.lex_param
+        extract_param_name(lex_param)
+      else
+        ""
+      end
+    end
+
+    # b4_parse_param_use
+    def parse_param_use(val, loc)
+      str = <<-STR
+  YY_USE (#{val});
+  YY_USE (#{loc});
+      STR
+
+      if @grammar.parse_param
+        str << "  YY_USE (#{parse_param_name});"
+      end
+
+      str
+    end
+
+    # b4_yylex_formals
+    def yylex_formals
+      ary = ["&yylval", "&yylloc"]
+
+      if @grammar.lex_param
+        ary << lex_param_name
+      end
+
+      "(#{ary.join(', ')})"
+    end
+
     # b4_table_value_equals
     def table_value_equals(table, value, literal, symbol)
       if literal < table.min || table.max < literal
@@ -188,6 +268,17 @@ module Lrama
       end
     end
 
+    # b4_yyerror_args
+    def yyerror_args
+      ary = ["&yylloc"]
+
+      if @grammar.parse_param
+        ary << parse_param_name
+      end
+
+      "#{ary.join(', ')}"
+    end
+
     def template_basename
       File.basename(template_file)
     end

data/lib/lrama/report.rb

@@ -1,6 +1,18 @@
 module Lrama
   class Report
     module Profile
+      # 1. Wrap target method with Profile.report_profile like below:
+      #
+      #   Lrama::Report::Profile.report_profile { method }
+      #
+      # 2. Run lrama command, for example
+      #
+      #   $ ./exe/lrama --trace=time spec/fixtures/integration/ruby_3_2_0/parse.tmp.y
+      #
+      # 3. Generate html file
+      #
+      #   $ stackprof --d3-flamegraph tmp/stackprof-cpu-myapp.dump > tmp/flamegraph.html
+      #
       def self.report_profile
         require "stackprof"