Skip to content

Port to latest zig-master #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
armagidon-exception wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Port to latest zig-master #2

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion .github/workflows/release.yml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ name: Release
on:
push:
tags:
- 'v*'
- "v*"

permissions:
contents: write
Expand Down
43 changes: 22 additions & 21 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,29 +21,29 @@ zig-regex is a regular expression engine for Zig featuring Thompson NFA construc

### Core Regex Features

| Feature | Syntax | Status |
|---------|--------|--------|
| **Literals** | `abc`, `123` | Stable |
| **Quantifiers** | `*`, `+`, `?`, `{n}`, `{m,n}` | Stable |
| **Alternation** | `a\|b\|c` | Stable |
| **Character Classes** | `\d`, `\w`, `\s`, `\D`, `\W`, `\S` | Stable |
| **Custom Classes** | `[abc]`, `[a-z]`, `[^0-9]` | Stable |
| **Anchors** | `^`, `$`, `\b`, `\B` | Stable |
| **Wildcards** | `.` | Stable |
| **Capturing Groups** | `(...)` | Stable |
| **Named Groups** | `(?P<name>...)`, `(?<name>...)` | Stable |
| **Non-capturing** | `(?:...)` | Stable |
| **Lookahead** | `(?=...)`, `(?!...)` | Stable |
| **Lookbehind** | `(?<=...)`, `(?<!...)` | Stable |
| **Backreferences** | `\1`, `\2` | Stable |
| **Case-insensitive** | `compileWithFlags(..., .{.case_insensitive = true})` | Stable |
| **Multiline** | `compileWithFlags(..., .{.multiline = true})` | Stable |
| **Dot-all** | `compileWithFlags(..., .{.dot_matches_newline = true})` | Stable |
| **Escaping** | `\\`, `\.`, `\n`, `\t`, `\r` | Stable |
| Feature | Syntax | Status |
| --------------------- | ------------------------------------------------------- | ------ |
| **Literals** | `abc`, `123` | Stable |
| **Quantifiers** | `*`, `+`, `?`, `{n}`, `{m,n}` | Stable |
| **Alternation** | `a\|b\|c` | Stable |
| **Character Classes** | `\d`, `\w`, `\s`, `\D`, `\W`, `\S` | Stable |
| **Custom Classes** | `[abc]`, `[a-z]`, `[^0-9]` | Stable |
| **Anchors** | `^`, `$`, `\b`, `\B` | Stable |
| **Wildcards** | `.` | Stable |
| **Capturing Groups** | `(...)` | Stable |
| **Named Groups** | `(?P<name>...)`, `(?<name>...)` | Stable |
| **Non-capturing** | `(?:...)` | Stable |
| **Lookahead** | `(?=...)`, `(?!...)` | Stable |
| **Lookbehind** | `(?<=...)`, `(?<!...)` | Stable |
| **Backreferences** | `\1`, `\2` | Stable |
| **Case-insensitive** | `compileWithFlags(..., .{.case_insensitive = true})` | Stable |
| **Multiline** | `compileWithFlags(..., .{.multiline = true})` | Stable |
| **Dot-all** | `compileWithFlags(..., .{.dot_matches_newline = true})` | Stable |
| **Escaping** | `\\`, `\.`, `\n`, `\t`, `\r` | Stable |

### Advanced Features

- **Hybrid Execution Engine**: Automatically selects between Thompson NFA (O(n*m)) and optimized backtracking
- **Hybrid Execution Engine**: Automatically selects between Thompson NFA (O(n\*m)) and optimized backtracking
- **AST Optimization**: Constant folding, dead code elimination, quantifier simplification
- **NFA Optimization**: Epsilon transition removal, state merging, transition optimization
- **Pattern Macros**: Composable, reusable pattern definitions
Expand All @@ -55,7 +55,7 @@ zig-regex is a regular expression engine for Zig featuring Thompson NFA construc
### Quality

- **Zero Dependencies**: Only Zig standard library
- **Linear Time Matching**: Thompson NFA guarantees O(n*m) worst-case
- **Linear Time Matching**: Thompson NFA guarantees O(n\*m) worst-case
- **Memory Safety**: Full control via Zig allocators, no hidden allocations, zero leaks
- **500+ Tests**: Comprehensive test suite covering core features, edge cases, regressions, and stress tests

Expand Down Expand Up @@ -241,6 +241,7 @@ MIT License - see [LICENSE](LICENSE) file for details.
## Acknowledgments

Inspired by:

- Ken Thompson's NFA construction algorithm
- RE2 (Google's regex engine)
- Rust's regex crate
Expand Down
Loading