| Topics |
- Alphabet, words, formal languages
- Finite-state automata: DFA, NFA, ε-NFA, Mealy, Moore, conversion, minimization
- Regular expressions: conversion from/to FSA
- Regular languages: pumping lemma, closure, equivalence
- Formal grammars: derivation, parse trees, removing ambiguity
- Pushdown Automata: PDA, DPDA
- Chomsky hierarchy, countable, recursively enumerable, decidable, halting problem
- Lexical analysis: Scanner and Parser, symbol table, JFlex
- Parsing: top-down, bottom-up, depth-/breadth-first-search, LL(k), parsing tables, first/follow sets
|
