Do we need regular expression first or finite state automata in lexical anlysing?
A regular expression is a language used to describe a finite state automaton. It allows you to define the fsa without drawing nodes and edges all over the place. The two go hand in hand in that regard.