package angstrom
Parser combinators built for speed and memory-efficiency
Install
Authors
Maintainers
Sources
0.6.0.tar.gz
md5=07c9be4a5dc20e390f4cd1df0aedc589
Description
Angstrom is a parser-combinator library that makes it easy to write efficient, expressive, and reusable parsers suitable for high-performance applications. It exposes monadic and applicative interfaces for composition, and supports incremental input through buffered and unbuffered interfaces. Both interfaces give the user total control over the blocking behavior of their application, with the unbuffered interface enabling zero-copy IO. Parsers are backtracking by default and support unbounded lookahead.
Published: 24 Jul 2017
Dependencies (5)
- result
-
ocplib-endian
>= "0.6"
-
cstruct
>= "0.7.0" & < "6.1.0"
-
jbuilder
>= "1.0+beta10"
-
ocaml
>= "4.03.0"
Dev Dependencies (1)
-
alcotest
with-test & >= "0.6.0" & < "0.8.0"
Used by (19)
-
angstrom-async
< "0.7.0"
- angstrom-lwt-unix
- angstrom-unix
-
coin
< "0.1.2"
-
colombe
< "0.2.0"
- dap
-
earlybird
< "1.0.0"
-
email_message
>= "v0.10.0" & < "v0.14.0"
-
graphql
< "0.4.0"
-
graphql_parser
< "0.5.0"
-
hpack
!= "0.9.0"
-
icalendar
< "0.1.4"
- multipart_form-lwt
- nosetup
-
osbx
< "1.2.4"
- piaf
-
tldr
< "0.3.0"
-
uuuu
< "0.2.0"
-
vcaml
< "v0.14.0"
Conflicts
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page