More doc updates

This commit is contained in:
David Beazley 2016-09-14 14:26:23 -05:00
parent 0a17f78d2e
commit 9952c0175a

View File

@ -61,6 +61,11 @@ Here are a few notable features:
SLY can be used to parse grammars consisting of several hundred SLY can be used to parse grammars consisting of several hundred
rules (as might be found for a language like C). 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 An Example
========== ==========
@ -164,6 +169,11 @@ expressions and store variables:
if text: if text:
parser.parse(lexer.tokenize(text)) parser.parse(lexer.tokenize(text))
Documentation
=============
Further documentation can be found in the docs directory.
Resources Resources
========= =========