equal
deleted
inserted
replaced
160 println(i + " " + "%.5f".format(time_needed(2, tmatches2(EVIL2, "a" * i)))) |
160 println(i + " " + "%.5f".format(time_needed(2, tmatches2(EVIL2, "a" * i)))) |
161 } |
161 } |
162 |
162 |
163 |
163 |
164 |
164 |
165 // while my thompson-enfa-subset-partial-function-chain |
165 // while my thompson->enfa->subset->partial-function-chain |
166 // is probably not the most effcient way to obtain a fast DFA |
166 // is probably not the most effcient way to obtain a fast DFA |
167 // (the test below should be much faster with a more direct |
167 // (the test below should be much faster with a more direct |
168 // construction), in general the DFAs can be slow because of |
168 // construction), in general the DFAs can be slow because of |
169 // the state explosion in the subset construction |
169 // the state explosion in the subset construction |
170 |
170 |