mostly on computers and mathematics
Given a regular expression, list all possible strings that match it, perhaps in order of length. This seems relatively easy, perhaps breadth-first on the nodes of a finite automaton. Easiest is if the regular expression is anchored with ^ .
Post a Comment
No comments :
Post a Comment