moory 1.1.0 → 1.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f9bd19c3c77df5dc2dcd9704047df98db0ac75b1e9e0c6786b21aca476bb02cd
-  data.tar.gz: bce8c57e2ff2743d6dc2259489f73c5cef5806fadf95175587b90350a1cb2cc2
+  metadata.gz: e1e1b029fd85b751396919e05fa902cbbf1e2198fcd20d44f614325dd8b556ad
+  data.tar.gz: b8056903c89db21097d1678f93c05b60689dcfbf666e82cda2fdd2874f4a4f98
 SHA512:
-  metadata.gz: e7c9f878405512b333da0ab4bbd1cc4a102cbe4ad737e7ca85bb6479c3486dc80bcc9d2d9cef27a36b009fe34c62f1554343e00cdce331faf3625ec0c2cc9b91
-  data.tar.gz: 3712aae9d6adef08d7e1a8ab82fc23dc293a884609558e34996bc3d257ccd95ec4f11e6423eef269a5d5ab3596f5768eccadcb1cce5025ce9c23941045663333
+  metadata.gz: 6aeab425171302916915af4ada63d24a6d0dadccd6030cdc7342dcaf5f8a61812002575ffee751b1cfe897012f64462945e1c59ed068fb6e5d48a22d0d716bdb
+  data.tar.gz: f1647149a2dccd90e9245c789a3e788855989d04530c709c4ae4ba322bc0bd7db0349a61cce2f6b5d9ec4b4be7ab5b0570cb831e6837a2b43dc2bd3e5fc79f2e

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    moory (1.1.0)
+    moory (1.1.2)
 
 GEM
   remote: https://rubygems.org/

data/examples/inductive.rb

@@ -1,29 +1,85 @@
 require 'moory'
 
