Pidgin

Benchmarks in the README show Pidgin is faster and allocates less memory than Sprache and Superpower, making it efficient for parsing large inputs.

It can parse sequences of any token type, enabling use with binary formats or tokenized inputs, as highlighted in the comparison to Sprache.

Supports parsing from streaming sources like TextReader or IEnumerable, allowing efficient handling of large or continuous data without full memory loads.

Uses the `Try` combinator to enable backtracking only where needed, optimizing performance by avoiding unnecessary buffer overhead, unlike Sprache's automatic backtracking.