Angstrom Files

Parser combinators built for speed and memory efficiency

This is an exact mirror of the Angstrom project, hosted at https://github.com/inhabitedtype/angstrom. SourceForge is not affiliated with Angstrom. For more information, see the SourceForge Open Source Mirror Directory.

The interactive file manager requires Javascript. Please enable it or use sftp or scp.
You may still browse the files here.

Name	Modified	Size	InfoDownloads / Week
Parent folder
README.md	2020-04-25	642 Bytes	0
v0.14.0 source code.tar.gz	2020-04-25	116.4 kB	0
v0.14.0 source code.zip	2020-04-25	135.0 kB	0
Totals: 3 Items		252.0 kB	0

Breaking Changes

count fails if its argument is negative, rather than raising. (#192)
parse_string and parse_bigstring take a required consume argument, specifying whether the parse is expected to consume a prefix of the input, or the entire input. The previous behavior was Prefix. (#196)

Features and Enhancements

improve the failure message of satisfy (#185)
add consumed and consumed_bigstring combinators, which take a parser t and returns a parser that produces the range of input that t consumed. (#163)
make pos and available part of the public API as expert, undocumented parsers. (#195)

Source: README.md, updated 2020-04-25

Other Useful Business Software

G-P - Global EOR Solution Icon

G-P - Global EOR Solution

Companies searching for an Employer of Record solution to mitigate risk and manage compliance, taxes, benefits, and payroll anywhere in the world

With G-P's industry-leading Employer of Record (EOR) and Contractor solutions, you can hire, onboard and manage teams in 180+ countries — quickly and compliantly — without setting up entities.

Learn More

The best childcare management software Icon

The best childcare management software

Customizable, mobile-friendly software that directors trust, ECE staff love, and parents rave about.

Forget ordinary childcare software. From digital enrollment to automatic billing to instant message translation, Famly is the time-saving solution that goes the extra mile for your early education center.

Learn More

Recommended Projects

Mecha
A parser combinator library for Zig
ANTLR
Parser generator to read, process, or translate structured text
LALR Parser Generator
The LALR parser generator (LPG) is a tool for developing scanners and parsers written in Java, C++ or C. Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.
SableCC
SableCC is a parser generator which generates object-oriented frameworks for building compilers, interpreters and other text parsers. SableCC keeps a clean separation between machine and user code which leads to a shorter development cycle.
Hapy
A runtime parser generator library, generates parsers for context-free grammars. Parsing scripting languages and communication protocol messages are typical use cases. The library is written in straight C++ and requires STL. Clean, correct, efficient.