Question: Moore or Mealy state machine?

[antonysigma]

Boost SML, like other similar state machine libraries, seems to favor Mealy-style state machine over Moore. In Mealy representation, the action is defined at the edge rather than in the state itself. Is it intentional?

Also, I am aware that all Moore-style representation can be converted to Mealy-style manually. Such an algorithm is taught in computer science courses. Does Boost SML implement the conversion algorithm internally at -O3 compiler optimization level?

Aside: what I meant by Moore:

[PavelGuzenfeld]

SML supports both: transition actions run on transitions (Mealy), while on_entry<...> / on_exit<...> provide per-state actions (Moore). You can mix them freely. Added to the FAQ in #709 — I think this can be closed.