Optimise the parser

Right now, the lexer is pretty inefficient as it essentially involves attempting to match multiple Regexes and using the first one that fits. Instead, find a different library or tool that does this efficiently using Haskell, and implement it.

Hint: Find tools that are similar to flex or lex

PS: yes partial points will be awarded!