You have test strings covering all cases and they match accordingly? The same wa... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		poisonborz 8 months ago \| parent \| context \| favorite \| on: Regex Isn't Hard (2023) You have test strings covering all cases and they match accordingly? The same way you'd know when writing manually.

bazoom42 8 months ago [–]

Covering all cases? How would that be possible? Even if we only consider ASCII strings, there are 16.000 possible two-character strings, 2 million possible three-character strings and so on.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact