rlsm 1.1.0 → 1.8.1

data/lib/rlsm/regexp.rb

@@ -3,6 +3,7 @@ require File.join(File.dirname(__FILE__), 'regexp_parser')
 require File.join(File.dirname(__FILE__), 'dfa')
 
 module RLSM
+  # @private
   class RegExp
     #Returns a RegExp which is the empty word.
     def self.empty_word
@@ -27,7 +28,7 @@ module RLSM
     #
     #Whitspaces will be ignored and the empty string represents the empty language.
     def initialize(description)
-      @parse_tree = RE::Parser[ description ]
+      @parse_tree = RLSM::RE::Parser[ description ]
       @string = @parse_tree.to_s
     end
 

data/lib/rlsm/regexp_parser.rb

@@ -1,6 +1,7 @@
 require File.join(File.dirname(__FILE__), 'helper')
 
 module RLSM
+  # @private
   module RE #:nodoc:
     module ParserHelpers #:nodoc:
       OpenBracket = '('
@@ -118,7 +119,7 @@ module RLSM
         end
 
         if unbalanced_brackets?(input)
-          raise RegExpError, "Parse Error: Unbalanced brackets."
+          raise RLSM::Error, "Parse Error: Unbalanced brackets."
         end
         
         parse(input)      

data/rlsm.gemspec

@@ -0,0 +1,26 @@
+# -*- ruby -*-
+
+require "rake"
+require File.join(File.dirname(__FILE__), 'lib', 'rlsm')
+
+Gem::Specification.new do |s|
+  s.author = "Gunther Diemant"
+  s.email = "g.diemant@gmx.net"
+  s.homepage = "http://github.com/asmodis/rlsm"
+  s.rubyforge_project = 'rlsm'
+
+  s.name = 'rlsm'
+  s.version = RLSM::VERSION
+  s.add_development_dependency('minitest')
+  s.add_development_dependency('thoughtbot-shoulda')
+  s.summary = "Library for investigating regular languages and syntactic monoids."
+  s.description = "see README"
+
+  s.files = File.open("Manifest").to_a.map { |file| file.strip }
+  s.test_files = FileList['test/test_*.rb']
+  s.extensions = FileList['ext/**/extconf.rb']
+
+  s.has_rdoc = true
+  s.extra_rdoc_files = ['README']
+  s.rdoc_options << '--main' << 'README'
+end

data/test/test_dfa.rb

@@ -11,7 +11,7 @@ context "Parsing the description of a DFA." do
   end
   
   test "The empty string is not accepted" do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new ""
     end
   end
@@ -23,13 +23,13 @@ context "Parsing the description of a DFA." do
   end
 
   test "The description must include an initial state indicator." do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new "s1"
     end
   end
 
   test "The description may not include more than one initial state." do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new "}s1-a->}s2"
     end
   end
@@ -41,29 +41,29 @@ context "Parsing the description of a DFA." do
   end
 
   test "A transition arrow must have a starting dash." do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new "}s1 a-> s2"
     end
   end
 
   test "A transition arrow must have a closing arrow." do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new "}s1 -a> s2"
     end
 
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new "}s1 -a- s2"
     end
   end
 
   test "A transition must have at least one label." do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new "}s1 --> s2"
     end
   end
 
   test "Multiple labels must be seperated by a comma." do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new "}s1 -a;b-> s2"
     end
   end
@@ -75,13 +75,13 @@ context "Parsing the description of a DFA." do
   end
 
   test "A transition must start with a state." do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new " -a-> }s2"
     end
   end
 
   test "A transition must end with a state." do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new "}s1 -a-> "
     end
   end
@@ -139,7 +139,7 @@ context "Creation of a DFA." do
   end
 
   test "Transition labels out from one state must be unique" do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new "}s1 -a-> s2 s1-a->s3"
     end
   end
@@ -207,11 +207,11 @@ context "Properties of a state" do
 
   test "Arguments for state properties must be states of the DFA." do
     dfa = RLSM::DFA.new "}s1"
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       dfa.dead? "s3"
     end
 
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       dfa.reachable? "s3"
     end
   end
@@ -382,7 +382,7 @@ context "Accepting of words, transition monoid" do
   end
 
   test "Requesting a transition from a nonexistant state." do
