Re: Re: Re: Clunky parsing problem, looking for simple solution

[jepri]

I think the academic computer world now calls small state machines Discrete Finite Automations or something. I read about how to do it in a lecture series I pulled of the net. Available upon request, or google for it. The upshot was that it was an interesting way of approaching the problem. To me it sounds like you are flogging yourself unnecessarily, but each to his own :)

____________________
Jeremy
I didn't believe in evil until I dated it.

[demerphq]

the academic computer world now calls small state machines Discrete Finite Automations or something

I think a lot of terms are used, this being one of them. Determinisitic Finite State Automata, Turing Machines, Finite State Machines, Finite Sate Automata, State Transition Machine are all terms ive seen.

Yves / DeMerphq
---
Writing a good benchmark isnt as easy as it might look.