parser
three-pass-compiler
Our great sponsors
| parser | three-pass-compiler | |
|---|---|---|
| 4 | 1 | |
| 5 | 0 | |
| - | - | |
| 6.6 | 0.0 | |
| 17 days ago | about 6 years ago | |
| TypeScript | Haskell | |
| MIT License | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
parser
-
Ramda: A practical functional library for JavaScript programmers
I find straight forward, dedicated combinators much more readable and practical to use ie. for iterables (context where it makes a lot of sense) [0] example [1], runtime assertions (through refutations, which are much faster than combinators over assertions) [2], parser combinators for smallish grammars [3] etc.
In many cases vanilla/imperative js is more readable and terse, no need to bring functional fanaticism everywhere, just in places where it gives true benefits and in form that can be understood by peers.
Functional code can be beautiful and can also be unreadable/undebugable. Same with imperative code. It's great in js/ts you can pick approach where the problem is expressed more naturally and mix it at will.
[0] https://github.com/preludejs/generator
[1] https://observablehq.com/@mirek/project-euler
[2] https://github.com/preludejs/refute
[3] https://github.com/preludejs/parser
-
Parsing Text with Nom
Parser combinators are great, we're using parser combinators in production, they are great ie. for typescript [0].
[0] https://github.com/preludejs/parser
- Parser Combinators in Haskell
- Casual Parsing in JavaScript
three-pass-compiler
What are some alternatives?
instaparse
parser-combinators - Parser combinators.
pyparsing - Python library for creating PEG parsers
assert-combinators - Functional assertion combinators.
yieldparser - Parse using JavaScript generator functions — it’s like components but for parsing!
angstrom - Parser combinators built for speed and memory efficiency
httpaf - A high performance, memory efficient, and scalable web server written in OCaml
ocaml-h2 - An HTTP/2 implementation written in pure OCaml
retro-httpaf-bench - Benchmarking environment for http servers
pidgin - build non-recursive grammars