-    assert_raises DFAError do
+    assert_raises RLSM::Error do
       RLSM::DFA.new("}s1")['s2', 'a']
     end
   end
@@ -401,6 +401,8 @@ context "Accepting of words, transition monoid" do
     refute dfa.accepts?("aab")
   end
 
+
+  
   test "Calculating the transition monoid." do
     dfa = RLSM::DFA.new "}s1-a->s2 s2 -a-> *s3 s3 -b-> s2"
     expected_monoid = RLSM::Monoid[ <<MONOID

data/test/test_monoid.rb

@@ -49,41 +49,41 @@ context "Creation of a monoid:" do
   end
 
   test "Monoid::new : Should reject an empty description." do
-    assert_raises ArgumentError do
+    assert_raises RLSM::Error do
       RLSM::Monoid[ "" ]
     end
   end
 
   test "Monoid::new : Should reject a description with only whitespaces." do
-    assert_raises ArgumentError do
+    assert_raises RLSM::Error do
       RLSM::Monoid[ " \t\n" ]
     end
   end
   
   test "Monoid::new : Description should describe a quadratic matrix." do
-    assert_raises ParseError do
+    assert_raises RLSM::Error do
       RLSM::Monoid[ "012 120 20" ]
     end
   end
 
   test "Monoid::new : Described n x n - matrix should contain n symbols." do
-    assert_raises ParseError do
+    assert_raises RLSM::Error do
       RLSM::Monoid[ "123 456 789" ]
     end
 
-    assert_raises ParseError do
+    assert_raises RLSM::Error do
       RLSM::Monoid[ "000 000 000" ]
     end
   end
 
   test "Monoid::new : Identity should be first row and column." do
-    assert_raises MonoidError do
+    assert_raises RLSM::Error do
       RLSM::Monoid[ "00 01" ]
     end
   end
 
   test "Monoid::new : Described monoid should be associative." do
-    assert_raises BinOpError do
+    assert_raises RLSM::Error do
       RLSM::Monoid[ "012 100 200" ]
     end
   end
@@ -96,7 +96,7 @@ context "Creation of a monoid:" do
   end
 
   test "Monoid::new : Column seperators must either be used or not in a row." do
-    assert_raises ParseError do
+    assert_raises RLSM::Error do
       RLSM::Monoid[ "0,12 120 201" ]
     end
   end
@@ -116,11 +116,11 @@ context "Multiplication of elements:" do
   end
 
   test "Monoid#[] : Should require at least two arguments." do
-    assert_raises ArgumentError do
+    assert_raises RLSM::Error do
       @monoid["2"]
     end
 
-    assert_raises ArgumentError do
+    assert_raises RLSM::Error do
       @monoid[]
     end
   end
@@ -134,7 +134,7 @@ context "Multiplication of elements:" do
 
   
   test "Monoid#[] : Should raise BinOpError for unknown elements." do
-    assert_raises ArgumentError do
+    assert_raises RLSM::Error do
       @monoid["1","3"]
     end
   end
@@ -201,7 +201,7 @@ context "Generating submonoids:" do
   test "Monoid#generated_set : Should raise BinOpError for unknown elements." do
     m1 = RLSM::Monoid[ "0123 1203 2013 3333" ]
 
-    assert_raises ArgumentError do
+    assert_raises RLSM::Error do
       m1.generated_set(["4"])
     end
   end
@@ -507,45 +507,45 @@ context "Iterator: " do
     i = 0
     RLSM::Monoid.each(3) { i += 1 }
 
-    assert_equal 6, i
+    assert_equal 6, i, "order3"
 
     i = 0
     RLSM::Monoid.each(4) { i += 1 }
 
-    assert_equal 27, i
+    assert_equal 27, i, "order4"
 
     i = 0
     RLSM::Monoid.each(5) { i += 1 }
 
-    assert_equal 156, i
-
-    order4 = [RLSM::Monoid[ '0123 1032 2301 3210' ],
-              RLSM::Monoid[ '0123 1032 2310 3201' ],
-              RLSM::Monoid[ '0123 1023 2222 3322' ],
-              RLSM::Monoid[ '0123 1023 2223 3332' ],
-              RLSM::Monoid[ '0123 1032 2323 3232' ],
-              RLSM::Monoid[ '0123 1023 2222 3323' ],
-              RLSM::Monoid[ '0123 1023 2222 3333' ],
-              RLSM::Monoid[ '0123 1023 2323 3223' ],
-              RLSM::Monoid[ '0123 1111 2111 3111' ],
-              RLSM::Monoid[ '0123 1113 2113 3331' ],
-              RLSM::Monoid[ '0123 1122 2211 3211' ],
-              RLSM::Monoid[ '0123 1111 2111 3112' ],
-              RLSM::Monoid[ '0123 1111 2111 3113' ],
-              RLSM::Monoid[ '0123 1111 2111 3123' ],
-              RLSM::Monoid[ '0123 1111 2111 3333' ],
-              RLSM::Monoid[ '0123 1111 2112 3123' ],
-              RLSM::Monoid[ '0123 1113 2113 3333' ],
-              RLSM::Monoid[ '0123 1121 2212 3123' ],
-              RLSM::Monoid[ '0123 1123 2213 3333' ],
-              RLSM::Monoid[ '0123 1111 2121 3113' ],
-              RLSM::Monoid[ '0123 1111 2121 3333' ],
-              RLSM::Monoid[ '0123 1111 2122 3123' ],
-              RLSM::Monoid[ '0123 1111 2122 3133' ],
-              RLSM::Monoid[ '0123 1111 2123 3333' ],
-              RLSM::Monoid[ '0123 1111 2222 3333' ],
-              RLSM::Monoid[ '0123 1111 2130 3102' ],
-              RLSM::Monoid['0123 1123 2231 3312']]
+    assert_equal 156, i, "order5"
+
+    order4 = [RLSM::Monoid[ [0,1,2,3,1,0,3,2,2,3,0,1,3,2,1,0] ],
+              RLSM::Monoid[ [0,1,2,3,1,0,3,2,2,3,1,0,3,2,0,1] ],
+              RLSM::Monoid[ [0,1,2,3,1,0,2,3,2,2,2,2,3,3,2,2] ],
+              RLSM::Monoid[ [0,1,2,3,1,0,2,3,2,2,2,3,3,3,3,2] ],
+              RLSM::Monoid[ [0,1,2,3,1,0,3,2,2,3,2,3,3,2,3,2] ],
+              RLSM::Monoid[ [0,1,2,3,1,0,2,3,2,2,2,2,3,3,2,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,0,2,3,2,2,2,2,3,3,3,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,0,2,3,2,3,2,3,3,2,2,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,1,1,3,1,1,1] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,3,2,1,1,3,3,3,3,1] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,2,2,2,2,1,1,3,2,1,1] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,1,1,3,1,1,2] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,1,1,3,1,1,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,1,1,3,1,2,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,1,1,3,3,3,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,1,2,3,1,2,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,3,2,1,1,3,3,3,3,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,2,1,2,2,1,2,3,1,2,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,2,3,2,2,1,3,3,3,3,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,2,1,3,1,1,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,2,1,3,3,3,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,2,2,3,1,2,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,2,2,3,1,3,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,2,3,3,3,3,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,2,2,2,3,3,3,3] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,1,1,2,1,3,0,3,1,0,2] ],
+              RLSM::Monoid[ [0,1,2,3,1,1,2,3,2,2,3,1,3,3,1,2] ]]
 
     RLSM::Monoid.each(4) { |m| assert order4.include? m }
   end

