X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=doc%2Fsbp.html;h=35e97039bc8ff48b55df5d5bc86c697b0cb86b68;hp=fe6ac8fb18510e6bfc299dfeaf98a5fe44cd094c;hb=2bee2b032b0422d212e17082cc4dcbf28cb897ac;hpb=0a0227b9180534d2a431f3d6e08a398bde2244c4

diff --git a/doc/sbp.html b/doc/sbp.html
index fe6ac8f..35e9703 100644
--- a/doc/sbp.html
+++ b/doc/sbp.html
@@ -45,6 +45,21 @@
 <b>SBP: the Scannerless Boolean Parser</b></font>
 </center>
 
+<br><br>
+<center>
+<table width=400><tr><td>
+<font color=red><b>Update:</b></font> [05-July-2006]<br><br>
+
+The reflective grammar-to-java bindings are complete, so SBP is now
+vastly easier to use.  You can find example code <a
+href=../src/edu/berkeley/sbp/misc/Demo.java>here</a>
+and the companion grammar <a
+href=../tests/demo.g>here</a>.
+I will be writing up a tutorial tomorrow (the 7th). -- Adam
+
+</td></tr></table>
+</center>
+
 <h1>What is it?</h1>
 
 The Scannerless Boolean Parser (SBP) is a scannerless parser for <a
@@ -71,7 +86,7 @@ and Wiki markup.
 <p>
 
 In addition to the juxtaposition and union operators provided in
-context-free languages, JTP supports grammars which use the
+context-free languages, SBP supports grammars which use the
 intersection operator (<a
 href=http://www.cs.queensu.ca/home/okhotin/conjunctive/>conjunctive
 grammars</a>) and the complement operator (<a