title: most efficient way to compare short string with small dictionary (parsing)
body: <p>I'm trying to optimize my simple C interpretter that I made just for fun, I am doing parsing like this - firstly I parse file into tokens inside doubly linked list, then I do syntax and semantic analysis.<br/>
  I want to optimize function with this prototype:</p>
  
  <p>bool parsed_keyword(struct token *, char dictionary[][]);</p>
  
  <p>Inside the function I basically call strcmp against <em>all keywords</em> and edit token type.
  This of course lead to 20 strcmp calls for each string that is being parsed (almost).</p>
  
  <p>I was thinking Rabin-Karp would be best, but it sounds to me like it isn't best suited for this job (matching one word against small dictionary).
  What would be the best algoritm to do this work? Thanks for any suggestions.</p>