Hi
In order to avoid being off-topic, does anybody know any mailing list
where people discuss just algorithms specifically? It doesn't need to
be compiler construction-specific -- even though they're amongst the
most interesting algorithms around.
I've recently devised an algorithm to produce use
ransitions derived from any regex e.
By applying the rule recursively, one obtains all DFA transitions for
any regex, or so I hope it is true. In such case, if proven to be
true, it is truly a replacement for Thompson's algorithm.
Greetings
Erik Poupaert