Formal Language and Syntax Analysis

0.5 credit · Graduate

Computability, unsolvable and NP-hard problems. Formal languages, classes of language automata. Principles of compiler design, syntax analysis, parsing (top-down, bottom-up), ambiguity, operator precedence, automatic construction of efficient parsers, LR, LR(O), LR(k), SLR, LL(k). Syntax directed translation.