diff --git a/README.md b/README.md index 156a671..6e764af 100644 --- a/README.md +++ b/README.md @@ -33,7 +33,7 @@ Most importantly, Lark will save you time and prevent you from getting parsing h ### Install Lark - $ pip install lark-parser --upgrade + $ pip install lark --upgrade Lark has no dependencies. diff --git a/docs/classes.rst b/docs/classes.rst index 1287896..2a1c770 100644 --- a/docs/classes.rst +++ b/docs/classes.rst @@ -13,7 +13,7 @@ Using Unicode character classes with ``regex`` Python's builtin ``re`` module has a few persistent known bugs and also won't parse advanced regex features such as character classes. -With ``pip install lark-parser[regex]``, the ``regex`` module will be +With ``pip install lark[regex]``, the ``regex`` module will be installed alongside lark and can act as a drop-in replacement to ``re``. Any instance of Lark instantiated with ``regex=True`` will use the ``regex`` module instead of ``re``. diff --git a/docs/index.rst b/docs/index.rst index e8bd6b2..e691e30 100644 --- a/docs/index.rst +++ b/docs/index.rst @@ -56,7 +56,7 @@ Install Lark .. code:: bash - $ pip install lark-parser + $ pip install lark Syntax Highlighting ------------------- diff --git a/docs/parsers.md b/docs/parsers.md index 9a24bcb..6c99ac5 100644 --- a/docs/parsers.md +++ b/docs/parsers.md @@ -7,7 +7,7 @@ An [Earley Parser](https://www.wikiwand.com/en/Earley_parser) is a chart parser Lark's Earley implementation runs on top of a skipping chart parser, which allows it to use regular expressions, instead of matching characters one-by-one. This is a huge improvement to Earley that is unique to Lark. This feature is used by default, but can also be requested explicitly using `lexer='dynamic'`. -It's possible to bypass the dynamic lexing, and use the regular Earley parser with a traditional lexer, that tokenizes as an independent first step. Doing so will provide a speed benefit, but will tokenize without using Earley's ambiguity-resolution ability. So choose this only if you know why! Activate with `lexer='basic'` +It's possible to bypass the dynamic lexing, and use the regular Earley parser with a basic lexer, that tokenizes as an independent first step. Doing so will provide a speed benefit, but will tokenize without using Earley's ambiguity-resolution ability. So choose this only if you know why! Activate with `lexer='basic'` **SPPF & Ambiguity resolution** diff --git a/docs/tools.md b/docs/tools.md index 3ea5176..ee9d2cf 100644 --- a/docs/tools.md +++ b/docs/tools.md @@ -23,7 +23,7 @@ Lark comes with a tool to convert grammars from [Nearley](https://github.com/Har 1. Install Lark with the `nearley` component: ```bash -pip install lark-parser[nearley] +pip install lark[nearley] ``` 2. Acquire a copy of the Nearley codebase. This can be done using: