4 ms·
There are deterministic finite state machines underneath implemented in lean C++. These automata allow to implement operations with strings optimally or close t
by sergeio76 7y ago
There are deterministic finite state machines underneath implemented in lean C++. These automata allow to implement operations with strings optimally or close to that. In the readme file there is a link to how to recompile linguistic resources, if you look inside the makefile that is used for resource compilation you will the steps.
- mlacks 7y agoWhat is lean C++?
- Abishek_Muthian 7y agoI think he just means efficient C++ programming.
- taf2 7y ago#define WIN32_LEAN_AND_MEAN Maybe ?
- avinium 7y agoThanks - will dive in and start checking things out.
- criddell 7y agoDo you use any kind of library or typical design pattern for your FSM implementation? When I've used them, I typically always go back to very C-like code (enum for the states, a state variable, and a big switch statement inside a loop).
- sergeio76 7y agoWe 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.
- criddell 7y agoI'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.