(formerly CS 236 or 230)

Syllabus

Fall Semester, 2002

19 August 2002 version

2:00-3:15 Tuesdays and Thursdays

room 107 MER Building (aka COMER Building)

Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman

Compilers: Principles, Techniques, and Tools

Addison-Wesley

Frances L. Van Scoy

304-293-LANEx4181

G11B CERC/CRRB (Concurrent Engineering Research Center / Chestnut Ridge Research Building 886 Chestnut Ridge Road)

Office hours: 7th floor student lounge ESB 1:00-1:45 Tuesdays and Thursdays

lobby of MER building 3:15-3:45 Thursdays

or by appointment

describe Chomsky hierarchy, identify the class to which specific languages belong, convert language definitions to equivalent language- or automata-based definitions

use lex and yacc to implement translation software

describe the block diagram of a compiler and the major algorithms for each component

You should plan on reading each chapter of the text 3 times:

skimming it before the lecture on the indicated day,

reading it carefully to determine whether you now understand it well within a day or two after the corresponding lecture,

reviewing it before the first test on the material

Also, you are being given a CD-ROM with old notes from CS 136 and 236. You should review old lecture notes and read the lex and yacc documentation on that CD. Other files from that CD may be specifically assigned as well.

One ore more additional reference CD-ROMs may be distributed during the semester and additional reading material may be posted to the course MIX web pages.

Using yacc (or ayacc or bison or similar),

implement a postfix notation calculator. Your calculator should include the arithmetic operators (addition, subtraction, multiplication, division, and exponentiation) and selected trigonometric functions (sine, cosine, and tangent). Your calculator should also provide 26 registers or variables, labeled A through Z, and an assignment operator.

or

construct a program which generates an English narrative from a GEDCOM data base. (Sample GEDCOMS for selected U.S. Presidents are on the CD-ROM.)

The recommended term project is a compiler which will translate VRML files to OpenGL or to programs using the GHOST library.

Other term project topics may be approved by discussion with the instruction.

Use lex (or alex or flex or similar) to implement a scanner for the following language based vaguely on COBOL.

The language has seven "sentences":

INPUT THE VALUE OF []. or INPUT A VALUE OF [].

OUTPUT THE VALUE OF []. or OUTPUT A VALUE OF [].

ADD [] TO [] GIVING [].

SUBTRACT [] FROM [] GIVING [].

MULTIPLY [] BY [] GIVING [].

DIVIDE [] BY [] GIVING [].

REPEAT THIS PARAGRAPH [] TIMES.

BEGIN PARAGRAPH.

<>

END PARAGRAPH.

or

REPEAT THE FOLLOWING PARAGRAPH [] TIMES.

BEGIN PARAGRAPH.

<>

END PARAGRAPH.

where

<> is a list of one or more sentences

[] is an identifier or a numeric literal

an identifier begins with a letter,

and may contain letters, digits, and spaces

a numeric literal is

digits

. digits

digits .

digits . digits

and may be preceded by a + or -

Notice that every sentence ends with a period.

Produce three classes of tokens:

identifiers

numeric literals

operators.

Define as few operators as possible, within the limits of the power of finite state automata and the needs of the parser.

West Virginia University is committed to social justice.

If you are a person with a disability and anticipate needing any type of accommodation in order to participate in this class, please advise me and make appropriate arrangements with Disability Services (293-6700).

Plagiarism involves claiming as your own work the work done by another. Plagiarism can result in a variety of penalties including a failing grade in the course.