Heyho, Silvan Jegen wrote: > Actually, I do not think you will need a "real" recursive parser. It should be > enough to use a finite state machine since you won't have any recursively > nested key bindings.
Yes, that should suffice. > I am not completely sure how to implement this but it sounds like a very > interesting problem. The states transition should probably look something like > this I would use an array of function pointers to implement a state machine (like the event handling in dwm etc.), but for this purpose it might be a little bit too much. --Markus
