new stateful parser engine for fisg 0.5-devel?

pattern template strings

"%H:%M -!- mode/%c [%m] by %n"
"%H:%M -!- %n [%*] has joined %c"
"%H:%M -!- %n [%*] has left %c"

compiled into tokens, and placed into a tree-structure
(with possible hashing?)

-> %H -> ':' -> %M -> " -!- "
			|
			+-> "mode/" ->
			| 
			\-> %n -> " [" -> %*] -> " has "
							|
							+-> "joined " ...
							|
							\-> "left " ...

matching would be done statefully.

 - read new line
 - reset parser state
   - traverse token tree until match found (if found)

problems:
	* structures? memory efficiency.
	* minimum path cost efficiency? performance issues?
	* I think this has to be just experimented,
	it's impossible to see if the impact will be negative
	or positive in overall.