Rooba
/
lark
mirror of https://github.com/lark-parser/lark.git
1
1
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Updated Philosophy (markdown)

Erez Shinan 2017-11-04 21:10:46 +02:00
parent 688d0adf74
commit 87090fe819
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Philosophy.md

@ -42,6 +42,8 @@ You can skip the creation of the tree for LALR(1), by providing a callback (see
Although Earley is the slower alternative, it has the huge benefit of accepting any context-free grammar (i.e. any grammar you can write in EBNF, it can parse).
That means you can use Lark to toy around with your language, and worry about performance later. Don't forget: "Premature optimization is the root of all evil!"
Notes:
- Some approaches and grammar structures are faster than others. If you care about speed, you can learn them gradually while your code is already working.
- Nondeterminstic grammars and ambiguous grammars will run a little slower