-balanced_parens_config = {
+pipcv_config = {
   basis: 'basis',
   specs: {
     'basis' => {
-      initial: 'ε',
       rules: """
-        ε : ( / parenthetical / defer : δ
+      ^ : constant : $
+
+      ^ : variable : $
+
+      ^ : prefix / open          / defer : Δ
+
+      ^ : (      / parenthetical / defer : Δ
+
+      $ : infix  / open          / defer : Δ
+      
+      Δ : term : $
+      """,
+    },
+    'open' => {
+      rules: """
+      ^ : constant / term          / reconvene : $
+
+      ^ : variable / term          / reconvene : $
+
+      ^ : prefix   / open          / defer : Δ
+
+      ^ : (        / parenthetical / defer : Δ
+
+      $ : infix    / open          / defer : Δ
+      
+      Δ : term     / term          / reconvene : $
       """,
     },
     'parenthetical' => {
-      initial: 'ε',
       rules: """
-        ε : ( / parenthetical / defer  : δ
-        ε : ) // reconvene : ω
-        δ : ) // reconvene : ω
+      ^ : constant : C
+
+      ^ : variable : C
+
+      ^ : prefix / open          / defer : Δ
+
+      ^ : (      / parenthetical / defer : Δ
+
+      ^ : )      / void          / reconvene : $
+
+      C : infix  / open          / defer : Δ
+
+      C : )      / term          / reconvene : $
+      
+      Δ : term : C
       """
     }
   }
 }
 
-logistic = Moory::Logistic::Controller.new(balanced_parens_config)
+logistic = Moory::Logistic::Controller.new(pipcv_config)
 
-"(()".each_char do |c|
-  logistic.issue(c)
+%w{
+  (
+    (
+      prefix
+      constant
+      infix
+      prefix
+      (
+        variable
+        infix
+        prefix
+        (
+          variable
+        )
+      )
+    )
+  )
+  infix
+}.each do |w|
+  logistic.issue(w)
 end
 
+pp logistic.deferrals
+
 pp logistic.done?
+

data/lib/moory/decoder.rb

@@ -9,11 +9,6 @@ module Moory
       configure(rules)
     end
 
-    # Decode a string according to the rules.  Writes the decoded string to the output 
-    #   stream configured at initialisation (which is $stdout, by default).  Characters
-    #   not belonging to the alphabet will be dropped.
-    #
-    # @param string [String] the string you wish to decode
     def decode(string)
       string.each_char { |c| issue(c) }
     end

data/lib/moory/logistic.rb

@@ -3,7 +3,7 @@ module Moory
     class Unit
       include Moory::Efferent
     
-      def initialize(rules:, initial:)
+      def initialize(rules:, initial:'^')
         @initial = initial
         configure(rules)
       end
@@ -90,13 +90,15 @@ module Moory
         active_unit.prime
       end
     
-      def reconvene
+      def reconvene(stimulus=nil)
         raise "Cannot reconvene without prior deferral" if deferrals.empty?
     
         deferrals.pop.tap do |last_deferral|
           focus_on(last_deferral[:name])
           active_unit.state = last_deferral[:state]
         end
+
+        active_unit.issue(stimulus) if stimulus
       end
     end
   end

data/lib/moory/machine.rb

@@ -12,25 +12,16 @@ module Moory
       @transitions ||= Moory::Transition::Storage.new
     end
 
-    # Issue a stimulus to the machine.
-    #
-    # @return will either be the new `settlement`, or `nil` if the stimulus is not understood.
     def issue(stimulus)
       if response = transitions.response(origin: state, stimulus: stimulus)
         honour(response)
       end
     end
 
-    # Reveals the stimuli to which the machine may respond in its current state.
-    #
-    # @return [Set] 
     def awaits
       transitions.egresses(state:state)
     end
 
-    # Answers whether a machine can respond to the given stimlus in its current state.
-    #
-    # @return [Boolean]
     def understand?(stimulus)
       awaits.include?(stimulus)
     end

data/lib/moory/recogniser.rb

@@ -8,11 +8,6 @@ module Moory
       Loader.load(rules: rules, machine: self)
     end
     
-    # Answers whether the given string is accepted; that is, does it belong to
-    # the language described by the rules?
-    #
-    # @param string [String] the candidate string.
-    # @return [Boolean] true if the string is accepted; false, otherwise.
     def accepts?(string)
       reset
 

data/lib/moory/repertoire.rb

@@ -6,9 +6,6 @@ module Moory
     attr_reader :fallback
     attr_reader :always
 
-    # Create a repertoire from a Hash mapping names to callable objects.
-    #
-    # @return [Repertoire]
     def Repertoire.from_hash(hash={})
       new.tap { |r| r.cram(hash) }
     end
@@ -19,28 +16,16 @@ module Moory
       @knowledge = {}
     end
 
-    # Learn multiple items of knowledge.
     def cram(hash={})
       hash.each { |k,v| learn(name: k, item: v) }
     end
 
-    # Associate a name with a callable object.  The item will not be stored unless it is callable; 
-    #   that is, it must respond to `:call`.
-    #
-    # @param item the callable object you want to store.
-    # @param name the name you will use to identify the `item`.
     def learn(item:,name:)
       @knowledge.store(name, item) if (
         appropriate?(item) && name
       )
     end
 
-    # Recall a callable object by name.
-    #
-    # @param the name identifying the object you want to retrieve.
-    # @return if the given value represents knowledge, then that which has been learned is returned.
-    #   If the name does not represent an item of knowledge, then the `fallback` is returned.  You will
-    #   always get something callable when you call this method.
     def recall(name)
       name ? 
         knowledge.fetch(name, fallback) : 

data/lib/moory/transitions.rb

@@ -2,46 +2,27 @@ require 'set'
 
 module Moory
   module Transition
-    # Serves as a transition relation.
     class Storage
       def count
         storage.size
       end
       
-      # Store a transition described by a hash
-      #
-      # @param params [Hash] a hash describing a transition.  At a minimum,
-      #   it should include `:origin`, `:stimulus`, and `:settlement`.  
-      #   It may also include `:output` and `:effector`.
       def store(params)
         storage.merge!(Hasher.new(params)) do |key, oldval, newval|
           oldval.merge!(newval)
         end
       end
 
-      # Retrieve the unique response to a stimulus from a given origin.
-      #
-      # @return [Hash, nil] if the given parameters represent a transition, a Hash is returned
-      #   including at least a `:settlement`, and maybe one/both of `:output` and `:effector`.
-      #   If the paremeters do not correspond to a uniqu transition, `nil` is returned.
       def response(origin:, stimulus:)
         storage.dig(origin, stimulus)
       end
 
-      # Retrieve the states represented by the transition relation.
-      #
-      # @return [Set]
       def states
         storage
           .keys
           .to_set
       end
 
-      # Retrieve the alphabet
-      #
-      # @param restrict retricts the alphabet to that subset applicable to the state named by 
-      #   the given value.
-      # @return [Set]
       def alphabet(restrict:nil)
         storage
           .select  { |k| restrict ? k == restrict : true }
@@ -51,25 +32,15 @@ module Moory
           .to_set
       end
 
-      # Retrieve the egresses for the given state.
-      #
-      # @param state identifies the state for which egresses are being sought.
-      # @return [Set]
       def egresses(state:)
         alphabet(restrict: state)
       end
 
-      # Returns the transition relation.
-      #
-      # @return [Hash] represents the transition relation as a mapping from 
-      #   (state, stimulus) to (settlement, output, effector).
       def storage
         @storage ||= {}
       end
     end
 
-    # Helps expand a flat-hash description of a transition into a form
-    # amenable to storage.
     Hasher = Struct.new(
       :origin,
       :stimulus,

data/lib/moory/version.rb

@@ -1,3 +1,3 @@
 module Moory
-  VERSION = "1.1.0"
+  VERSION = "1.1.2"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: moory
 version: !ruby/object:Gem::Version
-  version: 1.1.0
+  version: 1.1.2
 platform: ruby
 authors:
 - Adam W. Grant
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2018-07-30 00:00:00.000000000 Z
+date: 2018-08-01 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler