Lexical Analysis and Parsing

Sign in to save progress
20 lessons2 hFree
Loading lessons…

About this course

Implement lexical analyzers with finite automata and regular expressions. Construct LL(1) and LR(1) parsers, build abstract syntax trees, and handle syntax error recovery.

  • 20 lessons
  • 2 h
  • advanced

What you'll learn

  • Describe the stages of compilation and the position of lexical analysis and parsing
  • Explain the interface between the lexer and parser
  • Write regular expressions for common programming language tokens
  • Convert regular expressions to non-deterministic finite automata (NFA)
  • Differentiate between DFA and NFA
  • Simulate NFA and convert NFA to DFA

Finishing the course

  • 80 knowledge-check questions along the way, so you know the ideas stuck before you move on.
  • Watching is free and needs no account. Sign in to save your progress. Pass each lesson's quiz (60%+) to earn the certificate. Each certificate has its own public verification link to share, marked quiz-verified.