This is not quite a regular expression engine
Open
- Dominant language
- C
- Stars
- 1.5k
- Forks
- 212
- PR merge metrics
- No merged PRs in 30d
Description
This is not quite a regular expression engine because the features currently supported are not sufficient to recognize the regular languages. For example, $\\{a^{2n} \mid n \in \mathbb N\\}$ (as a regular expression, `(aa)*`) is regular but this engine’s features cannot describe it.
Contributor guide
No contributing guide indexed for this repository
Research direction
The issue names no files, entry points, or tests. Start by reviewing the regex engine's supported syntax and how repetition is represented, then compare it with the `(aa)*` example. Done would require a decided scope and a tested way to recognize this regular language.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- c
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100