{changed the subject}Joep Suijs wrote: > A fsm is not that difficult. It basicly consists of a collection of > states. Each state has an on-entry code block, a repeatable code block > and one or more possible transitions - a condition plus a new state. > Add the option of stateless transitions (if x occurs, go to state y, > regardless of the state you are in) and you are done. > > Although I used to think this would not be too dificult (and thus > usefull for less-experienced users), I did not yet find a neat way to > describe/present fsm in a clear and parsable way. > Someone pointed me to http://www.state-machine.com/ but this also > looks a bit too complicated for a beginner. > Maybe some of you guys has some idea. Yes, for Finite State Machines you must make yourself familiar with a certain way of thinking. Once you've got the picture it is not very difficult to make an implementation. But I don't think it is very easy to built a general purpose framework. Not that I'm so fluently with FSMs .... but some time ago I built a circuit using an FSM to debounce 4 rotary encoders (and convert their signals to 'forward' and 'backward' pulses). FSM is nice for debouncing switches, and it is simple enough for educational purposes. But one drawback of my program: it uses 'vertical counters' to get nice compact code, which makes the program somewhat less suitable as demo/lesson of FSMs. But have a look yourself at http://www.robh.nl/electro.php#rotary . For the code you need to download the package 'Quadrature Encoder' (written in C for the cc5x compiler, but I think not very difficult to convert to Jal). Regards, Rob. -- Rob Hamerling, Vianen, NL (http://www.robh.nl/) --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "jallib" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/jallib?hl=en -~----------~----~----~----~------~----~------~--~---
