News for hackers. Stuff that matters.
Re:Frak takes an entirely different approach to generating r... by samatman on Thursday August 15, 2013 @12:04PM (#6218678)
You're asking for implicit induction, which is not what the user would want in the general case. "a" "aaa" "aaaaa" could be expanded to "a(aa){0,2}" through deduction, and no more.

since frak is using a trie, this kind of encoding should be a conceptually straightforward extension of the existing parse structure.

Re:Frak takes an entirely different approach to generating r... by noprompt on Thursday August 15, 2013 @01:18PM (#6219294)
These expansions are certainly possible and I'm planning to investigate whether they have performance benefits. One interesting discovery we made last weeks is that `(a|b|c)` actually produces a larger state table than `[abc]`. This was both the case for Java and Vim. While the performance gains are minute, nevertheless, they are gains.

I haven't checked if "a{4}", for example, is faster than "aaaa" or produces fewer states. But it's something I am interested in. I just haven't had enough time this week.