rmuir commented on PR #13707:
URL: https://github.com/apache/lucene/pull/13707#issuecomment-2325097210
OK I took a third option here in the latest commit.
Javadoc is unchanged, we just detect the kind of "total" automaton being
created by RegExp, too, without involving any scary algorithms.
It just relaxes the check and detects total automaton that looks like this
(with a-z alphabet for demonstration):
```
State 0: accept
a-z -> State 1
State 1: accept
a-z -> State 1
```
This is what happens with `RegExp` parser today, or if you do
`Operations.repeat(Automata.makeAnyChar())`. It is only slightly "non-minimal"
and I think it doesn't make the code too ugly to handle it?
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For queries about this service, please contact Infrastructure at:
us...@infra.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For additional commands, e-mail: issues-h...@lucene.apache.org
