| parser | refute | |
|---|---|---|
| 4 | 3 | |
| 5 | 9 | |
| - | - | |
| 7.7 | 5.9 | |
| 25 days ago | 7 months ago | |
| TypeScript | TypeScript | |
| MIT License | 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
refute
-
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
-
Ask HN: Why isn't JSON-RPC more widely adopted?
We use jsonrpc over websockets in production for many years in trading services. It works very well. We use lightweight libraries that look like this [0] and this [1]. It's lightweight, fast, type safe, easy to maintain and debug etc.
[0] https://github.com/preludejs/jsonrpc
[1] https://github.com/preludejs/refute
-
An Inconsistent Truth: Next.js and Typesafety
Types can be asserted at runtime (parsed) at IO boundaries (reading http request or response, websocket message, parsing json file etc). Once they enter statically type system they don't need to be asserted again.
The difference it makes is illusion of type-safety vs type-safety this article touches on.
You can try to bind service with client somehow but in many cases this will fail in production as you can't guarantee paired versioning, due to normal situations by design of your architecture or temporary mid-deployment state or other team doing something they were not suppose to do etc. It's hard to avoid runtime parsing in general.
Functional combinators [0] or faster [1] with predicate/assert semantics work very well with typescript, which is very pleasant language to work with.
[0] https://github.com/appliedblockchain/assert-combinators
[1] https://github.com/preludejs/refute
What are some alternatives?
instaparse
assert-combinators - Functional assertion combinators.
pyparsing - Python library for creating PEG parsers
next-rpc - makes exported functions from API routes accessible in the browser. Just import your API function and call it anywhere you want.
sick - Streams of Independent Constant Keys
three-pass-compiler - Solution to the Three Pass Compiler kata on CodeWars, parsing and manipulating a very simple AST
gradual-typing-bib - A bibliography on Gradual Typing
parser-combinators - Parser combinators.
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