Skip to content
This repository
Browse code

0.0.1 release

  • Loading branch information...
commit f058e1d94f955266e5c7204a4bf085060dc41335 1 parent 114e626
Nate Young authored February 07, 2011

Showing 2 changed files with 4 additions and 3 deletions. Show diff stats Hide diff stats

  1. 5  README.md
  2. 2  project.clj
5  README.md
Source Rendered
@@ -26,7 +26,8 @@ be defined as follows:
26 26
               (between (char \[) (char \]) (many (instruction)))))
27 27
 
28 28
     (defparser bf []
29  
-      (many (instruction)))
  29
+      (many (instruction))
  30
+      (eof))
30 31
 
31 32
 The `defparser` forms create new parsers that you can combine into other, more
32 33
 complex parsers. As you can see in this example, those parsers can be recursive.
@@ -55,7 +56,7 @@ Parsatron offers you facilities for interacting with and operating on the things
55 56
 you parse via sequencing of multiple parsers and binding their results. The
56 57
 macros `>>` and `p-let` embody this facility.
57 58
 
58  
-As an example, bencoded strings, are prefixed by their length and a colon:
  59
+As an example, [bencoded strings](http://en.wikipedia.org/wiki/Bencode) are prefixed by their length and a colon:
59 60
 
60 61
     (defparser ben-string []
61 62
       (p-let [length (integer)]
2  project.clj
... ...
@@ -1,4 +1,4 @@
1  
-(defproject the/parsatron "0.0.1-SNAPSHOT"
  1
+(defproject the/parsatron "0.0.1"
2 2
   :description "Clojure parser combinators"
3 3
   :dependencies [[org.clojure/clojure "1.2.0"]
4 4
                  [org.clojure/clojure-contrib "1.2.0"]]

0 notes on commit f058e1d

Please sign in to comment.
Something went wrong with that request. Please try again.