Build a lexical parser (including the tokenizationwith maximal munch and priorities) out of the following
set of lexical specifications.
1. dict
2. dictator
3. [a – z]*
4. dictatorial
Test with some examples (e.g. “dictatorial” should beaccepted)
Same question for the following set of lexicalspecifications:
1. ab
2. b+
3. ac*
Test with some examples (e.g. “abbbaacc” should be tokenized as/ab/bb/a/acc/)
You can choose either Python or Prolog for your implementation.However, for full grade Prolog is
preferable.
Expert Answer
An answer will be send to you shortly. . . . .