httpaf
parser
httpaf | parser | |
---|---|---|
2 | 4 | |
533 | 5 | |
0.6% | - | |
0.0 | 6.6 | |
4 months ago | 19 days ago | |
OCaml | TypeScript | |
GNU General Public License v3.0 or later | 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.
httpaf
- Parser Combinators in Haskell
-
The RustyHermit Unikernel: unikernel written in Rust
Thanks for chiming in!
Sadly cohttp is (or was) performing so bad that it is kind of at odds with using it on a unikernel.
This one is quite a bit faster:
https://github.com/inhabitedtype/httpaf
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
What are some alternatives?
ocaml-cohttp - An OCaml library for HTTP clients and servers using Lwt or Async
instaparse
dream - Tidy, feature-complete Web framework
pyparsing - Python library for creating PEG parsers
ocaml-opium-unikernel - Example unikernel using opium + httpaf (using https://github.com/dinosaure/paf-le-chien)
assert-combinators - Functional assertion combinators.
three-pass-compiler - Solution to the Three Pass Compiler kata on CodeWars, parsing and manipulating a very simple AST
ling - Erlang on Xen
parser-combinators - Parser combinators.
angstrom - Parser combinators built for speed and memory efficiency