Summary of the content of the compiler part scanner regular expression <--> finite automata draw Finite State Machine to recognise lexicon parser context free grammar BNF rail-road diagram derivation: CFG <--> sentential form parsing algorithms matching between an input sentence <--> rules writing a recursive descent parser LL(1) parsing algorithm First, Follow set parsing table code generator source --> parse tree (N-code) contruction of parse-tree: head, tail, cons parse tree (N-code) --> target machine code eval function (a virtual machine or an interpreter) Good luck 27 Sept 2010