Browse Source

Fix a small typo

tags/gm/2021-09-23T00Z/github.com--lark-parser-lark/0.6.5
Eliot Alter 6 years ago
committed by GitHub
parent
commit
dc1754f8eb
No known key found for this signature in database GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
  1. +2
    -2
      docs/philosophy.md

+ 2
- 2
docs/philosophy.md View File

@@ -49,7 +49,7 @@ You can skip the building the tree for LALR(1), by providing Lark with a transfo

### 3. Earley is the default

The Earley algorithm can accept *any* contxet-free grammar you throw at it (i.e. any grammar you can write in EBNF, it can parse). That makes it extremely useful for beginners, who are not aware of the strange and arbitrary restrictions that LALR(1) places on its grammars.
The Earley algorithm can accept *any* context-free grammar you throw at it (i.e. any grammar you can write in EBNF, it can parse). That makes it extremely useful for beginners, who are not aware of the strange and arbitrary restrictions that LALR(1) places on its grammars.

As the users grow to understand the structure of their grammar, the scope of their target language and their performance requirements, they may choose to switch over to LALR(1) to gain a huge performance boost, possibly at the cost of some language features.

@@ -60,4 +60,4 @@ In short, "Premature optimization is the root of all evil."
- Automatically resolve terminal collisions whenever possible

- Automatically keep track of line & column numbers

Loading…
Cancel
Save