data/test/test_regexp.rb

@@ -19,11 +19,11 @@ context "Parsing of a regexp:" do
   end
 
   test "RegExp::new : Should check that parentheses are balanced." do
-    assert_raises RegExpError do
+    assert_raises RLSM::Error do
       RLSM::RegExp.new "(ab(cUd)"
     end
 
-    assert_raises RegExpError do
+    assert_raises RLSM::Error do
       RLSM::RegExp.new "ab)((cUd)"
     end
   end

metadata

@@ -1,7 +1,13 @@
 --- !ruby/object:Gem::Specification 
 name: rlsm
 version: !ruby/object:Gem::Version 
-  version: 1.1.0
+  hash: 53
+  prerelease: false
+  segments: 
+  - 1
+  - 8
+  - 1
+  version: 1.8.1
 platform: ruby
 authors: 
 - Gunther Diemant
@@ -9,116 +15,73 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2009-10-09 00:00:00 +02:00
+date: 2010-09-02 00:00:00 +02:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
   name: minitest
-  type: :development
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Requirement 
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
         version: "0"
-    version: 
+  type: :development
+  version_requirements: *id001
 - !ruby/object:Gem::Dependency 
   name: thoughtbot-shoulda
-  type: :development
-  version_requirement: 
-  version_requirements: !ruby/object:Gem::Requirement 
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
         version: "0"
