Selaa lähdekoodia

pip install lark-parser -> lark

remotes/origin/gm/2021-09-23T00Z/github.com--lark-parser-lark/master
Erez Sh 3 vuotta sitten
vanhempi
commit
2ed4d5adce
5 muutettua tiedostoa jossa 5 lisäystä ja 5 poistoa
  1. +1
    -1
      README.md
  2. +1
    -1
      docs/classes.rst
  3. +1
    -1
      docs/index.rst
  4. +1
    -1
      docs/parsers.md
  5. +1
    -1
      docs/tools.md

+ 1
- 1
README.md Näytä tiedosto

@@ -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.



+ 1
- 1
docs/classes.rst Näytä tiedosto

@@ -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``.


+ 1
- 1
docs/index.rst Näytä tiedosto

@@ -56,7 +56,7 @@ Install Lark

.. code:: bash

$ pip install lark-parser
$ pip install lark

Syntax Highlighting
-------------------


+ 1
- 1
docs/parsers.md Näytä tiedosto

@@ -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**



+ 1
- 1
docs/tools.md Näytä tiedosto

@@ -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:


Ladataan…
Peruuta
Tallenna