maciej-bendkowski
commented
4 years ago The syntax is meant to follow the construction of NFA. For instance, for the simple language aaabb we need two things. First, we need to specify the alphabet { a, b }. Secondly, we need to define the automaton:
State_1 -> State_2 (a)
State_2 -> State_3 (a)
State_3 -> State_4 (a)
State_4 -> State_5 (b)
State_5 -> State_6 (b)
State_6 -> _and define, in the header of the file
@generate State_1The above rule define transitions in form of <state> -> <state> (letter). Optionally, you can use the underscore _ to denote an epsilon (think of it as an epsilon transition to some implicit final state). If you need more rules for a single state, say for a* you can write something like:
State -> State (a)
| _Regarding the remark of singular tuning, I think that boltzmann-brain should perhaps drop it's use entirely. Actual, singular tuners are a rare phenomenon (usually we can just approximate them). A better interface might just specify the target size and assume an implicit size, say size = 1, 000, 000, to be a reasonable approximation of a singular tuner. That also would be a nice feature to have. Sadly, I cannot guarantee when it's going to be implemented, though.
Kerl13
I don't understand the syntax of rational grammars from the examples. How should I write the specification for
aaabboraa*bb*for instance ?I tried writing them in the algebraic format but then paganini cannot tune the system (I guess it runs the singular tuner).