NewYour coding agent can read the release notes before it upgrades.Set up the MCP server →
pub.dev
pub.dev
Packrat parser combinators that support static typing, generics, file spans, memoization, and more.
Latest stable
6.0.0
Last release 26 days ago
27 Oct 2026
Ships fairly regularly
a new release about every 7 months
Nearly every release is documented
notes for 10 of 10 stable releases
Nothing withdrawn
no release was ever pulled
5 years old
11 releases · first in 2021
Drag across the ruler to compare, or tap a release to open it.
Breaking: Requires belatuk_code_buffer 6.0.0, which Parser.stringify takes. Its length, span offsets and writeln() behave differently, as described in
belatuk_code_buffer 6.0.0, which Parser.stringify takes. Its length, span offsets and writeln() behave differently, as described in its changelog.chain, then and the tupleN functions give null for an element without a value, instead of the string 'NULL'. A chain with a non-nullable type, such as chain<String>, throws a StateError when an element has no value, so use a nullable type, such as chain<String?>, when that can happen.star() gives an empty list when nothing matches, instead of null.sum := sum '+' number | number, parse all of their input and group from the left, instead of stopping after one step, so 1+2+3 is no longer parsed as 1+2. A grammar that was left-recursive by accident, and relied on that rule failing, can now parse differently. any and longest no longer skip an alternative that is already being parsed at the same position; it fails there instead, as before.stringify numbers each reference, printing it as reference #1 (...) the first time and as reference #1 (printed above) after that, instead of writing (previously printed reference).cache() returns the parser itself, instead of a new parser that stringify prints as cache (...). Every parser's results are already cached for one parse, so parsing new text with a cached parser no longer returns earlier results, and a cached part of a left-recursive rule still grows.Reference.printed is removed. Each call to stringify tracks the references it has printed.any([chain([a, b]), chain([a, c])]), parse correctly.separatedByComma() no longer throws a TypeError when it matches a comma.surroundedByCurlyBraces and surroundedBySquareBrackets give defaultValue for empty braces or brackets, instead of throwing a TypeError.& and | accept a parser of any type, so they no longer throw a TypeError at run time when the two parsers' types differ. | casts the other parser's values to this parser's type.opt(backtrack: false) keeps the text consumed by a failed attempt, as documented, instead of always backtracking, and includes that text in its span. opt gives no span when the failed attempt consumed nothing.chain with failFast: false no longer throws a StateError for an element without a value once an element has failed. With a non-nullable type, the failed result then has no value. With a nullable type, it keeps the partial list of values, as before.Trampoline.memoize moves the scanner to the end of its span when it is used again, like a result memoized during parsing.stringify prints references in full again, even into a buffer that was used before or cleared.json, main, calculator, basic_auth and sexp examples run, and every interactive example stops at the end of its input instead of crashing.Your coding agent can read these notes before it upgrades. Set up the MCP server →
* Require Dart >= 3.13
* Require Dart >= 3.8
* Require Dart >= 3.5 * Updated lints to 5.0.0
lints to 5.0.0* Require Dart >= 3.3 * Updated lints to 4.0.0
lints to 4.0.0* Updated lints to 3.0.0 * Fixed lints warnings
lints to 3.0.0* Require Dart >= 3.0
Updated belatuk_code_buffer to 5.0.0
belatuk_code_buffer to 5.0.0* Require Dart >= 2.17
* Fixed license link
Upgraded from pendantic to lints linter
pendantic to lints linterbelatuk_combinator packageOne column per quarter.