generator
angstrom
Our great sponsors
generator | angstrom | |
---|---|---|
5 | 3 | |
4 | 616 | |
- | 1.8% | |
7.7 | 0.0 | |
6 months ago | 4 months ago | |
TypeScript | OCaml | |
MIT License | GNU General Public License v3.0 or later |
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.
generator
-
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
- Why Would Anyone Need JavaScript Generator Functions?
-
A pipe operator for JavaScript: introduction and use cases
You can type it, take a look at pipe and pipe1 in [0].
[0] https://github.com/preludejs/generator/tree/master/src
- Parser Combinators in Haskell
-
Loopless Code
Loops are great if your programming languages supports iterables/iterators/generators (also async generators) like in js/ts for example.
Especially generator-to-generator combinators ie. [0] give you terse, transducer expressiveness over computation on finite/infinite streams, arrays, etc. (all iterables). It's easy to compose them, jump into for loops if needed for arbitrary yielding (ie. yielding multiple items sometimes, skipping some, halting etc). `continue`, `break`, nesting, yield, yield from, normal code in for loops is very intuitive and terse creating pleasant, understandable code.
[0] https://github.com/preludejs/generator
angstrom
-
Anyone have suggestions on how to parse recursive grammar elements with a parser generator?
Looking at the angstrom reference here I've explored a few ideas but none of them work.
- Parser Combinators in Haskell
-
Is Ocaml From the beginning a good book? Where to learn about multicore Ocaml? Is this a good project skeleton?
Do you specifically need an LR(1) parser? If you just need to do some simple parsing, a parser combinator library like Angstrom works fine and is completely defined in OCaml code: https://github.com/inhabitedtype/angstrom
What are some alternatives?
assert-combinators - Functional assertion combinators.
ocaml-parsing - Boilerplate code for writing parsers in OCaml using Menhir + sedlex
ppipe - pipes values through functions, an alternative to using the proposed pipe operator ( |> ) for ES
comby - A code rewrite tool for structural search and replace that supports ~every language.
notion-sdk-js - Official Notion JavaScript Client
morbig - A static parser for POSIX Shell
IxJS - The Interactive Extensions for JavaScript
async-generator - Async generator module.
multicore-opam - OPAM repo for OCaml multicore development
trealla-js - Trealla Prolog for the web
parser - String parser combinators