Go to Main Content

Purdue Self-Service

 

HELP | EXIT

Catalog Entries

 

Spring 2011
Apr 15, 2024
Transparent Image
Information Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. The Schedule Type links will be available only when the schedule of classes is available for the selected term.

CS 66100 - Formal Compiling Methods
Credit Hours: 3.00. Application of concepts developed in formal language and automata theory to the design of programming languages and their processors. Models of syntactic analysis, including canonical precedence, LR(k) and LL(k) parsing methods and variants; efficiency of each. Synthesis techniques, including symbol tables, storage administration, parameter mechanisms, garbage collection; optimization considerations. Models of synthesis, including level, affix, attributed grammars; prospects of fully automating compiler design. Applicative vs. procedural languages and their implementations based on semantic definition of a language (LISP, Lucid) and on proof-like techniques (PROLOG, equational systems); merits of such approaches. Prerequisite: CS 50200. Typically offered Spring.
3.000 Credit hours

Levels: Undergraduate, Graduate, Professional
Schedule Types: Lecture

Offered By: College of Science
Department: Computer Science


May be offered at any of the following campuses:     
      West Lafayette


Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.7.2.4