|
|
|
|
|
|
by chaosite
1594 days ago
|
|
|
So in my CS program, those were split into several separate courses. You had an (mostly theoretical) Automata and Formal Languages course, which had regular/context free languages (including regexs), grammars, and pumping lemma.
lex/flex/yacc/bison, recursive descent, and LL(1) LR(n), LALR were in a Compilers course.
Programming Language exposure to a functional language (ML) and a logic language (Prolog) plus some other stuff was the Programming Language course. Type Theory, lambda calculus, and so on is relegated to advanced graduate courses that are given when a faculty member feels like it. |
|
|