@@ -33,7 +33,7 @@ Most importantly, Lark will save you time and prevent you from getting parsing h | |||||
### Install Lark | ### Install Lark | ||||
$ pip install lark-parser --upgrade | |||||
$ pip install lark --upgrade | |||||
Lark has no dependencies. | Lark has no dependencies. | ||||
@@ -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 | Python's builtin ``re`` module has a few persistent known bugs and also won't parse | ||||
advanced regex features such as character classes. | 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``. | 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``. | Any instance of Lark instantiated with ``regex=True`` will use the ``regex`` module instead of ``re``. | ||||
@@ -56,7 +56,7 @@ Install Lark | |||||
.. code:: bash | .. code:: bash | ||||
$ pip install lark-parser | |||||
$ pip install lark | |||||
Syntax Highlighting | Syntax Highlighting | ||||
------------------- | ------------------- | ||||
@@ -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'`. | 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** | **SPPF & Ambiguity resolution** | ||||
@@ -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: | 1. Install Lark with the `nearley` component: | ||||
```bash | ```bash | ||||
pip install lark-parser[nearley] | |||||
pip install lark[nearley] | |||||
``` | ``` | ||||
2. Acquire a copy of the Nearley codebase. This can be done using: | 2. Acquire a copy of the Nearley codebase. This can be done using: | ||||