Timeline for Partial matching a string against a regex
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 4, 2017 at 16:43 | comment | added | user557597 | a?b?c?d? wouldn't be correct anyway. It would have to be (?:a(?:b(?:c)?)?)? | |
| Mar 3, 2017 at 23:15 | comment | added | user557597 | You can't generate a typing regex, there is no such thing. In fact, using 0 or more sequential quantifiers, especially if nested, could cause serious backtracking problems. | |
| Feb 25, 2017 at 22:33 | comment | added | Sassan | I don't know how, what's the algorithm to generate/compute the typing regex based on the complete regex? it should work for every regex and should be done by computer. | |
| Feb 25, 2017 at 21:58 | comment | added | Maciej Kozieja | You know that you can alwasy re compute it ? | |
| Feb 25, 2017 at 21:44 | comment | added | Sassan | As I said regex is generated in runtime by enduser. So if you don't provide a way to automatically create the "typing regex" it doesn't help. | |
| Feb 25, 2017 at 21:34 | history | edited | Maciej Kozieja | CC BY-SA 3.0 | added 602 characters in body |
| Feb 25, 2017 at 21:28 | history | edited | Maciej Kozieja | CC BY-SA 3.0 | added 577 characters in body |
| Feb 25, 2017 at 21:18 | history | answered | Maciej Kozieja | CC BY-SA 3.0 |