15-411 Compiler Design
Lecture 6: Lexing

• Reading: Ch 2
• Concepts:
  • Regular expressions
  • Nondeterministic finite automata (NFA)
  • Deterministic finite automate (DFA)
  • Tokens
  • Lex and ML-Lex
• Previous lecture: Dataflow Analysis
• Next lecture: Context-Free Grammars

[ Home | Schedule | Labs & Assignments | Exams | Lab Machines | Resources ]
[ Textbook | Autolab ]
[ Blackboard | academic.cs.15-411 ]

fp@cs
Frank Pfenning