Repository files navigation

This is a kind of generic FSA implementation.It was written to handle keystrokes, so there are no accepting statesbut each transition can trigger actions:

• printing constant strings in the terminal:print "hi!"
• broadcasting the same kind of strings in UDP:bc 2000 "HELLO EVERYONE"

Combinators allow you prioritizing automata:

• a < b will produceb's actions whena doesn't
• a || b will produce (at each step) actions froma andb, in this order

• server.ml is a UDP server (for pranks, etc.)
• run.ml is a combinator tester
• dot.ml converts FSAs to graphs (seeExamples below)

opam install ocamlbuild menhirocamlbuild -lib unix -use-menhir dot.byte run.byte server.byte

Running

./dot.byte cashregister.aut |dot -Tpng >cashregister.png

... on this file

(* transition macros *)digit='0'-'9'(* action macros *)T=broadcast 2000 "tick"D=broadcast 2000 "ding"(* 0 is the initial state *)0:      digit -> typing; Ttyping: digit -> typing; T        '\n' -> 0; D

... yields: