From 9952c0175a5be4e1ff6ef262d326a064deb25413 Mon Sep 17 00:00:00 2001
From: David Beazley <dave@dabeaz.com>
Date: Wed, 14 Sep 2016 14:26:23 -0500
Subject: [PATCH] More doc updates

---
 README.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/README.md b/README.md
index d449860..569706f 100644
--- a/README.md
+++ b/README.md
@@ -61,6 +61,11 @@ Here are a few notable features:
     SLY can be used to parse grammars consisting of several hundred
     rules (as might be found for a language like C).  
 
+SLY originates from the PLY project (http://www.dabeaz.com/ply/index.html).
+However, it's been modernized a bit.  In fact, don't expect any code
+previously written for PLY to work. That said, most of the things 
+that were possible in PLY are also possible in SLY. 
+
 An Example
 ==========
 
@@ -164,6 +169,11 @@ expressions and store variables:
             if text:
                 parser.parse(lexer.tokenize(text))
 
+Documentation
+=============
+
+Further documentation can be found in the docs directory.  
+
 Resources
 =========