nfa2dfa 1.0.2 → 1.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 3c062458afee68eb899ec35c6fee8e82ea0366cb
-  data.tar.gz: 9f5191740fba0e5b0b865cd9d3e3b1af3a22856e
+  metadata.gz: 0dd869aacabd6004faccc4de1a7f9b35f7ec8b3c
+  data.tar.gz: dfe9e1cb14760e786a2b4ea5b0de62620c53e2ba
 SHA512:
-  metadata.gz: a4c92af38dc76982b669a26d3ba61b3038fd5f28496f37f4d1f7f6ecaf26565365fdf71e4f42da9e27062501ffe582f98348f9feb58764a0a31e4665f9aa786c
-  data.tar.gz: 2f1c55ad5e1a8efd8d3ff31bc7b060a063698d30d32ba370fe34d85a796b16df8ef49c940b4438cf0a86c4198aa5e645fc0911a7ad17fd655b940ec78d43c573
+  metadata.gz: ecb4a5153853a308678183c024a342d59c1f5a8272398bc03243351656322322959c3acabcdf840c19f62feafb9ec63a74ab087cf881790c222d194364dae20e
+  data.tar.gz: bc6bfa2a48abeac27a93521dfe5184a8ff4f1e7a07a407d5ba019027099acf5195e786d6604e9ab9cde6fab834f64b6112244c80259b8e336a65f55261a85feb

data/bin/automaton

@@ -0,0 +1,33 @@
+#!/usr/bin/env ruby
+
+require 'rubygems'
+require 'commander/import'
+require 'nfa2dfa'
+program :version, '0.0.1'
+program :description, 'Controller of automaton'
+program :name, 'automaton'
+ 
+command :create_finite do |c|
+  c.syntax = 'automaton create_finite [options]'
+  c.description = 'Creates determined automaton from file and writes it into "<input_file>.determined"'
+  c.action do |args|
+    args.each do |arg|
+      input_mat = Nfa2Dfa::Automaton.init(arg)
+      output_mat = input_mat.determine
+      data = output_mat.to_str
+      File.open(arg + ".determined", 'w') { |file| file.write(data) }
+    end
+  end
+end
+
+command :automaton_to_png do |c|
+  c.syntax = 'automaton automaton_to_png [options]'
+  c.description = 'Creates png representation of automaton from input'
+  c.action do |args|
+    args.each do |arg|
+      input_mat = Nfa2Dfa::Automaton.init(arg)
+      data = input_mat.to_graph(arg + ".png")
+    end
+  end
+end
+

data/lib/nfa2dfa.rb

@@ -1,4 +1,3 @@
-
 module Nfa2Dfa
   require_relative 'automaton'
   require_relative 'state'

data/spec/automaton_spec.rb

@@ -0,0 +1,134 @@
+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
+

data/spec/state_spec.rb

