An open API service indexing awesome lists of open source software.

https://github.com/doeixd/combi-parse

Type-safe, friendly parser combinator library for TypeScript featuring composable parsers, left-recursion support, detailed error reporting, and Unicode character classes.
https://github.com/doeixd/combi-parse

combinators grammar parser parser-combinators typescript typescript-library

Last synced: 5 months ago
JSON representation

Type-safe, friendly parser combinator library for TypeScript featuring composable parsers, left-recursion support, detailed error reporting, and Unicode character classes.

Awesome Lists containing this project

README

          

[![NPM Version](https://img.shields.io/npm/v/@doeixd/combi-parse.svg)](https://www.npmjs.com/package/@doeixd/combi-parse)
[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
[![Build Status](https://img.shields.io/badge/build-passing-brightgreen.svg)](#)
[![TypeScript](https://img.shields.io/badge/%3C/%3E-TypeScript-%230074c1.svg)](http://www.typescriptlang.org/)

# Combi-Parse

A friendly, powerful, and type-safe parser combinator library for TypeScript. It helps you transform raw, structured text into meaningful data with confidence and clarity.

Combi-Parse is built on a simple but powerful idea: **parser combinators**. Think of them like Lego blocks. You start with tiny, simple parsers that do one thing well (like matching the word "let" or a number). You then "combine" these blocks to build bigger, more sophisticated parsers that can understand complex structures, like a programming language or a JSON file.

The library handles the complex detailsβ€”like tracking the current position in the text, managing state, and reporting helpful errorsβ€”so you can focus on describing the *what* of your data's grammar, not the *how*.


## πŸ“₯ Installation

```bash
npm install @doeixd/combi-parse
```


## πŸš€ Quick Start: A Guided Tour

Let's build our first parser. Our goal is to parse a simple variable declaration string like `let user = "jane";` and turn it into a structured JavaScript object.

We'll build this up step-by-step to understand what’s happening.

### Step 1: Understanding the "Parser"

First, what *is* a parser in this library?

A parser is an object that "knows" how to recognize a specific piece of text. It's not the *result* itself; it's the *machine* that produces the result. Every parser has a `.parse()` method that you run on an input string.

Let's make the simplest possible parser: one that recognizes the exact word `let`.

```typescript
import { str } from '@doeixd/combi-parse';

// Create a parser that looks for the literal string 'let'.
const letParser = str('let');

// Let's run it!
const result = letParser.parse('let there be light');

console.log(result); // Output: 'let'

// What happens if it fails?
try {
letParser.parse('const there be light');
} catch (error) {
console.error(error.message); // Output: "ParseError at 1:1, expected 'let' but got 'const...'"
}
```
As you can see, a parser either successfully returns the value it parsed or throws a descriptive error.

### Step 2: Handling Patterns and Whitespace

Hardcoding every string isn't enough. We need to parse things like variable names, which follow a pattern. For that, we use the `regex` parser.

We also need to handle whitespace. It would be annoying to manually parse spaces after every token. This is where `lexeme` comes in. A **lexeme** is a token followed by any insignificant trailing whitespace.

`lexeme()` is a **higher-order parser**: it takes a parser as input and returns a *new* parser that does the original job and *also* consumes any whitespace that follows.

```typescript
import { str, regex, lexeme } from '@doeixd/combi-parse';

// `lexeme` wraps our basic parsers to also handle trailing whitespace.
// This makes composing them much cleaner.

// A parser for the 'let' keyword, ignoring any space after it.
const letKeyword = lexeme(str('let'));

// A parser for a variable name using a regular expression.
const identifier = lexeme(regex(/[a-zA-Z_][a-zA-Z0-9_]*/));

// A parser for the equals sign.
const equals = lexeme(str('='));

// We don't need lexeme for the final semicolon, as there's no trailing space to consume.
const semicolon = str(';');
```

### Step 3: Parsing a Sequence of Things

Now we have parsers for the individual pieces: `let`, `user`, `=`, and `;`. We need to tell Combi-Parse to run them in a specific order. For that, we use the `sequence` combinator.

`sequence` takes an array of parsers and runs them one after another. If they all succeed, it returns an array of their results.

```typescript
// ... imports and parsers from above

// Let's define a parser for a string literal like "jane".
// The `between` parser is perfect for this. It parses whatever is
// between a start and end token.
const stringLiteral = between(str('"'), regex(/[^"]*/), str('"'));

// Now, let's combine everything into a sequence.
const declarationParser = sequence([
letKeyword,
identifier,
equals,
stringLiteral,
semicolon
]);

// Run it on our input string.
const result = declarationParser.parse('let user = "jane";');

console.log(result);
// Output: [ 'let', 'user', '=', 'jane', ';' ]
```
It worked! We got back an array of all the successfully parsed parts.

### Step 4: Transforming the Result into Something Useful

The array `['let', 'user', '=', 'jane', ';']` is correct, but it’s not very useful. We want a clean object like `{ name: 'user', value: 'jane' }`.

The `sequence` combinator can take a second argument: a **mapper function**. This function receives the array of results and lets you transform it into any shape you want.

This is also where `as const` becomes incredibly useful. By adding `as const` to our array of parsers, we give TypeScript more precise information. It knows *exactly* what type is at each position in the array (e.g., the first element is a `string`, the second is a `string`, etc.), giving us perfect type-safety and autocompletion in our mapper function!

### Final Code: Putting It All Together

```typescript
import { str, regex, sequence, between, lexeme } from '@doeixd/combi-parse';

// 1. Define parsers for the smallest pieces (tokens).
// `lexeme` is a helper that wraps a parser to also consume trailing whitespace.
const letKeyword = lexeme(str('let'));
const identifier = lexeme(regex(/[a-zA-Z_][a-zA-Z0-9_]*/));
const equals = lexeme(str('='));
const semicolon = str(';');

// A string literal is any text between double quotes.
const stringLiteral = between(str('"'), regex(/[^"]*/), str('"'));

// 2. Compose the small parsers into a larger one that understands a sequence.
const declarationParser = sequence(
// The list of parsers to run in order.
[
letKeyword,
identifier,
equals,
stringLiteral,
semicolon,
] as const, // `as const` tells TypeScript to infer the exact shape of the results array.

// 3. Transform the raw results into a clean, structured object.
// We only care about the identifier (name) and the string literal (value).
// Because of `as const`, TypeScript knows `name` and `value` are strings!
([_let, name, _eq, value, _semi]) => ({
type: 'declaration',
name,
value
})
);

// 4. Run it!
const result = declarationParser.parse('let user = "jane";');

// The output is a perfectly typed and structured object.
console.log(result);
// Output: { type: 'declaration', name: 'user', value: 'jane' }
```
And there you have it! You've seen the core idea: **build big, powerful parsers by combining small, simple ones.**


## The Power of Composition: A Full JSON Parser

You can use these same building blocks to create a complete, robust parser for a complex format like JSON. This demonstrates how the simple ideas of `sequence`, `choice`, and `many` can scale up.

A new concept here is `lazy()`. Since JSON can be recursive (an object can contain other objects), we need a way to reference a parser before it's fully defined. `lazy()` acts as a placeholder for this purpose.

```typescript
import { str, regex, sequence, choice, between, many, sepBy, lazy, lexeme, Parser } from '@doeixd/combi-parse';

// `lazy()` lets us define recursive parsers, since a `jsonValue`
// can contain other `jsonValue`s (e.g., in an array or object).
const jsonValue: Parser = lazy(() => choice([
str('null').map(() => null),
str('true').map(() => true),
str('false').map(() => false),
regex(/-?\d+(\.\d+)?/).map(Number),
between(str('"'), regex(/[^"]*/), str('"')),
jsonArray, // A value can be an array...
jsonObject // ...or an object.
]));

const jsonString = between(str('"'), regex(/[^"]*/), str('"'));

// A property is a key-value pair, like "name": "John"
const jsonProperty = sequence(
[lexeme(jsonString), str(':'), jsonValue] as const,
([key, , value]) => [key, value]
);

// An object is a comma-separated list of properties between curly braces.
const jsonObject = between(
lexeme(str('{')),
sepBy(jsonProperty, lexeme(str(','))),
str('}')
).map(pairs => Object.fromEntries(pairs));

// An array is a comma-separated list of values between square brackets.
const jsonArray = between(
lexeme(str('[')),
sepBy(jsonValue, lexeme(str(','))),
str(']')
);

// Run the final parser on a complex JSON string.
const parsed = jsonValue.parse('{"users": [{"id": 1, "name": "Alice"}]}');
console.log(parsed.users[0].name); // "Alice"
```
This parser is readable, reusable, and type-safe. Each component can be tested and used independently.


## ✨ Core Philosophy

We designed Combi-Parse around a few key principles to make parsing a better experience.

* βœ… **Type-Safety First**: The library leverages TypeScript's type system to the fullest. You get precise type inference and compile-time validation, so if your grammar changes, your code will tell you what needs fixing.

* 🧩 **Radical Composability**: Every parser is a small, reusable component. This lets you build incredibly complex grammars from simple, testable pieces. A parser for a `number` can be used in a parser for a `date`, which can be used in a parser for a `log file`.

* πŸ“ **Human-Friendly Errors**: Say goodbye to `undefined is not a function`. Combi-Parse gives you precise error locations with line and column numbers, along with contextual messages that tell you *what* the parser was trying to do when it failed.

* πŸ› οΈ **A Tool for Every Task**: Real-world parsing is more than just text. Combi-Parse provides specialized toolkits for different domains, so you always have the right tool for the job.



## ✨ Principles & Capabilities

You've seen the basics of combining parsers. Now, let's explore what makes Combi-Parse uniquely suited for real-world scenarios. The library is built on a few core principles that address common parsing challenges.

### 1. Precise Type-Safety: Catch Errors Before You Run

While many tools might return a generic `string[]` or `any`, Combi-Parse is designed to give you the most precise types possible. This allows TypeScript to catch logical errors in your parsing code at compile time, long before it ever runs.

A key pattern is using `as const` with the `sequence` combinator. This gives TypeScript enough information to infer the exact type of each element in your parsed sequence.

```typescript
import { sequence, str, regex, number } from '@doeixd/combi-parse';

const declaration = sequence(
[
str('let'),
regex(/[a-z]+/), // Our identifier
str('='),
number, // Our value
] as const, // `as const` helps TypeScript infer the exact tuple type

// Because of `as const`, TypeScript knows the exact type of each element.
([_let, name, _eq, value]) => ({ name, value })
);

const result = declaration.parse('let age = 42');

// No more guesswork.
// result.name is known to be a `string`.
// result.value is known to be a `number`.
console.log(`Variable '${result.name}' has value ${result.value}.`);
```

### 2. First-Class Composability: Build Reusable Grammars

In Combi-Parse, parsers are first-class values. You can store them in variables, pass them to functions, and compose them in flexible and powerful ways. This enables you to create **higher-order parsers**β€”functions that build new parsersβ€”to eliminate boilerplate and make your grammars more modular and maintainable.

For example, you can create a function that wraps any parser to add a timestamp to its result:

```typescript
import { Parser, regex } from '@doeixd/combi-parse';

// A higher-order parser that takes any parser and enhances its result.
function withTimestamp(parser: Parser): Parser<{ data: T, timestamp: number }> {
return parser.map(data => ({
data,
timestamp: Date.now()
}));
}

// Now, apply it to an existing parser to create a new, timestamp-aware one.
const timestampedErrorLog = withTimestamp(regex(/ERROR: .*/));

const log = timestampedErrorLog.parse('ERROR: DB connection failed');
// log -> { data: "ERROR: DB connection failed", timestamp: 167... }
```

### 3. Generator Syntax: Clean Code for Complex Sequences

Deeply nested `sequence` and `.chain()` calls can become hard to read. For complex, multi-step parsing, you can use `genParser` to write your logic in a clean, imperative style that looks just like standard synchronous code, improving readability and maintainability.

```typescript
import { genParser, anyOf, str, regex } from '@doeixd/combi-parse/generator';

const httpHeaderParser = genParser(function* () {
const method = yield anyOf(['GET', 'POST', 'PUT'] as const);
yield str(' ');
const path = yield regex(/[\w\/]+/);
yield str(' HTTP/1.1\r\n');

// This style makes it easy to add loops for parsing multiple header lines.

return { method, path };
});

const header = httpHeaderParser.parse('GET /api/users HTTP/1.1\r\n...');
// header -> { method: 'GET', path: '/api/users' }
```

### 4. Binary Parsing: Go Beyond Text

Parsing isn't just for text. With the dedicated binary toolkit, you can apply the same combinator approach to decode file formats, network protocols, or any structured binary data. It handles details like endianness and data views automatically.

```typescript
import { Binary } from '@doeixd/combi-parse/binary';

// A parser for a simple image header.
const imageHeaderParser = Binary.sequence([
Binary.u32BE, // Width, 4 bytes, big-endian
Binary.u32BE, // Height, 4 bytes, big-endian
Binary.u8, // Color depth (1 byte)
Binary.string(3), // Image type, e.g., "IMG" (3 bytes)
] as const).map(([width, height, depth, type]) => ({
width, height, depth, type
}));

// Create a sample buffer: 1024x768, 8-bit depth, "IMG"
const buffer = new Uint8Array([
0, 0, 4, 0, // 1024
0, 0, 3, 0, // 768
8, // 8
73, 77, 71 // "IMG"
]).buffer;

const header = imageHeaderParser.parse(buffer, 0);
// header -> { width: 1024, height: 768, depth: 8, type: 'IMG' }
```

### 5. Stream Processing: Handle Large-Scale Data

What if your input is a 10GB log file or a real-time data feed? Loading it all into memory is not an option. The stream processing engine allows you to parse enormous datasets chunk-by-chunk with constant memory usage.

```typescript
import { createStreamSession, lift } from '@doeixd/combi-parse/stream';
import { jsonObjectParser } from './my-json-parser'; // Assume a JSON object parser
import { whitespace } from '@doeixd/combi-parse';

// Create a session to parse a stream of JSON objects separated by newlines.
const session = createStreamSession(
lift(jsonObjectParser), // Parser for one item
lift(whitespace) // Delimiter between items
);

// Process each item as it's parsed.
session.on('item', ({ value: log }) => {
if (log.level === 'ERROR') {
// A security alert was logged.
}
});

// Feed data chunks as they arrive from a file or network.
session.feed('{"level":"INFO", "msg":"User logged in"}\n{"level":"ERROR"');
session.feed(', "msg":"DB connection failed"}\n'); // Handles incomplete chunks automatically

session.end();
```

### 6. Advanced Engines: Built for Demanding Applications

Combi-Parse includes specialized engines for the most demanding use cases, ensuring you have the right tool for any job.

- **Incremental Parsing:** For applications like **code editors and IDEs**, this engine can re-parse a document after a small text change by reusing unchanged parts of the parse tree. This enables near-instant feedback for features like live error checking and syntax highlighting.
```typescript
// In an editor environment:
const session = createIncrementalSession(myLanguageParser);
await session.parse(initialDocument);

// When the user types 'x':
await session.parse(newDocument, [{ range, text: 'x' }]); // Re-parses in milliseconds
```

- **Secure Parsing:** When parsing **untrusted user input**, a cleverly crafted string can cause some parsers to enter an infinite loop or use exponential amounts of memory. The secure parsing engine runs your parser in a sandbox with resource limits.
```typescript
const safeParser = createSecureSession(myParser, {
maxDepth: 50, // Limit recursion to prevent stack overflows
maxParseTime: 1000, // Timeout after 1 second
});

try {
safeParser.parse(maliciousUserInput);
} catch (e) {
console.log('A security violation was caught.');
}
```

## 🧰 A Tool for Every Task: Parsing Paradigms

Combi-Parse gives you a toolkit of specialized approaches so you can choose the right one for your project.

| Paradigm | Best For... | Example Import |
| :--- | :--- | :--- |
| **Traditional Combinators** | General parsing, functional style | `import { sequence } from '@doeixd/combi-parse';` |
| **Generator-Based Parsing** | Complex, multi-step, or stateful logic | `import { genParser } from '@doeixd/combi-parse';` |
| **Binary Data Parsing** | File formats, network protocols | `import { Binary } from '@doeixd/combi-parse/binary';` |
| **Stream Processing** | Large files, real-time data feeds | `import { createStreamParser } from '@doeixd/combi-parse/stream';` |
| **Incremental Parsing** | Code editors, IDEs, live previews | `import { IncrementalParser } from '@doeixd/combi-parse/incremental';` |
| **Secure Parsing** | Untrusted user input, API endpoints | `import { SecureParser } from '@doeixd/combi-parse/secure';` |
| **Type-Level Regex** | Compile-time validation, type-safe patterns | `import type { CompileRegex } from '@doeixd/combi-parse/regex';` |


## πŸ“– Documentation & Learning

Ready to build your own parser? We have comprehensive documentation to guide you.

| To... | See... |
| :--- | :--- |
| **Understand the fundamentals** | **[Core Concepts](docs/core-concepts.md)** |
| **Follow a guided example** | **[Tutorial: Your First Parser](docs/tutorial.md)** |
| **See a real-world example** | **[Complete JSON Parser Example](docs/examples/json.md)** |
| **Choose the right tools** | **[API Overview](docs/api/overview.md)** |
| **Handle tricky situations** | **[Advanced Techniques](docs/advanced-techniques.md)** |
| **Parse a binary file format** | **[Binary Parsing Guide](docs/binary.md)** |
| **Handle a real-time data feed**| **[Async & Streaming Guide](docs/async-streaming.md)** |
| **Write a type-safe regex** | **[Type-Level Regex Guide](docs/regex-and-type-safety.md)** |
| **Tune for speed** | **[Performance Guide](docs/performance.md)** |
| **Fix a common problem** | **[Troubleshooting Guide](docs/troubleshooting.md)** |


# API Reference

A guide to the Combi-Parse library, organized by module and functionality.

### Primitive Parsers

These are the fundamental building blocks for recognizing basic patterns.

#### String & Pattern Matching

**str(text: string)** β†’ `Parser`
Matches the exact string `text`.
```javascript
str("let") // matches "let" exactly
```

**regex(pattern: RegExp)** β†’ `Parser`
Matches a regular expression. The pattern is automatically anchored to the current position.
```javascript
regex(/\d+/) // matches one or more digits
```

**charClass(...classes)** β†’ `Parser`
Matches a single character from a type-safe class (e.g., `'Digit'`) or a custom string.
```javascript
charClass('Digit') // matches 0-9
charClass('aeiou') // matches vowels
```

**anyOf(strings: readonly string[])** β†’ `Parser`
Matches any of the provided literal strings. A type-safe and ergonomic alternative to `choice`.
```javascript
anyOf(['GET', 'POST'] as const) // matches HTTP methods
```

#### Character & Number Parsing

**number** β†’ `Parser`
Parses an integer or floating-point number.
```javascript
number // matches "123", "3.14", "-42"
```

**anyChar** β†’ `Parser`
Consumes and returns any single character. Fails only at the end of input.

**noneOf(chars: string)** β†’ `Parser`
Matches any single character that is *not* in the `chars` string.
```javascript
noneOf('()[]{}') // matches any char except brackets
```

**whitespace** β†’ `Parser`
Matches one or more whitespace characters (`\s+`).

#### Control Flow

**succeed(value: T)** β†’ `Parser`
Always succeeds with the given `value`, consuming no input. Useful for injecting defaults.

**fail(message: string)** β†’ `Parser`
Always fails with the given `message`, consuming no input. For semantic validation.

**eof** β†’ `Parser`
Succeeds only at the very end of the input string, ensuring it was all consumed.

### Combinator Functions

These higher-order functions assemble simple parsers into more complex ones.

#### Sequence & Choice

**sequence(parsers: Parser[], mapper?: Function)** β†’ `Parser`
Runs parsers in order. Returns an array of results, or a transformed value via the optional `mapper`.
```javascript
sequence([str('('), number, str(')')], ([, num]) => num)
```

**choice(parsers: Parser[])** β†’ `Parser`
Tries parsers in order, returning the first success. Provides intelligent, combined error messages.
```javascript
choice([str('true'), str('false'), number])
```

#### Repetition

**many(parser: Parser)** β†’ `Parser`
Matches the `parser` zero or more times. Returns an array of results. Never fails.
```javascript
many(regex(/\w/)) // matches zero or more word characters
```

**many1(parser: Parser)** β†’ `Parser`
Matches the `parser` one or more times. Fails if it can't match at least once.

**count(n: number, parser: Parser)** β†’ `Parser`
Matches the `parser` exactly `n` times.
```javascript
count(3, regex(/\d/)) // matches exactly 3 digits
```

#### Lists & Separators

**sepBy(item: Parser, sep: Parser)** β†’ `Parser`
Matches zero or more `item`s separated by `sep`. Ideal for lists like `1,2,3`.
```javascript
sepBy(number, str(',')) // matches "1,2,3" or ""
```

**sepBy1(item: Parser, sep: Parser)** β†’ `Parser`
Matches one or more `item`s separated by `sep`.
```javascript
sepBy1(number, str(',')) // matches "1,2,3" but not ""
```

#### Delimiters & Structure

**between(left: Parser, content: Parser, right: Parser)** β†’ `Parser`
Matches `content` surrounded by `left` and `right` delimiters.
```javascript
between(str('('), number, str(')')) // matches "(42)"
```

**until(terminator: Parser)** β†’ `Parser`
Consumes characters as a string until the `terminator` parser succeeds. Perfect for comments or string contents.
```javascript
until(str('*/')) // matches everything until "*/"
```

#### Advanced Combinators

**lazy(fn: () => Parser)** β†’ `Parser`
Defers parser creation. **Essential for recursive grammars** (e.g., a JSON value parser).
```javascript
const jsonValue = lazy(() => choice([jsonObject, jsonArray, str('null')]))
```

### Parser Class Methods

These methods can be chained onto any parser instance for a fluent-style API.

#### Transformation

**.map(fn: (value: T) => U)** β†’ `Parser`
Transforms a parser's successful result. The most common way to shape your output data.
```javascript
regex(/\d+/).map(Number) // parse digits and convert to number
```

**.tryMap(fn: (value: T) => Result)** β†’ `Parser`
Transforms a result using a function that can *also fail*. Used for semantic validation after a successful parse.
```javascript
number.tryMap(n => n < 256 ? success(n) : fail('too large'))
```

**.chain(fn: (value: T) => Parser)** β†’ `Parser`
Sequences another parser where the next logic depends on the result of the first. The most powerful way to create dynamic parsers.
```javascript
str('repeat').chain(() => number).chain(n => count(n, anyChar))
```

#### Alternatives & Options

**.or(other: Parser)** β†’ `Parser`
Provides an alternative `other` parser if the first one fails *without consuming input*.
```javascript
str('yes').or(str('no')) // matches either "yes" or "no"
```

**.optional()** β†’ `Parser`
Makes a parser optional. Succeeds with `null` if the parser would have failed.
```javascript
str('const').optional() // matches "const" or nothing
```

#### Sequencing

**.keepLeft(other: Parser)** β†’ `Parser`
Runs `other` parser after, but keeps the result of the first one.
```javascript
str('hello').keepLeft(whitespace) // matches "hello " but returns "hello"
```

**.keepRight(other: Parser)** β†’ `Parser`
Runs `other` parser after, but keeps the result of the second one.
```javascript
str('$').keepRight(number) // matches "$42" but returns 42
```

#### Utilities

**.slice()** β†’ `Parser`
Returns the raw string slice consumed by the parser instead of its structured result.
```javascript
many1(regex(/\w/)).slice() // returns the matched word as a string
```

**.debug(label: string)** β†’ `Parser`
Adds console logging to a parser's execution for debugging, without changing its behavior.
```javascript
number.debug('parsing number') // logs debug info when parsing
```

### Error Handling & Advanced Control

**lexeme(parser: Parser)** β†’ `Parser`
Wraps a parser to also consume and discard any trailing whitespace. The key to writing clean, robust grammars.
```javascript
const token = (p) => lexeme(p) // helper for whitespace-aware parsing
```

**label(parser: Parser, msg: string)** β†’ `Parser`
Replaces a parser's default error message with a more descriptive `msg`.
```javascript
label(number, 'expected a number') // custom error message
```

**context(parser: Parser, msg: string)** β†’ `Parser`
Adds context to an error message, showing *what* the parser was trying to do when it failed.
```javascript
context(functionCall, 'in a function call') // adds context to errors
```

**lookahead(parser: Parser)** β†’ `Parser`
Succeeds if `parser` would match, but consumes no input. A "positive lookahead".
```javascript
lookahead(str('if')).keepRight(keyword) // checks for 'if' without consuming
```

**notFollowedBy(parser: Parser)** β†’ `Parser`
Succeeds if `parser` would *fail* to match. Consumes no input. A "negative lookahead", great for resolving ambiguity.
```javascript
str('if').keepLeft(notFollowedBy(regex(/\w/))) // 'if' not followed by word char
```

**memo(parser: Parser)** β†’ `Parser`
Memoizes a parser's result at each position, dramatically improving performance for grammars with lots of backtracking.

**leftRecursive(fn: () => Parser)** β†’ `Parser`
Correctly **handles** left-recursive grammars (e.g., `expr = expr + term`), which would cause infinite loops in simple parsers.

## Generator-Based Parsing (`@doeixd/combi-parse/generator`)

For writing parsers with a more readable, imperative `async/await`-like style.

**genParser(fn: GeneratorFunction)** β†’ `Parser`
Creates a parser from a generator function. Inside, `yield` a parser to run it and get its result. `return` the final value.
```javascript
const parser = genParser(function* () {
yield str('(')
const num = yield number
yield str(')')
return num
})
```

**`asyncGenParser(fn: AsyncGeneratorFunction)`** β†’ `AsyncParser`
Creates a parser from an `async function*`. Allows you to `await` promises (e.g., DB calls, API requests) inside your parsing logic.

**gen** β†’ `object`
A helper object with control-flow utilities for use inside `genParser`, like `gen.tryParsers(...)` and `gen.while(...)`.


## 🀝 Contributing

We welcome contributions! Whether it's reporting a bug, improving documentation, or submitting a pull request, we'd love to have your help. Please see our contributing guidelines for more details.


## πŸ“„ License

MIT License - see the [LICENSE](LICENSE) file for details.