Are regular expressions used directly in compilers to identify tokens?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Yes. Many compilers use a generated scanner whose token rules are defined as REs to a DFA. Flex(1) is a prominent example.
I don’t understand the second part of your question.