CS 164: Fall 1999
Midterm Solutions
Professor L. Rowe
PROBLEM 1.
Answer the following TRUE/FALSE questions:
All non-deterministic finite state automatons can be converted to a deterministic finite state
automaton: TRUE
An object-oriented program is easier to read and understand than a conventional procedural
program: TRUE
The class of the value assigned to the this variable in a method is the class within which the
method is declared: FALSE
A Java method signature does not include the return type: TRUE
A transient instance variable in Java is not written to persistent storage if the object is output:
TRUE
The class of the Class object is Class: TRUE
A regular expression can specify the set anbn where 0<n<5, that is {ab, aabb, ...,
aaaabbbb}: TRUE
A shift reduce parser performs reductions in the reverse order specified by a left-most
derivation: FALSE
The string aabb is a sentential form for the grammar S->ab | aSb: TRUE
A JO99 variable has an l-value and r-value: TRUE
An abstract syntax tree is derived from a parse tree by removing extraneous nodes and
restructuring the tree: TRUE
A handle is a simple phrase: TRUE
Some JO99 objects do not have a class: FALSE
The following finite state automation recognizes the laguage specified by the regular
expression a*1a+: FALSE
State Input NextState
0 1 1
0 a 0
1 a 2
2 1 1
2 a 2
Staring state is 0
A context free grammar can be used to recongnize any context sensitive language: FALSE
PROBLEM 2.
Given the parse table and grammar:
_____________________________________
| | b | a | $ || S | A |
|-------------------------------------|
| 0 | s3 | s2 | || 1 | 5 |
| 1 | | |accept|| | |
| 2 | r4 | s2 | r4 || | 4 |
| 3 | | | r1 || | |
| 4 | r3 | | r3 || | |
CS 164, Midterm 1, FALL 1999
CS 164: Fall 1999 Midterm Solutions Professor L. Rowe 1
