Discussion
Patterns for tokens are most naturally described by
Answer: A
Correct answer: regular expressions
Token patterns are exactly the kind of thing regular expressions describe: identifiers, numbers, operators and keywords are all regular languages, and a regular expression can be turned mechanically into the automaton that recognises it. Context free grammars are needed for the nested structure the parser handles, and are more machinery than the scanner requires.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development