« first day (3005 days earlier)      last day (42 days later) » 

4:27 PM
Is there a name for the type of automata we find in syntax highlighting lexers?
Usually you have a list of states and each states has rules. A rule is a tuple (regex, tokens, nextState), where tokens are the highlighting tokens issues for the matching groups in regex and nextState the next state. However, nextState is also allowed to push and pop multiple states.
 

« first day (3005 days earlier)      last day (42 days later) »