Preparing

At least, I did try

A good book for Computer Language and Machine Theory

ISBN: 0-201-82136-2

Good Points:
- easy to read and follow
- theory comes with examples
- the book covers almost all theory


Bad Points

- no solutions in exercise problems
- Decidability and Computability Section should be expanded.
- The descriptions of LL(K) and LR(K) mechanisms in the last two chapter should be explained more. More examples should be provided.

Qualification Exam Programming and Compiler Part

(Fall 2008)

1) Compare a non-tail recursive and a tail recursive in run time behavior context
2) Why Left recursive production cannot be in LL(1)?
3) How to prove two regular expressions generate the same language
4) LL(1) and SLR(1) grammar
5) Draw Stack created before and after enter the sub routine, (static and dynamic chains)
6) Why no shift-shift conflict in DFA
7) scoping , value passing and reference passing (write the value from a given complicated program)
8) Explain (or propose something intelligent) about compiler Optimization
a) value numbering
b) global data flow analysis
c) register allocation

Qualification Exam Theory Part

(Fall 2008 Topics)

1) Structural Induction, Induction

2) Logically Valid of and in

3) , : context free closure

4) is not regular
and is context free

5) The function f(n) :the number of perfect square numbers that < n,
f(n) is Primitive Recursive

6) The set of {m |p+q, when and and P and Q are recursive enumerable sets } is a recursive enumerable set.

Theory of Computational

A good material

www.math.ucla.edu/~hbe/computability.pdf