RubyGems - nfa2dfa - Versions diffs - 1.1.1 → 1.1.2 - Mend

nfa2dfa 1.1.1 → 1.1.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (10) hide show

data/lib/state.rb CHANGED Viewed

@@ -1,67 +1,72 @@
-# To change this template, choose Tools | Templates
-# and open the template in the editor.
-require 'graphviz'
-require_relative 'transition.rb'
-module Nfa2Dfa
-  class State
-    attr_reader :id, :is_final, :graphviz_node, :is_starting
-    def initialize(id)
-      @id = id
-      @is_final = false
-      @transitions = Array.new
-      @graphviz_init = false
-      @is_starting = false
-    end
-    def to_starting_node
-      @is_starting = true
-    end
-    def graph_id
-      is_starting ? (@id + "/init") : @id
-    end
-    def to_graph_node(graphviz_graph)
-      if @is_final
-        @graphviz_node = graphviz_graph.add_nodes(graph_id, :shape => "doublecircle")
-      else
-        @graphviz_node = graphviz_graph.add_nodes(graph_id, :shape => "circle")
-      end
-      @graphviz_init = false
-    end
-    def finalize
-      @is_final = true
-    end
-    def add_transition(tr)
-      @transitions.insert(@transitions.size, tr)
-    end
-    def clear_transitions
-      @transitions.clear
-    end
-    def associate_transitions(all_transitions)
-      @transitions.clear
-      @id.split(',').each do |id_part|
-        all_transitions.each do |transition|
-          if id_part == transition.beginning_state.id
-            add_transition(transition)
-          end
-        end
-      end
-    end
-    def get_next(char)
-      ret_val = Array.new
-      @transitions.each do |trans|
-        trans.alphabet == char ? ret_val.insert(ret_val.size, trans.ending_state) : NIL
-      end
-      ret_val
-    end
-  end
-end
+require 'graphviz'
+require_relative 'transition.rb'
+# Part of Nfa2Dfa module
+module Nfa2Dfa
+  # State of automaton
+  class State
+    attr_reader :id, :is_final, :graphviz_node, :is_starting
+    def initialize(id)
+      @id = id
+      @is_final = false
+      @transitions = []
+      @graphviz_init = false
+      @is_starting = false
+    end
+    def to_starting_node
+      @is_starting = true
+    end
+    def to_s
+      @id.to_s
+    end
+    def graph_id
+      is_starting ? (@id + '/init') : @id
+    end
+    def to_graph_node(viz_graph)
+      if @is_final
+        @graphviz_node = viz_graph.add_nodes(
+          graph_id, :shape => 'doublecircle')
+      else
+        @graphviz_node = viz_graph.add_nodes(graph_id, :shape => 'circle')
+      end
+      @graphviz_init = false
+    end
+    def finalize
+      @is_final = true
+    end
+    def add_transition(tr)
+      @transitions.insert(@transitions.size, tr)
+    end
+    def clear_transitions
+      @transitions.clear
+    end
+    def associate_transitions(all_transitions)
+      @transitions.clear
+      @id.split(',').each do |id_part|
+        all_transitions.each do |transition|
+          if id_part == transition.beginning_state.id
+            add_transition(transition)
+          end
+        end
+      end
+    end
+    def get_next(char)
+      ret_val = []
+      @transitions.each do |trans|
+        if trans.alphabet == char
+          ret_val.insert(ret_val.size, trans.ending_state)
+        end
+      end
+      ret_val
+    end
+  end
+end

data/lib/transition.rb CHANGED Viewed

