From: slkpg4@gmail.com   
      
   Lexing is not hard. If simple enough, you might even use the C library   
   strtok() to tokenize. Re2c is another C possibility.   
      
   If the grammar is recursive, then recursive descent might be fairly easy   
   to learn.   
      
   For simple grammars, I still think a parser generator like SLK is the   
   quickest way to get it done in C, C++, C#, Java, or Javascript.   
      
   The SLK Parser Generator - http://www.slkpg.com   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)