rlsm 0.2.3 → 0.2.4

data/test/regexp_spec.rb

@@ -0,0 +1,25 @@
+require File.join(File.dirname(__FILE__), '..', 'lib', 'rlsm', 'regexp')
+
+describe RLSM::RegExp do
+  ['(ab', '(|ab)', '(ab|)', 'ab(*)', '(*a|b)', 'ab()cd'].each do |str|
+    it "should raise error for input #{str}" do
+      lambda { RLSM::RegExp.new str }.should raise_error(Exception)
+    end
+  end
+
+  ['', '&', 'a', 'a|b', 'ab', '(a|b)c', '(a*|bc&&&d)|abc|(a|b|c)*'].each do |s|
+    it "should accept the input #{s}" do
+      lambda { RLSM::RegExp.new s }.should_not raise_error(Exception)
+    end
+  end
+  
+  it "should simplify a input" do
+    RLSM::RegExp.new('a&&**&&c***(bbbcccaa)**').to_s.should == 'ac*(bbbcccaa)*'
+  end
+
+  it "should convert a regexp to an dfa" do
+    dfa1 = RLSM::RegExp.new('(a|b)aa*(&|b)a*').to_dfa
+    dfa1.states.size.should == 4
+    dfa1.final_states.map {|f| f.label}.sort.should == ['1', '2'].sort
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: rlsm
 version: !ruby/object:Gem::Version 
-  version: 0.2.3
+  version: 0.2.4
 platform: ruby
 authors: 
 - asmodis
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2008-11-10 00:00:00 +01:00
+date: 2008-11-17 00:00:00 +01:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -48,6 +48,13 @@ files:
 - lib/rlsm/monoid.rb
 - lib/rlsm/monoid_db.rb
 - lib/rlsm/regexp.rb
+- lib/rlsm/regexp_nodes/concat.rb
+- lib/rlsm/regexp_nodes/primexp.rb
+- lib/rlsm/regexp_nodes/renodes.rb
+- lib/rlsm/regexp_nodes/star.rb
+- lib/rlsm/regexp_nodes/union.rb
+- lib/smon/commands/db_find.rb
+- lib/smon/commands/db_stat.rb
 - lib/smon/commands/exit.rb
 - lib/smon/commands/help.rb
 - lib/smon/commands/intro.rb
@@ -56,8 +63,12 @@ files:
 - lib/smon/commands/regexp.rb
 - lib/smon/commands/reload.rb
 - lib/smon/commands/show.rb
+- lib/smon/presenter.rb
+- lib/smon/presenter/txt_presenter.rb
 - lib/smon/smon.rb
-- test/test_rlsm.rb
+- test/dfa_spec.rb
+- test/monoid_spec.rb
+- test/regexp_spec.rb
 has_rdoc: true
 homepage: http://www.github.com/asmodis/rlsm
 post_install_message: 
@@ -85,5 +96,5 @@ rubygems_version: 1.2.0
 signing_key: 
 specification_version: 2
 summary: "This is a ruby implementation of three concepts: - Deterministic Finite Automata (DFA) - Regular Expressions (in the sense of theoretical computer sience) - Monoids (an algebraic construct)"
-test_files: 
-- test/test_rlsm.rb
+test_files: []
+