@@ -1,24 +1,31 @@
-require 'graphviz'
-require_relative 'state.rb'
-module Nfa2Dfa
-  class Transition
-    attr_reader :beginning_state, :alphabet, :ending_state
-    def initialize(beg_state, alphabet, end_state)
-      @beginning_state = beg_state
-      @alphabet = alphabet
-      @ending_state = end_state
-    end
-    def to_graph_transition(graphviz_graph)
-      graphviz_graph.add_edges( @beginning_state.graphviz_node, @ending_state.graphviz_node, :label => @alphabet)
-    end
-    def print
-      puts @beginning_state.id + "-" + @alphabet + "-" + @ending_state.id
-    end
-  end
-end
+require 'graphviz'
+require_relative 'state.rb'
+# Part of Nfa2Dfa module
+module Nfa2Dfa
+  # Transition between states
+  class Transition
+    attr_reader :beginning_state, :alphabet, :ending_state
+    def initialize(beg_state, alphabet, end_state)
+      @beginning_state = beg_state
+      @alphabet = alphabet
+      @ending_state = end_state
+    end
+    def to_graph_transition(graphviz_graph)
+      graphviz_graph.add_edges(
+        @beginning_state.graphviz_node,
+        @ending_state.graphviz_node, :label => @alphabet)
+    end
+    def to_s
+      ret = @beginning_state.to_s + '-' + alphabet + '-' + @ending_state.to_s
+      ret
+    end
+    def print
+      puts @beginning_state.id + '-' + @alphabet + '-' + @ending_state.id
+    end
+  end
+end

data/spec/automaton_spec.rb CHANGED Viewed

