Bling Fire: Finite state machine and regular expression manipulation library

Re:Bling Fire: Finite state machine and regular expression m... by sergeio76 on Thursday April 18, 2019 @05:53PM (#19695126)

We don't represent automata as a code, that leads to compiler errors etc., we represent them as graphs, just as data.

Inside the code we use: state --> int set of states --> sorted / unique'd array of int's input symbol --> int output symbol --> int transition function is abstracted out behind an interface and implemented differently based on whether automaton is read-only or changeable and based on the state etc.

[ Parent | on HN ]

Re:Bling Fire: Finite state machine and regular expression m... by criddell on Friday April 19, 2019 @08:50AM (#19699127)

I'm going to have to think about that a bit. Maybe I'm missing the point, but it sounds like an interpreter. Thanks for posting the code. This feels like something I need to understand.

[ Parent | on HN ]