In the era of information, technology changes at drastic speed and same observed in Computer Science / Information Technology field. Need of intelligent compilers for high level languages are increased. In this time, an argument arises regarding worthlessness of studying Regular Expression and Finite automaton in field of compiler construction. Would you differ with this argument or in favor of this comment? Describe your point of view in the structure provided below;
closed as primarily opinion-based by Yuval Filmus, Evil, xskxzr, Discrete lizard♦ Feb 12 at 8:23
Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise. If this question can be reworded to fit the rules in the help center, please edit the question.
A similar question is answered extensively on cstheory: What is the enlightenment I'm supposed to attain after studying finite automata?.
It is clear that parsing has lost much of its importance in compiler design in favor of other topics such as optimization, garbage collection, and parallelization. However, finite automata have other redeeming qualities, as described in the answers to the question on cstheory. Whether this justifies studying finite automata in compiler design classes is ultimately a subjective question.