@@ -1,134 +1,139 @@
-require 'rspec'
-require 'spec_helper'
-require_relative '../lib/automaton.rb'
-describe Nfa2Dfa::Automaton do
-  before(:each) do
-    @file_path = "#{File.dirname(__FILE__)}/testdata/valid_input.automat"
-    @file_path2 = "#{File.dirname(__FILE__)}/testdata/valid_input2.automat"
-    @file_path3 = "#{File.dirname(__FILE__)}/testdata/valid_input3.automat"
-  end
-  context "initializes as" do
-    it "valid automaton" do
-      mat = Automaton.init(@file_path)
-      mat.should_not eq NIL
-      mat.class.should eq Nfa2Dfa::Automaton
-    end
-    it "invalid automaton, when there is invalid input" do
-      mat = Automaton.init("#{File.dirname(__FILE__)}/testdata/invalid_input.automat")
-      mat.should eq NIL
-    end
-  end
-  it "should be exportable in same format by method 'to_str'" do
-    valid_str = "z f\na b\nz-a-f f-b-f\nz\nf"
-    mat = Automaton.init(@file_path)
-    mat.to_str.should eq valid_str
-  end
-  context "accepts method resolves" do
-    subject { Automaton.init(@file_path) }
-    it "valid words" do
-      (subject.accepts? "a b").should eq true
-      (subject.accepts? "a").should eq true
-      (subject.accepts? "a b b b").should eq true
-      (subject.accepts? "a b b").should eq true
-    end
-    it "invalid words" do
-      (subject.accepts? "").should eq false
-      (subject.accepts? "a a").should eq false
-      (subject.accepts? "a a ").should eq false
-      (subject.accepts? "a b a").should eq false
-    end
-  end
-  it "should be able to check if automat is deterministic" do
-    Automaton.init(@file_path).deterministic?.should eq true
-    Automaton.init(@file_path2).deterministic?.should eq false
-  end
-  context "can create deterministic automaton" do
-    it "returns Automaton class" do
-      mat1 = Automaton.init(@file_path)
-      mat2 = Automaton.init(@file_path2)
-      mat3 = Automaton.init(@file_path3)
-      mat1.determine.class.should eq Nfa2Dfa::Automaton
-      mat2.determine.class.should eq Nfa2Dfa::Automaton
-      mat3.determine.class.should eq Nfa2Dfa::Automaton
-    end
-    it "returns same instance of Automaton when already deterministic" do
-      mat1 = Automaton.init(@file_path)
-      mat1det = mat1.determine
-      mat1.should eq mat1det
-    end
-    it "returns deterministic automaton" do
-      mat2 = Automaton.init(@file_path2)
-      mat2det = mat2.determine
-      mat2det.deterministic?.should eq true
-    end
-    it "which can accept same words" do
-      mat2 = Automaton.init(@file_path2)
-      mat2det = mat2.determine
-      word = ""
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-      word = "a a"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-      word = "a b"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-      word = "a c"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-      word = "a c c"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-      word = "a c c a"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-      word = "a c c a c a"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-      word = "a c c a c a a b"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-      word = "c a b c a b c"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-      word = "a c c b c"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq true
-    end
-    it "which rejects same words" do
-      mat2 = Automaton.init(@file_path3)
-      mat2det = mat2.determine
-      word = "0"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq false
-      word = "1"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq false
-      word = "0 1"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq false
-      word = "1 0"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq false
-      word = "1 1 1 1 0"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq false
-      word = "0 0 0 0 1"
-      (mat2.accepts? word).should eq mat2det.accepts? word
-      (mat2.accepts? word).should eq false
-    end
-    it "should have method for exporting as GraphViz 'to_graph'" do
-      mat = Automaton.init(@file_path2)
-      expect(mat.methods.include?(:to_graph)).to be true
-    end
-  end
-end
+require 'rspec'
+require 'spec_helper'
+require_relative '../lib/automaton.rb'
+describe Nfa2Dfa::Automaton do
+  before(:each) do
+    @file_path = "#{File.dirname(__FILE__)}/testdata/valid_input.automat"
+    @file_path2 = "#{File.dirname(__FILE__)}/testdata/valid_input2.automat"
+    @file_path3 = "#{File.dirname(__FILE__)}/testdata/valid_input3.automat"
+  end
+  context 'initializes as' do
+    it 'valid automaton' do
+      mat = Automaton.init(@file_path)
+      mat.should_not eq NIL
+      mat.class.should eq Nfa2Dfa::Automaton
+    end
+    it 'invalid automaton, when there is invalid input' do
+      mat = Automaton.init("#{File.dirname(__FILE__)}" +
+          '/testdata/invalid_input.automat')
+      mat.should eq NIL
+    end
+  end
+  it 'should be exportable in same format by method \'to_str\'' do
+    valid_str = "z f\na b\nz-a-f f-b-f\nz\nf"
+    mat = Automaton.init(@file_path)
+    mat.to_str.should eq valid_str
+  end
+  context 'accepts method resolves' do
+    subject { Automaton.init(@file_path) }
+    it 'valid words' do
+      (subject.accepts? 'a b').should eq true
+      (subject.accepts? 'a').should eq true
+      (subject.accepts? 'a b b b').should eq true
+      (subject.accepts? 'a b b').should eq true
+    end
+    it 'invalid words' do
+      (subject.accepts? '').should eq false
+      (subject.accepts? 'a a').should eq false
+      (subject.accepts? 'a a ').should eq false
+      (subject.accepts? 'a b a').should eq false
+    end
+  end
+  it 'should be able to check if automat is deterministic' do
+    Automaton.init(@file_path).deterministic?.should eq true
+    Automaton.init(@file_path2).deterministic?.should eq false
+  end
+  context 'can create deterministic automaton' do
+    it 'returns Automaton class' do
+      mat1 = Automaton.init(@file_path)
+      mat2 = Automaton.init(@file_path2)
+      mat3 = Automaton.init(@file_path3)
+      mat1.determine.class.should eq Nfa2Dfa::Automaton
+      mat2.determine.class.should eq Nfa2Dfa::Automaton
+      mat3.determine.class.should eq Nfa2Dfa::Automaton
+    end
+    it 'returns same instance of Automaton when already deterministic' do
+      mat1 = Automaton.init(@file_path)
+      mat1det = mat1.determine
+      mat1.should eq mat1det
+    end
+    it 'returns deterministic automaton' do
+      mat2 = Automaton.init(@file_path2)
+      mat2det = mat2.determine
+      mat2det.deterministic?.should eq true
+    end
+    it 'which can accept same words' do
+      mat2 = Automaton.init(@file_path2)
+      mat2det = mat2.determine
+      word = ''
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+      word = 'a a'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+      word = 'a b'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+      word = 'a c'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+      word = 'a c c'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+      word = 'a c c a'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+      word = 'a c c a c a'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+      word = 'a c c a c a a b'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+      word = 'c a b c a b c'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+      word = 'a c c b c'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq true
+    end
+    it 'which rejects same words' do
+      mat2 = Automaton.init(@file_path3)
+      mat2det = mat2.determine
+      word = '0'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq false
+      word = '1'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq false
+      word = '0 1'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq false
+      word = '1 0'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq false
+      word = '1 1 1 1 0'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq false
+      word = '0 0 0 0 1'
+      (mat2.accepts? word).should eq mat2det.accepts? word
+      (mat2.accepts? word).should eq false
+    end
+    it 'should have method for exporting as GraphViz \'to_graph\'' do
+      mat = Automaton.init(@file_path2)
+      expect(mat.methods.include?(:to_graph)).to be true
+    end
+  end
+end