|
||||
| Description: | ||||
| Formal grammars and passing methods. Recursive descent, simple and higher order precedence, LR (k) parsers. The mathematical theory of global program optimization. Flow graphs, intervals, dataflow analysis dependency and redundancy equations. Loop optimization. No credit toward the M.S. degree in Computer Science. | ||||
|