angstrom
Parser combinators built for speed and memory efficiency (by inhabitedtype)
ocaml-asp
Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc (by yallop)
| angstrom | ocaml-asp | |
|---|---|---|
| 3 | 1 | |
| 618 | 95 | |
| 1.6% | - | |
| 0.0 | 3.0 | |
| 4 months ago | 11 months ago | |
| OCaml | OCaml | |
| GNU General Public License v3.0 or later | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
angstrom
Posts with mentions or reviews of angstrom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-22.
-
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
ocaml-asp
Posts with mentions or reviews of ocaml-asp.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-08-19.
-
Multistage Programming / First Class runtime compiler support
BER MetaOCaml is a variant of OCaml with first-class staging constructs. You can write a program that returns something of type "code for a program of type T" (possibly a function type), and then ask to compile this code and you get a value of type T. This has been used to demonstrate removing interpretation overhead in various settings, for example parser generators as a library.
What are some alternatives?
When comparing angstrom and ocaml-asp you can also consider the following projects:
ocaml-parsing - Boilerplate code for writing parsers in OCaml using Menhir + sedlex
comby - A code rewrite tool for structural search and replace that supports ~every language.
CompTime.jl - Library for compile-time computing in julia
generator - Generator module.
with-branching - An implementation of macroexpand-time conditionalization.
assert-combinators - Functional assertion combinators.
metaocaml-frex
morbig - A static parser for POSIX Shell
ocaml4noobs - Tutorial de OCaml para iniciantes na Linguagem.
multicore-opam - OPAM repo for OCaml multicore development
Numba - NumPy aware dynamic Python compiler using LLVM