lambdaclass / lambdaclass/lambda_compiler_kit
nit: add typical NFA size examples to Complexity.lean module docstring
Nobody has claimed this yet.
- Dominant language
- Lean
- Stars
- 2
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
Problem
Lck/Regex/Complexity.lean proves bounds on NFA size relative to AST size but its module docstring does not give concrete examples of what these bounds mean in practice (e.g., typical sizes for a*, (a|b)+, etc.).
Expected fix
Add a short table or a few examples to the module docstring illustrating typical NFA position counts for common patterns.
References
- Suggested by AI code review on PR #9
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Open Lck/Regex/Complexity.lean and read the module docstring alongside its NFA-size bounds. Add a short table or a few concrete examples for patterns such as a* and (a|b)+; the docstring is done when it explains typical NFA position counts in practice.
Written by the indexing model from the issue text.
Assessment
- Domain
- compilers, documentation
- Issue type
- Documentation
- Difficulty
- 1/5
- Estimated time
- Under an hour
- Activity status
- Stale
- Clarity
- Clearly specified
- Newbie friendliness
- 55/100