@@ -0,0 +1,101 @@
+require 'rspec'
+require 'spec_helper'
+require_relative '../lib/state.rb'
+
+describe Nfa2Dfa::State do
+  before(:each) do
+    @end_state = State.new("end")
+    @end_state.to_starting_node
+  end
+  context "should keep " do
+    subject { State.new("state") }
+
+    it "basic data" do
+      subject.id.should eq "state"
+      subject.is_final.should eq false
+    end
+
+    it "transitions as private data" do
+      expect { subject.transitions }.to raise_error NoMethodError
+    end
+    
+    it "added transitions" do
+      trans = Transition.new(subject, "jump", @end_state)
+      transes = subject.add_transition(trans)
+      transes.size.should eq 1
+      transes[0].should eq trans
+    end
+    
+    it "cleared transition array" do
+      subject.clear_transitions.size.should eq 0
+    end
+  end
+  
+  it "should be able to be finalized" do
+    state_a = State.new("a")
+    state_a.is_final.should eq false
+    state_a.finalize
+    state_a.is_final.should eq true
+    state_a.finalize
+    state_a.is_final.should eq true
+  end
+  it "should be able to be starting node" do 
+    state_a = State.new("a")
+    state_a.is_starting.should eq false
+    state_a.to_starting_node
+    state_a.is_starting.should eq true
+    state_a.to_starting_node
+    state_a.is_starting.should eq true
+  end
+  
+  context "gets correct next state" do 
+    trans = []
+    state_a = State.new("a")
+    state_b = State.new("b")
+    state_c = State.new("c")
+    trans[0] = Transition.new(state_a, "0", state_b)
+    trans[1] = Transition.new(state_b, "1", state_a)
+    trans[2] = Transition.new(state_a, "0", state_a)
+    trans[3] = Transition.new(state_c, "1", state_a)
+    trans[4] = Transition.new(state_a, "0", state_c)
+    state_a.add_transition(trans[0])
+    state_a.add_transition(trans[2])
+    state_a.add_transition(trans[4])
+    state_b.add_transition(trans[1])
+    state_c.add_transition(trans[3])
+    
+    it "array" do
+      state_a.get_next("0").size.should eq 3
+      state_a.get_next("1").size.should eq 0
+    end
+    
+    it "in first step" do
+      state_a.get_next("0")[0].should eq state_b
+    end
+    
+    it "in second step" do
+      state_a.get_next("0")[0].get_next("1")[0].should eq state_a
+    end
+  end
+  
+  context "while conversion from NFA to DFA" do
+    trans = Array.new
+    state_a = State.new("a")
+    state_b = State.new("b")
+    state_c = State.new("c")
+    trans[0] = Transition.new(state_a, "0", state_b)
+    trans[1] = Transition.new(state_b, "1", state_a)
+    trans[2] = Transition.new(state_a, "0", state_a)
+    trans[3] = Transition.new(state_c, "1", state_a)
+    trans[4] = Transition.new(state_a, "0", state_c)
+    
+    subject { State.new("a,b") }
+    it "should find correct transitions" do
+      subject.associate_transitions(trans)
+      subject.get_next("a").size.should eq 0
+      subject.get_next("1").size.should eq 1
+      subject.get_next("0").size.should eq 3
+    end
+  end
+end
+

data/spec/transition_spec.rb

@@ -0,0 +1,28 @@
+require 'rspec'
+require 'spec_helper'
+require_relative '../lib/transition.rb'
+
+describe Nfa2Dfa::Transition do
+  context "should keep " do
+    state1 = State.new("1")
+    state2 = State.new("2")
+    state2.finalize
+    subject { Transition.new(state1, "a", state2) }
+
+    it "states" do
+      subject.beginning_state.should eq state1
+      subject.ending_state.should eq state2
+    end
+
+    it "transition alphabet" do
+      subject.alphabet.should eq "a"
+    end
+    
+    it "correct types" do
+      subject.beginning_state.class.should eq State
+      subject.ending_state.class.should eq State
+      subject.alphabet.class.should eq String
+    end
+  end
+end
+

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: nfa2dfa
 version: !ruby/object:Gem::Version
-  version: 1.0.2
+  version: 1.0.4
 platform: ruby
 authors:
 - Martin Zachov
@@ -12,7 +12,8 @@ date: 2013-10-15 00:00:00.000000000 Z
 dependencies: []
 description: Finite automaton determinizer
 email: martin.zachov@gmail.com
-executables: []
+executables:
+- automaton
 extensions: []
 extra_rdoc_files: []
 files:
@@ -20,6 +21,10 @@ files:
 - lib/automaton.rb
 - lib/transition.rb
 - lib/nfa2dfa.rb
+- spec/automaton_spec.rb
+- spec/state_spec.rb
+- spec/transition_spec.rb
+- bin/automaton
 homepage: http://fit.cvut.cz
 licenses:
 - GNU GPL
@@ -44,4 +49,7 @@ rubygems_version: 2.0.3
 signing_key: 
 specification_version: 4
 summary: MI-RUB semestral
-test_files: []
+test_files:
+- spec/automaton_spec.rb
+- spec/state_spec.rb
+- spec/transition_spec.rb