From 443a9544e427b7dc6bbfbb33f6a69b2882280b3a Mon Sep 17 00:00:00 2001 From: Erez Shinan Date: Wed, 24 Jan 2018 14:44:09 +0200 Subject: [PATCH] Updated README --- README.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 794a203..6031f10 100644 --- a/README.md +++ b/README.md @@ -2,9 +2,9 @@ Parse any context-free grammar, FAST and EASY! -**Beginners**: Forget everything you knew about parsers. Lark's algorithm can quickly parse any grammar you throw at it, no matter how complicated. It also constructs a parse-tree for you, without additional code on your part. +**Beginners**: Lark is not just another parser. It can parse any grammar you throw at it, no matter how complicated or ambiguous, and do so efficiently. It also constructs a parse-tree for you, without additional code on your part. -**Experts**: Lark lets you choose between Earley and LALR(1), to trade-off power and speed. It also contains experimental features such as a contextual-lexer. +**Experts**: Lark lets you choose between Earley and LALR(1), to trade-off power and speed. It also contains a CYK parser and experimental features such as a contextual-lexer. Lark can: @@ -72,6 +72,7 @@ See more [examples in the wiki](https://github.com/erezsh/lark/wiki/Examples) - **LALR(1)** parser - Fast and light, competitive with PLY - Can generate a stand-alone parser + - **CYK** parser, for highly ambiguous grammars (NEW! Courtesy of [ehudt](https://github.com/ehudt)) - **EBNF** grammar - **Unicode** fully supported - **Python 2 & 3** compatible