rley 0.2.06 → 0.2.08

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    ODgwNTdhMzIwNjhhNWE1ZjE1N2M5ZTgzNjJiNDc3ODU4MWJkODYwMA==
+    ZmY0MDhhM2RlNzcxYzk3ZDJkMGM5YWVjY2Q0NWRlNGZhZmYyMjdmOQ==
   data.tar.gz: !binary |-
-    YmZjZjY2NDk3ODExMTlmODcwNmY1ODc2ZmNjZDZjYmEwOTIyNTE3Zg==
+    NGNmZDI2MmYyNDBhZWZiNzdhZDhjNmNjMjQxMDRkMDI0NTZkMDA3YQ==
 !binary "U0hBNTEy":
   metadata.gz: !binary |-
-    Yjk5NmRjZWIzODJjMjg3NWZkMTY4YjBmYTUxOTJmMWU2ZWNjNGIxYzM5YWQy
-    YTViZGZhOWNiZTNjNWIwMjViNjJlZjA5MDk4MDMyNDBhNTVkNTVjMmMzMTU1
-    YTJjMjk4YTM0NmI2NTdmNjE3OWUzN2M3NjJiYjk0NzkxNDBiNGU=
+    YTliNWVmM2NkN2ZjZjkyZjJhZGVhODE3M2M5MGQ5ZGI5NWM1MTI1ZGJjZWVl
+    ZTg4ZTFhODNjNzA3MmZlMmY4YTRjNDc0YzQ0M2FlNzE2NTU0YjQzMDBjYjUy
+    MmZjY2E5NzcyYzFiNTA2ZTg3Yjc1ZmUwNGJlNjUwOWM1YzY3ZWY=
   data.tar.gz: !binary |-
-    M2ZlZWZiYzIyYjYzM2Q3YTJhY2YwOWEwMTYwMDEzODc3NWYzNDc5NWIzYjFh
-    M2U4MGY5NGRlYTQ1MGQ2NWVlNDNjMmFkZjRmY2FiOWY5YjNiODZkNmIyMzQw
-    NWMzYmFiY2RmZjhkZjk2ZDUwODQ0YmE5OGMyNmQzNDVlYzhkMWY=
+    ZTM0M2IwODkwNjJlMDZkYzQzNTM4YmRkNDY5ZDI1YjQ1M2E5Y2IzZTA1OWIz
+    MGM4MDAxZTNlNDM2N2Q1ZTI3NzcxOGU0NTBmMGFmYTU2MDBhNDMxNjdlNzI5
+    ZTRlYTJkMzczNWZkZjk1NjkxZTVmYzc3N2ZjY2FlMDVhMTAyYjg=

data/CHANGELOG.md

@@ -1,3 +1,6 @@
+### 0.2.07 / 2015-04-22
+* [NEW] Rake file added in `examples` folder. It allows to run all the examples at once.
+
 ### 0.2.06 / 2015-03-21
 * [FIX] Method `EarleyParser#handle_error` portability issue between Ruby versions.
 

data/README.md

@@ -12,13 +12,20 @@ Rley
 __Rley__ is a Ruby implementation of a parser using the [Earley](http://en.wikipedia.org/wiki/Earley_parser) algorithm.  
 The project aims to build a parser convenient for lightweight NLP (Natural Language Processing) purposes.  
 
+### Highlights ###
+* Handles any context-free language,
+* Accepts left-recursive rules/productions,
+* Accepts ambiguous grammars,
+* Parse tracing facility,
+* Parse tree generation,
+* Syntax error detection and reporting.
 
-Yet another parser?  
+
+### Yet another parser? ###
 Yes and no. Rley doesn't aim to replace other very good programming language parsers for Ruby.
 The latter are faster because they use optimized algorithms at the price of a loss of generality
 in the grammar/language they support.  
 The Earley's algorithm being more general is able to parse input that conforms to any context-free grammar.
-For instance, it copes with ambiguous grammars.  
 
 This project is in "earley" stage.  
 ####Roadmap:

data/lib/rley/constants.rb

@@ -3,7 +3,7 @@
 
 module Rley # Module used as a namespace
   # The version number of the gem.
-  Version = '0.2.06'
+  Version = '0.2.08'
 
   # Brief description of the gem.
   Description = "Ruby implementation of the Earley's parsing algorithm"

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rley
 version: !ruby/object:Gem::Version
-  version: 0.2.06
+  version: 0.2.08
 platform: ruby
 authors:
 - Dimitri Geshef
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-03-21 00:00:00.000000000 Z
+date: 2015-04-22 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake