X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=README;h=7891aab773415405b3325d7fa94693cb773c9bd5;hp=fd7dd4c797f242f2652adee2bf7344bc6dcb4234;hb=14b3d2ee6a2d2ef84628e541ec291961f2061a5a;hpb=0a0227b9180534d2a431f3d6e08a398bde2244c4

diff --git a/README b/README
index fd7dd4c..7891aab 100644
--- a/README
+++ b/README
@@ -2,7 +2,7 @@
 Scannerless Boolean Parser
 
 Adam Megacz <megacz@cs.berkeley.edu>
-12-Dec-2005
+updated 27-May-2007
 
 ______________________________________________________________________________
 Requirements
@@ -49,8 +49,10 @@ Browsing the code
                    sbp/        -- core API: grammar, trees, and forests
                        misc    -- regression testing and sample code
                        util    -- some nifty data structures not specific to parsing
-                       tib     -- Text with Indentation and Braces (experimental/undocumented)
+                       meta    -- code relating to the metagrammar (meta.g)
+                       chr     -- code for parsing character streams (you want this)
   doc/
+      jargon.txt               -- read this!
       api/                     -- generated javadocs go here
   tests/
         meta.g                 -- the tentative metagrammar, written in itself
@@ -74,5 +76,10 @@ Using the code
   would be anything drastic enough to require more than a few minutes
   to update a grammar description.
 
-  The TIB stuff is super experimental; I'm not even sure if I'll keep
-  it around.  Use at your own risk.
+
+______________________________________________________________________________
+Haskell Integration
+
+  If you're using LambdaVM (the Java backend for GHC), you'll be able
+  to use SBP in your Haskell code.  See src/SBP.lhs for more info.
+