|
||||||||||||||||||
Add Forum to Favorites | Send Topic To a Friend | View Forum FAQ | Track this topic |
Last Thread Next Thread ![]() |
| Algorithmic Forays Part 4 |
|
![]() randomZ Member since: 8/17/2002 From: Germany |
||||
|
|
||||
| You rule. I continue to like each of your articles better than the last one. Keep it up! --- Just trying to be helpful. Sebastian Beschke Just some student from Germany http://zqf.de/randomz/ |
||||
|
||||
![]() spur4444 Member since: 3/9/2004 From: Haifa, Holy Land |
||||
|
|
||||
| Thanks ! |
||||
|
||||
![]() Box2020 Member since: 6/22/2001 |
||||
|
|
||||
| This is a great set of articles but I must ask - Why not generalise the NFA class as a template with input type as a parameter, or is this part of the "KISS" principle? |
||||
|
||||
![]() spur4444 Member since: 3/9/2004 From: Haifa, Holy Land |
||||
|
|
||||
Quote: This is an indeed part of the KISS principle. As I mentioned, I have no goal to create a very general NFA class - such classes exist, some probably better than I can ever make. My goal is a simple NFA class for my own needs. Generalizing when it's not required can be dangerous. I might get hooked with handling things I don't even need, just for the sake of keeping the class general. I don't want to get into it. |
||||
|
||||
![]() Anonymous Poster |
||||
|
||||
| I've seen mentioned in your article and others that an algorithm to convert directly from a regular expression to a DFA exists, but I haven't been able to locate one. Do you have a link to such an algorithm or a name I could search on? Also, are there methods of combining DFAs in a similar manner to how the NFAs are combined with the concat, alter, and star operations? The reason I ask is I was trying to construct a DFA with a large number of wildcards and the conversion from a NFA to a DFA was generating thousands of nodes. I thought I could minimize individual DFAs and then combine then with the hope of reducing the size of the total DFA, but then realized I hadn't read anywhere how to combine DFAs or indeed if it is possible to do so. Thanks! ~Dan |
||||
|
||||
All times are ET (US)![]() |
Last Thread Next Thread ![]() |
|