-    version: 
-description: |+
-  = rlsm
-  rlsm stands for *R*egular *L*anguages and *S*yntactic *M*onoids.
-  
-  Source is availible from
-    http://github.com/asmodis/rlsm
-  
-  RDoc-Documentation is availible from
-    http://rlsm.rubyforge.org
-  
-  == DESCRIPTION:
-  
-  This is a ruby implementation of three concepts:
-   - Deterministic Finite Automata
-   - Regular Expressions (in the sense of theoretical computer sience)
-   - Monoids
-  
-  
-  == SYNOPSIS:
-  
-    require 'rlsm'
-    
-    m = RLSM::Monoid.new '012 112 212'
-    m.syntactic? # => true
-    m.isomorph_to?(m) # => true
-    m.commutative? # => false
-  
-  == INSTALL:
-  
-    gem install rlsm 
-  
-  
-  == LICENSE:
-  
-  (The MIT License)
-  
-  Copyright (c) 2009 Gunther Diemant <g.diemant@gmx.net>
-  
-  Permission is hereby granted, free of charge, to any person obtaining
-  a copy of this software and associated documentation files (the
-  'Software'), to deal in the Software without restriction, including
-  without limitation the rights to use, copy, modify, merge, publish,
-  distribute, sublicense, and/or sell copies of the Software, and to
-  permit persons to whom the Software is furnished to do so, subject to
-  the following conditions:
-  
-  The above copyright notice and this permission notice shall be
-  included in all copies or substantial portions of the Software.
-  
-  THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
-  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-  CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-  TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-  SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-  
+  type: :development
+  version_requirements: *id002
+description: see README
 email: g.diemant@gmx.net
 executables: []
 
 extensions: 
 - ext/array/extconf.rb
-- ext/binop/extconf.rb
 - ext/monoid/extconf.rb
 extra_rdoc_files: 
 - README
 files: 
-- lib/rlsm/binary_operation.rb
-- lib/rlsm/dfa.rb
+- Rakefile
+- Manifest
+- README
+- rlsm.gemspec
+- lib/rlsm.rb
 - lib/rlsm/helper.rb
 - lib/rlsm/monoid.rb
+- lib/rlsm/dfa.rb
 - lib/rlsm/regexp.rb
 - lib/rlsm/regexp_parser.rb
-- lib/rlsm.rb
-- ext/array/array_c_ext.c
-- ext/binop/binop_c_ext.c
+- ext/monoid/extconf.rb
 - ext/monoid/monoid_c_ext.c
 - ext/array/extconf.rb
-- ext/binop/extconf.rb
-- ext/monoid/extconf.rb
+- ext/array/array_c_ext.c
 - test/helpers.rb
-- test/test_binop.rb
-- test/test_dfa.rb
 - test/test_monoid.rb
+- test/test_dfa.rb
 - test/test_regexp.rb
-- Rakefile
-- README
+- data/monoids.db
+- examples/creating_db.rb
+- examples/creating_lists.rb
+- examples/presenting_monoids_in_tex.rb
+- examples/regular_monoids.rb
+- examples/order8.rb
+- examples/benchmark.rb
+- examples/numbers.rb
 has_rdoc: true
 homepage: http://github.com/asmodis/rlsm
 licenses: []
@@ -130,26 +93,31 @@ rdoc_options:
 require_paths: 
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
       version: "0"
-  version: 
 required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
       version: "0"
-  version: 
 requirements: []
 
 rubyforge_project: rlsm
-rubygems_version: 1.3.5
+rubygems_version: 1.3.7
 signing_key: 
 specification_version: 3
 summary: Library for investigating regular languages and syntactic monoids.
 test_files: 
-- test/test_binop.rb
 - test/test_dfa.rb
 - test/test_monoid.rb
 - test/test_regexp.rb