Home » Community » Forums » » Algorithmic Forays Part 4
  Intel sponsors gamedev.net search:   
[Control Panel] [Register] [Bookmarks] [Who's Online] [Active Topics] [Stats] [FAQ] [Search]

Add Forum to Favorites |  Send Topic To a Friend | View Forum FAQ | Track this topic


 Last Thread Next Thread 
 Algorithmic Forays Part 4
Post Reply 
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/


 User Rating: 1042   |  Rate This User  Send Private MessageView Profile Report this Post to a Moderator | Link

Thanks !

 User Rating: 1023   |  Rate This User  Send Private MessageView Profile Report this Post to a Moderator | Link

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?

 User Rating: 1028   |  Rate This User  Send Private MessageView Profile Report this Post to a Moderator | Link

Quote:
Original post by Box2020

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?


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.

 User Rating: 1023   |  Rate This User  Send Private MessageView Profile Report this Post to a Moderator | Link

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


 User Rating: 1015    Report this Post to a Moderator | Link

All times are ET (US)

Post Reply
 Last Thread Next Thread 
Forum Rules:
You may not post new threads
You may post replies
You may not edit your posts
You may not use HTML in your posts
Jump To:
Administrative Options: