Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

nit: add typical NFA size examples to Complexity.lean module docstring

Open
#35 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
1/5
Estimated time
Under an hour
Newbie friendliness
55/100
Issue type
Documentation
Clarity
Clearly specified
Activity status
Stale

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.

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
Dominant language
Lean
Stars
2
Forks
1
PR merge metrics
No merged PRs in 30d

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from lambdaclass/lambda_compiler_kit

All issues in lambdaclass/lambda_compiler_kit

Similar issues

More Compilers issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.