Comparison of parser generators

This is a list of notable lexer generators and parser generators for various language classes. == Regular languages == Regular languages are a category of languages (sometimes termed Chomsky Type 3) which can be matched by a state machine (more specifically, by a deterministic finite automaton or a nondeterministic finite automaton) constructed from a regular expression.